An efficient multistart heuristic for the driver and vehicle routing problem

DOI10.1016/J.COR.2022.106076MaRDI QIDQ2108177zbMATH OpenOpenAlexFDO

Authors Bencomo Domínguez-Martín, Inmaculada Rodríguez-Martín, Juan-José Salazar-González

Publication date 19 December 2022

Published in Computers \& Operations Research (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.1016/j.cor.2022.106076

zbMATH Keywords

drivers and vehiclesmulti-depotmultistart heuristicvehicle routing

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Recommendations

• The driver and vehicle routing problem
• The multi-depot vehicle routing problem with inter-depot routes
• Solving min-max multi-depot vehicle routing problem
• A new matheuristic approach for the multi-depot vehicle routing problem with inter-depot routes
• Open vehicle routing problem with driver nodes and time deadlines

Cites work

• A new matheuristic approach for the multi-depot vehicle routing problem with inter-depot routes
• An efficient variable neighborhood search with tabu shaking for a class of multi-depot vehicle routing problems
• An exact algorithm for a vehicle-and-driver scheduling problem
• Benders Decomposition for Simultaneous Aircraft Routing and Crew Scheduling
• Handbook of transportation science.
• Integrated airline scheduling
• Models and algorithms for integration of vehicle and crew scheduling
• Principles and practice of constraint programming. 21st international conference, CP 2015, Cork, Ireland, August 31 -- September 4, 2015. Proceedings
• Set partitioning/covering-based approaches for the integrated vehicle and crew scheduling problem
• The driver and vehicle routing problem
• The multi-depot vehicle routing problem with inter-depot routes
• The truck dispatching problem

Cited in

(3)

• MIRHA: multi-start biased randomization of heuristics with adaptive local search for solving non-smooth routing problems
• Multistart Branch and Bound for Large Asymmetric Distance-Constrained Vehicle Routing Problem
• Driver-centric urban logistics optimization: vehicle routing with heterogeneous fixed drivers

This page was built for publication: An efficient multistart heuristic for the driver and vehicle routing problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2108177)