Mathematical formulations and improvements for the multi-depot open vehicle routing problem
type: Item
instance of: scholarly article
title: Mathematical formulations and improvements for the multi-depot open vehicle routing problem
zbMATH Open document ID: 1461.90121
author: Eduardo Lalla-Ruiz
author: Martijn Mes
published in: Optimization Letters
publication date: 2021-02-26T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90B06
zbMATH DE Number: 7315902
zbMATH Keywords: multi-depot open vehicle routing problem
zbMATH Keywords: mathematical formulation
zbMATH Keywords: optimization model
zbMATH Keywords: sub-tour elimination constraints
MaRDI profile type: Publication
full work available at URL: s11590-020-01594-z
OpenAlex ID: W3033868151
cites work: A memory-based iterated local search algorithm for the multi-depot open vehicle routing problem
cites work: A tabu search heuristic for periodic and multi-depot vehicle routing problems
cites work: Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
cites work: A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for the capacitated vehicle routing problem
cites work: An improved formulation for the multi-depot open vehicle routing problem
cites work: A POPMUSIC approach for the multi-depot cumulative capacitated vehicle routing problem
cites work: A hybrid genetic algorithm for the multi-depot open vehicle routing problem
cites work: Integer Programming Formulation of Traveling Salesman Problems
cites work: The multi-depot vehicle routing problem with heterogeneous vehicle fleet: formulation and a variable neighborhood search implementation
cites work: A heuristic method for the open vehicle routing problem
DOI: 10.1007/S11590-020-01594-Z
description: scientific article; zbMATH DE number 7315902