• Journal of Navigation and Port Research
• /
• v.30 no.6 s.112
• /
• pp.457-464
• /
• 2006

Remarshalling operation is one of the operations considered important in an automated container terminal to perform quickly loading operations and delivery operations. It arranges the containers scattered at a verticla yard block in order to reduce the transfer time and the rehandling time of ATC(Automated Transfer Crane)s. This paper deals with the remarshalling planning problem minimizing the weighted operation time. This problem can be decomposed into 2 subproblems, storage space assignment problem and operation sequencing problem Storage space assignment problem decides to where containers are transported in terms of transportation time cost.. With results of a previous subproblem, operation sequence problem determines the ATC operation sequence, which minimizes the dead-heading of ATC This study formulates each subproblem with mixed integer program and dynamic program. To illustrate the proposed model, we propose an instance to explain the process of remarshalling planning.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.10
• /
• pp.1275-1283
• /
• 1999

본 논문은 CMOS 디지털 회로에서의 전력 소모의 주원인인 신호의 천이중에서 회로의 동작에 직접적인 영향을 미치지 않는 불필요한 신호의 천이인 글리치를 줄이기 위한 효율적인 알고리즘을 제시한다. 제안된 알고리즘은 회로의 지연 증가 없이 게이트 사이징과 버퍼 삽입에 의해 경로 균등(path balancing)을 이룸으로써 글리치를 감소시킨다. 경로 균등화를 위하여 먼저 게이트 사이징을 통해 글리치의 감소와 동시에, 게이트 크기의 최적화를 통해 회로 전체의 캐패시턴스까지 줄일 수 있으며, 게이트 사이징 만으로 경로 균등화가 이루어지지 않을 경우 버퍼 삽입으로 경로 균등화를 이루게 된다. 버퍼 자체에 의한 전력 소모 증가보다 글리치 감소에 의한 전력 감소가 큰 버퍼를 선택하여 삽입한다. 이때 버퍼 삽입에 의한 전력 감소는 다른 버퍼의 삽입 상태에 따라 크게 달라질 수 있어 ILP (Integer Linear Program)를 이용하여 적은 버퍼 삽입으로 전력 감소를 최대화 할 수 있는 저전력 설계 시스템을 구현하였다. 제안된 알고리즘은 LGSynth91 벤치마크 회로에 대한 테스트 결과 회로의 지연 증가 없이 평균적으로 30.4%의 전력 감소를 얻을 수 있었다.Abstract This paper presents an efficient algorithm for reducing glitches caused by spurious transitions in CMOS logic circuits. The proposed algorithm reduces glitches by achieving path balancing through gate sizing and buffer insertion. The gate sizing technique reduces not only glitches but also effective capacitance in the circuit. In the proposed algorithm, the buffers are inserted between the gates where power reduction achieved by glitch reduction is larger than the additional power consumed by the inserted buffers. To determine the location of buffer insertion, ILP (Integer Linear Program) has been employed in the proposed system. The proposed algorithm has been tested on LGSynth91 benchmark circuits. Experimental results show an average of 30.4% power reduction.

• Journal of Korean Society of Transportation
• /
• v.22 no.6
• /
• pp.57-66
• /
• 2004

When we estimate an origin-destination matrix from traffic counts. origin-destination matrix estimation from traffic counts according to the selected optimal traffic counting links is method for improving the results of origin-destinaation matrix estimation and for increasing economic efficiency. This paper proposed model of selecting traffic counting links using integer program technique, and selected a traffic counting links using this model, and estimated and origin-destingtion matrix from traffic counts according to the selected optimal traffic counting links. Also, we compared a result of estimating origin-destination matrix from the selected optimal traffic counting links using this model to a result of estimating origin-destination matrix from the randomly selected traffic counting links. The error analysis result was more improved a result of origin-destination matrix estimation using this model than a result of randomly selected links.

• Journal of Institute of Control, Robotics and Systems
• /
• v.15 no.11
• /
• pp.1137-1143
• /
• 2009

This paper presents the FPGA implementation of efficient algorithms for approximating exponential function based on floating point format data. The Taylor-Maclaurin expansion as a conventional approximation method becomes inefficient since high order expansion is required for the large number to satisfy the approximation error. A format converter is designed to convert fixed data format to floating data format, and then the real number is separated into two fields, an integer field and an exponent field to separately perform mathematic operations. A new assembly command is designed and added to previously developed command set to refer the math table. To test the proposed algorithm, assembly program has been developed. The program is downloaded into the Altera DSP KIT W/STRATIX II EP2S180N Board. Performances of the proposed method are compared with those of the Taylor-Maclaurin expansion.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.58 no.4
• /
• pp.708-717
• /
• 2009

Recently, Korea government decided to introduce RPS (Renewable Portfolio Standard) mechanism which requires electricity providers to gradually increase the amount of renewable energy sources such as wind, solar, bioenergy, and geothermal. As a consequence, it is expected that the long-term fuel mix would be changed to result in more expensive production and the increased production costs would be distributed to the rate payers via electricity tariffs. This paper presents the change in long-term fuel mix in year 2020 with the four RPS scenarios of 3%, 5%, 10% and 20%, and the methodologies for collecting the increased production costs through new tariff schedule. The studies on long-term fuel mix have been carried out with the GATE-PRO (Generation And Transmission Expansion Program) optimization package, a mixed-integer program developed by the Korea Energy Economics Institute and Hongik university. Three methodologies for distributing the production costs to the rate payers have also been demonstrated.

• 전기의세계
• /
• v.23 no.1
• /
• pp.73-78
• /
• 1974

Digital simulation algorithms and program for multimachine dynamic stability have been developed which represent the effects of machines much more complety than have been available previously. Emphasis is given to the savings of the memory spaces required, thus making it possible to use a small computer with limited capacity of core storage (without auxiliary storage). Both d- and q- aris quantities are fully represented, and the speed-governing and voltage-regulating system available are ertensive, thus allowing a very close approximation to any physical system. Facilities for dynamic and nonlinear loads are also included. The computational algorithms and program developed have been shown to be extensive and complete, and are very desirable features minimizing memory spaces for stability calculations. The capabilities have been demonstrated by several case studies for an actual power system of 44 generators, 22 loads and 33 buses. About 13-K words of memory spaces have been required for the case studies on the basis of two words per real variable and a word per integer variable.

• Journal of Korean Institute of Industrial Engineers
• /
• v.23 no.1
• /
• pp.55-76
• /
• 1997

This paper presents a heuristic solution for the three dimensional container loading problem with boxes which are different in size. The container loading problem is formulated as a zero-one mixed integer programming model whose objective is to maximize the container utilization. Due to its problem complexity, we propose a heuristic based on layered loading technique. Also, presented is a way to achieve the weighting balance of the stacked boxes. A micro-computer based program is developed which generates container loading pattern provided by the proposed heuristic. The results are displayed by computer-graphic. To evaluate the performance of the proposed heuristic, computational experiments are performed. The results indicate that in most of the cases the proposed heuristic performs better than an existing heuristic in terms of the container utilization.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.19 no.1
• /
• pp.1-16
• /
• 1994

In this paper, we try to raise the efficiency of PCB production by improving automated inserting process. This process is composed of part inserting sequence and feeder allocation problem. Until now, this problem is formulated by Traveling Salesman Problem (TSP) or Rural Postman Problem. They concerted more on parts(chips) inserting. But in this paper, we concentrate on Feeder. We formulate 0-1 Integer program (MP2) easier than TSP. This program can be solved by using LP Package (i. e. LINDO, GAMS etc). We propose Heuristic algorithm ISFA which guarantees a local optimum and often gives solution. We give some examples to prove ISFA algorithm.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.58 no.3
• /
• pp.467-477
• /
• 2009

Renewable Portfolio Standard (RPS) is a regulatory policy that requires the generation companies to increase the proportion of renewable energy sources such as wind, solar, LFG, fuel cell, and small hydro. Recently, Korean government decided to increase the portion of renewable energy to 3% to total electricity generation by 2012 from the current level of 0.13%. To achieve this goal, an innovative plan for market competitiveness would be required in addition to the present Feed-In-Tariff (FIT). That is Korean government has taken it into consideration to introduce a Renewable Portfolio Standard (RPS) as an alternative to FIT. This paper reviews the impact of RPS on the long-term fuel mix in 2020. The studies have been carried out with the GATE-PRO (Generation And Transmission Expansion PROgram) program, a mixed-integer non-linear program developed by Hongik university and Korea Energy Economics Institute. Detailed studies on long-term fuel mix in Korea have been carried out with four RPS scenarios of 3%, 5%, 10% and 20%. The important findings and comments on the results are given to provide an insight on future regulatory policies.

• Journal of the Korean Data and Information Science Society
• /
• v.25 no.4
• /
• pp.697-703
• /
• 2014

Deal-or-No-Deal game is a famous TV show program of NBC, USA, which is composed of 10 stages at most. At each stage from the first and the ninth, a banker suggests a deal price to participants. In this paper, we intend to reveal the banker's deal price model using a constrained linear model and quadratic program. As results, we provide a linear model in relation to the deal price at each stage and then show using simulation data that the deal price is equal to the nearest integer of the value to be obtained by the provided linear model.