TY - JOUR
T1 - A branch-and-price algorithm for the Vehicle Routing Problem with Deliveries, Selective Pickups and Time Windows
AU - Gutiérrez-Jarpa, Gabriel
AU - Desaulniers, Guy
AU - Laporte, Gilbert
AU - Marianov, Vladimir
N1 - Funding Information:
This work was partly funded by the Canadian Natural Sciences and Engineering Research Council under grants 157935-07 and 39682-05 , by FONDECYT grant 1070741 , Instituto Milenio “Complex Engineering Systems”, and by the GSEP program of the Canadian bureau for International Education. This support is gratefully acknowledged. Thanks are due to the referees for their valuable comments.
PY - 2010/10/16
Y1 - 2010/10/16
N2 - In the Vehicle Routing Problem with Deliveries, Selective Pickups and Time Windows, the set of customers is the union of delivery customers and pickup customers. A fleet of identical capacitated vehicles based at the depot must perform all deliveries and profitable pickups while respecting time windows. The objective is to minimize routing costs, minus the revenue associated with the pickups. Five variants of the problem are considered according to the order imposed on deliveries and pickups. An exact branch-and-price algorithm is developed for the problem. Computational results are reported for instances containing up to 100 customers.
AB - In the Vehicle Routing Problem with Deliveries, Selective Pickups and Time Windows, the set of customers is the union of delivery customers and pickup customers. A fleet of identical capacitated vehicles based at the depot must perform all deliveries and profitable pickups while respecting time windows. The objective is to minimize routing costs, minus the revenue associated with the pickups. Five variants of the problem are considered according to the order imposed on deliveries and pickups. An exact branch-and-price algorithm is developed for the problem. Computational results are reported for instances containing up to 100 customers.
KW - Branch-and-price
KW - Deliveries and selective pickups
KW - Shortest paths with resources
KW - Time windows
KW - Transportation
KW - Vehicle routing
UR - http://www.scopus.com/inward/record.url?scp=77950368835&partnerID=8YFLogxK
U2 - 10.1016/j.ejor.2010.02.037
DO - 10.1016/j.ejor.2010.02.037
M3 - Article
AN - SCOPUS:77950368835
SN - 0377-2217
VL - 206
SP - 341
EP - 349
JO - European Journal of Operational Research
JF - European Journal of Operational Research
IS - 2
ER -