Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2017, Article ID 5098183, 13 pages
https://doi.org/10.1155/2017/5098183
Research Article

Electric Vehicle Routing Problem with Charging Time and Variable Travel Time

1School of Traffic and Transportation, Beijing Jiaotong University, Beijing 100044, China
2Department of Civil and Environmental Engineering, University of Wisconsin-Madison, Madison, WI 53706, USA

Correspondence should be addressed to Jun Bi; nc.ude.utjb@ibj

Received 26 September 2016; Accepted 9 November 2016; Published 5 January 2017

Academic Editor: Marcello Pellicciari

Copyright © 2017 Sai Shao et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. U.S. Environmental Protection Agency, “Greenhouse Gas Emissions from the U.S. Transportation Section,” March 2016, https://www3.epa.gov/otaq/climate/420r06003.pdf.
  2. J. Struben and J. D. Sterman, “Transition challenges for alternative fuel vehicle and transportation systems,” Environment and Planning B: Planning and Design, vol. 35, no. 6, pp. 1070–1097, 2008. View at Publisher · View at Google Scholar · View at Scopus
  3. J. V. F. Serra, Electric Vehicles: Technology, Policy and Commercial Development, Earthscan, London, UK, 2013.
  4. M. Schneider, A. Stenger, and D. Goeke, “The electric vehicle-routing problem with time windows and recharging stations,” Transportation Science, vol. 48, no. 4, pp. 500–520, 2014. View at Publisher · View at Google Scholar · View at Scopus
  5. S. Erdoĝan and E. Miller-Hooks, “A green vehicle routing problem,” Transportation Research Part E: Logistics and Transportation Review, vol. 48, no. 1, pp. 100–114, 2012. View at Publisher · View at Google Scholar · View at Scopus
  6. O. Worley, D. Klabjan, and T. M. Sweda, “Simultaneous vehicle routing and charging station siting for commercial electric vehicles,” in Proceedings of the IEEE International Electric Vehicle Conference, Greenville, SC, USA, March 2012.
  7. R. G. Conrad and M. A. Figliozzi, “The recharging vehicle routing problem,” in Proceedings of the Industrial Engineering Research Conference, 2011, http://web.cecs.pdx.edu/~maf/Conference_Proceedings/2011_The_Recharging_Vehicle_Routing_Problem.pdf.
  8. F. He, Y. Yin, and S. Lawphongpanich, “Network equilibrium models with battery electric vehicles,” Transportation Research Part B: Methodological, vol. 67, no. 3, pp. 306–319, 2014. View at Publisher · View at Google Scholar · View at Scopus
  9. T. M. Sweda and D. Klabjan, “Finding minimum-cost paths for electric vehicles,” in Proceedings of the IEEE International Electric Vehicle Conference, Greenville, SC, USA, March 2012. View at Publisher · View at Google Scholar
  10. J. Eisner, S. Funke, and S. Storandt, “Optimal route planning for electric vehicles in large networks,” in Proceedings of the 25th AAAI Conference on Artificial Intelligence, San Francisco, Calif, USA, August 2011.
  11. A. Andreas, H. Julian, L. Martin, and M. Sachenbacher, “The shortest path problem revisited: optimal routing for electric vehicles,” in KI 2010: Advances in Artificial Intelligence: 33rd Annual German Conference on AI, Karlsruhe, Germany, September 21–24, 2010. Proceedings, vol. 6359 of Lecture Notes in Computer Science, pp. 309–316, Springer, Berlin, Germany, 2010. View at Google Scholar
  12. M. W. Fontana, Optimal routes for electric vehicles facing uncertainty, congestion, and energy constraints [Ph.D. dissertation], Massachusetts Institute of Technology, Cambridge, Mass, USA, 2013.
  13. Y. Kobayashi, N. Kiyama, H. Aoshima, and M. Kashiyama, “A route search method for electric vehicles in consideration of range and locations of charging stations,” in Proceedings of the IEEE Intelligent Vehicles Symposium (IV '11), pp. 920–925, IEEE, Baden-Baden, Germany, June 2011. View at Publisher · View at Google Scholar · View at Scopus
  14. J. D. Adler, P. B. Mirchandani, G. Xue, and M. Xia, “The electric vehicle shortest-walk problem with battery exchanges,” Networks and Spatial Economics, vol. 16, no. 1, pp. 155–173, 2016. View at Publisher · View at Google Scholar · View at Scopus
  15. G. Laporte, M. Desrochers, and Y. Nobert, “Two exact algorithms for the distance-constrained vehicle routing problem,” Networks, vol. 14, no. 1, pp. 161–172, 1984. View at Publisher · View at Google Scholar · View at Scopus
  16. C.-L. Li, D. Simchi-Levi, and M. Desrochers, “On the distance constrained vehicle routing problem,” Operations Research, vol. 40, no. 4, pp. 790–799, 1992. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  17. V. Nagarajan and R. Ravi, “Approximation algorithms for distance constrained vehicle routing problems,” Networks, vol. 59, no. 2, pp. 209–214, 2012. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  18. S. Almoustafa, S. Hanafi, and N. Mladenović, “New exact method for large asymmetric distance-constrained vehicle routing problem,” European Journal of Operational Research, vol. 226, no. 3, pp. 386–394, 2013. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  19. G. Laporte, “The vehicle routing problem: an overview of exact and approximate algorithms,” European Journal of Operational Research, vol. 59, no. 3, pp. 345–358, 1992. View at Publisher · View at Google Scholar · View at Scopus
  20. B.-H. Ahn and J.-Y. Shin, “Vehicle-routeing with time windows and time-varying congestion,” Journal of the Operational Research Society, vol. 42, no. 5, pp. 393–400, 1991. View at Publisher · View at Google Scholar · View at Scopus
  21. C. Malandraki and M. S. Daskin, “Time dependent vehicle routing problems: formulations, properties and heuristic algorithms,” Transportation Science, vol. 26, no. 3, pp. 185–200, 1992. View at Publisher · View at Google Scholar · View at Scopus
  22. R. J. V. Wiel and N. V. Sahinidis, “Heuristic bounds andtest problem generation for the time dependent traveling salesman problem,” Transportation Science, vol. 314, no. 2, pp. 151–155, 1995. View at Google Scholar
  23. M. Gendreau, G. Laporte, and R. Séguin, “Stochastic vehicle routing,” European Journal of Operational Research, vol. 88, no. 1, pp. 3–12, 1996. View at Publisher · View at Google Scholar · View at Scopus
  24. C. Malandraki and R. B. Dial, “A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem,” European Journal of Operational Research, vol. 90, no. 1, pp. 45–55, 1996. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  25. S. Ichoua, M. Gendreau, and J.-Y. Potvin, “Vehicle dispatching with time-dependent travel times,” European Journal of Operational Research, vol. 144, no. 2, pp. 379–396, 2003. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  26. H.-K. Chen, C.-F. Hsueh, and M.-S. Chang, “The real-time time-dependent vehicle routing problem,” Transportation Research Part E: Logistics and Transportation Review, vol. 42, no. 5, pp. 383–408, 2006. View at Publisher · View at Google Scholar · View at Scopus
  27. E. Taniguchi and H. Shimamoto, “Intelligent transportation system based dynamic vehicle routing and scheduling with variable travel times,” Transportation Research Part C: Emerging Technologies, vol. 12, no. 3-4, pp. 235–250, 2004. View at Publisher · View at Google Scholar · View at Scopus
  28. J.-Y. Potvin, Y. Xu, and I. Benyahia, “Vehicle routing and scheduling with dynamic travel times,” Computers & Operations Research, vol. 33, no. 4, pp. 1129–1137, 2006. View at Publisher · View at Google Scholar · View at Scopus
  29. A. Haghani and S. Jung, “A dynamic vehicle routing problem with time-dependent travel times,” Computers & Operations Research, vol. 32, no. 11, pp. 2959–2986, 2005. View at Publisher · View at Google Scholar · View at Scopus
  30. M. A. Figliozzi, “The time dependent vehicle routing problem with time windows: benchmark problems, an efficient solution algorithm, and solution characteristics,” Transportation Research Part E: Logistics and Transportation Review, vol. 48, no. 3, pp. 616–636, 2012. View at Publisher · View at Google Scholar · View at Scopus
  31. E. W. Dijkstra, “A note on two problems in connexion with graphs,” Numerische Mathematik, vol. 1, no. 1, pp. 269–271, 1959. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  32. Beijing Municipal Commission of Development and Reform, Beijing TOU Tariff Table, 2015, http://www.bjpc.gov.cn/zwxx/tztg/201601/P020160105602466219360.pdf.