TY - JOUR
T1 - An improved formulation for the multi-depot open vehicle routing problem
AU - Lalla-Ruiz, Eduardo
AU - Expósito-Izquierdo, Christopher
AU - Taheripour, Shervin
AU - Voß, Stefan
PY - 2016/1/1
Y1 - 2016/1/1
N2 - 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.
AB - 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.
KW - Delivery of goods
KW - Mathematical model
KW - Multi-depot open vehicle routing problem
UR - http://www.scopus.com/inward/record.url?scp=84954365332&partnerID=8YFLogxK
U2 - 10.1007/s00291-015-0408-9
DO - 10.1007/s00291-015-0408-9
M3 - Article
AN - SCOPUS:84954365332
VL - 38
SP - 175
EP - 187
JO - OR Spectrum = OR Spektrum
JF - OR Spectrum = OR Spektrum
SN - 0171-6468
IS - 1
ER -