• Title/Summary/Keyword: 혼합정수계획모형

Search Result 78, Processing Time 0.022 seconds

Export Container Remarshaling Planning in Automated Container Terminals (자동화 컨테이너 터미널에서 수출 컨테이너 이적계획)

  • Bae Jong-Uk;Park Yeong-Man;Kim Gap-Hwan
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2006.05a
    • /
    • pp.1186-1193
    • /
    • 2006
  • 이적작업은 하역작업 시간을 단축하고 장치장의 효율을 높이기 위해 최근 중요하게 다루어지는 운영 전략들 중의 하나이다. 자동화 컨테이너 터미널에서 수출 컨테이너 이적작업은 작업영역에 제약을 가진 하역장비를 이용하여 장치장 블록에 산재되어 있는 수출 컨테이너들을 적하작업이 용이한 형태로 재배치하는 것이다. 이 연구는 이적 및 적하작업과 연관된 총비용을 최소화하기 위해 어느 베이의 어떤 컨테이너를 어느 베이로 재배치할 지를 결정하기 위한 이적계획을 정의하고 이를 혼합정수계획법으로 모형화하였다. 또한, 실제 현장에서 사용이 가능한 휴리스틱 알고리즘을 제안하였으며 다양한 시나리오를 구성하여 배치형태 및 비용 가중치 등에 대한 민감도를 분석하였다.

  • PDF

Development of Transmission Expansion Planning Optimization Software Considering Integration of Generation and Transmission Facilities (발·송전설비 통합성을 고려한 전력계통계획 전산모형 프로그램 개발)

  • Hur, Don;Jung, Hae-Sung;Ryu, Heon-Su;Cho, Kong-Wook
    • Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
    • /
    • v.24 no.2
    • /
    • pp.16-26
    • /
    • 2010
  • The transmission valuation methodology we propose here captures the interaction between generation and transmission investment decisions recognizing that a transmission expansion can impact the profitability of new resources investment, so that a methodology should consider both the objectives of investors in resources and the transmission planner. In this perspective, this paper purports to develop the mixed-integer programming based transmission expansion planning optimization software, which is well designed to determine the construction time and place of new generators, transmission lines, and substations as well as their capacities to minimize total expenditures related to their investment and operations while meeting technical constraints such as capacity margin, constitution ratio of power resources, spinning reserves, energy and fuel constraints, transmission line outages and losses, pi-type branching, and so on. Finally, Garver's simple system is adopted to validate not simply the accuracy but the efficiency of the proposed model in this paper.

A Goal Programming Model for Guard Soldier Scheduling (목표계획법을 이용한 경계부대 근무편성에 관한 연구)

  • Kim, Hak-Young;Ryoo, Hong-Seo
    • Journal of the military operations research society of Korea
    • /
    • v.32 no.2
    • /
    • pp.21-39
    • /
    • 2006
  • This paper presents a mixed linear and integer goal programming (GP) model to aid in strategic planning and scheduling of guard soldiers. The proposed model is a general-purpose model, hence can be used to produce an optimal schedule with respect to any user-provided combination of guard post objectives and soldier preferences. We extensively test the usefulness of the model on a real-life dataset from a guard post in the ROK Army with using three objectives set by the guard post and three preferences provided by individual solders. Numerical results and analysis from these experiments show that the proposed guard scheduling model efficiently as well as effectively generates an optimal guard schedule and can also be used for an optimal revision of any existing schedule. In summary, these illustrate that the proposed model can be practically used for optimal planning and scheduling of guard soldiers in guard posts.

A Modeling and Solution Method for Routing of Container Ship (콘테이너 선박 운항경로 문제의 모형화와 해법)

  • 성기석;박순달
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.14 no.2
    • /
    • pp.1-18
    • /
    • 1989
  • 콘태이너 선박은 출발항과 종착항의 두항구 사이를 잇는 지정된 항로를 오가면서 항로의 중도에 있는 각 항구에 기항하여 화물을 상.하역하는 형태로 각 항구 사이의 화물운송을 수행한다. 이때 이윤을 최대화 하기 위해서 선박을 어느 항구에 기항하고, 또 기항하는 항구에서는 얼마만큼의 화물을 항.하역할 것인지를 적절하게 결정해야 한다. 이러한 콘테이너 선박 운항경로 문제를 모형화 하고, 0-1 혼합정수 계획법을 이용한 수리모형을 제시한 후, 최소비용 흐름문제와 분지한계 기법을 이용한 최적해법을 제시하였다. 본 논문에서는 제시한 해법에서는 먼저, 기항하기로 한 항구의 집합에 따라 부분문제를 정의한다. 또한 분해된 부분문제에서 추가로 기항할 항구들에 대한 운항구간의 적제 한계와 운항비용을 완화시킨 문제를 정의하고, 그것을 다시 최소비용흐름문제를 이용하여 풀어서 상한값ㄹ 구한다. 이와 같은 방법으로 각 부분문제의 하한값과 하한값을 계신히여, 그것을 이용하여 분지를 절단하고, 또한 상한값이 높은 부분문제를 우선적으로 선택하여 분지합으로써 최적해를 구한다.

  • PDF

An Algorithm for Real-Traffic Signal Control at An Isolated-Intersection (실시간 신호제어알고리즘 개발에 관한 연구)

  • Shin, Eon-Kyo;Kim, Young-Chan;Lee, Jong-Man
    • Journal of Korean Society of Transportation
    • /
    • v.22 no.7 s.78
    • /
    • pp.161-167
    • /
    • 2004
  • While most or fixed-time control systems such as UTCS produce the signal timing plans that either maximizing bandwidth or minimizing a disutility index of delay and stops, cannot consider the fluctuation of traffic flow. One category of the traffic-response control systems, which make small changes on a predefined signal plan such as SCOOT, cannot be easily modified for feedback real-time control schemes based on observation of variables other than traffic flow. The other category, which decide to whether switch the traffic lights or not at each step of time as in PRODYN, does not adequately consider the relations between traffic flows and traffic lights at each step of time. In this paper we present a complete formulation that adequately consider the relations between traffic flows and traffic lights at each step of time. The formulation is a binary mixed integer linear programing (BMILP) that obtain traffic lights at each step for minimizing delay. Since numarical examples for application of the proposed model illustrated that the model adequately produced dynamic traffic signal plans minimizing delay at each step, the model may be expected to contribute to advanced transportation management systems (ATMS) for dynamic traffic signal control.

A Study on the Optimization Problem for Offshore Oil Production and Transportation (해양 석유 생산 및 수송 최적화 문제에 관한 연구)

  • Kim, Chang-Soo;Kim, Si-Hwa
    • Journal of Navigation and Port Research
    • /
    • v.39 no.4
    • /
    • pp.353-360
    • /
    • 2015
  • The offshore oil production requires a huge amount of cost and time accompanied by multiple variables due to the peculiar nature of 'offshore'. And every process concerned is controlled by elaborate series of plans for reducing loss of lives, environment and property. This paper treats an optimization problem for offshore oil production and transportation. We present an offshore production and transportation network to define scope of the problem and construct a mixed integer linear programming model to tackle it. To demonstrate the validity of the optimization model presented, some computational experiments based on hypothetical offshore oil fields and demand markets are carried out by using MS Office Excel solver. The downstream of the offshore production and transportation network ends up with the maritime transportation problem distributing the crude oil produced from offshore fields to demand markets. We used MoDiSS(Model-based DSS in Ship Scheduling) which was built to resolve this maritime transportation problem. The paper concludes with the remark that the results of the study might be meaningfully applicable to the real world problems of offshore oil production and transportation.

On an Implementation of a Hybrid Solver Based on Warren Abstract Machine and Finite Domain Constraint Programming Solver Structures (워렌 추상기계와 한정도메인 제약식프로그램의 구조를 이용한 혼합형 문제해결기 구현에 대한 탐색적 연구)

  • Kim Hak-Jin
    • Journal of Intelligence and Information Systems
    • /
    • v.10 no.2
    • /
    • pp.165-187
    • /
    • 2004
  • Constraint Programming in AS and Optimization in OR started and have grown in different backgrounds to solve common decision-making problems in real world. This paper tries to integrate results from those different fields by suggesting a hybrid solver as an integration framework. Starting with an integrating modeling language, a way to implement a hybrid solver will be discussed using Warren's abstract machine and an finite domain constraint programming solver structures. This paper will also propose some issues rising when implementing the hybrid solver and provide their solutions.

  • PDF

Study of shortest time artillery position construction plan (최단시간 포병진지 구축계획 수립을 위한 연구)

  • Ahn, Moon-Il;Choi, In-Chan
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.17 no.6
    • /
    • pp.89-97
    • /
    • 2016
  • This paper addresses the problem of the construction planning of artillery positions, for which we present an optimization model and propose a heuristic algorithm to solve problems of practical size. The artillery position construction plan includes the assignment of engineers to support the artillery and the schedule of the support team construction sequence. Currently, in the army, managers construct the plan based on their experience. We formulate the problem as a mixed integer program and present a heuristic that utilizes the decomposition of the mixed integer model. We tested the efficacy of the proposed algorithm by conducting computational experiments on both small-size test problems and large-size practical problems. The average optimality gap in the small-size test problem was 6.44% in our experiments. Also, the average computation time to solve the large-size practical problems consisting of more than 200 artillery positions was 79.8 seconds on a personal computer. The result of our computational experiments shows that the proposed approach is a viable option to consider for practical use.

Robust production and transportation planning for TFT-LCD industry under demand and price uncertainties using scenario model (시나리오 모델을 활용한 수요 및 가격 불확실성이 존재하는 TFT-LCD 산업에서의 Robust 생산 및 수송계획)

  • Shin, Hyun-Joon;Ru, Jae-Pil
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.11 no.9
    • /
    • pp.3304-3310
    • /
    • 2010
  • This study solves the decision making problems for TFT-LCD manufacturing supply chain with demand and price uncertainties by establishing robust production and distribution strategies. In order to control the decisions regarding production graded by quality, inventory level and distribution, this study develop scenario model based stochastic mixed integer linear programs (SMILPs) that consider demand and price uncertainties as well as realistic constraints such as capacities etc. The performance of the solution obtained from the SMILPs using robust algorithms will be evaluated through various scenarios.

A Study on the Improvement of Inter-Terminal Transportation Using Buffer Space (완충지역을 활용한 타부두 환적 컨테이너 운송 개선 방안)

  • Park, Hyoung-Jun;Shin, Jae-Young;Choi, Yang-Ho
    • Journal of Navigation and Port Research
    • /
    • v.45 no.6
    • /
    • pp.314-324
    • /
    • 2021
  • Competition between ports around the world is intensifying to attract transshipment cargo. However, recently, there have been concerns about the departure of transshipment cargo volume at Busan Port, such as the lifting of the cabotage policy in China's shipping sector and the implementation of a safe fare system. In terms of operation, terminal congestion and vehicle waiting time are seriously occurring due to imbalance in the transshipment volume of each terminal and vehicles concentrated in a specific time period. In this paper, we propose a method of inter-terminal transportation (ITT) using buffer space to solve the problem caused by inefficient ITT systems and presented a mixed integer programming (MIP) for the problem. The effect of using the buffer space was analyzed for various work volumes and capacity fluctuation ranges by applying the terminal congestion pattern and ITT vehicle in/out pattern based on the Busan New Port data.