• Title/Summary/Keyword: Mixed Integer Programming Model

Search Result 231, Processing Time 0.025 seconds

Stochastic Weapon Target Assignment Problem under Uncertainty in Targeting Accuracy (명중률의 불확실성을 고려한 추계학적 무장-표적 할당 문제)

  • Lee, Jinho;Shin, Myoungin
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.41 no.3
    • /
    • pp.23-36
    • /
    • 2016
  • We consider a model that minimizes the total cost incurred by assigning available weapons to existing targets in order to reduce enemy threats, which is called the weapon target assignment problem (WTAP). This study addresses the stochastic versions of WTAP, in which data, such as the probability of destroying a target, are given randomly (i.e., data are identified with certain probability distributions). For each type of random data or parameter, we provide a stochastic optimization model on the basis of the expected value or scenario enumeration. In particular, when the probabilities of destroying targets depending on weapons are stochastic, we present a stochastic programming formulation with a simple recourse. We show that the stochastic model can be transformed into a deterministic equivalent mixed integer programming model under a certain discrete probability distribution of randomness. We solve the stochastic model to obtain an optimal solution via the mixed integer programming model and compare this solution with that of the deterministic model.

A Mixed-Integer Programming Model to Draw the Concordance Level and the Kernel Set for the Implementation of ELECTRE IS (ELECTRE IS의 구현 시 일치판정 기준비율 도출과 핵심대안 선정을 위한 혼합정수계획 모형)

  • Park, Seokyoung;Kim, Jaehee;Kim, Sheung-Kown
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.31 no.4
    • /
    • pp.265-276
    • /
    • 2005
  • ELECTRE IS requires the decision maker (DM) to specify several parameters such as weights, pseudo-criteria thresholds and the concordance level. Among these parameters, the concordance level has a significant effect on the outranking relation. And the number of alternatives selected may be sensitive to the value of these parameters. Therefore the DM may have to perform many iterations to obtain the desired number of alternatives in the kernel set. In this study, we developed a mixed-integer programming (MIP) model to elicit the concordance level and thereby to choose the desired number of alternatives in the kernel set. The MIP model can be applied in the interactive process so that the pseudo-criteria thresholds are adjusted according to the results of MIP model. Using the MIP model in the interactive process, we can reduce the number of iterations needed to perform ELECTRE IS.

Distribution-Location Problem with Physical Distribution Service (물류서비스를 고려한 수송-배치문제에 관한 연구)

  • 강인선;윤덕균
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.14 no.23
    • /
    • pp.1-6
    • /
    • 1991
  • The physical distribution service(PDS) is essential to evaluate the business logistics system. The PDS combines the inventory service with the lead time to deliver. This paper is presented to model Mixed Zero-One integer programming which is to determine distribution center location and to allocation products, considering delivery lead time, from given candidate locations to given customer markets. A numerical example is given to demonstrate the applicability of Mixed Zero-One integer programming for Distribution-Location problem.

  • PDF

Design of Mixed Integer Linear Programming Model for Strategic Location Decision -Focused on the Automotive Industry SCM- (혼합정수 계획법을 이용한 전략적 입지선정 -자동차 SCM을 중심으로-)

  • Young-Kyou HA;Su-Han Woo
    • Korea Trade Review
    • /
    • v.46 no.2
    • /
    • pp.213-228
    • /
    • 2021
  • In recent year, US government requires local investment ,unlike in the past, when import restrictions and tariff were imposed. In this situation, many companies are considering new investment in the US and entering the local market. However, research on the optimal investment plan along with the case analysis on trade regulation is extremely limited and more research needs to be conducted. Accordingly, this study aims to suggest the implications and countermeasure of the SCM and logistical perspective by studying the optimal measures for the new investment of each company due to trade regulation. As a research method, the gravity location model, Mixed Integer Linear Programming Model were used to select the optimal automobile manufacturing factory considering each state's population. This study will be implication of SCM and logistics perspective not only for companies considering new investment in the US but also for the government to conduct trade negotiations. In the future, it is expected that the US trade pressure will increase and affect Korea in many ways. Therefore, in order to cope with such difficult situation in a timely manner, continuous research considering various possibilities is needed in the future.

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.

Considering Claim Costs in Project Time-Cost Mixed Integer Programming Model (클레임코스트를 고려한 프로젝트의 시간-비용 혼합정수계획모형)

  • Kim, Jong-Yul;Kang, Chang-Wook;Hwang, In-Keuk
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.34 no.3
    • /
    • pp.97-105
    • /
    • 2011
  • Previous researches have focused on the efficiency of project execution and the satisfaction of internal customers In view of the fact that a project is successful if any defects are not found in the short-term performance test of the project final outcome. To execute a project that both internal customer and external customer are satisfied in terms of longer-term benefit perspective, the project claim costs (PCC) which may occur for the warranty period of the project final outcome should be considered. We propose a model included PCC to the linear programming between time and cost to expedite a project and perform the validity test by applying the model to an example project. This model and related procedure will contribute to overall project activities' cost reduction by taking preventive actions for PCC.

Optimizing delivery routing problem for logistics companies based on Integer Linear Programming method

  • Cao, Ngoc-Anh;Phan, Thanh-Hang;Chinh, Nguyen Thi;Tran, Duc-Quynh;Nguyen, Ha-Nam;Trang, Ngo-Thi-Thu;Choi, Gyoo-Seok
    • International Journal of Internet, Broadcasting and Communication
    • /
    • v.14 no.4
    • /
    • pp.212-221
    • /
    • 2022
  • Currently, issues related to freight at Vietnamese logistics companies are becoming more and more urgent because of typical problems in Vietnam such as traffic, infrastructure, and application of information technology. This problem has been studied by applying many different approaches such as Integer Programming (LP), Mixed Integer Programming (MIP), hybrid, meta search, … In this paper, we applied the ILP model in order to deal with the VRP problem in a small size logistics company which is very popular in Vietnam. The experiments showed promising results with some optimal solutions with some small extra costs.

Optimum Operational Schedule for Cogeneration Systems using the Mixed Integer Programming (혼합정수계획법에 의한 열병합발전설비의 최적운용)

  • 차재상
    • Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
    • /
    • v.16 no.5
    • /
    • pp.75-82
    • /
    • 2002
  • This paper propose a new mathematical modelling method about optimum operational schedule for cogeneration systems. Proposed algorithm solving the energy product cost function in this paper is very similar to the real model that is, proposed algorithm solve nonlinear type of real model using mixed integer programming based on the piecewise linear function while the conventional algorithms used before could not solve that kind of problems. The effectiveness of the proposed method is ascertained by the simulation results with varius case studies which are similar to real operation circumstances.

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

  • Cho, Geonyoung;Lim, Heejong
    • International Journal of Highway Engineering
    • /
    • v.19 no.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.

Mixed-Integer programming model for scheduling of steelmaking processes (철강 공정의 일정계획을 위한 혼합정수계획 모델)

  • Bok, Jin-Gwang;Lee, Dong-Yeop;Park, Seon-Won
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.5 no.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