An improved formulation for the multi-depot open vehicle routing problem

DOI10.1007/s00291-015-0408-9zbMath1336.90019DBLPjournals/ors/Lalla-RuizITV16OpenAlexW863933106WikidataQ57866656 ScholiaQ57866656MaRDI QIDQ5964850

Christopher Expósito-Izquierdo, Eduardo Lalla-Ruiz, Stefan Voß, Shervin Taheripour

Publication date: 1 March 2016

Published in: OR Spectrum (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00291-015-0408-9

zbMATH Keywords

mathematical modeldelivery of goodsmulti-depot open vehicle routing problem

Mathematics Subject Classification ID

Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06)

Related Items (9)

An adaptive tabu search algorithm embedded with iterated local search and route elimination for the bike repositioning and recycling problem ⋮ A memory-based iterated local search 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 probabilistic uncapacitated open vehicle routing location problem ⋮ Alternative formulations and improved bounds for the multi-depot fleet size and mix vehicle routing problem ⋮ Flexible two-echelon location routing problem ⋮ Mathematical formulations and improvements for the multi-depot open vehicle routing problem ⋮ A multi-period analysis of the integrated item-sharing and crowdshipping problem ⋮ Scheduling heterogeneous delivery tasks on a mixed logistics platform

Cites Work

• Unnamed Item
• A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for the capacitated vehicle routing problem
• A tabu search algorithm for the open vehicle routing problem
• A general heuristic for vehicle routing problems
• The open vehicle routing problem: algorithms, large-scale test problems, and computational results
• A hybrid evolution strategy for the 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
• Integrating multi-product production and distribution in newspaper logistics
• The Truck Dispatching 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

This page was built for publication: An improved formulation for the multi-depot open vehicle routing problem