A column generation approach for location-routing problems with pickup and delivery
Author
dc.contributor.author
Capelle, Thomas
Author
dc.contributor.author
Cortés, Cristián
Author
dc.contributor.author
Gendreau, Michel
Author
dc.contributor.author
Rey, Pablo
Author
dc.contributor.author
Rousseau, Louis
Admission date
dc.date.accessioned
2019-05-31T15:33:54Z
Available date
dc.date.available
2019-05-31T15:33:54Z
Publication date
dc.date.issued
2019
Cita de ítem
dc.identifier.citation
European Journal of Operational Research, Volumen 272, Issue 1, 2019, Pages 121-131
Identifier
dc.identifier.issn
03772217
Identifier
dc.identifier.other
10.1016/j.ejor.2018.05.055
Identifier
dc.identifier.uri
https://repositorio.uchile.cl/handle/2250/169669
Abstract
dc.description.abstract
In this paper we formulate an integer programming model for the Location and Routing Problem with Pickup and Delivery. We propose a column generation scheme and implement, for the subproblem, a label-setting algorithm for the shortest path with pickup and delivery and time windows problem. We also propose a set of heuristics to speed up this process. To validate the model, we implement the column generation scheme and test it on different instances developed in this paper. We also provide an analysis of how the costs of opening depots and the fixed cost of routes affect the optimal solution.