Papers
Topics
Authors
Recent
Search
2000 character limit reached

Hybrid Memetic Search for Electric Vehicle Routing with Time Windows, Simultaneous Pickup-Delivery, and Partial Recharges

Published 25 Oct 2024 in cs.NE | (2410.19580v2)

Abstract: With growing environmental concerns, electric vehicles for logistics have gained significant attention within the computational intelligence community in recent years. This work addresses an emerging and significant extension of the electric vehicle routing problem (EVRP), namely EVRP with time windows, simultaneous pickup-delivery, and partial recharges (EVRP-TW-SPD), which has widespread real-world applications. We propose a hybrid memetic algorithm (HMA) for solving EVRP-TW-SPD. HMA incorporates two novel components: a parallel-sequential station insertion (PSSI) procedure for handling partial recharges that can better avoid local optima compared to purely sequential insertion, and a cross-domain neighborhood search (CDNS) that explores solution spaces of both electric and non-electric problem domains simultaneously. These components can also be easily applied to various EVRP variants. To bridge the gap between existing benchmarks and real-world scenarios, we introduce a new, large-scale EVRP-TW-SPD benchmark set derived from real-world applications, containing instances with many more customers and charging stations than existing benchmark instances. Extensive experiments demonstrate the significant performance advantages of HMA over existing algorithms across a wide range of problem instances. Both the benchmark set and HMA are to be made open-source to facilitate further research in this area.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (37)
  1. X. Wen, G. Wu, J. Liu, and Y.-S. Ong, “Transfer optimization for heterogeneous drone delivery and pickup problem,” IEEE Trans. Emerg. Top. Comput. Intell., pp. 1–18, 2024.
  2. L. Feng, Y. Huang, L. Zhou, J. Zhong, A. Gupta, K. Tang, and K. C. Tan, “Explicit evolutionary multitasking for combinatorial optimization: A case study on capacitated vehicle routing problem,” IEEE Trans. Cybern., vol. 51, no. 6, pp. 3143–3156, 2021.
  3. M. Chen, J. Chen, P. Peng, S. Liu, and K. Tang, “A heuristic repair method for dial-a-ride problem in intracity logistic based on neighborhood shrinking,” Multimed. Tools Appl., vol. 80, no. 20, pp. 30 775–30 787, 2021.
  4. J. Mandziuk, “New shades of the vehicle routing problem: Emerging problem formulations and computational intelligence solution methods,” IEEE Trans. Emerg. Top. Comput. Intell., vol. 3, no. 3, pp. 230–244, 2019.
  5. H. Qin, X. Su, T. Ren, and Z. Luo, “A review on the electric vehicle routing problems: Variants and algorithms,” Front. Eng. Manag., vol. 8, pp. 370–389, 2021.
  6. Z. Zhou, B. Wang, Y. Guo, and Y. Zhang, “Blockchain and computational intelligence inspired incentive-compatible demand response in internet of electric vehicles,” IEEE Trans. Emerg. Top. Comput. Intell., vol. 3, no. 3, pp. 205–216, 2019.
  7. Y. Liu, P. Zhou, L. Yang, Y. Wu, Z. Xu, K. Liu, and X. Wang, “Privacy-preserving context-based electric vehicle dispatching for energy scheduling in microgrids: An online learning approach,” IEEE Trans. Emerg. Top. Comput. Intell., vol. 6, no. 3, pp. 462–478, 2022.
  8. S. Erdoğan and E. Miller-Hooks, “A green vehicle routing problem,” Transp. Res. Part E Logist. Transp. Rev., vol. 48, no. 1, pp. 100–114, 2012.
  9. I. Küçükoglu, R. Dewil, and D. Cattrysse, “The electric vehicle routing problem and its variations: A literature review,” Comput. Ind. Eng., vol. 161, p. 107650, 2021.
  10. C. Wang, M. Cao, H. Jiang, X. Xiang, and X. Zhang, “A deep reinforcement learning-based adaptive large neighborhood search for capacitatedelectric vehicle routing problems,” IEEE Trans. Emerg. Top. Comput. Intell., pp. 1–14, 2024.
  11. M. A. Akbay, C. B. Kalayci, and C. Blum, “Application of CMSA to the electric vehicle routing problem with time windows, simultaneous pickup and deliveries, and partial vehicle charging,” in Proceedings of MIC’2022, Syracuse, Italy, Jul 2022, pp. 1–16.
  12. M. Schneider, A. Stenger, and D. Goeke, “The electric vehicle-routing problem with time windows and recharging stations,” Transp. Sci., vol. 48, no. 4, pp. 500–520, 2014.
  13. J. Dethloff, “Vehicle routing and reverse logistics: The vehicle routing problem with simultaneous delivery and pick-up,” OR Spectr., vol. 23, no. 1, pp. 79–96, 2001.
  14. N. A. Wassan, A. H. Wassan, and G. Nagy, “A reactive tabu search algorithm for the vehicle routing problem with simultaneous pickups and deliveries,” J. Comb. Optim., vol. 15, no. 4, pp. 368–386, 2008.
  15. M. Keskin and B. Çatay, “Partial recharge strategies for the electric vehicle routing problem with time windows,” Transp. Res. Part C Emerg. Technol., vol. 65, pp. 111–127, 2016.
  16. G. Desaulniers, F. Errico, S. Irnich, and M. Schneider, “Exact algorithms for electric vehicle-routing problems with time windows,” Oper. Res., vol. 64, no. 6, pp. 1388–1405, 2016.
  17. M. A. Akbay, C. Blum, and C. B. Kalayci, “Cmsa algorithms for the electric vehicle routing problem with simultaneous pickup and deliveries, time windows and partial battery charging,” 2023, available at SSRN: http://dx.doi.org/10.2139/ssrn.4459937.
  18. F. Feng, B. Qian, R. Hu, N. Yu, and Q. Shang, “ADMM with SUSLM for electric vehicle routing problem with simultaneous pickup and delivery and time windows,” in Proceedings of ICIC’2023, Zhengzhou, China, Aug 2023, pp. 15–24.
  19. S. Liu, K. Tang, and X. Yao, “Memetic search for vehicle routing with simultaneous pickup-delivery and time windows,” Swarm Evol. Comput., vol. 66, p. 100927, 2021.
  20. W. Wang and J. Zhao, “Partial linear recharging strategy for the electric fleet size and mix vehicle routing problem with time windows and recharging stations,” Eur. J. Oper. Res., vol. 308, no. 2, pp. 929–948, 2023.
  21. M. Keskin and B. Çatay, “A matheuristic method for the electric vehicle routing problem with time windows and fast chargers,” Comput. Oper. Res., vol. 100, pp. 172–188, 2018.
  22. M. Keskin, B. Çatay, and G. Laporte, “A simulation-based heuristic for the electric vehicle routing problem with time windows and stochastic waiting times at recharging stations,” Comput. Oper. Res., vol. 125, p. 105060, 2021.
  23. G. Berbeglia, J.-F. Cordeau, I. Gribkovskaia, and G. Laporte, “Static pickup and delivery problems: a classification scheme and survey,” Top, vol. 15, pp. 1–31, 2007.
  24. Ç. Koç, G. Laporte, and I. Tükenmez, “A review of vehicle routing with simultaneous pickup and delivery,” Comput. Oper. Res., vol. 122, p. 104987, 2020.
  25. K. Tang, S. Liu, P. Yang, and X. Yao, “Few-shots parallel algorithm portfolio construction via co-evolution,” IEEE Trans. Evol. Comput., vol. 25, no. 3, pp. 595–607, 2021.
  26. H. Min, “The multiple vehicle routing problem with simultaneous delivery and pick-up points,” Transp. Res. Part A: Gen., vol. 23, no. 5, pp. 377–386, 1989.
  27. F. A. T. Montané and R. D. Galvão, “Vehicle routing problems with simultaneous pick-up and delivery service,” Opsearch, vol. 39, pp. 19–33, 2002.
  28. Y. Gajpal and P. L. Abad, “Saving-based algorithms for vehicle routing problem with simultaneous pickup and delivery,” J. Oper. Res. Soc., vol. 61, no. 10, pp. 1498–1509, 2010.
  29. H. Mao, J. Shi, Y. Zhou, and G. Zhang, “The electric vehicle routing problem with time windows and multiple recharging options,” IEEE Access, vol. 8, pp. 114 864–114 875, 2020.
  30. J. Lu, “Study on distribution path planning of electric logistics vehicles under partial charging strategy,” Acad. J. Sci. Technol., vol. 10, no. 1, pp. 202–210, 2024.
  31. R. Roberti and M. Wen, “The electric traveling salesman problem with time windows,” Transp. Res. Part E Logist. Transp. Rev., vol. 89, pp. 32–52, 2016.
  32. Á. Felipe, M. T. Ortuño, G. Righini, and G. Tirado, “A heuristic approach for the green vehicle routing problem with multiple technologies and partial recharges,” Transp. Res. Part E Logist. Transp. Rev., vol. 71, pp. 111–128, 2014.
  33. A. Santini, M. Schneider, T. Vidal, and D. Vigo, “Decomposition strategies for vehicle routing heuristics,” INFORMS J. Comput., vol. 35, no. 3, pp. 543–559, 2023.
  34. S. Salhi and G. Nagy, “A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling,” J. Oper. Res. Soc., vol. 50, no. 10, pp. 1034–1042, 1999.
  35. S. Liu, Y. Zhang, K. Tang, and X. Yao, “How good is neural combinatorial optimization? A systematic evaluation on the traveling salesman problem,” IEEE Comput. Intell. Mag., vol. 18, no. 3, pp. 14–28, 2023.
  36. K. Tang and X. Yao, “Learn to optimize-a brief overview,” Natl. Sci. Rev., p. nwae132, 2024.
  37. S. Liu, C. Chen, X. Qu, K. Tang, and Y.-S. Ong, “Large language models as evolutionary optimizers,” in Proceedings of the IEEE CEC’2024, Yokohama, Japan, Jun 2024, pp. 1–8.

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now

Collections

Sign up for free to add this paper to one or more collections.

Sign Up