Skip to main content
SpringerLink
Log in

Application of CMSA to the Electric Vehicle Routing Problem with Time Windows, Simultaneous Pickup and Deliveries, and Partial Vehicle Charging

  • Conference paper
  • First Online:
Metaheuristics (MIC 2022)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 13838))

Included in the following conference series:

Abstract

As a consequence of the growing importance of environmental issues, partially due to a negative impact of transportation activities, the use of environmentally-friendly vehicles in logistics has become one of the prominent concepts in recent years. In this line, this paper addresses a variant of the vehicle routing problem, the electric vehicle routing problem with time windows and simultaneous pickup and deliveries, which are two essential real-life constraints. Moreover, we consider partial recharging of electric vehicles at charging stations. A recent self-adaptive variant of the matheuristic “Construct, Merge, Solve & Adapt” (CMSA) is applied to solve the tackled problem. CMSA combines heuristic elements, such as the probabilistic generation of solutions, with an exact solver that is iteratively applied to sub-instances of the original problem instances. Two constructive heuristics, a Clark & Wright Savings algorithm and a sequential insertion heuristic, are probabilistically applied to generate solutions which are then subsequently merged to form a sub-instance. The numerical results show that CMSA outperforms CPLEX in the context of small problem instances. Moreover, it is shown that CMSA outperforms the heuristic algorithms when large problem instances are concerned.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 69.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 89.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    https://www.ibm.com/analytics/cplex-optimizer.

  2. 2.

    http://www.gurobi.com/.

  3. 3.

    Remember that solutions constructed with a high value of \(\alpha _{\textrm{bsf}}\) will be rather similar to \(S^{\textrm{bsf}}\).

References

  1. Akbay, M.A., Blum, C.: Application of CMSA to the minimum positive influence dominating set problem. In: Artificial Intelligence Research and Development, pp. 17–26. IOS Press (2021)

    Google Scholar 

  2. Akbay, M.A., López Serrano, A., Blum, C.: A self-adaptive variant of CMSA: application to the minimum positive influence dominating set problem. Int. J. Comput. Intell. Syst. 15(1), 1–13 (2022). Springer

    Article  Google Scholar 

  3. Arora, D., Maini, P., Pinacho-Davidson, P., Blum, C.: Route planning for cooperative air-ground robots with fuel constraints: an approach based on CMSA. In: Proceedings of GECCO 2019 - Genetic and Evolutionary Computation Conference, pp. 207–214. Association for Computing Machinery, New York (2019)

    Google Scholar 

  4. Asghari, M., Al-e Hashem, S.M.J.M.: Green vehicle routing problem: a state-of-the-art review. Int. J. Prod. Econ. 231, 107899 (2021)

    Google Scholar 

  5. Blum, C., Pinacho Davidson, P., López-Ibáñez, M., Lozano, J.A.: Construct, merge, solve & adapt: a new general algorithm for combinatorial optimization. Comput. Oper. Res. 68, 75–88 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  6. Blum, C., Raidl, G.R.: Hybrid Metaheuristics - Powerful Tools for Optimization. Artificial Intelligence: Foundations, Theory, and Algorithms, Springer, Switzerland (2016). https://doi.org/10.1007/978-3-319-30883-8

  7. Boschetti, M.A., Maniezzo, V., Roffilli, M., Bolufé Röhler, A.: Matheuristics: optimization, simulation and control. In: Blesa, M.J., Blum, C., Di Gaspero, L., Roli, A., Sampels, M., Schaerf, A. (eds.) HM 2009. LNCS, vol. 5818, pp. 171–177. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-04918-7_13

    Chapter  Google Scholar 

  8. Clarke, G., Wright, J.W.: Scheduling of vehicles from a central depot to a number of delivery points. Oper. Res. 12(4), 568–581 (1964)

    Article  Google Scholar 

  9. Conrad, R.G., Figliozzi, M.A.: The recharging vehicle routing problem. In: Proceedings of the 2011 Industrial Engineering Research Conference, p. 8. IISE Norcross, GA (2011)

    Google Scholar 

  10. Dantzig, G.B., Ramser, J.H.: The truck dispatching problem. Manage. Sci. 6(1), 80–91 (1959)

    Article  MathSciNet  MATH  Google Scholar 

  11. Dethloff, J.: Vehicle routing and reverse logistics: the vehicle routing probleam with simultaneous delivery and pick-up. OR-Spektr. 23(1), 79–96 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  12. Duman, E.N., Taş, D., Çatay, B.: Branch-and-price-and-cut methods for the electric vehicle routing problem with time windows. Int. J. Prod. Res. 60(17), 5332–5353 (2022). Taylor & Francis

    Google Scholar 

  13. Dupin, N., Talbi, E.G.: Matheuristics to optimize refueling and maintenance planning of nuclear power plants. J. Heurist. 27(1), 63–105 (2021)

    Article  Google Scholar 

  14. Elshaer, R., Awad, H.: A taxonomic review of metaheuristic algorithms for solving the vehicle routing problem and its variants. Comput. Industr. Eng. 140, 106242 (2020)

    Google Scholar 

  15. Erdoğan, S., Miller-Hooks, E.: A green vehicle routing problem. Transp. Res. Part E: Logist. Transp. Rev. 48(1), 100–114 (2012)

    Article  Google Scholar 

  16. Felipe, Á., Ortuño, M.T., Righini, G., Tirado, G.: A heuristic approach for the green vehicle routing problem with multiple technologies and partial recharges. Transp. Res. Part E: Logist. Transp. Rev. 71, 111–128 (2014)

    Article  Google Scholar 

  17. Ferrer, J., Chicano, F., Ortega-Toro, J.A.: CMSA algorithm for solving the prioritized pairwise test data generation problem in software product lines. J. Heurist. 27(1), 229–249 (2021)

    Article  Google Scholar 

  18. Fischetti, M., Fischetti, M.: Matheuristics, pp. 121–153. Springer, Heidelberg (2018)

    Google Scholar 

  19. Golden, B.L., Raghavan, S., Wasil, E.A.: The Vehicle Routing Problem: Latest Advances and New Challenges, vol. 43. Springer, New York (2008). https://doi.org/10.1007/978-0-387-77778-8

    Book  MATH  Google Scholar 

  20. Huerta-Rojo, A., Montero, E., Rojas-Morales, N.: An ant-based approach to solve the electric vehicle routing problem with time windows and partial recharges. In: 2021 40th International Conference of the Chilean Computer Science Society (SCCC), pp. 1–8. IEEE (2021)

    Google Scholar 

  21. Keskin, M., Çatay, B.: Partial recharge strategies for the electric vehicle routing problem with time windows. Transp. Res. Part C: Emerg. Technol. 65, 111–127 (2016)

    Article  Google Scholar 

  22. Keskin, M., Çatay, B.: A matheuristic method for the electric vehicle routing problem with time windows and fast chargers. Comput. Oper. Res. 100, 172–188 (2018)

    Article  MathSciNet  MATH  Google Scholar 

  23. Keskin, M., Çatay, B., Laporte, G.: A simulation-based heuristic for the electric vehicle routing problem with time windows and stochastic waiting times at recharging stations. Comput. Oper. Res. 125, 105060 (2021)

    Google Scholar 

  24. Koç, Ç., Laporte, G., Tükenmez, İ: A review of vehicle routing with simultaneous pickup and delivery. Comput. Oper. Res. 122, 104987 (2020)

    Google Scholar 

  25. Lewis, R., Thiruvady, D., Morgan, K.: Finding happiness: an analysis of the maximum happy vertices problem. Comput. Oper. Res. 103, 265–276 (2019)

    Article  MathSciNet  MATH  Google Scholar 

  26. López-Ibánez, M., et al.: The irace package: iterated racing for automatic algorithm configuration. Oper. Res. Perspect. 3, 43–58 (2016)

    MathSciNet  Google Scholar 

  27. Moghdani, R., Salimifard, K., Demir, E., Benyettou, A.: The green vehicle routing problem: a systematic literature review. J. Clean. Prod. 279, 123691 (2021)

    Article  Google Scholar 

  28. Montoya, A., Guéret, C., Mendoza, J.E., Villegas, J.G.: The electric vehicle routing problem with nonlinear charging function. Transp. Res. Part B: Methodol. 103, 87–110 (2017)

    Article  Google Scholar 

  29. Montoya-Torres, J.R., Franco, J.L., Isaza, S.N., Jiménez, H.F., Herazo-Padilla, N.: A literature review on the vehicle routing problem with multiple depots. Comput. Industr. Eng. 79, 115–129 (2015)

    Article  Google Scholar 

  30. Paessens, H.: The savings algorithm for the vehicle routing problem. Eur. J. Oper. Res. 34(3), 336–344 (1988)

    Article  MATH  Google Scholar 

  31. Sadati, M.E.H., Çatay, B.: A hybrid variable neighborhood search approach for the multi-depot green vehicle routing problem. Transp. Res. Part E: Logist. Transp. Rev. 149, 102293 (2021)

    Article  Google Scholar 

  32. Salhi, S., Nagy, G.: A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling. J. Oper. Res. Soc. 50(10), 1034–1042 (1999)

    Article  MATH  Google Scholar 

  33. Schneider, M., Stenger, A., Goeke, D.: The electric vehicle-routing problem with time windows and recharging stations. Transp. Sci. 48(4), 500–520 (2014)

    Article  Google Scholar 

  34. Toth, P., Vigo, D.: Vehicle Routing: Problems, Methods, and Applications. SIAM (2014)

    Google Scholar 

  35. Wassan, N.A., Wassan, A.H., Nagy, G.: A reactive tabu search algorithm for the vehicle routing problem with simultaneous pickups and deliveries. J. Comb. Optim. 15(4), 368–386 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  36. Yellow, P.: A computational modification to the savings method of vehicle scheduling. J. Oper. Res. Soc. 21(2), 281–283 (1970)

    Article  Google Scholar 

Download references

Acknowledgements

This paper was supported by grants PID2019-104156GB-I00 and TED2021-129319B-I00 funded by MCIN/AEI/10.13039 /501100011033. Moreover, M.A. Akbay and C.B. Kalayci acknowledge support from the Technological Research Council of Turkey (TUBITAK) under grant number 119M236. The corresponding author was funded by the Ministry of National Education, Turkey (Scholarship program: YLYS-2019).

Author information

Authors and Affiliations

  1. Artificial Intelligence Research Institute (IIIA-CSIC), Campus UAB, Bellaterra, Spain

    Mehmet Anıl Akbay & Christian Blum

  2. Department of Industrial Engineering, Pamukkale University, Denizli, Turkey

    Can Berk Kalayci

Authors
  1. Mehmet Anıl Akbay
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Can Berk Kalayci
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Christian Blum
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Mehmet Anıl Akbay .

Editor information

Editors and Affiliations

  1. University of Udine, Udine, Italy

    Luca Di Gaspero

  2. University of Napoli - Federico II, Napoli, Italy

    Paola Festa

  3. University of Paris Est, Paris, France

    Amir Nakib

  4. University of Catania, Catania, Italy

    Mario Pavone

Rights and permissions

Reprints and permissions

Copyright information

© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Akbay, M.A., Kalayci, C.B., Blum, C. (2023). Application of CMSA to the Electric Vehicle Routing Problem with Time Windows, Simultaneous Pickup and Deliveries, and Partial Vehicle Charging. In: Di Gaspero, L., Festa, P., Nakib, A., Pavone, M. (eds) Metaheuristics. MIC 2022. Lecture Notes in Computer Science, vol 13838. Springer, Cham. https://doi.org/10.1007/978-3-031-26504-4_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-26504-4_1

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-26503-7

  • Online ISBN: 978-3-031-26504-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation