• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.25 no.10
• /
• pp.28-37
• /
• 2011

Though Korea has introduced CBP(Cost Based pool) power trading system since 2001, long-term Generation system planning has been executed by government for Cost minimization every 2 years. Until currently the model which is used for Generation system planning and best-mix only considers cost minimization and total yearly or quarterly electricity demand every year. In a view point of one day power supply operation, technical characteristics, like the ramp up/down rate of total generation system, minimum up/down time and GFRQ(Governor Free Response Quantity), are very important. this paper analyzes Optimal Fuel-Mix for 2022 Korea generation system satisfying these constraints of each fuel type and considering pump storage plants, construction cost and $CO_2$ emission charge Using MILP(Mixed Integer Linear Programming) method. Also the sensitivity analysis which follows in future power industry environmental change accomplished.

• Journal of the Optical Society of Korea
• /
• v.19 no.1
• /
• pp.13-21
• /
• 2015

In recent years energy consumption has become a main concern for network development, due to the exponential increase of network traffic. Potential energy savings can be obtained from a load-adaptive scheme, in which a day can be divided into multiple time periods according to the variation of daily traffic patterns. The energy consumption of the network can be reduced by selectively turning off network components during the time periods with light traffic. However, the time segmentation of daily traffic patterns affects the energy savings when designing multiperiod logical topology in optical wavelength routed networks. In addition, turning network components on or off may increase the overhead of logical topology reconfiguration (LTR). In this paper, we propose two mixed integer linear programming (MILP) models to design the optimal logical topology for multiple periods in IP-over-WDM networks. First, we formulate the time-segmentation problem as an MILP model to optimally determine the boundaries for each period, with the objective to minimize total network energy consumption. Second, another MILP formulation is proposed to minimize both the overall power consumption (PC) and the reconfiguration overhead (RO). The proposed models are evaluated and compared to conventional schemes, in view of PC and RO, through case studies.

• Journal of Korean Society for Quality Management
• /
• v.16 no.1
• /
• pp.78-87
• /
• 1988

The purpose of this study is to develop the algorithm applicable to the integrated production inventory model under quantity discount. To achieve this purpose, the integrated production inventory model which unifies the inventory problem of raw materials and the finished product for a single product manufacturing system is considered. The product is manufactured in batches and the raw materials are obtained from outside suppliers but some of the raw materials are discounted according to the purchasing quantity. The intergrated production inventory problem considered in this study is formulated by the non-linear mixed integer programming model, and the optimal solution is obtained by using the algorithm developed by Goyal. Then, the algorithm developed by this study is applied to the quantity discount problem, and the optimal solution is revised by this results. The quantity discount algorithm of the integrated production inventory model developed by this study gives a systematic procedure to obtain the optimum policy to minimize the total cost in any case. The numerical example involving 20 raw materials and 5 raw materials among them are discounted according to the purchasing quantity is given to verify the mathematical model and the algorithm developed in this study.

• Journal of Korean Institute of Industrial Engineers
• /
• v.33 no.2
• /
• pp.265-272
• /
• 2007

The purpose of Vehicle Routing Problem (VRP) is to design the least costly (distance, time) routes for a fleet of identically capacitated vehicles to serve geographically scattered customers. There may be some restrictions such as the maximal capacity for each vehicle, maximal distance for each vehicle, time window to visit the specific customers, and so forth. This paper is concerned with VRP to minimize the sum of elapsed time from departure, where the elapsed time is defined as the time taken in a moving vehicle from the depot to each customer. It is important to control the time taken from departure in the delivery of perishable products or foods, whose freshness may deteriorate during the delivery time. An integer linear programming formulation is suggested and a heuristic for practical use is constructed. The heuristic is based on the set partitioning problem whose performances are compared with those of ILOG dispatcher. It is shown that the suggested heuristic gave good solutions within a short computation time by computational experiments.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.7
• /
• pp.1416-1427
• /
• 2012

This paper proposes a design technique of a survivable ship backbone network, which describes a near optimal configuration scheme of physical and logical topologies of which the survivable ship backbone network consists. We first analyze and present an efficient architecture of a survivable ship backbone network consisting of redundant links and ship devices with dual communication interfaces. Then, we present an integer linear programming-based configuration scheme of a physical topology with regard to the proposed ship backbone network architecture. Finally, we present a metaheuristic-based configuration scheme of a logical topology, underlying the physical topology.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.06a
• /
• pp.319-321
• /
• 2006

본 논문에서는 다양한 캐리 전달 방식(carry propagation scheme)이 단일 가산기 설계를 위하여 복합적으로 사용되는 가산기 구조물 제안하며. 이를 통하여 보다 향상된 delay-area trade-off 점들을 갖는 설계공간을 생성한다. 제안된 구조의 가산기는 각기 다른 캐리전달 방식의 하부 가산기 블록들을 캐리 입/출력 신호를 선형으로 연결한 구조이며, 기존의 단일 캐리전달 방식의 가산기와 달리, 다양한 delay-area trade-off 특성을 갖는 여러 종류의 캐리전달 방식을 비트 수준에서 조합하여 사용함으로써 보다 섬세한 delay-area 설계공간을 생성해낼 수 있다. 그러나, 제안된 가산기 구조의 설계공간은 다양한 캐리전달 방식이 비트 수준에서 할당되므로, 할당가능한 설계 조합은 설계하고자 하는 가산기의 비트 폭과 고려하는 캐리전달 방식의 수에 비례하여 폭발적으로 증가하게 된다. 따라서, 제안된 가산기의 효율적이며, 자동화된 설계공간 탐색 방범이 요구된다. 본 논문에서는 이를 해결하기 위하여 정수 선형 프로그래밍 (Integer Linear Programming, ILP) 방법을 이용하여 제안한 가산기의 최적화 문제를 형식화함으로써 효과적인 설계공간의 탐색 방법을 제안하였다.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.33 no.4
• /
• pp.63-82
• /
• 2008

The explosively growing attractiveness of the Web is commencing significant demands for a structuring analysis on various web objects. The larger the substantial number of web objects are available, the more difficult for the clients(i.e. common web users and web robots) and the servers(i.e. Web search engine) to retrieve what they really want. We have in mind focusing on the structure of web objects by introducing optimization models for more convenient and effective information retrieval. For this purpose, we represent web objects and hyperlinks as a directed graph from which the optimal structures are derived in terms of rooted directed spanning trees and Top-k trees. Computational experiments are executed for synthetic data as well as for real web sites' domains so that the Lagrangian Relaxation approaches have exploited the Top-k trees and Hop constraint resolutions. In the experiments, our methods outperformed the conventional approaches so that the complex web graph can successfully be converted into optimal-structured ones within a reasonable amount of computation time.

• ETRI Journal
• /
• v.37 no.3
• /
• pp.562-572
• /
• 2015

For a multiprocessor System-on-Chip (MPSoC) to achieve high performance via parallelism, we must consider how to partition a given application into different components and map the components onto multiple processors. In this paper, we propose a software pipeline-based partitioning method with cyclic dependent task management and communication optimization. During task partitioning, simultaneously considering computation load balance and communication optimization can cause interference, which leads to performance loss. To address this issue, we formulate their constraints and apply an integer linear programming approach to find an optimal partitioning result - one that requires a trade-off between these two factors. Experimental results on a reconfigurable MPSoC platform demonstrate the effectiveness of the proposed method, with 20% to 40% performance improvements compared to a traditional software pipeline-based partitioning method.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.8
• /
• pp.2143-2151
• /
• 1997

As inter-wire spacing on a VLSI chip becomes smaller with the evolution of VLSI fabrication technology, coupling capacitance between adjacent wires is increasing rapidly over ground capacitance. Therefore, it becomes necessary to take into account the crosstalk caused mainly by coupling capacitance during the layout design of VLSI systems. This paper deals with layer assignment problem to minimize crosstalk in three layers gridded channel routing. The problem is formulated in 0/1 integer linear programming style. Upper bound for cost function is estimated for the fast termination. Experiment shows the effectiveness of our approach to minimize crosstalk.

• Journal of Korean Institute of Industrial Engineers
• /
• v.42 no.3
• /
• pp.173-181
• /
• 2016

This paper deals with the single-hoist and multiple-products scheduling problem. Although a mixed integer linear programming model for the problem was developed earlier, a branch-and-bound based heuristic algorithm is proposed in this paper to solve the big-size problems in real situation. The algorithm is capable of handling problems incorporating different product types, jobs in the process, and tank capacities. Using a small example problem the procedure of the heuristic algorithm is explained. To assess the performance of the heuristic we generate a bigger example problem and compare the results of the algorithm proposed in this paper with the optimal solutions derived from the mathematical model of earlier research. The comparison shows that the heuristic has very good performance and the computation time is sufficiently short to use the algorithm in real situation.