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

• KIEE International Transactions on Power Engineering
• /
• v.5A no.4
• /
• pp.311-321
• /
• 2005

A competitive generating company (GENCO) could maximize its payoff by optimizing its generation assets. This paper considers the GENCO's arbitrage problem using price-based unit commitment (PBUC). The GENCO could consider arbitrage opportunities in purchases from qualifying facilities (QFs) as well as simultaneous trades with spots markets for energy, ancillary services, emission, and fuel. Given forecasted hourly market prices for each market, the GENCO's generating asset arbitrage problem is formulated as a mixed integer program (MIP) and solved by a branch-and-cut algorithm. A GENCO with 54 thermal and 12 combined-cycle units is considered for analyzing the proposed formulation. The proposed case studies illustrate the significance of simultaneous arbitrage by applying PBUC to multi-commodity markets.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.26 no.6
• /
• pp.115-123
• /
• 1989

This paper describes a new method of mask compaction to formulate a mixed integer linear programming problem from a user defined stick diagram. By solving this mixed integer program, a compacted and design rule violation free layout is obtained. Also, a new efficient algorithm is given which solves the longest problem in the constraint graph.

• Management Science and Financial Engineering
• /
• v.11 no.1
• /
• pp.63-78
• /
• 2005

Disassembly scheduling is the problem of determining the ordering and disassembly schedules of used or end-of-life products while satisfying the demand of their parts or components over a certain planning horizon. This paper considers the case of the assembly product structure for the cost-based objective of minimizing the sum of purchase, setup, inventory holding, and disassembly operation costs. To represent and solve the problem optimally, this paper presents an integer programming model, which is a reversed form of the multi-level lot sizing formulation. Computational experiments on an example derived from the literature and a number of randomly generated test problems are done and the results are reported.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.11 no.1
• /
• pp.18-25
• /
• 2018

In this paper, we present a low-power implementation of the multi-channel hearing aid system using a general-purpose DSP chip. The system includes an acoustic amplification algorithm based on Wide Dynamic Range Compression (WDRC), an adaptive howling canceller, and a single-channel noise reduction algorithm. To achieve a low-power implementation, each algorithm is re-constructed in forms of integer program, and the integer program is converted to the assembly program using BelaSigna(R) 250 instructions. Through experiments using the implementation system, the performance of each processing algorithm was confirmed in real-time. Also, the clock of the implementation system was measured, and it was confirmed that the entire signal processing blocks can be performed in real time at about 7.02MHz system clock.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.21 no.48
• /
• pp.299-310
• /
• 1998

Actually mixed assembly line is mixed with open and close type workstation. This workstation is called hybridworkstation. The propose of this paper is to determine the sequencing of model that minimize line length for actual(hybridworkstation) mixed model assembly line. we developed three mathematical formulation of the problem to minimize the overall length of a line with hybrid station. Mathematical formulation classified model by operato schedule. Mixed model assembly line is combination program and NP-hard program. Thus computation time is often a critical factor in choosing a method of determining the sequence. This study suggests a tabu search technique which can provide a near optimal solution in real time and use the hill climbing heuristic method for selecting initial solution. Modified tabu search method is compared with MIP(Mixed Integer Program). Numerical results are reported to demonstrate the efficiency of the method.

• Proceedings of the KSR Conference
• /
• 2011.10a
• /
• pp.1246-1250
• /
• 2011

This paper considers the container storage problem determining storage position of inbound containers in a container yard at a rail freight terminal. The objective of the problem is to minimize the total number of rehandles when storing/retrieving containers onto/from stacks in the yard. Rehandle implies the temporary removal from and placement back onto the stack to retrieval a target container. In order to solve the problem, we formulate the problem as a binary integer program.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.13 no.2
• /
• pp.34-46
• /
• 1988

This paper deals with design problem of unit load automated storage/retrieval systems (AS/RS). We propose an optimal design model in which the investment and maintenance costs of AS/RS, operating under dual command model is minimized over a time horizon satisfying the warehouse dimensional constraints. The model is formulated as an integer nonlinear program and an algorithm is proposed to find an optimum solution. The valididty of the solution algorithm is illustrated through an example.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.20 no.1
• /
• pp.101-113
• /
• 1995

The past three decades have witnessed a tremendous growth is the literature on location proble. A mathematical formulation of uncapacitated plant location problem and the k-median as an integer program has proven very fruitful in the derivation of solution methods. Most of the successful algorithms for the problem are based on so-called "strong" linear programming relaxation. This is due to the fact that the strong linear programming relaxation provides a tight lower bound. In this paper we investigate the phenomenon with a structural analysis of the problem.e problem.

• Proceedings of the IEEK Conference
• /
• 2008.06a
• /
• pp.771-772
• /
• 2008

In this paper, we analyze the characterization of Mibench, an embedded system benchmark program, using simplescalar simulator. The experimental results show Mibench generally is formed by lots of integer and memory access instructions. Especially, IPC of rijndael decoding is effected by cache size largely, but IPC of CRC32 is few effected by cache size or branch predicting algorithm.