Paper Title :Tour-And-Charging Scheduler Based On (N+1) Traveling Salesman Problem Modeling
Author :Ho-Gun Oh, Yumin Jo, Donghyun Kim, Gyung-Leen Park, Junghoon Lee
Article Citation :Ho-Gun Oh ,Yumin Jo ,Donghyun Kim ,Gyung-Leen Park ,Junghoon Lee ,
(2016 ) " Tour-And-Charging Scheduler Based On (N+1) Traveling Salesman Problem Modeling " ,
International Journal of Advance Computational Engineering and Networking (IJACEN) ,
pp. 81-83,
Volume-4,Issue-1
Abstract : Tour-and-charging scheduling for DC chargers is modeledas (n+1) traveling salesman problem, where 1 out of m
chargersis added to the set of n given destinations. To cope with the executiontime explosion according to the more
deployment of chargers, thispaper designs a heuristic by which just a small set of chargersare investigated. To narrow the
candidate set, our scheme sorts thedestinations according to the distance from the start point and thenpicks just a limited
number of chargers closest to each destinationone by one. The restriction avoids the containment of candidateswithin a small
area. The experiment result, obtained by means ofa prototype implementation on a real-life geographic distribution,reveals
that the proposed scheme can find a solution comparable tothe optimal one with 5 candidates, the gap not larger than 2.7 %
forthe given parameter setting.
Keywords – Electric Vehicle, DC Charger, Tour-and-Charging Schedule, Traveling Salesman Problem, Response Time.
Type : Research paper
Published : Volume-4,Issue-1
DOIONLINE NO - IJACEN-IRAJ-DOIONLINE-3740
View Here
Copyright: © Institute of Research and Journals
| |
 |
| |
 |
PDF |
| |
Viewed - 90 |
| |
Published on 2016-01-30 |
|
