RoutingBlocks: An Open-Source Python Package for Vehicle Routing Problems with Intermediate Stops

Published Online:https://doi.org/10.1287/ijoc.2023.0104

References

  • Accorsi L, Vigo D (2021) A fast and scalable heuristic for the solution of large-scale capacitated vehicle routing problems. Transportation Sci. 55(4):832–856.LinkGoogle Scholar
  • Beek O, Raa B, Dullaert W, Vigo D (2018) An efficient implementation of a static move descriptor-based local search heuristic. Comput. Oper. Res. 94:1–10.CrossrefGoogle Scholar
  • Erdelić T, Carić T (2022) Goods delivery with electric vehicles: Electric vehicle routing optimization with time windows and partial or full recharge. Energies 15(1):285.CrossrefGoogle Scholar
  • Froger A, Jabali O, Mendoza JE, Laporte G (2022) The electric vehicle routing problem with capacitated charging stations. Transportation Sci. 56(2):460–482.LinkGoogle Scholar
  • Goeke D, Schneider M (2015) Routing a mixed fleet of electric and conventional vehicles. Eur. J. Oper. Res. 245(1):81–99.CrossrefGoogle Scholar
  • Groer C (2009) Vrph. https://github.com/coin-or/VRPH.Google Scholar
  • Irnich S (2008) A unified modeling and solution framework for vehicle routing and local search-based metaheuristics. INFORMS J. Comput. 20(2):270–287.LinkGoogle Scholar
  • Kindervater GAP, Savelsbergh MWP (2003) Vehicle routing: Handling edge exchanges. Local Search in Combinatorial Optimization (Princeton University Press, Princeton, NJ), 337–360.CrossrefGoogle Scholar
  • Kullman ND, Froger A, Mendoza JE, Goodson JC (2021) frvcpy: An open-source solver for the fixed route vehicle charging problem. INFORMS J. Comput. 33(4):1277–1283.LinkGoogle Scholar
  • Mendoza J, Guéret C, Hoskins M, Lobit H, Pillac V, Vidal T, Vigo D (2014) Vrp-rep: A vehicle routing community repository. Accessed January 17, 2024, http://www.vrp-rep.org/.Google Scholar
  • Montoya A, Guéret C, Mendoza JE, Villegas JG (2017) The electric vehicle routing problem with nonlinear charging function. Transportation Res. Part B: Methodological 103:87–110.CrossrefGoogle Scholar
  • Peng L, Murray C (2022) VeRoViz: A vehicle routing visualization toolkit. INFORMS J. Comput. 34(4):1842–1848.LinkGoogle Scholar
  • Pisinger D, Ropke S (2007) A general heuristic for vehicle routing problems. Comput. Oper. Res. 34(8):2403–2435.CrossrefGoogle Scholar
  • Rasku J, Kwon C (2023) VeRyPy. https://github.com/yorak/VeRyPy.Google Scholar
  • Ropke S, Pisinger D (2006) An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transportation Sci. 40(4):455–472.LinkGoogle Scholar
  • Schiffer M (2017) Logistics networks with intermediate stops: Designing innovative and green solutions. Doctoral dissertation, Rheinisch-Westfälische Technische Hochschule Aachen, Aachen, Germany.Google Scholar
  • Schiffer M, Walther G (2018) An adaptive large neighborhood search for the location-routing problem with intra-route facilities. Transportation Sci. 52(2):331–352.LinkGoogle Scholar
  • Schiffer M, Schneider M, Walther G, Laporte G (2019) Vehicle routing and location routing with intermediate stops: A review. Transportation Sci. 53(2):319–343.LinkGoogle Scholar
  • Schneider M, Stenger A, Goeke D (2014) The electric vehicle-routing problem with time windows and recharging stations. Transportation Sci. 48(4):500–520.LinkGoogle Scholar
  • Shaw P (1997) A new local search algorithm providing high quality solutions to vehicle routing problems. APES Group (Department of Computer Science, University of Strathclyde, Glasgow, UK), 46.Google Scholar
  • Vidal T (2022) Hybrid genetic search for the CVRP: Open-source implementation and SWAP* neighborhood. Comput. Oper. Res. 140:105643.CrossrefGoogle Scholar
  • Vidal T, Crainic TG, Gendreau M, Prins C (2014) A unified solution framework for multi-attribute vehicle routing problems. Eur. J. Oper. Res. 234(3):658–673.CrossrefGoogle Scholar
  • Zachariadis EE, Kiranoudis CT (2010) A strategy for reducing the computational complexity of local search-based methods for the vehicle routing problem. Comput. Oper. Res. 37(12):2089–2105.CrossrefGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.