Design of a Team-Based Relocation Scheme in Electric Vehicle Sharing Systems

  • Junghoon Lee
  • Gyung-Leen Park
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7973)


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.


Electric vehicle sharing system relocation team schedule genetic algorithms equivalent pairs relocation distance 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Cepolina, E., Farina, A.: A New Shared Vehicle System for Urban Areas. Transportation Research Part C, 230–243 (2012)Google Scholar
  2. 2.
    Correia, G., Antunes, A.: Optimization Approach to Depot Location and Trip Selection in One-Way Carsharing Systems. Transportation Research Part E, 233–247 (2012)Google Scholar
  3. 3.
    Weikl, S., Bogenberger, K.: Relocation Strategies and Algorithms for Free-Floating Car Sharing Systems. In: IEEE Conference on Intelligent Transportation Systems, pp. 355–360 (2012)Google Scholar
  4. 4.
    Ipakchi, A., Albuyeh, F.: Grid of the Future. IEEE Power & Energy Magazine, 52–62 (2009)Google Scholar
  5. 5.
    Bektas, T.: The Multiple Traveling Salesman Problem: An Overview of Formulations and Solution Procedures. International Journal of Management Science 34, 209–219 (2006)Google Scholar
  6. 6.
    Giardini, G., Kalmar-Nagy, T.: Genetic Algorithm for Combinational Path Planning: The Subtour Problem. Mathematical Problems in Engineering (February 2011)Google Scholar
  7. 7.
    Lue, A., Colorni, A., Nocerino, R., Paruscio, V.: Greem Move: An Innovative Electric Vehicle-Sharing System. Procedia-Social and Behavioral Sciences 48, 2978–2987 (2012)CrossRefGoogle Scholar
  8. 8.
    Lian, L., Castelain, E.: A Decomposition Approach to Solve a General Delivery Problem. Engineering Letters 18(1) (2010)Google Scholar
  9. 9.
    Lee, J., Kim, H., Park, G.: Relocation Action Planning in Electric Vehicle Sharing Systems. In: Sombattheera, C., Loi, N.K., Wankar, R., Quan, T. (eds.) MIWAI 2012. LNCS, vol. 7694, pp. 47–56. Springer, Heidelberg (2012)CrossRefGoogle Scholar
  10. 10.
    Kek, A., Cheu, R., Meng, Q., Fung, C.: A Decision Support System for Vehicle Relocation Operations in Carsharing Systems. Transportation Research Part E, 149–158 (2009)Google Scholar
  11. 11.
    Lee, J., Park, G.: Genetic Algorithm-based Relocation Scheme in Electric Vehicle Sharing Systems. In: Submitted to International Conference on Information Technology Convergence and Services (2013)Google Scholar
  12. 12.
    Lee, J., Park, G.: Planning of Relocation Staff Operations in Electric Vehicle Sharing Systems. In: Selamat, A., Nguyen, N.T., Haron, H. (eds.) ACIIDS 2013, Part II. LNCS, vol. 7803, pp. 256–265. Springer, Heidelberg (2013)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Junghoon Lee
    • 1
  • Gyung-Leen Park
    • 1
  1. 1.Dept. of Computer Science and StatisticsJeju National UniversityRepublic of Korea

Personalised recommendations