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

The multi-depot open vehicle routing problem (MDOVRP) is a recent hard combinatorial optimization problem that belongs to the vehicle routing problem family. In the MDOVRP, the vehicles depart from several depots and once they have delivered the goods to the last customers in their routes they are n...

Full description

Saved in:
Bibliographic Details
Published inOR Spectrum Vol. 38; no. 1; pp. 175 - 187
Main Authors Lalla-Ruiz, Eduardo, Expósito-Izquierdo, Christopher, Taheripour, Shervin, Voß, Stefan
Format Journal Article
LanguageEnglish
Published Berlin/Heidelberg Springer Berlin Heidelberg 01.01.2016
Springer Nature B.V
Subjects
Algorithms
Business and Management
Calculus of Variations and Optimal Control; Optimization
Combinatorial analysis
Computation
Customers
Energy consumption
Integer programming
Linear programming
Logistics
Mathematical models
Operations research
Operations Research/Decision Theory
Optimization
Regular Article
Route selection
Routing
Studies
Vehicles
Mathematical model
Delivery of goods
Multi-depot open vehicle routing problem
Online AccessGet full text

Cover

More Information
Summary:The multi-depot open vehicle routing problem (MDOVRP) is a recent hard combinatorial optimization problem that belongs to the vehicle routing problem family. In the MDOVRP, the vehicles depart from several depots and once they have delivered the goods to the last customers in their routes they are not required to return to the depots. In this work, we propose a new mixed integer programming formulation for the MDOVRP by improving some constraints from the literature and proposing new ones. The computational experience carried out over problem instances from the literature indicates that our proposed model outperforms the existing one.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:0171-6468
1436-6304
DOI:10.1007/s00291-015-0408-9