• The Journal of Information Systems
• /
• v.28 no.1
• /
• pp.133-153
• /
• 2019

Purpose The purpose of this study is to design a regional electricity planning model rather than the existing single region ones and verify its usefulness. The regional electricity planning model is to determine both electricity distribution among regions and power plant planning at the same time satisfying regional demands and distribution networks. Design/methodology/approach This study made a regional electricity planning model by integrating power plant planning and electricity distribution among regions. The regional electricity planning model is formulated into a linear programming problem, and coded and run using the OSeMOSYS, one of open source energy systems. Findings According to the empirical analysis result, this study confirmed that the regional electricity planning model proposed in this study deducts the unfairness among regions in view of electricity and green house gas. In addition, the model is expected to be used in evaluating and developing the national policies concerning fine dust and/or green house gas.

• IE interfaces
• /
• v.16 no.4
• /
• pp.441-449
• /
• 2003

In this paper we propose a distribution planning method aiming the use in the real-life situations. The assumed form of the distribution network is arborescence. At every node in the distribution network, orders are placed periodically. At each renewal of planning horizon, demand informations of periods in the horizon are updated. The objective of the problem is to minimize the total cost, which is the sum of holding and backorder costs of all sites during planning horizon. For such a situation, this study addressed an effective distribution plan when demands for demand-sites are provided for a given planning horizon.

• Proceedings of the KIEE Conference
• /
• 1998.11a
• /
• pp.323-325
• /
• 1998

Distribution planning needs data of present loads, forecasted loads, sub-stations and distribution lines. Besides it needs a computer program for optimal analysis. In Kepco, The CADPAD system had been used for local distribution planning since 1989. Recently, we upgraded the I/O modules so easy to operate. And they can display optimal feeder planning on a real map. This paper is a case study of the West Inchun distribution planning using the CADPAD system. In this paper, not only optimal feeder designs and sub-station plannings, but also comparison and evaluation of various planning cases are suggested from the viewpoint of voltage drop and line losses.

• Journal of the Korea Safety Management & Science
• /
• v.11 no.1
• /
• pp.205-211
• /
• 2009

In reality, distribution planning for a supply chain is established using a certain probabilistic distribution estimated by forecasting. However, in general, the demands used for an actual distribution planning are of deterministic value, a single value for each of periods. Because of this reason the final result of a planning has to be a single value for each period. Unfortunately, it is very difficult to estimate a single value due to the inherent uncertainty in the probabilistic distribution of customer demand. The issue addressed in this paper is the selection of single demand value among of the distributed demand estimations for a period to be used in the distribution planning. This paper proposes an efficient demand selection scheme for minimizing total inventory costs while satisfying target service level under the various experimental conditions.

• Journal of the Korea Safety Management & Science
• /
• v.22 no.4
• /
• pp.65-74
• /
• 2020

Many of companies have made significant improvements for globalization and competitive business environment The supply chain management has received many attentions in the area of that business environment. The purpose of this study is to generate realistic production and distribution planning in the supply chain network. The planning model determines the best schedule using operation sequences and routing to deliver. To solve the problem a hybrid approach involving a genetic algorithm (GA) and computer simulation is proposed. This proposed approach is for: (1) selecting the best machine for each operation, (2) deciding the sequence of operation to product and route to deliver, and (3) minimizing the completion time for each order. This study developed mathematical model for production, distribution, production-distribution and proposed GA-Simulation solution procedure. The results of computational experiments for a simple example of the supply chain network are given and discussed to validate the proposed approach. It has been shown that the hybrid approach is powerful for complex production and distribution planning in the manufacturing supply chain network. The proposed approach can be used to generate realistic production and distribution planning considering stochastic natures in the actual supply chain and support decision making for companies.

• IE interfaces
• /
• v.16 no.3
• /
• pp.280-290
• /
• 2003

Many firms are trying to optimize their production and distribution functions separately, but possible savings by this approach may be limited. Nowadays, it is more important to analyze these two functions simultaneously by trading off the costs associated with the whole. In this paper, I treat a production and distribution planning problem for single-period inventory products comprised of a single production facility and multiple customers, with the aim of optimally coordinating important and interrelated decisions of production sequencing and vehicle routing. Then, I propose a hybrid genetic algorithm incorporating several local optimization techniques, HGAP, for integrated production-distribution planning. Computational results on test problems show that HGAP is effective and generates substantial cost savings over Hurter and Buer's decoupled planning approach in which vehicle routing is first developed and a production sequence is consequently derived. Especially, HGAP performs better on the problems where customers are dispersed with multi-item demand than on the problems where customers are divided into several zones based on single-item demand.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.27 no.2
• /
• pp.102-113
• /
• 2004

This paper addresses the transportation planning that is based on genetic algorithm for determining transportation time and transportation amount of minimizing cost of distribution system. The vehicle routing of minimizing the transportation distance of vehicle is determined. A distribution system is consisted of a distribution center and many retailers. The model is assumed that the time horizon is discrete and finite, and the demand of retailers is dynamic and deterministic. Products are transported from distribution center to retailers according to transportation planning. Cost factors are the transportation cost and the inventory cost, which transportation cost is proportional to transportation distance of vehicle when products are transported from distribution center to retailers, and inventory cost is proportional to inventory amounts of retailers. Transportation time to retailers is represented as a genetic string. The encoding of the solutions into binary strings is presented, as well as the genetic operators used by the algorithm. A mathematical model is developed. Genetic algorithm procedure is suggested, and a illustrative example is shown to explain the procedure.

• Proceedings of the Korea Society for Simulation Conference
• /
• 2000.04a
• /
• pp.57-66
• /
• 2000

Production-distribution planning is the most important part in supply chain management (SCM). To solve this planning problem, either analytic or simulation approach has been developed. However these two approaches have their own demerits in problem solving. In this paper, we propose a hybrid approach which is a specific problem solving procedure combining analytic and simulation method to solve production-distribution problems in supply chain. The machine capacity and distribution capacity constraints in the analytic model are considered as stochastic factors and adjusted by the proposed specific process according to the results from independently developed simulation model which includes general production-distribution characteristics.

• Journal of Electrical Engineering and Technology
• /
• v.10 no.3
• /
• pp.709-718
• /
• 2015

Traditional transmission planning usually caters for rated wind power output. Due to the low occurrence probability of nominal capacity of wind power and huge investment in transmission, these planning methods will leads to low utilization rates of transmission lines and poor economic efficiency. This paper provides a novel transmission expansion planning method for integrating large-scale wind power. The wind power distribution characteristics of large-scale wind power output and its impact on transmission planning are analyzed. Based on the wind power distribution characteristics, this paper proposes a flexible and economic transmission planning model which saves substantial transmission investment through spilling a small amount of peak output of wind power. A methodology based on Benders decomposition is used to solve the model. The applicability and effectiveness of the model and algorithm are verified through a numerical case.

• IE interfaces
• /
• v.18 no.1
• /
• pp.63-72
• /
• 2005

In this paper, we present a distribution planning method for a supply chain. Like a typical distribution network of manufacturing firms, we have the form of arborescence. To consider more realistic situation, we investigated that an outside supplier has limited capacity. The customer demands are given in deterministic form in finite number of discrete time periods. In this environment, we attempt to minimize the total costs, which is the sum of inventory holding and backorder costs over the distribution network during the planning horizon. To make the best of the restricted capacity, we propose the look-ahead feature. For looking ahead, we convert this problem into a single machine scheduling problem and utilize tabu search approach to solve it. Numerous simulation tests have shown that the proposed algorithm performs quite well.