On the exact solution of the multi-depot open vehicle routing problem
From MaRDI portal
Publication:6492461
DOI10.1007/S11590-023-02072-YMaRDI QIDQ6492461
Unnamed Author, Marcos Costa Roboredo
Publication date: 25 April 2024
Published in: Optimization Letters (Search for Journal in Brave)
Cites Work
- A hybrid algorithm for a class of vehicle routing problems
- An open vehicle routing problem metaheuristic for examining wide solution neighborhoods
- New benchmark instances for the capacitated vehicle routing problem
- Mathematical formulations and improvements for the multi-depot open vehicle routing problem
- A memory-based iterated local search algorithm for the multi-depot open vehicle routing problem
- A generic exact solver for vehicle routing and related problems
- A hybrid genetic algorithm for the multi-depot open vehicle routing problem
- An efficient variable neighborhood search with tabu shaking for a class of multi-depot vehicle routing problems
- The Truck Dispatching Problem
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- A tabu search heuristic for periodic and multi-depot vehicle routing problems
- A unified tabu search heuristic for vehicle routing problems with time windows
- An improved formulation for the multi-depot open vehicle routing problem
- A general VNS for the multi-depot open vehicle routing problem with time windows
This page was built for publication: On the exact solution of the multi-depot open vehicle routing problem
