• 제목/요약/키워드: Constraint Programming Model

검색결과 98건 처리시간 0.034초

개선된 Randomizing 알고리즘을 이용한 Job Shop 일정계획에 관한 연구 (A Study on the Job Shop Scheduling Using Improved Randomizing Algorithm)

  • 이화기;김민석;이승우
    • 대한안전경영과학회지
    • /
    • 제6권2호
    • /
    • pp.141-154
    • /
    • 2004
  • The objective of this paper is to develop the efficient heuristic method for solving the minimum makespan problem of the job shop scheduling. The proposed heuristic method is based on a constraint satisfaction problem technique and a improved randomizing search algorithm. In this paper, ILOG programming libraries are used to embody the job shop model, and a constraint satisfaction problem technique is developed for this model to generate the initial solution. Then, a improved randomizing search algorithm is employed to overcome the increased search time of constrained satisfaction problem technique on the increased problem size and to find a improved solution. Computational experiments on well known MT and LA problem instances show that this approach yields better results than the other procedures.

작업처리능력 제약하에서 자동창고 건설비용 최소화를 위한 연구 (A Solution Procedure for Minimizing AS/RS Construction Costs under Throughput Rate Requirement Constraint)

  • 나윤균;이동하;오근태
    • 산업경영시스템학회지
    • /
    • 제25권4호
    • /
    • pp.40-45
    • /
    • 2002
  • An AS/RS construction cost minimization model under throughput rate requirement constraint has been developed, whose objective function includes S/R machine cost, storage rack cost, and interrace conveyor cost. S/R machine cost is a function of the storage rack height, the unit load weight, and the control logic used by the system, while storage rack cost is a function of the storage rack height, the weight and the volume of the unit load. Since the model is a nonlinear integer programming problem which is very hard to solve exactly with large problem size, a solution procedure is developed to determine the height and the length of the storage rack with a fixed number of S/R machines, while increasing the number of S/R machines one by one to meet the throughput rate requirement.

A CANONICAL REPRESENTATION FOR THE SOLUTION OF FUZZY LINEAR SYSTEM AND FUZZY LINEAR PROGRAMMING PROBLEM

  • NEHI HASSAN MISHMAST;MALEKI HAMID REZA;MASHINCHI MASHAALAH
    • Journal of applied mathematics & informatics
    • /
    • 제20권1_2호
    • /
    • pp.345-354
    • /
    • 2006
  • In this paper first, we find a canonical symmetrical trapezoidal(triangular) for the solution of the fuzzy linear system $A\tilde{x}=\tilde{b}$, where the elements in A and $\tilde{b}$ are crisp and arbitrary fuzzy numbers, respectively. Then, a model for fuzzy linear programming problem with fuzzy variables (FLPFV), in which, the right hand side of constraints are arbitrary numbers, and coefficients of the objective function and constraint matrix are regarded as crisp numbers, is discussed. A numerical procedure for calculating a canonical symmetrical trapezoidal representation for the solution of fuzzy linear system and the optimal solution of FLPFV, (if there exist) is proposed. Several examples illustrate these ideas.

철강 공정의 일정계획을 위한 혼합정수계획 모델 (Mixed-Integer programming model for scheduling of steelmaking processes)

  • 복진광;이동엽;박선원
    • 제어로봇시스템학회논문지
    • /
    • 제5권6호
    • /
    • pp.714-723
    • /
    • 1999
  • This paper presents a short-term scheduling algorithm for the operation of steelmaking processes. The scope of the problem covers refining of the hot iron transferred form a blast furnace, ladle treatment, continuous casting, hot-rolling, and coiling for the final products that should satisfy the given demand. The processing time at each unit depends on how much the batch amount is treated, and te dedicated intermediate storage with finite capacity between the units is considered. Resource constraints and initial amount of each state are incorporated into the presented scheduling model for the algorithm of on-line scheduling. We propose amixed integer linear programming (MILP) model with two objectives for the scheduling. The first is to maximize the total profit while atisfying the due date constraint for each product. And the second is to minimize the total processing time, makespan, while satisfying the demand for each product. Especially, we observe the effect of penalizing the intermediate storage and the inventory level of the final product on the scheduling results.

  • PDF

Application of Dynamic Programming to Optimization of a System Reliability

  • Sok, Yong-U
    • 한국국방경영분석학회지
    • /
    • 제24권2호
    • /
    • pp.130-145
    • /
    • 1998
  • This paper is concerned with the optimization of a system reliability. Two kinds of the reliability model for optimal allocation of parallel redundancy are considered. The algorithm for solving the optimal redundancy problem is proposed by the use of dynamic programming(DP) method. The problem is approached with a standard DP formulation and the DP algorithm is applied to the model and then the optimal solution is found by the backtracking method. The method is applicable to the models having no constraints or having a cost constraint subject to a specified minimum requirement of the system reliability. A consequence of this study is that the developed computer program package are implemental for the optimization of the system reliability.

  • PDF

SCHEDULING REPETITIVE PROJECTS WITH STOCHASTIC RESOURCE CONSTRAINTS

  • I-Tung Yang
    • 국제학술발표논문집
    • /
    • The 1th International Conference on Construction Engineering and Project Management
    • /
    • pp.881-885
    • /
    • 2005
  • Scheduling repetitive projects under limitations on the amounts of available resources (labor and equipment) has been an active subject because of its practical relevance. Traditionally, the limitation is specified as a deterministic (fixed) number, such as 1000 labor-hours. The limitation, however, is often exposed to uncertainty and variability, especially when the project is lengthy. This paper presents a stochastic optimization model to treat the situations where the limitations of resources are expressed as probability functions in lieu of deterministic numbers. The proposed model transfers each deterministic resource constraint into a corresponding stochastic one and then solves the problem by the use of a chance-constrained programming technique. The solution is validated by comparison with simulation results to show that it can satisfy the resource constraints with a probability beyond the desired confidence level.

  • PDF

규칙적인 논리프로그램밍을 이용한 탄력적 제약 만족문제 해법 (A Method for Reactive Scheduling using Rule-based Constraint Satisfaction Problem)

  • 김철수
    • 한국정보처리학회논문지
    • /
    • 제7권10호
    • /
    • pp.3113-3118
    • /
    • 2000
  • 본 연구에서 제시한 구조는 다중목적을 갖는 규칙기반 제약만족문제의 표현을 포함하고 있고 그 문제는 시스템에서 변화에 탄력적으로 대응할 수 있는 전력공급계획을 효과적으로 수립한다. 이 연구에서 제안한 구조를 계량적 모델을 위한 모델링 시스템과 정성적 모델을 위한 규칙 기반의 제약만족 프로그램밍 기법을 이용하였다. 또한 좋은 사례를 통한 실험결과를 요약하면 이 문제의 표현을 포함한 구조는 효과적이며 탄력적인 의사결정을 얻는데 큰 도움을 주며, 발전기 특성을 고려하는 데에서는 기존의 문제 구조보다는 표현이 다양하고 쉽다는 장점을 갖는다.

  • PDF

환경규제와 기술제약 -한국지역제조업을 중심으로- (Environmental Regulation and Technological Constraint)

  • 강상목;김은순
    • 자원ㆍ환경경제연구
    • /
    • 제11권3호
    • /
    • pp.345-375
    • /
    • 2002
  • The purpose of this paper is to measure the change of the production efficiency which may happen when environmental regulation incurs technological constraint in the process of production, and to compute the opportunity cost of pollution reduction with the lost products based on the change of efficiency. The patterns of production technoloy in the paper are divided into the technologies of strong disposability and weak disposabilty to grasp the effect of the technological constraint due to the environmental regulation. The endowment of the technolgical constraints in the process of production is considered to bring the greatest restriction on firm's production. When the environmental efficiencies of Korean regional manufactures were measured with linear programming model, the lost products related with the constraint of production technology that environmental regulation incurred, was average 148.1 billion dollar per year(5.87% of one year overall products) for total manufactures in 1991~1998. The ratio of the lost products for total products was spread from 0.78% to 1l.08%. The average lost products of 15 regions were changed from 4.66% to 18.35% of total products. Generally the environmental efficiency index of regional manufactures being decreased continuously since 1991, it is estimated that the environmental performance of Korean manufactures has been more and more deteriorating.

  • PDF

단독주택 태양광 발전과 냉방수요를 반영한 전력 최적운용 전략 연구 (Study on Optimal Control Algorithm of Electricity Use in a Single Family House Model Reflecting PV Power Generation and Cooling Demand)

  • 서정아;신영기;이경호
    • 설비공학논문집
    • /
    • 제28권10호
    • /
    • pp.381-386
    • /
    • 2016
  • An optimization algorithm is developed based on a simulation case of a single family house model equipped with PV arrays. To increase the nationwide use of PV power generation facilities, a market-competitive electricity price needs to be introduced, which is determined based on the time of use. In this study, quadratic programming optimization was applied to minimize the electricity bill while maintaining the indoor temperature within allowable error bounds. For optimization, it is assumed that the weather and electricity demand are predicted. An EnergyPlus-based house model was approximated by using an equivalent RC circuit model for application as a linear constraint to the optimization. Based on the RC model, model predictive control was applied to the management of the cooling load and electricity for the first week of August. The result shows that more than 25% of electricity consumed for cooling can be saved by allowing excursions of temperature error within an affordable range. In addition, profit can be made by reselling electricity to the main grid energy supplier during peak hours.

제동 장치 최적 설계 모듈 개발 (Development of the Optimization Design Module of a Brake System)

  • 정성필;박태원
    • 한국자동차공학회논문집
    • /
    • 제16권3호
    • /
    • pp.166-171
    • /
    • 2008
  • In this paper, the optimization design module for the brake system of a vehicle is developed. As using this module, design variables, that minimize an object function and satisfy nonlinear constraint conditions, can be found easily. Before an optimization is operated, Plackett-Burman design, one of the factorial design methods, is used to choose the design variables which affect a response function significantly. Using the response surface analysis, second order recursive model function, which informs a relation between design variables and response function, is estimated. In order to verify the reliability of the model function, analysis of variances(ANOVA) table is used. The value of design variables which minimize the model function and satisfy the constraint conditions is predicted through Sequential Quadratic-Programming (SQP) method. As applying the above procedure to a real vehicle simulation model and comparing the values of object functions of a current and optimized system, the optimization results are verified.