• Journal of the Korean Operations Research and Management Science Society
• /
• v.3 no.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.

• 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.

• Korean Management Science Review
• /
• v.32 no.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.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.62 no.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).

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2001.10a
• /
• 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.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.38 no.5
• /
• pp.427-436
• /
• 2010

This paper deals with a task assignment problem of multiple UAVs performing multiple tasks on multiple targets. The task assignment problem of multiple UAVs is a kind of combinatorial optimization problems such as traveling salesman problem or vehicle routing problem, and it has NP-hard computational complexity. Therefore, computation time increases as the size of considered problem increases. To solve the problem efficiently, approximation methods or heuristic methods are widely used. In this study, the problem is formulated as a mixed integer linear program, and is solved by a mixed integer linear programming and a genetic algorithm, respectively. Numerical simulations for the environment of the multiple targets, multiple tasks, and obstacles were performed to analyze the optimality and efficiency of each method.

• Journal of Electrical Engineering and Technology
• /
• v.11 no.5
• /
• pp.1063-1069
• /
• 2016

• Journal of the Korean Institute of Intelligent Systems
• /
• v.15 no.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.

• 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.

• Journal of the Korean Society for Aviation and Aeronautics
• /
• v.23 no.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.