• 제목/요약/키워드: CSP(Constraint Satisfaction Problems)

검색결과 17건 처리시간 0.031초

Experimental Evaluation of Distributed Maximal Constraint Satisfaction Algorithm

  • Ando, Masahiko;Noto, Masato
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2002년도 ITC-CSCC -3
    • /
    • pp.1638-1641
    • /
    • 2002
  • A constraint satisfaction problem (CSP) is a general framework that can formalize various application problems in artificial intelligence. In this paper, we will focus on an important subclass of distributed partial CSP called the distributed maximal CSP that can be applied to more practical kinds of problems. Specifically, we propose a method of solving distributed mammal CSPs using a combination of approximate and exact algorithms that yields faster optimal solutions than otherwise possible using conventional methods. Experimental results are presented that demonstrate the effectiveness of the proposed new approach.

  • PDF

Locomotive Scheduling Using Constraint Satisfaction Problems Programming Technique

  • Hwang, Jong-Gyu;Lee, Jong-Woo;Park, Yong-Jin
    • KIEE International Transaction on Electrical Machinery and Energy Conversion Systems
    • /
    • 제4B권1호
    • /
    • pp.29-35
    • /
    • 2004
  • Locomotive scheduling in railway systems experiences many difficulties because of the complex interrelations among resources, knowledge and various constraints. Artificial intelligence technology has been applied to solve these scheduling problems. These technologies have proved to be efficient in representing knowledge and rules for complex scheduling problems. In this paper, we have applied the CSP (Constraints Satisfaction Problems) programming technique, one of the AI techniques, to solve the problems associated with locomotive scheduling. This method is more effective at solving complex scheduling problems than available mathematical programming techniques. The advanced locomotive scheduling system using the CSP programming technique is realized based on the actual timetable of the Saemaul type train on the Kyong-bu line. In this paper, an overview of the CSP programming technique is described, the modeling of domain and constraints is represented and the experimental results are compared with the real-world existing schedule. It is verified that the scheduling results by CSP programming are superior to existing scheduling performed by human experts. The executing time for locomotive scheduling is remarkably reduced to within several decade seconds, something requiring several days in the case of locomotive scheduling by human experts.

효율적인 유지보수 작업배정을 위한 CSP기반의 스케줄링 시스템 (Scheduling System for Effective Assignment of Repair Warrant Job in Constraint Satisfaction Problems)

  • 심명수;조근식
    • 지능정보연구
    • /
    • 제6권2호
    • /
    • pp.99-110
    • /
    • 2000
  • 오늘날의 기업은 상품을 판매하는 것 뿐만 아니라 기업의 신용과 이미지를 위해 그 상품에 대한 사후처리(After Service) 업무에 많은 투자를 하고 있다. 이러한 양질의 사후서비스를 고객에게 공급하기 위해서는 많은 인력을 합리적으로 관리해야 하며 요청되는 고장수리 서비스 업무의 신속한 해결을 위해 업무를 인력에게 합리적으로 배정을 해야 한다. 그러므로, 회사의 비용을 최소화하면서 정해진 시간에 요청된 작업을 처리하기 위해서는 인력들에게 작업을 배정하고 스케줄링하는 문제가 발생된다. 본 논문에서는 이러한 문제를 해결하기 위해서 화학계기의 A/S작업을 인력에게 합리적으로 배정 하는 스케줄링 시스템에 관한 연구이다. 먼저 스케줄링 모델을 HP사의 화학분석 및 시스템을 판매, 유지보수 해주는 Y사의 작업 스케줄을 분석하여 필요한 도메인과 고객서비스전략과 인력관리전략에서 제약조건을 추출하였고 여기에 스케줄링 문제를 해결하기 위한 방법으로 제약만족문제(CSP) 해결기법인 도메인 여과기법을 적용하였다. 도메인 여과기법은 제약조건에 의해 변수가 갖는 도메인의 불필요한 부분을 여과하는 것으로 제약조건과 관련되어 있는 변수의 도매인 크기가 축소되는 것이다. 또한, 스케줄링을 하는데에 있어서 비용적인 측면에서의 스케줄링방법과 고객만족도에서의 스케줄링 방법을 비교하여 가장 이상적인 해를 찾는데 트래이드오프(Trade-off)를 이용하여 최적의 해를 구했으며 실험을 통해 인력에게 더욱 효율적으로 작업들을 배정 할 수 있었고 또한, 정해진 시간에 많은 작업을 처리 할 수 있었으며 작업을 처리하는데 있어 소요되는 비용을 감소하는 결과를 얻을 수 있었다.

  • PDF

일반 배치문제 해결을 위한 제약만족기법의 적용 (APPLICATION OF THE CONSTRAINT SATISFACTION APPROACH TO GENERAL LAYOUT PROBLEMS)

  • 박성준;정의승
    • 대한산업공학회지
    • /
    • 제24권4호
    • /
    • pp.539-550
    • /
    • 1998
  • A computerized layout system based on a constraint satisfaction problem (CSP) technique was developed to treat both facility layout and instrument panel layout problems. This layout system attempts to allocate various facilities under multiple layout criteria including qualitative design objectives. Since most of the design objectives can be understood as constraints which the layout solution must satisfy to improve the goodness of the solution, a CSP technique was employed to solve the multi-constraints layout problem. The effectiveness of the system was evaluated by the comparison with the well-known facility layout program, CORELAP. Furthermore, the proposed system can also be applied to the instrument panel layout problem successfully. Several user-centered guidelines were well reflected on the solution obtained. CONSLAY, the prototype layout system being developed in the research, greatly enhanced the interactions with the designer so as to deal with the problem-dependent nature of the layout problem and to properly reflect the domain-specific knowledge of the designer.

  • PDF

전자상거래에서의 벡터 공간 모델링을 통한 Configuration 시스템 (Configuration System through Vector Space Modeling In I-Commerce)

  • 김세형;조근식
    • 지능정보연구
    • /
    • 제7권1호
    • /
    • pp.149-159
    • /
    • 2001
  • 최근 전자상거래에는 일대일 마케팅이나 협력적 정보여과기법등을 이용한 다양한 추천서비스가 도입되고 있다. 이러한 추천 서비스의 형태는 다양한 제약 조건을 갖고 계산 복잡도가 높은 제품의 경우에는 고객을 만족시킬 만큼 적절한 추천서비스가 이루어지기 어려울 것으로 본다. 본 논문에서는 Clancey의 Classification Problem Solving 방법과 제약조건 기반 Configuration기술을 통합하여, 이러한 문제를 해결할 수 있는 방법을 제시하였다. 이 방법은 Clancey의 이론에 따라 구성 복잡도가 높은 제품의 해집합 도메인을 분할하여 문제의 복잡도를 줄일 수 있도록 하였으며, 여기에서 선택된 도메인을 제약조건 기반 Configuration기술에 적용시킴으로써, 구매자와 제품 컴포넌트 사이에 존재하는 제약조건을 처리할 수 있도록 하였다. 제약조건기반 Configuration기술은 구매자에게 적합한 제품을 구성하기 위해서 제막 조건 판촉 문제(Constraint Satisfaction Problem; CSP)해결 기법을 이용한다. 또한 Clancey이론은 구매자의 만족도를 고려하기 위해서 정보검색 분야의 벡터공간 모델링 방법을 변형하여 적용하였다. 마지막으로 본 모델의 평가를 위해 전체 시스템의 수행시간 및 구매자 만족도를 비교 분석하였다

  • PDF

멀티에이전트를 이용한 CSP의 활용에 관한 연구 (A Study on Applications of CSP for Multi-Agent)

  • 김진수
    • 공학논문집
    • /
    • 제7권1호
    • /
    • pp.17-28
    • /
    • 2005
  • 분산제약조건만족문제는 다수의 자율적으로 동작하는 에이전트들의 상호작용과 그들 간의 협조에 의해 모든 에이전트들이 갖고 있는 변수들의 값과 그들 간에 존재하는 제약 조건들이 일치(Consistency)하는 값을 효율적으로 찾기 위한 양질의 알고리즘 개발에 관한 연구 분야로서 최근에 와서는 멀티에이전트 시스템을 이용하여 분산 제약조건만족문제를 해결하기 위한 효율적인 알고리즘 개발에 관한 연구가 활발하게 진행되고 있다. 이 논문에서는 비동기/병행적인 탐색 과정에서 모든 에이전트들이 그들의 시험적인 값들을 조건에 일치하는 값으로 변경하기 위해 각 에이전트의 우선순위를 동적으로 변경할 수 있게 함으로써 불 일치된 변수의 값을 탐색이 진행되는 동안에도 수정이 가능하도록 하여, 기존 비 동기 되돌림 알고리즘의 개선 대상인 되돌림(backtracking)의 효율성을 크게 향상시킬 수 있는 멀티에이전트의 동적 우선순위탐색 알고리즘을 제안하였다.

  • PDF

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

  • 박성준;정의승;장수영
    • 대한산업공학회지
    • /
    • 제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.

  • PDF

에이전트 기반 전자상거래에서 제약만족 기법을 이용한 최적의 중개 모델 (Optimal Brokerage Model using CSP Technique in Agent-Based Electronic Commerce)

  • 정종진;김지연;조근식
    • 한국정보처리학회논문지
    • /
    • 제7권5S호
    • /
    • pp.1687-1695
    • /
    • 2000
  • Recently, many researchers have tried to establish EC framework EC framework for automated contract and brokerage using agent technologies in electronic commerce. Traditional researches, however, often enforced the user's participations during the automated brokerage process of agents an did not supported the procedures and methodologies for satisfying various user's requirements. In this paper, we propose a brokerge framework based on multi-agent to overcome the defects of the previous researches. For the optimal brokerage, the proposed framework is divided into tow layers, which are called competition layer and constraint satisfaction layer. The Agents process behaviors of brokerage through two layers accroding to th proposed message driven communication protocol. W also apply CSP (Constraint Satisfaction Problems) techniques to brokerage process to satisfy various preferential requirements from the user. That is, e model the relationship between buyer agents and seller agents using CSP and propose efficient CSP models for the optimal brokerage as the types of brokerage. Finally, e implemented prototype systems applying the proposed framework and showed the efficiency of he proposed framwork with the experimental results.

  • PDF

Constraints satisfaction problem기법을 이용한 조종패널 설계방법

  • 박성준;조항준;정의승;장수영
    • 대한인간공학회:학술대회논문집
    • /
    • 대한인간공학회 1994년도 춘계학술대회논문집
    • /
    • pp.75-84
    • /
    • 1994
  • A 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 constrains, and generate an optimal or, at least, a "satisfactory" solution through the efficient search algorithm. The problem of seeking an ergonomically sound panel design should be viewed as a multiple criteria 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-constraiants layout problem. The efficient search algorithm using "preprocess" and "look ahead" procedures was developed to handle the vast amount of computational effort. 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 developed panel layout method was evaluated by example problems, and the results clearly showed that the generated layouts took various ergonomic design principles into account.esign principles into account.

  • PDF

An interactive and iterative control panel layout

  • 박성준;정의승;조항준
    • 한국경영과학회:학술대회논문집
    • /
    • 대한산업공학회/한국경영과학회 1994년도 춘계공동학술대회논문집; 창원대학교; 08월 09일 Apr. 1994
    • /
    • pp.103-111
    • /
    • 1994
  • An interactive and iterative design method based on the constraint satisfaction problem (CSP) technique was developed to generate an ergonomically sound layout of a control panel. 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 iterative interactions with the designer. The existing panel design and layout methods are mostly based on the optimization of single objective function formulated to reflect and trade off all ergonomic design objectives which are largely different in their nature. In fact, the problem of seeking an ergonomically sound panel design should be viewed as a multiple objective optimization problem. Furthermore, most of the design objectives should be understood as constraints rather than objectives to be optimized. Hence, a constraint satisfaction approach is proposed in this study as a framework for the panel designer to search through the design decision space effectively and make various design decisions iteratively. In order to apply the constraint satisfaction approach to the panel design procedure, the ergonomic principles such as frequency-of-use, importance, functional grouping, and sequence-of-use are formalized as CSP terms. With this formalization, a prototype system was implemented and applied to panel layout problems. The results clearly showed the effectiveness of the proposed approach since it permits designers to consider and iteratively evaluate various design constraints and ergonomic principles, and, therefore, aids the panel designer to come up with an ergonomically sound control panel layout.