• 정보처리학회논문지A
• /
• 제18A권3호
• /
• pp.115-122
• /
• 2011

모든 제약만족 최적화 문제의 해를 구하는 일반화된 알고리즘을 구하는 것은 매우 어렵다. 그러나 결정 변수의 특성에 따라 세분화된 문제는 해를 위한 알고리즘을 구하기에 더 쉽다는 가정을 할 수 있다. 이와 같은 가정 하에 문제를 세분화 시키는 문제분류규칙을 제안하고 세분화된 문제의 특성에 맞는 백트래킹 알고리즘을 개발한다. 백트래킹을 이용한 깊이우선탐색에서 해를 빨리 찾기 위한 방법 중 하나는 탐색되는 노드의 순서를 효과적으로 배열하는 것이다. 정적 특성이 우세한 무선 센서 네트워크의 클러스터 헤드 위치문제와 동적 및 정적 특성의 혼합특성을 갖는 RFID 리더 간섭 최소화 문제를 선택하여 최적의 변수 순서화 알고리즘을 개발하고 기존의 방법과 비교하였다. 결과적으로 문제를 세분화시킴으로써 체계적인 탐색을 위한 백트래킹의 구조화를 실현하였다. 또한 개발된 백트래킹 알고리즘의 성능이 우수함을 보였다.

• 공학논문집
• /
• 제6권1호
• /
• pp.5-14
• /
• 2004

제약조건을 만족시키기 위한 문제에서 해를 얻는 일은 그 문제의 조건들을 만족시키기 위한 변수들의 값을 선정하는 것이다. 이것은 주어진 영역내의 다수의 불확정적인 변수들의 논리적 관계를 탐색하여 조건을 만족하는 최적의 해를 얻는 것이다. 그러나, 이러한 문제들의 해를 구하는 과정에는 두 가지 큰 문제를 내포한다. 즉, 다양한 형태와 다수의 속성을 지닌 제약 조건들을 시스템내부에 효율적으로 표현하는 방법이 어렵고, 탐색과정에서 기하급수적으로 발생하는 공간문제와 처리시간을 최소화 하기가 힘들다. 그 이유는, 적절한 제약 조건의 표현방법과 효율적인 알고리즘에 의해 스케줄링을 한다 해도 모든 조건들을 항상 다 만족시킬 수는 없기 때문이다. 즉, 제약 조건 내에 충돌의 요소가 있을 수도 있기 때문이다. 따라서 이 논문에서는, 스케줄링을 진행하는 과정에서 이러한 제약 조건위반(충돌)에 대한 정보 및 차선의 조건을 사용자에게 제시하여 사용자로 하여금 조건의 재조정이 가능하도록 하는 대화형 스케줄링시스템의 모델을 제시한다.

• 대한안전경영과학회지
• /
• 제9권6호
• /
• pp.113-122
• /
• 2007

Quality function deployment(QFD) is becoming a widely used customer oriented approach. The aim of this paper is to present an analytic method of quality function deployment that is to maximize customer satisfaction, using a customer satisfaction survey conducted in the college in Korea. Combining weights and satisfaction indices, "performance/important" diagrams are to develop and this grid can be used in order to identify priorities for decision making. Also, this paper shows a 0-1 integer programming model for maximizing customer satisfaction subject to a budget constraint in QFD planning process with case study.

• 한국경영정보학회:학술대회논문집
• /
• 한국경영정보학회 2007년도 International Conference
• /
• pp.509-514
• /
• 2007

Most of the IS continuance research has assumed that IS use is activated by an intention to use, which in turn is determined by the evaluation of IS usage. Perceived usefulness is one of the evaluation variables most widely used. Typically, the past studies adopt this perceived usefulness because it views continuance as an extension of acceptance behavior. However, the literature on interpersonal relationships suggests that individuals are motivated to maintain relationships either because they genuinely want to or they believe they have no other option. The former is referred to as dedication-based relationship maintenance and the latter as constraint-based relationship maintenance. The IS continuance can be considered as the relationship maintenance situation with the existing IS that the user is currently using. The belief constructs previously used in IS continuance researches fall into the category of dedication-based ones. Additional constraint-based belief constructs are needed to explain the IS continuance behavior. In this regard, switching cost represents an important avenue for better understanding and predicting customer retention in that it can be regarded as the constraint-based motivation for relationship maintenance or IS use continuance. For an empirical exploration, 275 samples were collected from the users of a web portal site. Data analysis using Structural Equation Modeling (SEM) shows that perceived usefulness shows a significant direct effect on continuance intention while perceived switching cost significantly affects continuance usage.

• Journal of Communications and Networks
• /
• 제7권4호
• /
• pp.471-477
• /
• 2005

This paper proposes an efficient constraint-based optimization model for the design of 3G mobile networks, such as universal mobile telecommunications system (UMTS). The model concerns about finding a set of sites for locating radio network controllers (RNCs) from a set of pre-defined candidate sites, and at the same time optimally assigning node Bs to the selected RNCs. All these choices must satisfy a set of constraints and optimize an objective function. This problem is NP-hard and consequently cannot be practically solved by exact methods for real size networks. Thus, this paper proposes a hybrid search strategy for tackling this complex and combinatorial optimization problem. The proposed hybrid search strategy is composed of three phases: A constraint satisfaction method with an embedded problem-specific goal which guides the search for a good initial solution, an optimization phase using local search algorithms, such as tabu algorithm, and a post­optimization phase to improve solutions from the second phase by using a constraint optimization procedure. Computational results show that the proposed search strategy and the model are highly efficient. Optimal solutions are always obtained for small or medium sized problems. For large sized problems, the final results are on average within $5.77\%$ to $7.48\%$ of the lower bounds.

• 한국정보시스템학회지:정보시스템연구
• /
• 제27권4호
• /
• pp.203-227
• /
• 2018

Purpose The purpose of this study is to investigate which decision factors continue to use the service based on the online simple payment service. In this study, we will examine how to activate the service from the continuing factors through the dual-model theory consisting of personal dedication and constraint dedication which are frequently used in relation marketing. Design/methodology/approach In this study, we investigated the activation of online simple settlement service using factors affecting the preference of the simple payment service based on the dual-model of dedication-based mechanism and constraint-based mechanism. Findings This study confirmed that customer satisfaction and convenience under the dedication -based mechanism were found to be linked to the preference of the simple payment service. Switching cost under the constraint - based mechanism showed that the customer had no binding ability to continue using the service of the current provider. Likewise, preference was found to have a direct effect on the actual frequency of use of the simple payment service, the number of uses compared to the total number of online payments, and willingness to use more.

• 인지과학
• /
• 제7권4호
• /
• pp.141-162
• /
• 1996

• 한국콘텐츠학회논문지
• /
• 제15권7호
• /
• pp.353-367
• /
• 2015

피쳐폰 시대부터 최근 소셜 네트워크 게임(SNG)의 광풍에 이르기까지 모바일 게임은 모바일 폰의 킬러 콘텐츠로써, 큰 시장 규모와 매출을 자랑하고 있다. 게임 분야의 연구 관점에서 보았을 때, 모바일 게임은 플레이 기기의 스펙부터 플레이 환경까지 사용자에게 제약이 많이 주어지므로, 사용자 만족도에 부정적일 것이라는 예측을 할 수 있다. 그러나 대다수의 모바일 게임 사용자는 게임 경험에 굉장히 만족하고 있다. 이에 따라, 제약이라는 개념에 주목하였다. 또한 제약과 지원이라는 개념을 동시에 독립 변수로 설정하고, 이러한 요인이 사용자의 몰입과 만족에 어떠한 영향을 미치는지 설문조사 방법론을 통해 검증하고자 하였다. 분석 결과, 모바일 게임에서는 제약이 몰입에 긍정적인 영향을 미치는 것으로 나타났으며, 제약을 통해 불편함을 느끼는 것이 아니라 만족감을 얻을 수 있음을 확인하였다. 이를 통해 향후 모바일 게임의 UX 디자인 과정에서 해당 연구들의 결과를 활용할 수 있으리라 기대한다.

• 대한산업공학회지
• /
• 제20권4호
• /
• pp.85-97
• /
• 1994

An interactive and iterative control panel layout method based on the constraint satisfaction problem (CSP) technique was developed to generate an ergonomically sound panel design. This control panel layout method attempts to incorporate a variety of relevant ergonomic principles and design constraints, and generate an optimal or, at least, a "satisfactory" solution through an efficient search algorithm. The problem of seeking an ergonomically sound panel design should be viewed as a multi-criteria design problem and most of the design objectives should be understood as constraints. Hence, a CSP technique was employed in this study for dealing with the multi-constraints layout problem. The efficient search algorithm using "preprocess" and "look_ahead" procedures was developed to handle vast amount of computation. In order to apply the CSP technique to the panel layout procedure, the ergonomic principles such as spatial compatibility, frequency-of-use, importance, functional grouping, and sequence-of-use were formalized as CSP terms. The effectiveness of the proposed panel layout method was evaluated by example problems and the results clearly showed that the generated layouts properly considered various ergonomic design principles.

• 산업공학
• /
• 제16권3호
• /
• pp.352-361
• /
• 2003

Vehicle manufacturing plant is a typical mixed-model production system. Generally it consists of three main shops including body shop, painting shop and assembly shop in addition to engine shop. Each shop contains diverse manufacturing processes, all of which are integrated in a form of flow line. Due to the high pressure from the market requesting small-volume large variety production, production planning becomes very critical for the competitiveness of automotive industry. In order to save costs and production time, production planning system is requested to meet some designated requirements for each shop: to balance the work load in body and assembly shops, and to minimize the number of color changes in painting shop. In this context, we developed a sequencing module for a vehicle production planning system using the ILOG Solver Library. It is designed to take into account all the manufacturing constraints at a time with meeting hard constraints in body shop, minimizing the number of soft constraints violated in assembly shop, and minimizing the number of color changes in painting shop.