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

dc.creatorGutierrez Jarpa, Gabriel
dc.creatorDesaulniers, Guy
dc.creatorLaporte, Gilbert
dc.creatorMarianov, Vladimir
dc.date.accessioned2024-01-10T12:37:22Z
dc.date.accessioned2024-05-02T17:54:46Z
dc.date.available2024-01-10T12:37:22Z
dc.date.available2024-05-02T17:54:46Z
dc.date.created2024-01-10T12:37:22Z
dc.date.issued2010
dc.identifier10.1016/j.ejor.2010.02.037
dc.identifier1872-6860
dc.identifier0377-2217
dc.identifierhttps://doi.org/10.1016/j.ejor.2010.02.037
dc.identifierhttps://repositorio.uc.cl/handle/11534/76829
dc.identifierWOS:000277873300007
dc.identifier.urihttps://repositorioslatinoamericanos.uchile.cl/handle/2250/9269323
dc.description.abstractIn 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.
dc.languageen
dc.publisherELSEVIER
dc.rightsacceso restringido
dc.subjectTransportation
dc.subjectVehicle routing
dc.subjectDeliveries and selective pickups
dc.subjectTime windows
dc.subjectBranch-and-price
dc.subjectShortest paths with resources
dc.subjectSHORTEST-PATH PROBLEM
dc.titleA branch-and-price algorithm for the Vehicle Routing Problem with Deliveries, Selective Pickups and Time Windows
dc.typeartículo


Este ítem pertenece a la siguiente institución