• Title/Summary/Keyword: constraint satisfaction

Search Result 169, Processing Time 0.025 seconds

A Backtracking Search Framework for Constraint Satisfaction Optimization Problems (제약만족 최적화 문제를 위한 백트래킹 탐색의 구조화)

  • Sohn, Surg-Won
    • The KIPS Transactions:PartA
    • /
    • v.18A no.3
    • /
    • pp.115-122
    • /
    • 2011
  • It is very hard to obtain a general algorithm for solution of all the constraint satisfaction optimization problems. However, if the whole problem is separated into subproblems by characteristics of decision variables, we can assume that an algorithm to obtain solutions of these subproblems is easier. Under the assumption, we propose a problem classifying rule which subdivide the whole problem, and develop backtracking algorithms fit for these subproblems. One of the methods of finding a quick solution is efficiently arrange for any order of the search tree nodes. We choose the cluster head positioning problem in wireless sensor networks in which static characteristics is dominant and interference minimization problem of RFID readers that has hybrid mixture of static and dynamic characteristics. For these problems, we develop optimal variable ordering algorithms, and compare with the conventional methods. As a result of classifying the problem into subproblems, we can realize a backtracking framework for systematic search. We also have shown that developed backtracking algorithms have good performance in their quality.

Interactive Scheduling System for Distributed Constraint Satisfaction Problem (분산 제약조건 만족 문제에 있어서의 대화형 스케줄링시스템)

  • Kim, Jin-Su
    • The Journal of Engineering Research
    • /
    • v.6 no.1
    • /
    • pp.5-14
    • /
    • 2004
  • Finding a solution to a constraint satisfaction problem requires choosing values for variables so as to satisfy the constraints of the problem. A constraint is simply a logical relation among several unknowns (or variables), each taking a value in a given domain. Conventional constraint-based scheduling systems are not enough to satisfy the all constraints because there are conflicts between them. In this paper, we propose a method for interactive scheduling, which have two major problems: first, it is hard to satisfy concretely all various kinds of constraints, and second, the search space is extremely large and requires a long execution time. To solve the above problems, we introduce the Interactive Scheduling System (ISS) that interacts with the user to exchange suggestions each other. Our system is performed in two steps: knowledge base generation of an initial assignment and iterative improvement with the user(host or internet client) to satisfy the constraints. Applying our system, we actually constructed timetables for our university, where the scheduling time is considerably reduced.

  • PDF

Customer Satisfaction Strategy of the College Considering Capital Budgeting (자본투자를 고려한 전문대학의 고객만족전략)

  • Woo, Tae-Hee
    • Journal of the Korea Safety Management & Science
    • /
    • v.9 no.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.

Constraint and Dedication based Motivations on Use Continuance for a Web Portal Site

  • Hong, Soong-Eun;Kang, Young-Sik;Lee, Hee-Seok
    • 한국경영정보학회:학술대회논문집
    • /
    • 2007.06a
    • /
    • 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.

  • PDF

Optimization of 3G Mobile Network Design Using a Hybrid Search Strategy

  • Wu Yufei;Pierre Samuel
    • Journal of Communications and Networks
    • /
    • v.7 no.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.

A Study on the Facilitating Usage of Online Simple Payment Service (온라인 간편결제 서비스 사용 활성화에 대한 연구)

  • Yon, Dine;Moon, Dong-Ji;Kim, Hee-Woong
    • The Journal of Information Systems
    • /
    • v.27 no.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.

Effect of Constraint and Supporting Features of Mobile Social Networking Games(SNGs) on User's Satisfaction (모바일 소셜 네트워크 게임의 제약과 지원 기능이 사용자의 만족에 미치는 영향)

  • IM, Chae-Rin;SHIN, Young-soo;KIM, Jin-woo;LEE, In-seong
    • The Journal of the Korea Contents Association
    • /
    • v.15 no.7
    • /
    • pp.353-367
    • /
    • 2015
  • From the era of feature phone to the current smart phone which bloomed Social Network Games(SNGs), mobile games have held the top position as killer contents of mobile market. Mobile game has many constraints such as specification of device, network status, and external environment. Based on common perspective of game research, these factors have negative influences on flow of user. Even with these opinions, most mobile gamers have felt satisfaction. To explain this phenomenon, our research focuses on the constraints. Referring to theoretical concepts, we attempt to clarify the relationship between game features and flow through survey methodology. Our finding shows that the constraints have a positive effect on flow even though it disaccords with previous studies. Therefore, we argue that users of mobile game have sense of satisfaction not a cognitive overload as discomforts.

Interactive Control Panel Layout Using a Constraint Satisfaction Algorithm (제약만족 알고리즘을 이용한 상호대화적 조종패널 배치)

  • Park, Sung-Joon;Jeong, Eui-S.;Chang, Soo-Y.
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.20 no.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.

  • PDF

Implementation of a Vehicle Production Sequencing Module Using Constraint Satisfaction Technique for Vehicle Production Planning System (자동차 생산계획 시스템에서 제약만족기법을 이용한 생산 시퀀스 모듈 구현)

  • Ha, Young-Hoon;Woo, Sang-Bok;Ahn, Hyun-Sik;Hahn, Hyung-Sang;Park, Young-Jin
    • IE interfaces
    • /
    • v.16 no.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.