An improved formulation for the multi-depot open vehicle routing problem
- 8 July 2015
- journal article
- research article
- Published by Springer Nature in OR Spectrum
- Vol. 38 (1) , 175-187
Abstract
No abstract availableKeywords
Funding Information
- Spanish Ministry of Economy and Competitiveness (TIN2012-32608)
- Spanish Ministry of Economy and Competitiveness (TIN2012-32608)
This publication has 15 references indexed in Scilit:
- A hybrid genetic algorithm for the multi-depot open vehicle routing problemOR Spectrum, 2012
- A branch-and-cut algorithm for the capacitated open vehicle routing problemJournal of the Operational Research Society, 2007
- The open vehicle routing problem: Algorithms, large-scale test problems, and computational resultsComputers & Operations Research, 2007
- A general heuristic for vehicle routing problemsComputers & Operations Research, 2007
- A note on the lifted Miller–Tucker–Zemlin subtour elimination constraints for the capacitated vehicle routing problemEuropean Journal of Operational Research, 2004
- A tabu search algorithm for the open vehicle routing problemEuropean Journal of Operational Research, 2004
- A tabu search heuristic for periodic and multi-depot vehicle routing problemsNetworks, 1997
- Improvements and extensions to the Miller-Tucker-Zemlin subtour elimination constraintsOperations Research Letters, 1991
- Integer Programming Formulation of Traveling Salesman ProblemsJournal of the ACM, 1960
- The Truck Dispatching ProblemManagement Science, 1959