• 제목/요약/키워드: Mixed-Integer Linear Programming

검색결과 135건 처리시간 0.043초

MINIMIZATION OF PARENT ROLL TRIM LOSS FOR THE PAPER INDUSTRY

  • Bae, Hee-Man
    • 한국경영과학회지
    • /
    • 제3권2호
    • /
    • pp.95-108
    • /
    • 1978
  • This paper discusses an application of mathematical programming techniques in the paper industry in determining optimal parent roll widths. Parent rolls are made from the reels produced at wide paper machines by slitting them to more manageable widths. The problem is finding a set of the slitting patterns that will minimize the trim loss involved in the sheeting operation. Two programming models, one linear and one mixed integer linear, are presented in this paper. Also presented are the computational experience, the model sensitivity, and the comparison of the optimal solutions with the simulated operational data.

  • PDF

철강 공정의 일정계획을 위한 혼합정수계획 모델 (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

혼합정수계획법을 이용한 요격미사일의 할당 및 교전 일정계획에 관한 연구 (A Study on the Allocation and Engagement Scheduling of Air Defense Missiles by Using Mixed Integer Programming)

  • 이대력;양재환
    • 경영과학
    • /
    • 제32권4호
    • /
    • pp.109-133
    • /
    • 2015
  • This paper considers the allocation and engagement scheduling of air defense missiles by using MIP (mixed integer programming). Specifically, it focuses on developing a realistic MIP model for a real battle situation where multiple enemy missiles are headed toward valuable defended assets and there exist multiple air defense missiles to counteract the threats. In addition to the conventional objective such as the minimization of surviving target value, the maximization of total intercept altitude is introduced as a new objective. The intercept altitude of incoming missiles is important in order to minimize damages from debris of the intercepted missiles and moreover it can be critical if the enemy warhead contains an atomic or chemical bomb. The concept of so called the time window is used to model the engagement situation and a continuous time is assumed for flying times of the both missiles. Lastly, the model is extended to simulate the situation where the guidance radar, which guides a defense missile to its target, has the maximum guidance capacity. The initial mathematical model developed contains several non-linear constraints and a non-linear objective function. Hence, the linearization of those terms is performed before it is solved by a commercially available software. Then to thoroughly examine the MIP model, the model is empirically evaluated with several test problems. Specifically, the models with different objective functions are compared and several battle scenarios are generated to evaluate performance of the models including the extended one. The results indicate that the new model consistently presents better and more realistic results than the compared models.

가스터빈 복합발전의 기동특성을 고려한 열거래 기반 지역 냉난방 시스템의 최적 운영 모델 (Optimal Operation Model of Heat Trade based District Heating and Cooling System Considering Start-up Characteristic of Combined Cycle Generation)

  • 김종우;이지혜;김학만
    • 전기학회논문지
    • /
    • 제62권11호
    • /
    • pp.1610-1616
    • /
    • 2013
  • Recently, district heating and cooling (DHC) systems based on combined cycle generation (CCG) providers are increasing in Korea. Since characteristics of combined heat and power (CHP) generators and heat demands of providers, heat trading between DHC providers based on the economic viewpoint is required; the heat trading has been doing. In this paper, a mathematical model for optimal operation based on heat trading between DHC providers is proposed. Especially, start-up characteristic of CCG is included. The operation model is established by mixed integer linear programming (MILP).

혼합 정수 계획 모형을 활용한 서울시 폐기물 관리 시스템 예비 분석 (Preliminary Analysis of Solid Waste Management System for Seoul City by a Mixed Integer Programming Model)

  • Kim, Jae-Hee;Kim, Sheung-Kown
    • 한국경영과학회:학술대회논문집
    • /
    • 한국경영과학회 2001년도 추계학술대회 논문집
    • /
    • pp.72-75
    • /
    • 2001
  • This paper presents a sophisticated mixed-integer linear programming model that may help regional decision-maker to develop long term plan of solid waste management The model revises Ni-Bin Chang(1996)'s integrated waste management models to fit Korean solid waste management system We apply this model to evaluate impact of facility sharing and coordinated operation among three self-governing districts in Seoul city Our study results indicate that facility sharing and coordinated operation among districts eliminate unnecessary landfilling and facility expansion.

  • PDF

혼합정수 선형계획법과 유전 알고리듬을 이용한 다수 무인항공기 임무할당 (Task Assignment of Multiple UAVs using MILP and GA)

  • 최현진;서중보;김유단
    • 한국항공우주학회지
    • /
    • 제38권5호
    • /
    • pp.427-436
    • /
    • 2010
  • 본 논문은 다수의 목표물과 다수의 임무가 존재하는 상황에서의 다수 무인항공기의 임무할당 문제를 다룬다. 다수 무인항공기의 임무할당 문제는 순회 세일즈맨 문제, 차량 라우팅 문제와 같은 조합최적화 문제의 일종으로 NP-hard의 계산 복잡도를 가지고 있다. 이런 성격의 문제는 문제의 크기가 커질수록 계산시간이 급격히 증가하는 특징을 지니기 때문에 문제를 효율적으로 풀기 위해서 근사화 방법 또는 발견적인 방법을 사용한다. 본 연구에서는 임무할당 문제를 혼합정수 선형계획 문제로 정식화하고, 혼합정수 선형계획법과 유전 알고리듬으로 해를 구하였다. 다수의 목표물, 다수의 임무, 장애물이 존재하는 환경에 대한 수치 시뮬레이션을 수행하여 각 방법의 최적성과 효율성에 대해 검토하였다.

A remark to a Constrained OWA Aggregation

  • Hong Dug Hun;Kim Kyung Tae
    • 한국지능시스템학회논문지
    • /
    • 제15권3호
    • /
    • pp.355-356
    • /
    • 2005
  • The problem of maximizing an OWA aggregation of a group of variables that are interrelated and constrained by a collection of linear inequalities is considered by Yager[Fuzzy Sets and Systems, 81(1996) 89-101]. He obtained how this problem can be modelled as a mixed integer linear programming problem. Recently, Carlsson et al. [Fuzzy Sets and Systems, 139(2003) 543-546] obtained a simple algorithm for exact computation of optimal solutions to a constrained OWA aggregation problem with a single constraint on the sum of all decision variables. In this note, we introduce anew approach to the same problem as Carlsson et al. considered. Indeed, it is a direct consequence of a known result of the linear programming problem.

혼합정수계획법을 활용한 도로포장 보수구간 선정 최적화 연구 (Optimal Road Maintenance Section Selection Using Mixed Integer Programming)

  • 조건영;임희종
    • 한국도로학회논문집
    • /
    • 제19권3호
    • /
    • pp.65-70
    • /
    • 2017
  • PURPOSES : Pavement Management System contains the data that describe the condition of the road. Under limited budget, the data can be utilized for efficient plans. The objective of this research is to develop a mixed integer program model that maximizes remaining durable years (or Lane-Kilometer-Years) in road maintenance planning. METHODS : An optimization model based on a mixed integer program is developed. The model selects a cluster of sectors that are adjacent to each other according to the road condition. The model also considers constraints required by the Seoul Metropolitan Facilities Management Corporation. They select two lanes at most not to block the traffic and limit the number of sectors for one-time construction to finish the work in given time. We incorporate variable cost constraints. As the model selects more sectors, the unit cost of the construction becomes smaller. The optimal choice of the number of sectors is implemented using piecewise linear constraints. RESULTS : Data (SPI) collected from Pavement Management System managed by Seoul Metropolitan City are fed into the model. Based on the data and the model, the optimal maintenance plans are established. Some of the optimal plans cannot be generated directly in existing heuristic approach or by human intuition. CONCLUSIONS:The mathematical model using actual data generates the optimal maintenance plans.

연속상승운항을 위한 최적 공역 설계에 관한 연구 (A Study on Optimal Airspace Design for Continuous Climb Operation)

  • 김은영;홍성권;이금진
    • 한국항공운항학회지
    • /
    • 제23권2호
    • /
    • pp.15-20
    • /
    • 2015
  • This paper introduces a new airspace design method for continuous climb operation (CCO). The optimization problem is formulated as Mixed-Integer Linear Program (MILP) to maximize the upper limits of altitude on the waypoints to facilitate continuous climb for aircraft. In the proposed method, the interactions with other flight procedures are considered as well as various aircraft flight performances. The proposed method is applied to one of the departure procedures of Incheon International Airport (ICN) to demonstrate its performances.