• Title/Summary/Keyword: Mixed Integer and Linear Programming (MILP)

Search Result 59, Processing Time 0.021 seconds

Optimal Weapon-Target Assignment of Multiple Dissimilar Closed-In Weapon Systems Using Mixed Integer Linear Programming (혼합정수선형계획법을 이용한 다수 이종 근접 방어 시스템의 최적 무장 할당)

  • Roh, Heekun;Oh, Young-Jae;Tahk, Min-Jea;Jung, Young-Ran
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.47 no.11
    • /
    • pp.787-794
    • /
    • 2019
  • In this paper, a Mixed Integer Linear Programming(MILP) approach for solving optimal Weapon-Target Assignment(WTA) problem of multiple dissimilar Closed-In Weapon Systems (CIWS) is proposed. Generally, WTA problems are formulated in nonlinear mixed integer optimization form, which often requires impractical exhaustive search to optimize. However, transforming the problem into a structured MILP problem enables global optimization with an acceptable computational load. The problem of interest considers defense against several threats approaching the asset from various directions, with different time of arrival. Moreover, we consider multiple dissimilar CIWSs defending the asset. We derive a MILP form of the given nonlinear WTA problem. The formulated MILP problem is implemented with a commercial optimizer, and the optimization result is proposed.

On-Chip Crossbar Network Topology Synthesis using Mixed Integer Linear Programming (Mixed Integer Linear Programming을 이용한 온칩 크로스바 네트워크 토폴로지 합성)

  • Jun, Minje;Chung, Eui-Young
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.50 no.1
    • /
    • pp.166-173
    • /
    • 2013
  • As the number of IPs and the communication volume among them have constantly increased, on-chip crossbar network is now the most widely-used on-chip communication backbone of contemporary SoCs. The on-chip crossbar network consists of multiple crossbars and the connections among the IPs and the crossbars. As the complexity of SoCs increases, it has also become more and more complex to determine the topology of the crossbar network. To tackle this problem, this paper proposes an on-chip crossbar network topology method for application-specific systems. The proposed method uses mixed integer linear programming to solve the topology synthesis problem, thus the global optimality is guaranteed. Unlike the previous MILP-based methods which represent the topology with adjacency matrixes of IPs and crossbar switches, the proposed method uses the communication edges among IPs as the basic element of the representation. The experimental results show that the proposed MILP formulation outperforms the previous one by improving the synthesis speed by 77.1 times on average, for 4 realistic benchmarks.

MILP MODELLING FOR TIME OPTIMAL GUIDANCE TO A MOVING TARGET

  • BORZABADI AKBAR H.;MEHNE HAMED H.
    • Journal of applied mathematics & informatics
    • /
    • v.20 no.1_2
    • /
    • pp.293-303
    • /
    • 2006
  • This paper describes a numerical scheme for optimal control of a time-dependent linear system to a moving final state. Discretization of the corresponding differential equations gives rise to a linear algebraic system. Defining some binary variables, we approximate the original problem by a mixed integer linear programming (MILP) problem. Numerical examples show that the resulting method is highly efficient.

Voltage Control and Security Assessment of Power System Using Mixed Integer Linear Programming (혼합정수 선형계획법을 이용한 계통의 전압제어 및 안전도 평가)

  • 김두현;김상철
    • Journal of the Korean Society of Safety
    • /
    • v.14 no.2
    • /
    • pp.70-76
    • /
    • 1999
  • In this paper, a mixed-integer programming approach is presented for adjusting the voltage profiles in a power system. The advent of large-scaled system makes the reactive power and voltage problem-an attempt to achieve an overall improvement of system security, service quality and economy-more complex and seriously, Although the problem is originally a nonlinear optimization problem, it can be formulated as a mixed integer linear programming(MILP) problem without deteriorating of solution accuracy to a certain extent. The MILP code is developed by the branch and bound process search for the optimal solution. The variable for modeling transformer tap positions is handled as discrete one, and other variables continuous ones. Numerical data resulting from case study using a modified IEEE 30 bus system with outaged line show that the MILP can produce more reductions of magnitude in the operating cost. The convergence characteristics of the results are also presented and discussed.

  • PDF

Daily Unit Commitment Scheduling of Power System with Energy Storage System (전력저장장치를 고려한 일간 최적 기동정지계획 수립연구)

  • Song, Ha-Na;Jang, Se-Hwan;Kim, Hyeong-Jung;Roh, Jae-Hyung;Park, Jong-Bae
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.60 no.4
    • /
    • pp.717-725
    • /
    • 2011
  • In the power system with an electric storage system that can increase utilization rate of the source of such new renewable energy, this paper introduces the approach on the daily unit commitment scheduling that determines simultaneously optimum operational condition and output of thermal generators and electric storage device. The unit commitment is one of the most important issues in economic operation and security of short-term operational plan of the power system. It is to determine on/off status of generator to minimize operational cost during the given period. The committed generator should satisfy various operational limitation such as estimated demand by system, spinning reserve condition within minimum operational cost. In order to determine on/off or charge/discharge/idle condition and output level of units and electric storage system, the MILP(Mixed Integer Linear Programming) is suggested. The proposed approach is the mixed method between LP(Linear Programming) and IP(integer programming) which seeks the value of real number and integer that maximize or minimize function objective within given condition. The daily unit commitment problem with the electric storage system is applied to MILP algorithm through linearization and formulation process. The proposed approach is applied to the test system.

An MILP Approach to a Nonlinear Pattern Classification of Data (혼합정수 선형계획법 기반의 비선형 패턴 분류 기법)

  • Kim, Kwangsoo;Ryoo, Hong Seo
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.32 no.2
    • /
    • pp.74-81
    • /
    • 2006
  • In this paper, we deal with the separation of data by concurrently determined, piecewise nonlinear discriminant functions. Toward the end, we develop a new $l_1$-distance norm error metric and cast the problem as a mixed 0-1 integer and linear programming (MILP) model. Given a finite number of discriminant functions as an input, the proposed model considers the synergy as well as the individual role of the functions involved and implements a simplest nonlinear decision surface that best separates the data on hand. Hence, exploiting powerful MILP solvers, the model efficiently analyzes any given data set for its piecewise nonlinear separability. The classification of four sets of artificial data demonstrates the aforementioned strength of the proposed model. Classification results on five machine learning benchmark databases prove that the data separation via the proposed MILP model is an effective supervised learning methodology that compares quite favorably to well-established learning methodologies.

A Production Schedule for Load Leveling in a Block Assembly Shop (블록조립공장의 부하평준화를 위한 생산일정계획)

  • Lee, Jae-Dong;Hong, Yu-Shin
    • IE interfaces
    • /
    • v.7 no.2
    • /
    • pp.75-85
    • /
    • 1994
  • This paper presents a production scheduling model in a block assembly shop in shipbuilding industry. In a block assembly shop, the most important performance criterion is load leveling, which balances manpower and work area utilization through the planning horizon. The problem is formulated as a mixed-integer nonlinear programming(MINLP) problem of which objective function is to optimize load leveling. The developed MINLP problem can not be solvable due to computational complexity. The MINLP problem is decomposed into two stage mixed-integer linear programming (MILP) problems to obtain a good solution, but the decomposed MILP problems are still computationally intractable because of combinatorial complexity. Therfore, a heuristic method using linear programming is proposed to solve two stage MILP problems sequentially. The proposed heuristic generates a good production schedule within a reasonable computation time, and it is easily applicable for establishing the production schedule in a block assembly shop in shipbuilding industry.

  • PDF

An Optimization Model for O&M Planning of Floating Offshore Wind Farm using Mixed Integer Linear Programming

  • Sang, Min-Gyu;Lee, Nam-Kyoung;Shin, Yong-Hyuk;Lee, Chulung;Oh, Young-Jin
    • Journal of the Korea Society of Computer and Information
    • /
    • v.26 no.12
    • /
    • pp.255-264
    • /
    • 2021
  • In this paper, we propose operations and maintenance (O&M) planning approach for floating offshore wind farm using the mathematical optimization. To be specific, we present a MILP (Mixed Integer Linear Programming that suggests the composition of vessels, technicians, and maintenance works on a weekly basis. We reflect accessibility to wind turbines based on weather data and loss of power generation using the Jensen wake model to identify downtime cost that vary from time to time. This paper also includes a description of two-stage approach for maintenance planning & detailed scheduling and numeric analysis of the number of vessels and technicians on the O&M cost. Finally, the MILP model could be utilized in order to establish the suitable and effective maintenance planning reflecting domestic situation.

Minimization of Trim Loss Problem in Paper Mill Scheduling Using MINLP (MINLP를 이용한 제지 공정의 파지 손실 최소화)

  • Na, Sung-hoon;Ko, Dae-Ho;Moon, Il
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2000.10a
    • /
    • pp.392-392
    • /
    • 2000
  • This study performs optimization of paper mill scheduling using MINLP(Mixed-Integer Non-Linear Programming) method and 2-step decomposing strategy. Paper mill process is normally composed of five units: paper machine, coater, rewinder, sheet cutter and roll wrapper/ream wrapper. Various kinds of papers are produced through these units. The bottleneck of this process is how to cut product papers efficiently from raw paper reel and this is called trim loss problem or cutting stock problem. As the trim must be burned or recycled through energy consumption, minimizing quantity of the trim is important. To minimize it, the trim loss problem is mathematically formulated in MINLP form of minimizing cutting patterns and trim as well as satisfying customer's elder. The MINLP form of the problem includes bilinearity causing non-linearity and non-convexity. Bilinearity is eliminated by parameterization of one variable and the MINLP form is decomposed to MILP(Mixed-Integer Linear programming) form. And the MILP problem is optimized by means of the optimization package. Thus trim loss problem is efficiently minimized by this 2-step optimization method.

  • PDF

A Mixed-Integer Programming Model for Effective Distribution of Relief Supplies in Disaster (재난 구호품의 효과적 분배를 위한 혼합정수계획 모형)

  • Kim, Heungseob
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.44 no.1
    • /
    • pp.26-36
    • /
    • 2021
  • The topic of this study is the field of humanitarian logistics for disaster response. Many existing studies have revealed that compliance with the golden time in response to a disaster determines the success or failure of relief activities, and logistics costs account for 80% of the disaster response cost. Besides, the agility, responsiveness, and effectiveness of the humanitarian logistics system are emphasized in consideration of the disaster situation's characteristics, such as the urgency of life-saving and rapid environmental changes. In other words, they emphasize the importance of logistics activities in disaster response, which includes the effective and efficient distribution of relief supplies. This study proposes a mathematical model for establishing a transport plan to distribute relief supplies in a disaster situation. To determine vehicles' route and the amount of relief for cities suffering a disaster, it mainly considers the urgency, effectiveness (restoration rate), and uncertainty in the logistics system. The model is initially developed as a mixed-integer nonlinear programming (MINLP) model containing some nonlinear functions and transform into a Mixed-integer linear programming (MILP) model using a logarithmic transformation and piecewise linear approximation method. Furthermore, a minimax problem is suggested to search for breakpoints and slopes to define a piecewise linear function that minimizes the linear approximation error. A numerical experiment is performed to verify the MILP model, and linear approximation error is also analyzed in the experiment.