Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
8953643 | European Journal of Operational Research | 2019 | 35 Pages |
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Thomas Capelle, Cristián E. Cortés, Michel Gendreau, Pablo A. Rey, Louis-Martin Rousseau,