Advertisement

Integrated Route, Charging and Activity Planning for Whole Day Mobility with Electric Vehicles

  • Marek Cuchý
  • Michal ŠtolbaEmail author
  • Michal Jakob
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11352)

Abstract

Over the last two decades, route planning algorithms have revolutionized the way we organize car travel. The advent of electric vehicles (EVs), however, bring new challenges for travel planning. Because of electric vehicle limited range and long charging times, it is beneficial to plan routes, charging, and activities jointly and in the context of the whole day—rather than for single, isolate journeys as done by standard route planning approaches. In this work, we therefore present a novel approach to solving such a whole day mobility problem. Our method works by first preprocessing an energy-constrained route planning problem and subsequently planning the temporally and spatially constrained activities. We propose both an optimal algorithm for the day mobility planning problem and a set of sub-optimal speedup heuristics. We evaluate the proposed algorithm on a set of benchmarks based on real-world data and show that it is significantly faster than the previous state-of-the-art approach. Moreover, the speedups provide dramatic memory and time improvements with a negligible loss in solution quality.

Keywords

Electromobility Route planning Day mobility planning Charging allocation 

Notes

Acknowledgments

This research was funded by the European Union Horizon 2020 research and innovation programme under the grant agreement \(N^{\mathrm {\circ }}713864\) and by the Grant Agency of the Czech Technical University in Prague, grant No. SGS16/235/ OHK3/3T/13.

References

  1. 1.
    Cuchý, M., Štolba, M., Jakob, M.: Whole day mobility planning with electric vehicles. In: ICAART (2018)Google Scholar
  2. 2.
    Aneja, Y.P., Nair, K.P.K.: The constrained shortest path problem. Nav. Res. Logist. Q. 25, 549–555 (1978)MathSciNetCrossRefGoogle Scholar
  3. 3.
    Desaulniers, G.: Shortest path problems with resource constraints. Column Gener. 5, 33 (2006)zbMATHGoogle Scholar
  4. 4.
    Desrochers, M., Soumis, F.: A column generation approach to the urban transit crew scheduling problem. Transp. Sci. 23, 1–13 (1989)CrossRefGoogle Scholar
  5. 5.
    Sachenbacher, M., Leucker, M., Artmeier, A., Haselmayr, J.: Efficient energy-optimal routing for electric vehicles. In: AAAI (2011)Google Scholar
  6. 6.
    Hart, P.E., Nilsson, N.J., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. Syst. Sci. Cybern. 4, 100–107 (1968)CrossRefGoogle Scholar
  7. 7.
    Cornuéjols, G., Fonlupt, J., Naddef, D.: The traveling salesman problem on a graph and some related integer polyhedra. Math. Program. 33, 1–27 (1985)MathSciNetCrossRefGoogle Scholar
  8. 8.
    Rice, M.N., Tsotras, V.J.: Parameterized algorithms for generalized traveling salesman problems in road networks. In: Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, SIGSPATIAL 2013, New York, NY, USA, pp. 114–123. ACM (2013)Google Scholar
  9. 9.
    Bockenhauer, H.J., Hromkovic, J., Kneis, J., Kupke, J.: The parameterized approximability of TSP with deadlines. Theory Comput. Syst. 41, 431–444 (2007)MathSciNetCrossRefGoogle Scholar
  10. 10.
    Pekny, J.F., Miller, D.L.: An exact parallel algorithm for the resource constrained traveling salesman problem with application to scheduling with an aggregate deadline. In: Proceedings of the 1990 ACM Annual Conference on Cooperation, pp. 208–214. ACM (1990)Google Scholar
  11. 11.
    Roberti, R., Wen, M.: The electric traveling salesman problem with time windows. Transp. Res. Part E: Logist. Transp. Rev. 89, 32–52 (2016)CrossRefGoogle Scholar
  12. 12.
    Davari, M., Demeulemeester, E., Leus, R., Talla Nobibon, F.: Exact algorithms for single-machine scheduling with time windows and precedence constraints. J. Sched. 19, 309–334 (2016)MathSciNetCrossRefGoogle Scholar
  13. 13.
    Lawler, E.L., Lenstra, J.K., Kan, A.H.R., Shmoys, D.B.: Sequencing and scheduling: algorithms and complexity. In: Logistics of Production and Inventory, Handbooks in Operations Research and Management Science, vol. 4, pp. 445–522. Elsevier (1993)Google Scholar
  14. 14.
    Loui, R.P.: Optimal paths in graphs with stochastic or multidimensional weights. Commun. ACM 26, 670–676 (1983)MathSciNetCrossRefGoogle Scholar
  15. 15.
    Mandow, L., De la Cruz, J.P., et al.: A new approach to multiobjective a* search. In: IJCAI, vol. 8 (2005)Google Scholar
  16. 16.
    Hartigan, J.A., Wong, M.A.: Algorithm AS 136: a k-means clustering algorithm. J. Roy. Stat. Soc. Ser. C (Appl. Stat.) 28, 100–108 (1979)zbMATHGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.Department of Computer Science, Faculty of Electrical EngineeringCzech Technical University in PraguePragueCzech Republic

Personalised recommendations