• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.67 no.10
• /
• pp.1278-1285
• /
• 2018

For saving electricity bill, energy storage system(ESS) is being installed in factories, public building and commercial building with a Time-of-Use(TOU) tariff which consists of demand charge(KRW/kW) and energy charge(KRW/kWh). However, both of peak reduction and ESS special tariff are not considered in an analysis of initial cost payback period(ICPP) on ESS. Since it is difficult to reflect base rate by an amount of uncertain peak demand reduction during mid-peak and on-peak periods in the future days. Therefore, the ICPP on ESS can be increased. Based on this background, this paper presents the advanced analysis method for the ICPP on ESS. In the proposed algorithm, the representative days of monthly electricity consumption pattern for the amount of peak reduction can be found by the k­means clustering algorithm. Moreover, the total expected energy costs of representative days are minimized by optimal daily ESS operation considering both peak reduction and the special tariff through a mixed-integer linear programming(MILP). And then, the amount of peak reduction becomes a value that the sum of the expected energy costs for 12 months is maximum. The annual benefit cost is decided by the amount of annual peak reduction. Two simulation cases are considered in this study, which one only considers the special tariff and another considers both of the special tariff and amount of peak reduction. The ICPP in the proposed method is shortened by 18 months compared to the conventional method.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.14 no.1
• /
• pp.69-80
• /
• 1996

This Study aims at identifying optimum residential area of small and medium local cities to be relocated in the future. In the object of study, Chinju City was chosen and it consists of three stages of application to choose the priority of residential development us well as available residential locations. In the first stage, a digital image processing technique was applied to generate the existing urban land use information from the satellite image data. In the second stage, GIS technique was used to choose the avaliable residential area by evaluating the elements for residential site allocation such as road accessibility, topographic height, slope, aspect, legal limit, population density, and land price. In the third stage, some mathematical location models were applied to identify optimum candidates of residential areas chosen by earier stages. The results were evaluated by statistical methods and integer programming to identify the development priority. We expect this procedures and the results will be able to be used as a guide-line to support housing policies of Chinju City by allocating residential sites as well as a technique to apply a locational analysis for the future residential areas of small and medium local cities.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.6
• /
• pp.1032-1039
• /
• 2015

Service function chaining(SFC) defines the creation of network services that consist of an ordered set of service function. A multiple service function instances should be deployed across networks for scalable and fault-tolerant SFC services. Therefore, an incoming flows should be distributed to multiple service function instances appropriately. In this paper, we formulate the flow distribution problem in SFC aiming at minimizing the end-to-end flow latency under resource constraints. Then, we evaluate its optimal solution in a realistic network topology generated by the GT-ITM topology generator. Simulation results reveal that the optimal solution can reduce the total flow latency significantly.

• Journal of the Korean Society for Railway
• /
• v.10 no.6
• /
• pp.742-750
• /
• 2007

This paper presents a mathematical model for a double-fleet operation in Korean high speed rail (HSR). KORAIL has a plan to launch new HSR units in 2010, which are composed of 10 railcars. The double-fleet operation assigns a single-unit or two-unit fleet to a segment, accommodating demand fluctuation. The proposed model assumes stochastic demand and uses chance-constrained constraints to assure a preset service level. It can be used in the tactical planning stage of the rail management as it includes several real-world conditions, such as the capacities of the infra-structures and operational procedures. In the solution approach, the expected revenue in the objective function is linearized by using expected marginal revenue, and the chance-constrained constraints are linearized by assuming that demands are normally distributed. Subsequently, the model can be solved by a mixed-integer linear programming solver fur small size problems. The test results of the model applied to Friday morning train schedules for one month sample data from KTX operation in 2004 shows that the proposed model could be utilized to determine the effectiveness of double-fleet operation, which could significantly increase the expected profit and seat utilization rates when properly maneuvered.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.40 no.1
• /
• pp.11-21
• /
• 2017

Artillery fire power due to effectiveness which is hard to predict well-planned and surprising attack can give a fear and shock to the personnel and is a very core weapon system and takes a critical role in wartime. Therefore in order to maximize operational effectiveness, Army required protecting artillery and takes a quick attack action through rapid construction of artillery's positions. The artillery use artillery's position to prevent exposure by moving to other position frequently. They have to move and construct at new artillery's positions quickly against exposing existed place by foe's recognition. These positions should be built by not manpower but engineering construction equipment. Because artillery positions have to protect human and artillery equipment well and build quickly. Military engineering battalion have lots of construction equipment which include excavator, loader, dozer, combat multi-purposed excavator, armored combat earthmover dump truck and so on. So they have to decide to optimal number of Team combining these equipments and determine construction sequence of artillery's position in operational plan. In this research, we propose to decide number of Team efficiently and allocate required construction's positions for each Team under constraints of limited equipments and time. To do so, we develop efficient heuristic method which can give near optimal solution and be applied to various situation including commander's intention, artillery position's priority or grouping etc. This heuristic can support quick and flexible construction plan of artillery positions not only for using various composition's equipment to organize Teams but also for changing quantity of positions.

• Transactions on Control, Automation and Systems Engineering
• /
• v.3 no.3
• /
• pp.181-189
• /
• 2001

The software components of embedded control systems get extremely complex as they are designed into distributed systems get extremely complex as they are designed into distributed systems consisting of a large number of inexpensive microcontrollers interconnected by low-bandwidth real-time networks such as the controller area network (CAN). While recently emerging middleware technologies such as CORBA and DCOM address the complexity of distributed programming, they cannot be directly applied to distributed control system design due to their excessive resource demand and inadequate communication models. In this paper, we propose a CORBA-based middleware design for CAN-based distributed embedded control systems. Our design goal is to minimize its resource need and make it support group communication without losing the IDL (interface definition language) level compliance to the OMG standards. To achieve this, we develop a transport protocol on the CAN and a group communication scheme based on the well-known publisher/subscriber model. The protocol effectively realizes subject-based addressing and supports anonymous publisher/subscriber communication. We also customize the method invocation and message passing protocol, referred to as the general inter-ORB protocol (GIOP), of CORBA so that CORBA method invocations are efficiently serviced on a low-bandwidth network such as the CAN. This customization includes packed data encoding and variable-length integer encoding for compact representation of IDL data types. We have implemented our CORBA-based middleware on the mArx real-time operating system we have developed at Seoul National University. Our experiments clearly demonstrate that it is feasible to use CORBA in developing distributed embedded control systems possessing severe resource limitations. Our design clearly demonstrates that it is feasible to use a CORBA-based middleware in developing distributed embedded systems on real-time networks possessing severe resource limitations.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.47 no.7
• /
• pp.51-58
• /
• 2010

Wireless Mesh Network has drawn much attention due to wide area service coverage with low system cost. However, there is a bottleneck problem in wireless mesh network since the traffic is aggregated into a gateway. Placement of multi-radio can easy the bottleneck problem, but without careful design it results in unnecessary system cost increasement. In this paper, we propose a system cost minimization through differential antenna placement where optimum antenna placement is determined by the required wireless link capacity. With CPLEX program, optimum number of antennae is determined as a function of local user traffic and gateway capacity. From numerical analysis, it is confirmed that our proposed model can solve bottleneck problem, and at the same time save the system cost.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.39 no.2
• /
• pp.28-36
• /
• 2016

Recently, owing to the development of ICT industry and wide spread of smart phone, the number of people who use car sharing service are increased rapidly. Currently two-way car sharing system with same rental and return locations are mainly operated since this system can be easily implemented and maintained. Currently the demand of one-way car sharing service has increase explosively. But this system have several obstacle in operation, especially, vehicle stock imbalance issues which invoke vehicle relocation. Hence in this study, we present an optimization approach to depot location and relocation policy in one-way car sharing systems. At first, we modelled as mixed-integer programming models whose objective is to maximize the profits of a car sharing organization considering all the revenues and costs involved and several constraints of relocation policy. And to solve this problem efficiently, we proposed a new method based on particle swarm optimization, which is one of powerful meta-heuristic method. The practical usefulness of the approach is illustrated with a case study involving satellite cities in Seoul Metrolitan Area including several candidate area where this kind systems have not been installed yet and already operating area. Our proposed approach produced plausible solutions with rapid computational time and a little deviation from optimal solution obtained by CPLEX Optimizer. Also we can find that particle swarm optimization method can be used as efficient method with various constraints. Hence based on this results, we can grasp a clear insight into the impact of depot location and relocation policy schemes on the profitability of such systems.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.7
• /
• pp.2325-2349
• /
• 2014

Network virtualization technology plays a key role in cloud computing, which serves as an effective approach for provisioning a flexible and highly adaptable shared substrate network to satisfy the demands of various applications or services. Recently, the problem of mapping a virtual network (VN) onto a substrate network has been addressed by various algorithms. However, these algorithms are typically efficient for unicast service-oriented virtual networks, and generally not applicable to multicast service-oriented virtual networks (MVNs). Furthermore, the survivable MVN mapping (SMVNM) problem that considers the survivability of MVN has not been studied and is also the focus of this work. In this research, we discuss SMVNM problem under regional failures in the substrate network and propose an efficient algorithm for solving this problem. We first propose a framework and formulate the SMVNM problem with the objective of minimizing mapping cost by using mixed integer linear programming. Then we design an efficient heuristic to solve this problem and introduce several optimizations to achieve the better mapping solutions. We validate and evaluate our framework and algorithms by conducting extensive simulations on different realistic networks under various scenarios, and by comparing with existing approaches. Our simulation experiments and results show that our approach outperforms existing solutions.

• Asia pacific journal of information systems
• /
• v.12 no.4
• /
• pp.193-213
• /
• 2002

The sales activity of most of small manufacturing companies is based on orders of buyers. The process of promotion, negotiation, receipt and selection of orders of the manufacturers is closely coupled with the load status of the production lines. The decision on whether to accept an order or not, or the selection of optimal order set among excessive orders is entirely dependent on the schedule of production lines. However, in the real world, since the production scheduling activity is mainly performed by human experts, most of small manufacturers are suffer from being unable to meet due dates, lack of rapid decision on the acceptance of new order. Recently, Internet based Electronic Commerce is recognized as one of the alternatives for strengthening sales power of small and medium companies. However, small and medium manufacturers can't adjust properly to the new environment because they are in short of money, personnel, and technology. To cope with this problem, this paper deals with development of part sales agent coupled with virtual manufacturing in Internet environment that consist of selection agent, advertisement agent, selection agent, negotiation agent, and virtual manufacturing system. This paper develops a time-bounded negotiation mechanism for small and medium manufacturers in agent-based automated negotiation between customers and negotiation agents. Furthermore, to select optimal order set maximized profit, we first formulate the order selection problem with mixed integer programming, but the computation time of IP is not acceptable for real world scale problem. To overcome this problem and dynamic nature of virtual manufacturing, we suggest a genetic algorithm approach, which shows a reasonable computation time for real world case and good incremental problem solving capability.