• Title/Summary/Keyword: Mixed Linear and Integer Programming

Search Result 132, Processing Time 0.029 seconds

A Study on Aircraft-Target Assignment Problem in Consideration of Deconfliction (최적화와 분할 방법을 이용한 항공기 표적 할당 연구)

  • Lee, Hyuk;Lee, Young Hoon;Kim, Sun Hoon
    • Korean Management Science Review
    • /
    • v.32 no.1
    • /
    • pp.49-63
    • /
    • 2015
  • This paper investigates an aircraft-target assignment problem in consideration of deconfliction. The aircraft-target assignment problem is the problem to assign available aircrafts and weapons to targets that should be attacked, where the objective function is to minimize the total expected damage of aircrafts. Deconfliction is the way of dividing airspaces for aircraft flight to ensure the safety while performing the mission. In this paper, mixed integer programming model is suggested, where it considers deconfliction between aircrafts. However, the suggested MIP model is non-linear and limited to get solution for large size problem. The 2-phase decomposition model is suggested for efficiency and computation, where in the first phase target area is divided into sectors for deconfliction and in the second phase aircrafts and weapons are assigned to given targets for minimizing expected damage of aircraft. The proposed decomposition model shows outperforms the model developed for comparison in the computational experiment.

Branch-and-Bound Based Heuristic Scheduling for the Single-Hoist and Multiple-Products Production System (단일 호이스트 생산시스템에서 다양한 주문을 처리하기 위한 분지한계 기반의 휴리스틱 일정계획)

  • Lee, Jungkoo;Kim, Jeongbae;Koh, Shiegheun
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.42 no.3
    • /
    • pp.173-181
    • /
    • 2016
  • This paper deals with the single-hoist and multiple-products scheduling problem. Although a mixed integer linear programming model for the problem was developed earlier, a branch-and-bound based heuristic algorithm is proposed in this paper to solve the big-size problems in real situation. The algorithm is capable of handling problems incorporating different product types, jobs in the process, and tank capacities. Using a small example problem the procedure of the heuristic algorithm is explained. To assess the performance of the heuristic we generate a bigger example problem and compare the results of the algorithm proposed in this paper with the optimal solutions derived from the mathematical model of earlier research. The comparison shows that the heuristic has very good performance and the computation time is sufficiently short to use the algorithm in real situation.

A Study of Optimal Fuel-Mix Considering Power Generation Operation (발전기 출력특성을 고려한 최적전원구성 연구)

  • Jung, Young-Beom;Kim, Kil-Sin;Park, Chang-Ho;Yoon, Yong-Beom
    • Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
    • /
    • v.25 no.10
    • /
    • pp.28-37
    • /
    • 2011
  • Though Korea has introduced CBP(Cost Based pool) power trading system since 2001, long-term Generation system planning has been executed by government for Cost minimization every 2 years. Until currently the model which is used for Generation system planning and best-mix only considers cost minimization and total yearly or quarterly electricity demand every year. In a view point of one day power supply operation, technical characteristics, like the ramp up/down rate of total generation system, minimum up/down time and GFRQ(Governor Free Response Quantity), are very important. this paper analyzes Optimal Fuel-Mix for 2022 Korea generation system satisfying these constraints of each fuel type and considering pump storage plants, construction cost and $CO_2$ emission charge Using MILP(Mixed Integer Linear Programming) method. Also the sensitivity analysis which follows in future power industry environmental change accomplished.

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 Integrated Production-Inventory Model Under Quantity Discount (수량할인하(數量割引下)의 통합생산재고(統合生産在庫)모델에 관(關)한 연구(硏究))

  • Han, Yeong-Seop;Lee, Sang-Yong
    • Journal of Korean Society for Quality Management
    • /
    • v.16 no.1
    • /
    • pp.78-87
    • /
    • 1988
  • The purpose of this study is to develop the algorithm applicable to the integrated production inventory model under quantity discount. To achieve this purpose, the integrated production inventory model which unifies the inventory problem of raw materials and the finished product for a single product manufacturing system is considered. The product is manufactured in batches and the raw materials are obtained from outside suppliers but some of the raw materials are discounted according to the purchasing quantity. The intergrated production inventory problem considered in this study is formulated by the non-linear mixed integer programming model, and the optimal solution is obtained by using the algorithm developed by Goyal. Then, the algorithm developed by this study is applied to the quantity discount problem, and the optimal solution is revised by this results. The quantity discount algorithm of the integrated production inventory model developed by this study gives a systematic procedure to obtain the optimum policy to minimize the total cost in any case. The numerical example involving 20 raw materials and 5 raw materials among them are discounted according to the purchasing quantity is given to verify the mathematical model and the algorithm developed in this study.

  • PDF

A Study on the Application of Asynchronous Team Theory for QVC and Security Assessment in a Power System (전력계통의 무효전력 제어 및 안전도 평가를 위한 Asynchronous Team 이론의 적용에 관한 연구)

  • 김두현;김상철
    • Journal of the Korean Society of Safety
    • /
    • v.12 no.3
    • /
    • pp.67-75
    • /
    • 1997
  • This paper presents a study on the application of Asynchronous Team(A-Team) theory for QVC(Reactive power control) and security assessment in a power system. Reactive power control problem is the one of optimally establishing voltage level given reactive power sources, which is very important problem to supply the demand without interruption and needs methods to alleviate a bus voltage limit violation more quickly. It can be formulated as a mixed-integer linear programming(MILP) problem without deteriorating of solution accuracy to a certain extent. The security assessment is to estimate the relative robustness of the system and deterministic approach based on AC load flow calculations is adopted to assess it, especially voltage security. A distance measure, as a measurement for voltage security, is introduced. In order to analyze the above two problem, reactive power control and static security assessment, In an integrated fashion, a new organizational structure, called an A-team, is adopted. An A-team is well-suited to the development of computer-based, multi-agent systems for operation of large-scaled power systems. In order to verify the usefulness of the suggested scheme herein, modified IEEE 30 bus system is employed as a sample system. The results of a case study are also presented.

  • PDF

Development of PC-based PVC scheduling system connected with ERP system

  • Kang, Min-Gu;Kang, Soo-Kil;Lee, Ho-Kyung;Park, Sun-Won
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2004.08a
    • /
    • pp.945-949
    • /
    • 2004
  • These days there are so many scheduling systems or softwares. But only few scheduling systems have succeeded in the market. In spite of powerful engine and functions, those systems have difficulties to be applied in real processes. In real processes, there are various constraints caused by physical or systematical environments of plants. Those constraints are too many to be handled in the system. This problem makes it difficult for the system to represent the details of processes. In order to resolve this problem, we have developed a specialized scheduling system for a target process. The system could be developed by the experts for target process and researchers for scheduling. In this study, a scheduling system for PVC process has been developed as an MILP (Mixed integer linear programming) model and coded in $Fortran^{TM}$. The scheduling system has been applied to two processes, which have different characteristics. Simulation results indicate that the profit of the target process can be increased by about 5% by implementing the scheduling system.

  • PDF

Chance-constrained Scheduling of Variable Generation and Energy Storage in a Multi-Timescale Framework

  • Tan, Wen-Shan;Abdullah, Md Pauzi;Shaaban, Mohamed
    • Journal of Electrical Engineering and Technology
    • /
    • v.12 no.5
    • /
    • pp.1709-1718
    • /
    • 2017
  • This paper presents a hybrid stochastic deterministic multi-timescale scheduling (SDMS) approach for generation scheduling of a power grid. SDMS considers flexible resource options including conventional generation flexibility in a chance-constrained day-ahead scheduling optimization (DASO). The prime objective of the DASO is the minimization of the daily production cost in power systems with high penetration scenarios of variable generation. Furthermore, energy storage is scheduled in an hourly-ahead deterministic real-time scheduling optimization (RTSO). DASO simulation results are used as the base starting-point values in the hour-ahead online rolling RTSO with a 15-minute time interval. RTSO considers energy storage as another source of grid flexibility, to balance out the deviation between predicted and actual net load demand values. Numerical simulations, on the IEEE RTS test system with high wind penetration levels, indicate the effectiveness of the proposed SDMS framework for managing the grid flexibility to meet the net load demand, in both day-ahead and real-time timescales. Results also highlight the adequacy of the framework to adjust the scheduling, in real-time, to cope with large prediction errors of wind forecasting.

Efficient Logical Topology Design Considering Multiperiod Traffic in IP-over-WDM Networks

  • Li, Bingbing;Kim, Young-Chon
    • Journal of the Optical Society of Korea
    • /
    • v.19 no.1
    • /
    • pp.13-21
    • /
    • 2015
  • In recent years energy consumption has become a main concern for network development, due to the exponential increase of network traffic. Potential energy savings can be obtained from a load-adaptive scheme, in which a day can be divided into multiple time periods according to the variation of daily traffic patterns. The energy consumption of the network can be reduced by selectively turning off network components during the time periods with light traffic. However, the time segmentation of daily traffic patterns affects the energy savings when designing multiperiod logical topology in optical wavelength routed networks. In addition, turning network components on or off may increase the overhead of logical topology reconfiguration (LTR). In this paper, we propose two mixed integer linear programming (MILP) models to design the optimal logical topology for multiple periods in IP-over-WDM networks. First, we formulate the time-segmentation problem as an MILP model to optimally determine the boundaries for each period, with the objective to minimize total network energy consumption. Second, another MILP formulation is proposed to minimize both the overall power consumption (PC) and the reconfiguration overhead (RO). The proposed models are evaluated and compared to conventional schemes, in view of PC and RO, through case studies.

Signal Optimization Model Considering Traffic Flows in General Traffic Networks (일반적인 네트워크에서의 신호최적화모형 개발 연구)

  • 신언교;김영찬
    • Journal of Korean Society of Transportation
    • /
    • v.17 no.2
    • /
    • pp.127-135
    • /
    • 1999
  • Most existing progression bandwidth models maximize the single or multi weighted sum of bandwidths in the both directions to improve traffic mobility on an arterial, but they cannot be applied to general networks. Even though a few models formulating a looped network problem cannot be applied to networks have not loops. Also they have some defects in optimizing phase sequences. Therefore, the objective of this study is to develope a mathematical formulation of the synchronization problem for a general traffic network. The goal is achieved successfully by introducing the signal phasing for each movement and expanding the mixed integer linear programming of MAXBAND. The experiments indicate that the proposed model can formulate the general traffic network problem mere efficiently than any other model. In conclusion, this model may optimize signal time to smooth progression in the general networks.

  • PDF