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

DOI10.1007/S11590-020-01594-ZzbMATH Open1461.90121OpenAlexW3033868151MaRDI QIDQ1996758FDOQ1996758

Authors: 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

Recommendations

• An improved formulation for the multi-depot open vehicle routing problem
• A hybrid genetic algorithm for the multi-depot open vehicle routing problem
• A new matheuristic approach for the multi-depot vehicle routing problem with inter-depot routes
• Solving min-max multi-depot vehicle routing problem
• A new tabu search heuristic for the open vehicle routing problem

zbMATH Keywords

optimization modelmathematical formulationmulti-depot open vehicle routing problemsub-tour elimination constraints

Mathematics Subject Classification ID

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

Cites Work

• Integer Programming Formulation of Traveling Salesman Problems
• A heuristic method for the open vehicle routing problem
• A tabu search heuristic for periodic and multi-depot vehicle routing problems
• Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
• A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for the capacitated vehicle routing problem
• The multi-depot vehicle routing problem with heterogeneous vehicle fleet: formulation and a variable neighborhood search implementation
• A hybrid genetic algorithm for the multi-depot open vehicle routing problem
• An improved formulation for the multi-depot open 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

Cited In (7)

• 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
• A general VNS for the multi-depot open vehicle routing problem with time windows
• A node current-based 2-index formulation for the fixed-destination multi-depot travelling salesman problem
• A new matheuristic approach for the multi-depot vehicle routing problem with inter-depot routes
• An improved formulation for the multi-depot open vehicle routing problem
• On the exact solution of 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

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