Abstract
In this paper, we address the routing and recharging problem for electric vehicles, where charging nodes have heterogeneous prices and waiting times, and the objective is to minimize the total recharging cost. We prove that the problem is NP-hard and propose two algorithms to solve it. The first, is an algorithm which obtains the optimal solution in pseudo-polynomial time. The second, is a polynomial time algorithm that obtains a solution with the total cost of recharging not greater than the optimal cost for a more constrained instance of the problem with the maximum waiting time of \((1-\epsilon ) \cdot W\), where W is the maximum allowable waiting time.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Arslan, O., Yıldız, B., Karaşan, O.E.: Minimum cost path problem for plug-in hybrid electric vehicles. Transp. Res. Part E: Logistics Transp. Rev. 80, 123–141 (2015)
Desrochers, M., Soumis, F.: A generalized permanent labelling algorithm for the shortest path problem with time windows. INFOR: Inf. Syst. Oper. Res. 26(3), 191–212 (1988)
DoE: All Electric Vehicles. https://www.fueleconomy.gov/feg/evtech.shtml. Accessed 27 June 2020
Garey, M.R., Johnson, D.S.: Computers and Intractability, vol. 174. Freeman San Francisco (1979)
Hertzke, P., Müller, N., Schaufuss, P., Schenk, S., Wu, T.: Expanding Electric-Vehicle Adoption Despite Early Growing Pains. McKinsey & Company Insights (2019)
Ichimori, T., Ishii, H., Nishida, T.: Routing a vehicle with the limitation of fuel. J. Oper. Res. Soc. Japan 24(3), 277–281 (1981)
Khuller, S., Malekian, A., Mestre, J.: To fill or not to fill: the gas station problem. ACM Trans. Algorithms (TALG) 7(3), 1–16 (2011)
Lin, S.-H.: Finding optimal refueling policies in transportation networks. In: Fleischer, R., Xu, J. (eds.) AAIM 2008. LNCS, vol. 5034, pp. 280–291. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-68880-8_27
Nejad, M.M., Mashayekhy, L., Grosu, D., Chinnam, R.B.: Optimal routing for plug-in hybrid electric vehicles. Transp. Sci. 51(4), 1304–1325 (2017)
Sweda, T.M., Dolinskaya, I.S., Klabjan, D.: Adaptive routing and recharging policies for electric vehicles. Transp. Sci. 51(4), 1326–1348 (2017)
US-EPA: Global Greenhouse Gas Emissions Data. https://www.epa.gov/ghgemissions/global-greenhouse-gas-emissions-data. Accessed 27 June 2020
Acknowledgments
This research was supported in part by the US National Science Foundation under grant no. IIS-1724227.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Bahreini, T., Fisher, N., Grosu, D. (2020). An Efficient Algorithm for Routing and Recharging of Electric Vehicles. In: Wu, W., Zhang, Z. (eds) Combinatorial Optimization and Applications. COCOA 2020. Lecture Notes in Computer Science(), vol 12577. Springer, Cham. https://doi.org/10.1007/978-3-030-64843-5_48
Download citation
DOI: https://doi.org/10.1007/978-3-030-64843-5_48
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-64842-8
Online ISBN: 978-3-030-64843-5
eBook Packages: Computer ScienceComputer Science (R0)