• Advances in Energy Research
• /
• v.6 no.1
• /
• pp.55-73
• /
• 2019

The cost incurred by voltage sag effect in power networks has always been of important concern for discussions. Due to the environmental constraints, fossil fuel shortage crisis and low efficiency of conventional power plants, decentralized generation and renewable based DG have become trends in recent decades; because DGs can reduce the voltage sag effect in distribution networks noticeably; therefore, optimum allocation of DGs in order to maximize their effectiveness is highly important in order to maximize their effectiveness. In this paper, a new method is proposed for calculating the cost incurred by voltage sag effect in power networks. Thus, a new objective function is provided that comprehends technical standards as minimization of the cost incurred by voltage sag effect, active power losses and economic criterion as the installation and maintenance costs of DGs. Considering operational constraints of the system, the optimum allocation of DGs is a constrained optimization problem in which Lightning Attachment procedure optimization (LAPO) is used to resolve it and is the optimum number, size and location of DGs are determined in IEEE 33 bus test system and IEEE 34 bus test system. The results show that optimum allocation of DGs not only reduces the cost incurred by voltage sag effect, but also improves the other characteristics of the system.

• Journal of Korea Multimedia Society
• /
• v.17 no.8
• /
• pp.946-952
• /
• 2014

Mobility prediction is one of hot topics using location history information. It is useful for not only user-level applications such as people finder and recommendation sharing service but also for system-level applications such as hand-off management, resource allocation, and quality of service of wireless services. Most of current prediction techniques often use a set of significant locations without taking into account possible location information changes for prediction. Markov-based, LZ-based and Prediction by Pattern Matching techniques consider interesting locations to enhance the prediction accuracy, but they do not consider interesting location changes. In our paper, we propose an algorithm which integrates the changing or emerging new location information. This approach is based on Active LeZi algorithm, but both of new location and all possible location contexts will be updated in the tree with the fixed depth. Furthermore, the tree will also be updated even when there is no new location detected but the expected route is changed. We find that our algorithm is adaptive to predict next location. We evaluate our proposed system on a part of Dartmouth dataset consisting of 1026 users. An accuracy rate of more than 84% is achieved.

• Proceedings of the IEEK Conference
• /
• 2002.07c
• /
• pp.1590-1593
• /
• 2002

We propose a dynamic location management scheme and named it Virtual Dynamic Location Area(VDLA) scheme. It allocates LA on the basis of terminal mobility, VDLA consists of two phases: VLA allocation and final LA selection phases. In the first phase it allocates primary and secondary VLAs to the terminal. In the second phase the terminal selects one of them using LA selection criterion. Cost analysis of the proposed scheme is peformed and its location management cost is compared with those of FLA and DBLA.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.15 no.26
• /
• pp.165-172
• /
• 1992

This paper develops the at location system of milling cutting tools to be used on NC milling machine tool by the technique of cluster analysis. The implementation concerning the tool management system will be applying to Flexible Manufacturing System efficiently.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.40 no.6
• /
• pp.9-21
• /
• 2003

In this paper, we propose a new submesh allocation scheme which improves the performance of multicomputer systems. The key idea of this allocation scheme is to reduce waiting time of task by minimizing the submesh search time and the submesh a]location delay caused by external fragmentation. This scheme reduces the submesh search time by classifying independent free submeshes according to their types (square, horizontal rectangle, vertical rectangle) and searching a best-fit submesh from the classified free submesh list. If a submesh allocation delay occurs due to external fragmentation, the proposed scheme relocates tasks, executing In allocated submeshes, to another free submeshes and compacts processor fragmentation. This results in reducing the submesh allocation delay. Through simulation, we show that it is more effective to reduce the submesh allocation delay due to external fragmentation than reducing the submesh search time with respect to the waiting time of task. We also show that the proposed strategy improves the performance compared to previous strategies.

• Journal of Korean Society of Rural Planning
• /
• v.9 no.4 s.21
• /
• pp.43-51
• /
• 2003

This study aims to integrate the simulation models for rural settlement planning (SimRusep) in the district level (Myon) area of rural counties. The SimRusep, which has two modules of key villages selection and spatial planning for the selected villages, consists of four sub-models such as the spatial location-allocation model of center villages (SLAMCV), the potential centrality evaluation model (PCEM), the land use planning model (LUPM), and the 3-dimensional spatial planning modeller (3DSPLAM). Basically, map data of the integrated system which can be operated on the UNIX environment is inputted and treated using GIS (ARC/INFO) and then its village planning results is graphically presented on the AutoCAD. In order to verify the practical applicabilities of the SimRusep, an administrative area, Ucheon-myun, HoengSung-gun, KangWon-do, was selected as a case study area. It was well operated in the strategic application trials considering application of each sub-model in the study area. The operation results of the SimRusep showed the possibilities of realtime simulation from the selection of key village to its final stereoscopic presentation of planned results. Alternative village plan proposals can be swiftly drafted, which means very practical support for decision making process and public participation.

• Journal of Korean Institute of Industrial Engineers
• /
• v.31 no.4
• /
• pp.303-315
• /
• 2005

In this paper we address a design problem for hub-and-spoke networks and then consider a capacitated hub locations problem with direct shipment (CHLPwD). We determine the location of hubs, the allocation of nodes to hubs, and direct shipment paths in the network, with the objective of minimizing the total cost in the network. In this paper, CHLPwD is formulated as 0-1 integer programming. We develop an evolutionary algorithm here to solve the large sized CHLPwD. To do this, we present the representation and the genetic operators suitable for the problem and propose a heuristic method for the allocation of nodes to hubs. To enhance the search capability, problem-specific information is used in our evolutionary algorithm. The proposed algorithm is compared with the heuristic method in terms of solution quality and computation time. The experimental results show that our algorithm can provide better solutions than the heuristic.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.12
• /
• pp.3275-3295
• /
• 2012

In this paper, we analyze the performance of an amplify-and-forward (AF) two-way relaying system, where two sources exchange information via the aid of an intermediate relay that is selected among multiple relays according to max-min criterion. We consider a practical scenario, where one source-relay link undergoes Rician fading, and the other source-relay link is subject to Rayleigh fading. To be specific, we derive a tight lower bound for the outage probability. From this lower bound, the asymptotic outage probability and average symbol error rate (SER) expressions are derived to gain insight into the system performance at high signal-to-noise ratio (SNR) region. Furthermore, we investigate the optimal power allocation (PA) with fixed relay location (RL), optimal RL with fixed PA and joint optimization of PA and RL to minimize the outage probability and average SER. The analytical expressions are verified through Monte Carlo simulations, where the positive impact of Rician factor on the system performance is also illustrated. Simulation results also validate the effectiveness of the proposed PA and relay positioning schemes.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.12
• /
• pp.4776-4798
• /
• 2015

The location selection of virtual machines in distributed cloud is difficult because of the physical resource distribution, allocation of multi-dimensional resources, and resource unit cost. In this study, we propose a multi-object virtual machine location selection algorithm (MOVMLSA) based on group information, doubly linked list structure and genetic algorithm. On the basis of the collaboration of multi-dimensional resources, a fitness function is designed using fuzzy logic control parameters, which can be used to optimize search space solutions. In the location selection process, an orderly information code based on group and resource information can be generated by adopting the memory mechanism of biological immune systems. This approach, along with the dominant elite strategy, enables the updating of the population. The tournament selection method is used to optimize the operator mechanisms of the single-point crossover and X-point mutation during the population selection. Such a method can be used to obtain an optimal solution for the rapid location selection of virtual machines. Experimental results show that the proposed algorithm is effective in reducing the number of used physical machines and in improving the resource utilization of physical machines. The algorithm improves the utilization degree of multi-dimensional resource synergy and reduces the comprehensive unit cost of resources.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.38 no.1
• /
• pp.153-181
• /
• 2013

Weather is an influential factor to sales of companies. There have been growing attempts with which companies apply weather to developing their strategic marketing plans. By executing weather marketing activities, companies minimize risks (or negative impacts) of weather to their business and increase sales revenues. In spite of managerial importance of weather management, there are scarce empirical studies that comprehensively investigate its impact and present an efficient method that optimally allocates marketing budget. Our research was conducted in two parts. In the first part, we investigated influences of weather on sales based on real-world daily sales data. We specifically focused on the contextual factors that were less focused in the weather related research. In the second part, we propose an optimization model that can be utilized to efficiently allocate weather marketing budget across various regions (or branches) and show how it can be applied to real industry cases. The results of our study are as follow. Study 1 investigated the impact of weather on sales using store sales data of a family restaurant company and an outdoor fashion company. Results represented that the impacts of weather are context-dependent. The impact of weather on store sales varies across their regional and location characteristics when it rains. Based on the results derived from Study 1, Study 2 proposes a method on how optimally companies allocate their weather marketing budgets across each region.