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

Simple item page
dc.contributor.authorGutierrez Jarpa, Gabriel
dc.contributor.authorDesaulniers, Guy
dc.contributor.authorLaporte, Gilbert
dc.contributor.authorMarianov, Vladimir
dc.date.accessioned2024-01-10T12:37:22Z
dc.date.available2024-01-10T12:37:22Z
dc.date.issued2010
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.description.funderCanadian Natural Sciences and Engineering Research Council
dc.description.funderFONDECYT
dc.fechaingreso.objetodigital2024-04-16
dc.format.extent9 páginas
dc.fuente.origenWOS
dc.identifier.doi10.1016/j.ejor.2010.02.037
dc.identifier.eissn1872-6860
dc.identifier.issn0377-2217
dc.identifier.urihttps://doi.org/10.1016/j.ejor.2010.02.037
dc.identifier.urihttps://repositorio.uc.cl/handle/11534/76829
dc.identifier.wosidWOS:000277873300007
dc.information.autorucIngeniería;Gutiérrez-Jarpa G;S/I;143925
dc.information.autorucIngeniería;Marianov V;S/I;99349
dc.issue.numero2
dc.language.isoen
dc.nota.accesocontenido parcial
dc.pagina.final349
dc.pagina.inicio341
dc.publisherELSEVIER
dc.revistaEUROPEAN JOURNAL OF OPERATIONAL RESEARCH
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.subject.ods11 Sustainable Cities and Communities
dc.subject.odspa11 Ciudades y comunidades sostenibles
dc.titleA branch-and-price algorithm for the Vehicle Routing Problem with Deliveries, Selective Pickups and Time Windows
dc.typeartículo
dc.volumen206
sipa.codpersvinculados143925
sipa.codpersvinculados99349
sipa.indexWOS
sipa.indexScopus
sipa.trazabilidadCarga SIPA;09-01-2024
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
A branch-and-price algorithm for the Vehicle Routing Problem with Deliveries, Selective Pickups and Time Windows.pdf
Size:
2.4 KB
Format:
Adobe Portable Document Format
Description:
Download
Collections
Artículos de revistas