A branch-and-price algorithm for the Vehicle Routing Problem with Deliveries, Selective Pickups and Time Windows

Gutierrez Jarpa, Gabriel; Desaulniers, Guy; Laporte, Gilbert; Marianov, Vladimir

A branch-and-price algorithm for the Vehicle Routing Problem with Deliveries, Selective Pickups and Time Windows

Files

A branch-and-price algorithm for the Vehicle Routing Problem with Deliveries, Selective Pickups and Time Windows.pdf(2.4 KB)

Date

2010

Authors

Gutierrez Jarpa, Gabriel

Desaulniers, Guy

Laporte, Gilbert

Marianov, Vladimir

Publisher

ELSEVIER

Abstract

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. (C) 2010 Elsevier B.V. All rights reserved.

Keywords

Transportation, Vehicle routing, Deliveries and selective pickups, Time windows, Branch-and-price, Shortest paths with resources, SHORTEST-PATH PROBLEM

URI

https://doi.org/10.1016/j.ejor.2010.02.037
https://repositorio.uc.cl/handle/11534/76829

Collections

Artículos de revistas

Full item page