• Industrial Engineering and Management Systems
• /
• v.10 no.1
• /
• pp.74-83
• /
• 2011

In this paper, we consider a new lot-sizing and scheduling problem (LSSP) that minimizes the sum of production cost, setup cost and inventory cost. Setup carry-over, setup overlapping, state dependent setup time as well as demand splitting are considered. For this LSSP, we develop a mixed integer programming (MIP) model, of which the size does not increase even if we divide a time period into a number of micro time periods. Also, we develop an efficient heuristic algorithm by combining a decomposition scheme with a local search procedure. Test results show that the developed heuristic algorithm finds a good quality (in practice, even better) feasible solution using far less computation time compared with the CPLEX, a competitive MIP solver.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.56 no.10
• /
• pp.1721-1730
• /
• 2007

SThis paper proposes a new dispatch scheduling algorithm in interconnected regional system operations. The dispatch scheduling formulated as mixed integer non-linear programming (MINLP) problem can efficiently be computed by generalized Benders decomposition (GBD) algorithm. GBD guarantees adequate computation speed and solution convergency since it decomposes a primal problem into a master problem and subproblems for simplicity. In addition, the inter-temporal optimal power flow (OPF) subproblem of the dispatch scheduling problem is comprised of various variables and constraints considering time-continuity and it makes the inter-temporal OPF complex due to increased dimensions of the optimization problem. In this paper, regional decomposition technique based on auxiliary problem principle (APP) algorithm is introduced to obtain efficient inter-temporal OPF solution through the parallel implementation. In addition, it can find the most economic dispatch schedule incorporating power transaction without private information open. Therefore, it can be expanded as an efficient dispatch scheduling model for interconnected system operation.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.26 no.1
• /
• pp.33-44
• /
• 2001

In this paper, we address a problem of traffic grooming and wavelength routing in all optical WDM ring networks. Given a traffic demand for each node pair, we should aggregate the traffic onto lightpaths between pairs of nodes to transport the demand, and set up the routing path for each lightpath with minimum number of wavelengths to be assigned to lightpaths. In this paper, we formulate our problem as a mixed Integer Programming model. Owing to the problem complexity, it is hard to find an optimal solution for our problem. hence, we develop a heuristic algorithm to solve our problem efficiently. From the computational experiments, we can find the proposed heuristic is very satisfactory in both the computation time and the solution quality generated.

• Journal of Korean Society of Transportation
• /
• v.15 no.3
• /
• pp.53-74
• /
• 1997

신호연동화모형에서 통과폭모형은 지체를 최소화하지 못하고 지체도모형은 좌회전현시순서를 최적화하지 못한다. 이러한 모형의 단점을 극복하고자 개발된 KS_SIGNAL은 지체를 최소화하는 신호연동화모형이지만 지체를 산정하는데 있어 많은 한계를 갖고 있다. 본 연구에서는 기존에 개발된 KS_SIGNAL의 지체모형을 개선하여 보다 우수한 연동신호시간과 현시순서를 산정해주는 신호최적화모형(KS_SIGNAL II)을 개발하여 FORTRAN 언어로 전산화하였다. 개발된 모형은 다양한 평가를 통하여 기존 모형들보다 전반적으로 우수한 것으로 입증되었다. 본 모형을 통하여 차량 출발 및 도착형태에 따른 대기차량 소거시간을 고려하는 옵셋 산정이 가능해져 지체를 최소화하는 간선도로의 신호최적화모형으로 활용될 경우 도로기능제고 및 지체도 감소에 의한 편익을 얻을 수 있다.

• Proceedings of the Korean Reliability Society Conference
• /
• 2000.11a
• /
• pp.399-404
• /
• 2000

Redundancy allocation problems have been considered at single-level systems and it may be the best policy in some specific situations, but not in general. With regards to reliability, it is most effective to allocate the lowest objects, because parallel-series systems are more reliable than series-parallel systems. However, the smaller and tower in the system an object is, the more time and accuracy are needed for duplicating it, and so, the cost can be decreased by using modular redundancy. Therefore, providing redundancy at high levels like as modules or subsystems, can be more economical than providing redundancy at low levels or duplicating components. In this paper, the problem in which redundancy is allocated at all level in a series system is addressed, a mixed integer nonlinear programming model is presented and genetic algorithm is proposed. An example illustrates the procedure.

• Journal of Korean Institute of Industrial Engineers
• /
• v.23 no.1
• /
• pp.55-76
• /
• 1997

This paper presents a heuristic solution for the three dimensional container loading problem with boxes which are different in size. The container loading problem is formulated as a zero-one mixed integer programming model whose objective is to maximize the container utilization. Due to its problem complexity, we propose a heuristic based on layered loading technique. Also, presented is a way to achieve the weighting balance of the stacked boxes. A micro-computer based program is developed which generates container loading pattern provided by the proposed heuristic. The results are displayed by computer-graphic. To evaluate the performance of the proposed heuristic, computational experiments are performed. The results indicate that in most of the cases the proposed heuristic performs better than an existing heuristic in terms of the container utilization.

• Journal of Korean Institute of Industrial Engineers
• /
• v.32 no.2
• /
• pp.91-97
• /
• 2006

The vehicle routing problem with time windows (VRPTW) is an important problem in third party logistics and supply chain management. We extend the VRPTW to the VRPTW with overtime and outsourcing vehicles (VRPTWOV) which allows the overtime of drivers and the possibility of using outsourcing vehicles. This problem can be applied to third party logistics companies for managing central distributor-local distributors, local distributor-retailers (or customers), and a manufacturer. We develop a mixed integer programming model and a genetic algorithm. Computational results demonstrate the efficiency of the developed genetic algorithm. We also develop a decision support system based on this genetic algorithm.

• Journal of Korean Institute of Industrial Engineers
• /
• v.37 no.4
• /
• pp.382-389
• /
• 2011

Salesperson Monitoring System (SMS) is geographic based information system that supports business auditing, sales area coordinating and customer management for each salesperson. Conventional SMSs focus mainly on the monitoring or logging functions, i.e., a salesperson locating or moving trail tracking. However, the schedules have been planned by human planner, and they have rarely been managed with a software system like SMS. In this paper, a mixed integer programming model for a salesperson routing schedule is provided. Then, 2-phase Genetic Algorithm (GA) is proposed to make salesperson routing schedule. Experimental results show a validity of the proposed method.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.30 no.1
• /
• pp.1-15
• /
• 2005

In this paper, we deal with a mesh network design problem arising from the deployment of WDM for the optical internet. The mesh network consists of mesh topology for satisfying traffic demand while minimizing the cost of WDM, OXC, and fiber cables. The problem seeks to find an optimal routing of traffic demands in the network such that the total cost is minimized. We formulate the problem as a mixed-integer programming model and devise a tabu search heuristic procedure. Also we develop an optical internet design system that implements the proposed tabu search heuristic procedure. We demonstrate the computational efficacy of the proposed algorithm, compared with CPLEX 8.0.

• Proceedings of the Korea Water Resources Association Conference
• /
• 1993.07a
• /
• pp.535-543
• /
• 1993

이 논문의 목적은 기존의 상수도 관망을 개선하는데 있어 어느 관을 교체 또는 재생할 것인가와 펌프용량을 얼마나 늘릴 것인가를 결정함으로써 관망내 각 급수지점에서의 요구유량및 수압을 만족시킴은 물론 그에 드는 비용을 최소화시키는 모델을 개발하는데 있다. 이 논문은 관교체 비용, 세관 및 재생 비용, 관보수 비용, 펌핑 비용, 펌프시설 확충비용 등의 다섯가지 비용들을 비교 검토함으로써 의사결정을 하게 된다. 제약조건식으로는 급수 조건식, 에너지 방정식, 수리학적 방정식, 결정 조건식, 한계 조건식, 정수 조건식 등이 있다. 이 모델을 수식화하면 정수혼합 비선형계획법 (mixed-integer nonlinear programming, MINLP) 문제가 된다. 이 문제를 풀기 위해 비선형해법의 GRG (generalized reduced gradient) 방법과 분기와 한계 (banch and bound) 기법을 통한 implicit enumeration 기법을 접목시키는 방법을 제안하였다.