Browse > Article
http://dx.doi.org/10.12815/kits.2013.12.1.121

A case study on optimal location modeling of battery swapping & charging facility for the electric bus system  

Kim, Seung-Ji (한국항공대학교 항공교통물류학과 교통 전공)
Kim, Wonkyu (한국항공대학교 항공교통물류학과)
Kim, Byung Jong (한국항공대학교 항공교통물류학과)
Im, Hyun Seop (한국항공대학교 항공교통물류학과)
Publication Information
The Journal of The Korea Institute of Intelligent Transport Systems / v.12, no.1, 2013 , pp. 121-135 More about this Journal
Abstract
This paper propose an efficient algorithm for selecting electric bus charging facility location. In nature, the optimal charging facility location problem is similar to Set Covering Problem. Set Covering Problem is the problem of covering all the rows of an $m{\times}n$ matrix of ones and zeros by a subset of columns with a minimal cost. It has many practical applications of modeling of real world problems. The Set Covering Problem has been proven to be NP-Complete. In order to overcome the computational complexity involved in seeking optimal solutions, this paper present an enhanced greedy algorithm and simulated annealing algorithm. In this paper, we apply the developed algorithm to Seoul's public bus system.
Keywords
Electric Bus; Greedy Algorithm; Set covering problem; Battery Swapping Station; EV;
Citations & Related Records
Times Cited By KSCI : 1  (Citation Analysis)
연도 인용수 순위
1 Ministry of Land, Transport and Maritime Affairs, "Technology Development of EV Transportation Safety Convergence System"(10PTSI-B056303-01), Working Report, 2011
2 Zhi-Gang Ren, Zu-Ren Feng, "New ideas for applying ant colony optimization to the set covering problem", Computers & Industrial Engineering, Volume 58, Issue 4, pp. 774-784, 2010   DOI   ScienceOn
3 Guanghui Lan, Gail W. DePuy, "An effective and simple heuristic for the set covering problem", European Journal of Operational Research Volume 176, Issue 3, pp. 1387-1403, 2007   DOI   ScienceOn
4 Michael J. Brusco, Larry W. Jacobs, "A morphing procedure to supplement a simulated annealing heuristic for cost- and coverage-correlated set covering problems", Annals of Operations Research 86, pp.611-627, 1999   DOI
5 Beasley, J. E. and Chu, p., "A genetic algorithm for the set covering problem", European Journal of Operational Research, vol. 94, pp. 392-404, 1996   DOI   ScienceOn
6 Caprara, A., Fischetti, M. and P. Toch, "A heuristic method for the set covering problem", Working Paper, DEIS, University of Bologna, Italy, 1995
7 Daskin, M., Network and Discrete Location Models, Algorithms and Applications, John Wiley & Sons, Inc., 1995
8 Beasley, J. E. and Jonsten, K., "Enhancing an algorithm for set covering problems", European Journal of Operational Research 58, pp.293-300, 1992   DOI   ScienceOn
9 E. Balas and A. Ho, "Set covering algorithms using cutting planes, heuristics, and subgradient optimization", A computational study, Mathematical Programming Study 12, pp. 37-60, 1980   DOI
10 Oh Se-Chang & Kim Jung-Min, "A Optimal Facility Location Set Covering and Minisum(Application to Optimal Location of 119 Eru)", Journal of Korean Society of Transportation, vol.27, no.4, pp. 103-113, 2009   과학기술학회마을
11 Kim Seung-Bin. " A study on Optimal Allocation Model for SAM-X by using Set Covering Model", Korea National Defence Univ., 2004
12 Lee Hyun-Nam & Han Chi-Geun, "An Enhanced Simulated Annealing Algorithm for the Set Covering Problem", IE Interfaces, vol. 12, no. 1, pp. 94-101, 1999   과학기술학회마을
13 Kang Byung-Cheon & Han Chi-eun, "A Genetic Algorithm for Solving the Extended Set Covering Problem", journal of KIISE(A), vol. 25, no. 2, 1997