Mathematical formulations and improvements for the multi-depot open vehicle routing problem

DOI10.1007/s11590-020-01594-zzbMath1461.90121OpenAlexW3033868151MaRDI QIDQ1996758

Eduardo Lalla-Ruiz, Martijn Mes

Publication date: 26 February 2021

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-020-01594-z

zbMATH Keywords

optimization modelmulti-depot open vehicle routing problemmathematical formulationsub-tour elimination constraints

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27)

Related Items (2)

An efficient variable neighborhood search with tabu shaking for a class of multi-depot vehicle routing problems ⋮ A general VNS for the multi-depot open vehicle routing problem with time windows

Cites Work

• The multi-depot vehicle routing problem with heterogeneous vehicle fleet: formulation and a variable neighborhood search implementation
• A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for the capacitated vehicle routing problem
• A POPMUSIC approach for the multi-depot cumulative capacitated vehicle routing problem
• A memory-based iterated local search algorithm for the multi-depot open vehicle routing problem
• Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
• A hybrid genetic algorithm for the multi-depot open vehicle routing problem
• A heuristic method for the open vehicle routing problem
• Integer Programming Formulation of Traveling Salesman Problems
• A tabu search heuristic for periodic and multi-depot vehicle routing problems
• An improved formulation for the multi-depot open vehicle routing problem

This page was built for publication: Mathematical formulations and improvements for the multi-depot open vehicle routing problem