• Title/Summary/Keyword: Hard Constraint

Search Result 97, Processing Time 0.025 seconds

Constraint Programming Approach for a Course Timetabling Problem

  • Kim, Chun-Sik;Hwang, Junha
    • Journal of the Korea Society of Computer and Information
    • /
    • v.22 no.9
    • /
    • pp.9-16
    • /
    • 2017
  • The course timetabling problem is a problem assigning a set of subjects to the given classrooms and different timeslots, while satisfying various hard constraints and soft constraints. This problem is defined as a constraint satisfaction optimization problem and is known as an NP-complete problem. Various methods has been proposed such as integer programming, constraint programming and local search methods to solve a variety of course timetabling problems. In this paper, we propose an iterative improvement search method to solve the problem based on constraint programming. First, an initial solution satisfying all the hard constraints is obtained by constraint programming, and then the solution is repeatedly improved using constraint programming again by adding new constraints to improve the quality of the soft constraints. Through experimental results, we confirmed that the proposed method can find far better solutions in a shorter time than the manual method.

Exponential Stability and Feasibility of Receding Horizon Control for Constrained Systems (구속조건이 있는 시스템에 대한 이동구간제어기의 지수 안정성과 실현 가능성)

  • Jae-Won Lee;Wook Hyun Kwon
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.4 no.5
    • /
    • pp.567-573
    • /
    • 1998
  • 본 논문에서는 입력과 상태변수에 hard constraint가 있는 이산시간 시스템에 대한 새로운 이동구간 제어기를 제안한다. 제안된 이동구간제어기가 terminal ellipsoid constraint를 이용하여 지수 안정성(exponential stability)을 보장함을 보인다. Feasibility를 증가시키기 위하여 시스템을 안정 모드와 불안정 모드로 바꾸는 방법, constraint를 완화하는 방법을 제안한다. Constraint를 완화할 때 constraint를 만족시키지 못하는 부분의 성능을 개선시키는 방법을 제안하고 예제를 통해서 몇 가지 제안한 방법들을 비교한다.

  • PDF

Sensitivity Analysis Using a Symbolic Computation Technique and Optimal Design of Suspension Hard Points (기호계산을 이용한 현가장치의 민감도 해석 및 설계점의 최적 설계)

  • Chun, Hung-Ho;Tak, Tae-Oh
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.16 no.4 s.97
    • /
    • pp.26-36
    • /
    • 1999
  • A general procedure for determining the optimum location of suspension hard points with respect to kinematic design parametes is presented. Suspensions are modeled as connection of rigid bodies by ideal kinematic joints. Constraint equations of the kinematic joints are expressed in terms of the generalized coordinates and hard points. By directly differentiating the constraint equations with respect to the hard points, kinematic sencitivity equations are obtained. In order to cope with algebraic complexity associated with the differentiation process, a symbolic computation technique is used. A performance index is defined in terms of static design parameters such as camber, caster, toe, ect.. Gradient of the performance index can be analytically computed from the kinematic sensitivity equations. Optimization results show the effectiveness and validity of the procedure, which is applicable to any type of suspension if its kinematic configurations are given.

  • PDF

Energy Efficient Control Scheme in Wireless Sensor Networks

  • Pongot, Kamil;Jeong, Woo-Jin;Lee, Jae-Yoon;Yoon, Dong-Weon;Park, Sang-Kyu
    • Proceedings of the IEEK Conference
    • /
    • 2008.06a
    • /
    • pp.371-372
    • /
    • 2008
  • In this paper, we consider wireless sensor networks with hard energy constraint, where each node is powered by a small battery. Under this hard constraint, reducing energy consumption is the most important design consideration for wireless sensor networks. Energy saving and control is an important issue, involved in the design of most sensor nodes. In this context, we focus on physical layer design where energy constraint problem can be modeled as an optimization of transmission modulation scheme[1]. Specifically, our analyses are based on energy control schemes that are relative to physical layer design on upper bound SEP MPSK in AWGN channels.

  • PDF

Fuzzy Control as Self-Organizing Constraint-Oriented Problem Solving

  • Katai, Osamu;Ida, Masaaki;Sawaragi, Tetsuo;Shimamoto, Kiminori;Iwai, Sosuke
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 1993.06a
    • /
    • pp.887-890
    • /
    • 1993
  • By introducing the notion of constraint-oriented fuzzy inference, we will show that it provides us ways of fuzzy control methods that has abilities of adaptation, learning and self-organization. The basic supporting techniques behind these abilities are“hard”processing by Artificial Intelligence or traditional computational framework and“soft”processing by Neural Network or Genetic Algorithm techniques. The reason that these techniques can be incorporated to fuzzy control systems is that the notion of“constraint”itself has two fundamental properties, that is, the“modularity”property due to its declarativeness and the“logicality”property due to its two-valuedness. From the former property, the modularity property, decomposing and integrating constraints can be done easily and efficiently, which enables us to carry out the above“soft”processing. From the latter property, the logicality property, Qualitative Reasoning and Instance Generalization by Symbolic Reasoning an be carried out, thus enabling the“hard”processing.

  • PDF

Hierarchical Constraint Network Representation of Concurrent Engineering Models (동시성공학 모형의 계층적 제약식 네트워크 표현 방법론)

  • Kim, Yeong-Ho
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.22 no.3
    • /
    • pp.427-440
    • /
    • 1996
  • Constraint networks are a major approach to knowledge representation in Concurrent Engineering (CE) systems. The networks model various factors in CE as constraints linked by shared variables. Many systems have been developed to assist constraint network processing. While these systems can be useful, their underlying assumption that a solution must simultaneously satisfy all the constraints is often unrealistic and hard to achieve. Proposed in this paper is a hierarchical representation of constraint networks using priorities, namely Prioritized Constraint Network (PCN). A mechanism to propagate priorities is developed, and a new satisfiability definition taking into account the priorities is described. Strength of constraint supporters can be derived from the propagated priorities. Several properties useful for investigating PCN's and finding effective solving strategies ore developed.

  • PDF

Kinematic Design Sensitivity Analysis of Suspension System Using a Symbolic Computation Method (기호계산 기법을 이용한 현가장치의 기구학적 민감도 해석)

  • 송성재;탁태오
    • Transactions of the Korean Society of Automotive Engineers
    • /
    • v.4 no.6
    • /
    • pp.247-259
    • /
    • 1996
  • Kinematic design sensitivity analysis for vehicle in suspension systems design is performed. Suspension systems are modeled using composite joins to reduce the number of the constraint equations. This allows a semi-analytical approach that is computerized symbolic manipulation before numerical computations and that may compensate for their drawbacks. All the constraint equations including design variables are derived in symbolic equations for sensitivity analysis. By directly differentiating the equations with respect to design variables, sensitivity equations are obtained. Since the proposed method only requires the hard point data, sensitivity analysis is possible in suspension design stage.

  • PDF

Robust Design Methodology under Design Constraints (기술적 설계제약을 고려한 강건설계법)

  • Kim, Kyung-Mo
    • Journal of Korean Society for Quality Management
    • /
    • v.35 no.4
    • /
    • pp.52-60
    • /
    • 2007
  • A multi-attribute robust design methodology is presented. This method can be applied where there are various technical constraints in design variables, multiple potentially conflicting design attributes, and uncontrollable noise variables. Two forms of technical constraints, soft and hard constraints, are considered in robust design settings. Specifically, this work presents procedures for integrating two types of design constraints seamlessly on the multiple design attributes, which is achieved through a development of multi-attribute utility formulation. The effectiveness of the overall procedures is tested with the aid of an I-Beam design problem, and results of sensitivity analysis are discussed.

Tree Representation for solving Degree Constraint Minimum Spanning Tree Problem (차수 제약 걸침 나무 문제를 해결하기 위한 트리 표현법)

  • 석상문;안병하
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2003.10a
    • /
    • pp.178-180
    • /
    • 2003
  • 최소 걸침 나무는 널리 알려진 순회 판매원 문제와 같이 전통적인 최적화 문제 중에 하나이다. 특히나 최소 걸침 나무와는 달리 차수 제약 최소 걸침 나무의 경우는 일반적으로 NP-hard 문제로 알려져 있다. 이러한 NP-hard 문제를 해결하기 위한 다양한 접근법들이 소개되었는데 유전 알고리즘은 효율적인 방법 중에 하나로 알려져 있다. 유전 알고리즘과 같이 진화에 기반을 둔 알고리즘을 어떤 문제에 적응하기 위해서 가장 우선적으로 고려되어야 하는 것은 해를 어떻게 표현할 것인가 인데 본 논문에서는 차수 제약 최소 걸침 나무를 해결하기 위한 새로운 트리 표현법을 제안한다.

  • PDF

Effects of Deep Mixed Method Construction Within the Soft ground (연약지반의 심층혼합처리공법의 시공효과)

  • ;;Li Guang Fan
    • Journal of the Korea Institute of Building Construction
    • /
    • v.1 no.1
    • /
    • pp.160-168
    • /
    • 2001
  • This study aims at the development of computer program for the deformation analysis of soft ground, and using this computer program, study the constraint effect of deformation heaving, lateral displacement of the soft ground reinforced with improvement of soft ground up to hard strata, under intact state(natural). The following results are obtained. 1. Improvement of soft ground to the hard strata works well against the settlement of neighboring ground. 2. the larger the rigidity or width of improvement of layer to hard strata is, the less settlement occurs. 3. Improvement of soft ground to the hard strata is of no use.

  • PDF