This paper designs a team-based relocation scheme for electric vehicle sharing systems in which stock imbalance can lead to serious service quality degradation. For an efficient operation plan for a relocation team consisting of multiple service staffs, stations are geographically grouped first and the planner merges as many equivalent relocation pairs as possible, considering the number of simultaneously movable vehicles. To obtain a reasonable quality plan within a limited time bound using genetic algorithms even for a large-scale sharing system, each relocation plan is encoded to an integer-valued vector. A vector index points to a overflow station while the vector element points to an underflow station, according to predefined association maps built by the number of surplus and lacking vehicles. The experiment result obtained by a prototype implementation shows that each addition of a service staff cut down the relocation distance by 38.1 %, 17.2 %, and 12.7 %, respectively. © 2013 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Lee, J., & Park, G. L. (2013). Design of a team-based relocation scheme in electric vehicle sharing systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7973 LNCS, pp. 368–377). https://doi.org/10.1007/978-3-642-39646-5_27
Mendeley helps you to discover research relevant for your work.