An efficient multistart heuristic for the driver and vehicle routing problem
From MaRDI portal
Publication:2108177
DOI10.1016/j.cor.2022.106076OpenAlexW4308289265MaRDI QIDQ2108177
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)
Full work available at URL: https://doi.org/10.1016/j.cor.2022.106076
Cites Work
- The multi-depot vehicle routing problem with inter-depot routes
- Integrated airline scheduling
- Handbook of transportation science.
- The driver and vehicle routing problem
- An exact algorithm for a vehicle-and-driver scheduling problem
- A new matheuristic approach for the multi-depot vehicle routing problem with inter-depot routes
- Set partitioning/covering-based approaches for the integrated vehicle and crew scheduling problem
- 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
- An efficient variable neighborhood search with tabu shaking for a class of multi-depot vehicle routing problems
- The Truck Dispatching Problem
- Benders Decomposition for Simultaneous Aircraft Routing and Crew Scheduling
This page was built for publication: An efficient multistart heuristic for the driver and vehicle routing problem