• Journal of the Korean Operations Research and Management Science Society
• /
• v.15 no.2
• /
• pp.97-104
• /
• 1990

The problem is a variation of the weighted set-covering problem (SCP) which requires the minimum-cost cover to be self-covering. It is shown that direct extension of the well-known greedy heuristic for SCP can have an arbitrarily large error in the worst case. It remains an open question whther these exists a greedy heuristic with a finite error bound.

• The Pure and Applied Mathematics
• /
• v.3 no.1
• /
• pp.73-81
• /
• 1996

Multiple objective programming has been a popular research area since 1970. The pervasiveness of multiple objective in decision problems have led to explosive growth during the 1980's. Several approaches (interactive methods, feasible direction methods, criterion weight space methods, Lagrange multiplies methods, etc) have been developed for solving decision problems having multiple objectives. However there are still many mathematically challengings including multiple objective integer, nonlinear optimization problems which require further mathematically oriented research. (omitted)

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.22 no.49
• /
• pp.59-65
• /
• 1999

This paper considers the cell formation in a manufacturing environment where the setup times and costs are significantly dependent on the sequence. The trade-off between saving on the setup costs and additional investment on new machines is considered for determining the economic number of cells. Accordingly, This paper develops a mixed integer program and mentions a variety of manufacturing situations where this model can be useful. This paper also includes an illustrative example.

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

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.61 no.4
• /
• pp.522-533
• /
• 2012

This paper presents an adaptive strategy of GENCOs for reducing the greenhouse gas by fuel mix change. Fuel mix stands for generation capacity portfolio composed of different fuel resources. Currently, the generation sector of power industry in Korea is heavily dependent on fossil fuels, therefore it is required to change the fuel mix gradually into more eco-friendly way based on renewable energies. The generation costs of renewable energies are still expensive compared to fossil fueled resources. This is why the adaptive change is more preferred at current stage and this paper proposes an optimal strategy for capacity planning based on multiple environmental scenarios on the time horizon. This study used the computer program tool named GATE-PRO (Generation And Transmission Expansion PROgram), which is a mixed-integer non-linear program developed by Hongik university and Korea Energy Economics Institute. The simulations have been carried out with the priority allocation method in the program to determine the optimal mix of NRE(New Renewable Energy). Through this process, the result proposes an economic fuel mix under emission constraints compatible with the greenhouse gas mitigation policy of the United Nations.

• Journal of Korean Institute of Industrial Engineers
• /
• v.41 no.3
• /
• pp.296-304
• /
• 2015

Vessel Traffic Service (VTS) is the service that provides ships navigating on a sea transportation route with guidance and advice about geographical environment and other attentive information for their safety. In this study we point out that currently, constructing additional VTSs is required to prevent ships from unexpected accident on their navigation. We first select several candidate locations for constructing VTSs, based on the amount of marine transportation and its potential development possibility. Then, we present an optimization model in which the maximum area coverage is achieved by determining new locations of VTS subject to budget limitation. The problem can be modeled as a binary integer program and it provides an optimal solution for new VTS locations to be constructed under the consideration of the currently located VTSs in Korea.

• Journal of Electrical Engineering and Technology
• /
• v.8 no.6
• /
• pp.1251-1260
• /
• 2013

This paper presents the optimal scheduling of hourly consumption in a residential community (community, neighborhood, etc.) based on real-time electricity price. The residential community encompasses individual residential loads, communal (shared) loads, and local generation. Community-aggregated loads, which include residential and communal loads, are modeled as fixed, adjustable, shiftable, and storage loads. The objective of the optimal load scheduling problem is to minimize the community-aggregated electricity payment considering the convenience of individual residents and hourly community load characteristics. Limitations are included on the hourly utility load (defined as community-aggregated load minus the local generation) that is imported from the utility grid. Lagrangian relaxation (LR) is applied to decouple the utility constraint and provide tractable subproblems. The decomposed subproblems are formulated as mixed-integer programming (MIP) problems. The proposed model would be used by community master controllers to optimize the utility load schedule and minimize the community-aggregated electricity payment. Illustrative optimal load scheduling examples of a single resident as well as an aggregated community including 200 residents are presented to show the efficiency of the proposed method based on real-time electricity price.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.6
• /
• pp.465-470
• /
• 2013

In this paper, we introduce a modulation code design problem where best selection of two-dimensional codewords are determined to reduce two-dimensional (2D) Intersymbol Interference (ISI) and Interpage Interference (IPI), while when these codewords are randomly arranged on the storage, isolated pixel cannot be formed. Codeword selection problem and isolated pixel detection problem are formulated as integer program models and we develop a cutting plane algorithm where a valid cut is generated to remove current feasible solution to avoid isolated pixel by solving the isolated pixel detection subproblem. Using the proposed method, $4{\times}2$ 6/8 codewords with non-isolated pixel are found.

• Journal of Korean Institute of Industrial Engineers
• /
• v.34 no.3
• /
• pp.362-372
• /
• 2008

Manufacturers, or vendors, and their customers continue to adopt vendor-managed inventory(VMI) program to improve supply chain performance through collaboration achieved by consolidating replenishment responsibility upstream with vendors. In this paper, we construct a mixed integer linear programming model and propose a genetic algorithm for the integrated inventory and routing problems with lost sales maximizing the total profit in the VMI supply chains which comprise of a single manufacturer and multi-retailer. The proposed GA is compared with the mathematical model on the various sized test problems with respect to the solution quality and computation time. As a result, the GA demonstrates the capability of reaching solutions that are very close to those obtained by the mathematical model for small problems and stay within 3.2% from those obtained by the mathematical model for larger problems, with a much shorter computation time. Finally, we investigate the effects of the cost and operation variables on the total profit of the problem as well as the GA performance through the sensitivity analyses.

• Journal of Sensor Science and Technology
• /
• v.26 no.4
• /
• pp.274-279
• /
• 2017

LCD(Liquid Crystal Display) panel cutting problem is a sort of two dimensional cutting stock problem. A cutting stock problem is problem that it minimizes the loss of the stock when a stock is cut into various parts. In the most research of the two dimensional cutting stock problem, it is supposed that the relative angle of a stock and parts is not important. Usually the angle is regarded as horizontal or perpendicular. In the manufacturing of polarizing film of LCD, the relative angle should be maintained at some specific angle because of the physical and/or chemical characteristics of raw material. We propose a mathematical model for solving this problem, a two-dimensional non-Guillotine cutting stock problem that is restricted by an arranged angle. Some example problems are solved by the C++ program using ILOG CPLEX classes. We could get the verification and validation of the suggested model based on the solutions.