Route and charging planning for electric vehicles: a multi-objective approach

References

• Aneja, Y. P., and K. P. K. Nair. 1978. “The Constrained Shortest Path Problem.” Naval Research Logistics Quarterly 25 (3): 549–555. http://doi.org/10.1002/nav.3800250314.
   Google Scholar
• Artmeier, A., J. Haselmayr, M. Leucker, and M. Sachenbacher, 2010. “The Shortest Path Problem Revisited: Optimal Routing for Electric Vehicles.” In Annual Conference on Artificial Intelligence, Karlsruhe Institute of Technology (KIT), Karlsruhe, Germany, 309–316. Springer.
   Google Scholar
• Bast, H., D. Delling, A. Goldberg, M. Müller-Hannemann, T. Pajor, P. Sanders, D. Wagner, and R. F. Werneck. 2016. “Route Planning in Transportation Networks.” In Algorithm Engineering, edited by L. Kliemann and P. Sanders, 19–80. Cham: Springer.
   Google Scholar
• Batista, L. S., F. Campelo, F. G. Guimarães, and J. A. Ramírez, 2011. “A Comparison of Dominance Criteria in Many-Objective Optimization Problems.” In Evolutionary Computation (CEC), 2011 IEEE Congress on Evolutionary Computation, New Orleans, LA, USA, 2359–2366. IEEE.
   Google Scholar
• Bauer, R., and D. Delling. 2009. “Sharc: Fast and Robust Unidirectional Routing.” Journal of Experimental Algorithmics (JEA) 14:2–4. https://doi.org/10.1145/1498698.1537599.
   Google Scholar
• Baum, M., J. Dibbelt, A. Gemsa, D. Wagner, and T. Zündorf. 2019. “Shortest Feasible Paths with Charging Stops for Battery Electric Vehicles.” Transportation Science 53 (6): 1627–1655. https://doi.org/10.1287/trsc.2018.0889.
   Web of Science ®Google Scholar
• Baum, M., J. Dibbelt, T. Pajor, J. Sauer, D. Wagner, and T. Zündorf. 2019. “Energy-Optimal Routes for Battery Electric Vehicles.” Algorithmica 82 (5): 1490–1546. https://doi.org/10.1007/s00453-019-00655-9.
   Web of Science ®Google Scholar
• Bellman, R. 1958. “On a Routing Problem.” Quarterly of Applied Mathematics 16 (1): 87–90. https://doi.org/10.1090/qam/102435.
   Google Scholar
• Ben Abbes, S., L. Rejeb, and L. Baati. 2022. “Route Planning for Electric Vehicles.” IET Intelligent Transport Systems 16:875–889.
   Web of Science ®Google Scholar
• Delling, D., and D. Wagner. 2009. “Pareto Paths with SHARC.” In 8th International Symposium on Experimental Algorithms, Tech Univ Dortmund, Dortmund, Germany, 125–136. Springer.
   Google Scholar
• Dijkstra, E. W. 1959. “A Note on Two Problems in Connexion with Graphs.” Numerische mathematik 1 (1): 269–271. https://doi.org/10.1007/BF01386390.
   Google Scholar
• Eisner, J., S. Funke, and S. Storandt, 2011. “Optimal Route Planning for Electric Vehicles in Large Networks.” In Proceedings of the 25th Conference on Artificial Intelligence, San Francisco, CA, USA, 1108–1113.
   Google Scholar
• Eppstein, D., and M. T. Goodrich, 2008. “Studying (Non-Planar) Road Networks Through an Algorithmic Lens.” In Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems, Irvine, CA, USA, 1–10.
   Google Scholar
• Garey, M. R., and D. S. Johnson. 1979. Computers and Intractability. Vol. 174. San Francisco, CA, USA: freeman San Francisco.
   Google Scholar
• Geisberger, R., P. Sanders, D. Schultes, and C. Vetter. 2012. “Exact Routing in Large Road Networks Using Contraction Hierarchies.” Transportation Science 46 (3): 388–404. https://doi.org/10.1287/trsc.1110.0401.
   Web of Science ®Google Scholar
• Hart, P. E., N. J. Nilsson, and B. Raphael. 1968. “A Formal Basis for the Heuristic Determination of Minimum Cost Paths.” IEEE Transactions on Systems Science and Cybernetics 4 (2): 100–107. https://doi.org/10.1109/TSSC.1968.300136.
   Web of Science ®Google Scholar
• Hrnčíř, J., P. Žilecký, Q. Song, and M. Jakob. 2016. “Practical Multicriteria Urban Bicycle Routing.” IEEE Transactions on Intelligent Transportation Systems 18 (3): 493–504. https://doi.org/10.1109/TITS.2016.2577047.
   Web of Science ®Google Scholar
• Johnson, D. B. 1977. “Efficient Algorithms for Shortest Paths in Sparse Networks.” Journal of the ACM (JACM) 24 (1): 1–13. https://doi.org/10.1145/321992.321993.
   Web of Science ®Google Scholar
• Laszczyk, M., and P. B. Myszkowski. 2019. “Survey of Quality Measures for Multi-Objective Optimization: Construction of Complementary Set of Multi-Objective Quality Measures.” Swarm and Evolutionary Computation 48:109–133. https://doi.org/10.1016/j.swevo.2019.04.001.
   Web of Science ®Google Scholar
• Liu, Y., X. Feng, L. Zhang, W. Hua, and K. Li. 2020. “A Pareto Artificial Fish Swarm Algorithm for Solving a Multi-Objective Electric Transit Network Design Problem.” Transportmetrica A: Transport Science 16 (3): 1648–1670. https://doi.org/10.1080/23249935.2020.1773574.
   Web of Science ®Google Scholar
• Mandow, L., J. P. De la Cruz. 2005. “A New Approach to Multiobjective A* Search.” In Proceedings of the 19th International Joint Conference on Artificial Intelligence, Edinburgh, Scotland.
   Google Scholar
• Martins, E. Q. V. 1984. “On a multicriteria shortest path problem.” European Journal of Operational Research 16 (2): 236–245. https://doi.org/10.1016/0377-2217(84)90077-8.
   Web of Science ®Google Scholar
• Möhring, R. H., H. Schilling, B. Schütz, D. Wagner, and T. Willhalm. 2007. “Partitioning graphs to speedup dijkstra’s algorithm.” Journal of Experimental Algorithmics (JEA) 11:2–8. https://doi.org/10.1145/1187436.1216585.
   Google Scholar
• Müller-Hannemann, M., and K. Weihe. 2006. “On the Cardinality of the Pareto Set in Bicriteria Shortest Path Problems.” Annals of Operations Research 147 (1): 269–286. https://doi.org/10.1007/s10479-006-0072-1.
   Web of Science ®Google Scholar
• Pulido, F. J., L. Mandow, and J. L. Pérez-de-la Cruz. 2015. “Dimensionality Reduction in Multi- Objective Shortest Path Search.” Computers & Operations Research 64:60–70. https://doi.org/10.1016/j.cor.2015.05.007.
   Web of Science ®Google Scholar
• Rajan, P., M. Baum, M. Wegner, T. Zündorf, C. J. West, D. Schieferdecker, and D. Delling, 2021. “Robustness Generalizations of the Shortest Feasible Path Problem for Electric Vehicles.” In 21st Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2021), Online, Schloss Dagstuhl-Leibniz-Zentrum für Informatik.
   Google Scholar
• Riquelme, N., C. Von Lücken, and B. Baran, 2015. “Performance Metrics in Multi-Objective Optimization.” In 2015 Latin American computing conference (CLEI), SPC, UNSA, UCSM, UCSP, ULS, Arequipa, Peru, 1–11. IEEE.
   Google Scholar
• Sachenbacher, M., M. Leucker, A. Artmeier, and J. Haselmayr, 2011. “Efficient Energy-Optimal Routing for Electric Vehicles.” In Proceedings of the 25th Conference on Artificial Intelligence, San Francisco, CA, USA.
   Google Scholar
• Sanders, P., and D. Schultes. 2006. Engineering Highway Hierarchies, 804–816. in: ESA, Springer.
   Google Scholar
• Schoenberg, S., and F. Dressler. 2023. “Reducing Waiting Times at Charging Stations with Adaptive Electric Vehicle Route Planning.” IEEE Transactions on Intelligent Vehicles 8 (1): 95–107. https://doi.org/10.1109/TIV.2022.3140894.
   Google Scholar
• Schönfelder, R., M. Leucker, and S. Walther, 2014. “Efficient Profile Routing for Electric Vehicles.” In International Conference on Internet of Vehicles, Beijing, China, 21–30. Springer.
   Google Scholar
• Siddiqi, U. F., Y. Shiraishi, and S. M. Sait, 2011. “Multi-Constrained Route Optimization for Electric Vehicles (Evs) Using Particle Swarm Optimization (Pso).” In 2011 11th International Conference on Intelligent Systems Design and Applications, Cordoba, Spain, 391–396. IEEE.
   Google Scholar
• Stewart, B. S., and C. C. White III. 1991. “Multiobjective a.” Journal of the ACM (JACM) 38 (4): 775–814. https://doi.org/10.1145/115234.115368.
   Web of Science ®Google Scholar
• Storandt, S., 2012. “Quick and Energy-Efficient Routes: Computing Constrained Shortest Paths for Electric Vehicles.” In Proceedings of the 5th ACM SIGSPATIAL international workshop on computational transportation science, Redondo Beach, CA, USA, 20–25.
   Google Scholar
• Storandt, S., and S. Funke, 2012. “Cruising with a Battery-Powered Vehicle and Not Getting Stranded.” In: Twenty-Sixth AAAI Conference on Artificial Intelligence, Toronto, Ontario, Canada.
   Google Scholar
• Tran, C. Q., M. Keyvan-Ekbatani, D. Ngoduy, and D. Watling. 2021. “Stochasticity and Environ- Mental Cost Inclusion for Electric Vehicles Fast-Charging Facility Deployment.” Transportation Research Part E: Logistics & Transportation Review 154:102460. https://doi.org/10.1016/j.tre.2021.102460.
   Web of Science ®Google Scholar
• Ünal, V., M. Soysal, M. Çimen, and Ç. Koç. 2022. “Dynamic Routing Optimization with Electric Vehicles Under Stochastic Battery Depletion.” Transportation Letters 15 (10): 1376–1388. https://doi.org/10.1080/19427867.2022.2157365.
   Web of Science ®Google Scholar
• Zhu, S. 2022. “Multi-Objective Route Planning Problem for Cycle-Tourists.” Transportation Letters 14 (3): 298–306. https://doi.org/10.1080/19427867.2020.1860355.
   Web of Science ®Google Scholar
• Zündorf, T., 2014. “Electric vehicle routing with realistic recharging models.” Master’s thesis. Department of Informatics Karlsruhe, Germany.
   Google Scholar