The DOI matches its Crossref record; 32 of the 32 references it cites were found in a registry or an index.
Branch and Cut and Price for the Pickup and Delivery Problem with Time Windows
Abstract
In the pickup and delivery problem with time windows vehicle routes must be designed to satisfy a set of transportation requests, each involving a pickup and delivery location, under capacity, time window, and precedence constraints. This paper introduces a new branch-and-cut-and-price algorithm in which lower bounds are computed by solving through column generation the linear programming relaxation of a set partitioning formulation. Two pricing subproblems are considered in the column generation algorithm: an elementary and nonelementary shortest path problem. Valid inequalities are added dynamically to strengthen the relaxations. Some of the previously proposed inequalities for the pickup and delivery problem with time windows are also shown to be implied by the set partitioning formulation. Computational experiments indicate that the proposed algorithm outperforms a recent branch-and-cut algorithm.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
Solomon, M. M. (1987) · Operations Research · doi:10.1287/opre.35.2.254 · Cited by 4,298
(2002) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898718515 · Cited by 4,008
Nemhauser, G. L., & Wolsey, L. A. (1972) · Cited by 3,365
Ropke, S., & Pisinger, D. (2006) · Transportation Science · doi:10.1287/trsc.1050.0135 · Cited by 2,580
Self-citationBranch-and-price: column generation for solving huge integer programs
Barnhart, C., Johnson, E. L., Nemhauser, G. L., Savelsbergh, M. W. P., & Vance, P. H. (1998) · Operations Research · doi:10.1287/opre.46.3.316 · Cited by 2,219
Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems
Shaw, P. (1998) · Lecture Notes in Computer Science · doi:10.1007/3-540-49481-2_30 · Cited by 1,366
A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
Desrochers, M., Desrosiers, J., & Solomon, M. (1992) · Operations Research · doi:10.1287/opre.40.2.342 · Cited by 1,197
The General Pickup and Delivery Problem
Savelsbergh, M. W. P., & Sol, M. (1995) · Transportation Science · doi:10.1287/trsc.29.1.17 · Cited by 1,042
A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
Cordeau, J.-F. (2006) · Operations Research · doi:10.1287/opre.1060.0283 · Cited by 695
Self-citationFeillet, D., Dejax, P., Gendreau, M., & Gueguen, C. (2004) · Networks · doi:10.1002/net.20033 · Cited by 693
The pickup and delivery problem with time windows
Dumas, Y., Desrosiers, J., & Soumis, F. (1991) · European Journal of Operational Research · doi:10.1016/0377-2217(91)90319-q · Cited by 667
Shortest Path Problems with Resource Constraints
Irnich, S., & Desaulniers, G. (2006) · Column Generation · doi:10.1007/0-387-25486-2_2 · Cited by 597
Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem
Fukasawa, R., Longo, H., Lysgaard, J., Aragão, M. P. D., Reis, M., Uchoa, E., & Werneck, R. F. (2006) · Mathematical Programming · doi:10.1007/s10107-005-0644-x · Cited by 539
2-Path Cuts for the Vehicle Routing Problem with Time Windows
Kohl, N., Desrosiers, J., Madsen, O. B. G., Solomon, M. M., & Soumis, F. (1999) · Transportation Science · doi:10.1287/trsc.33.1.101 · Cited by 411
Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
Jepsen, M., Petersen, B., Spoorendonk, S., & Pisinger, D. (2008) · Operations Research · doi:10.1287/opre.1070.0449 · Cited by 410
Baldacci, R., Christofides, N., & Mingozzi, A. (2008) · Mathematical Programming · doi:10.1007/s10107-007-0178-5 · Cited by 364
Righini, G., & Salani, M. (2006) · Discrete Optimization · doi:10.1016/j.disopt.2006.05.007 · Cited by 364
Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows
Røpke, S., Cordeau, J., & Gilbert Laporte, A. (2007) · Networks · doi:10.1002/net.20177 · Cited by 353
Self-citationDrive: Dynamic Routing of Independent Vehicles
Savelsbergh, M., & Sol, M. (1998) · Operations Research · doi:10.1287/opre.46.4.474 · Cited by 334
Note on the Complexity of the Shortest Path Models for Column Generation in VRPTW
Dror, M. (1994) · Operations Research · doi:10.1287/opre.42.5.977 · Cited by 325
New dynamic programming algorithms for the resource constrained elementary shortest path problem
Righini, G., & Salani, M. (2008) · Networks · doi:10.1002/net.20212 · Cited by 284
A Metaheuristic for the Pickup and Delivery Problem with Time Windows
Li, H., & Lim, A. E. B. (2003) · International Journal of Artificial Intelligence Tools · doi:10.1142/s0218213003001186 · Cited by 265
A Unified Framework for Deterministic Time Constrained Vehicle Routing and Crew Scheduling Problems
Desaulniers, G., Desrosiers, J., loachim, I., Solomon, M. M., Soumis, F., & Villeneuve, D. (1998) · Fleet Management and Logistics · doi:10.1007/978-1-4615-5755-5_3 · Cited by 238
Desaulniers, G., Lessard, F., & Hadjar, A. (2008) · Transportation Science · doi:10.1287/trsc.1070.0223 · Cited by 237
2-Path Cuts for the Vehicle Routing Problem with Time Windows
Desrosiers, J., Solomon, M. M., Soumis, F., Kohl, N., & Madsen, O. B. G. (1997) · Les Cahiers du GERAD · Cited by 225
The Shortest-Path Problem with Resource Constraints and k-Cycle Elimination for k ≥ 3
Irnich, S., & Villeneuve, D. (2006) · INFORMS Journal on Computing · doi:10.1287/ijoc.1040.0117 · Cited by 215
Dell’Amico, M., Righini, G., & Salani, M. (2006) · Transportation Science · doi:10.1287/trsc.1050.0118 · Cited by 213
3. Branch-And-Cut Algorithms for the Capacitated VRP
Naddef, D., & Rinaldi, G. (2002) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898718515.ch3 · Cited by 201
Accelerated label setting algorithms for the elementary resource constrained shortest path problem
Boland, N., Dethridge, J., & Dumitrescu, I. (2006) · Operations Research Letters · doi:10.1016/j.orl.2004.11.011 · Cited by 200
Rutledge, D. B. (2019) · Cambridge University Press eBooks · doi:10.1017/9781139381208.010 · Cited by 138
Column generation techniques for pickup and delivery problems
Sol, M. M. (1994) · TU/e Research Portal · doi:10.6100/ir423957 · Cited by 50
Engine Scheduling by Column Generation
Lübbecke, M. E. (2001) · Digitale Bibliothek Braunschweig (Verbundzentrale Göttingen (VZG)) · doi:10.24355/dbbs.084-200511080100-720 · Cited by 21
Cited by
The vehicle routing problem: State of the art classification and review
Braekers, K., Ramaekers, K., & Van Nieuwenhuyse, I. (2016) · Computers & Industrial Engineering · doi:10.1016/j.cie.2015.12.007 · Cited by 1,265
The Electric Fleet Size and Mix Vehicle Routing Problem with Time Windows and Recharging Stations
Hiermann, G., Puchinger, J., Ropke, S., & Hartl, R. F. (2016) · European Journal of Operational Research · doi:10.1016/j.ejor.2016.01.038 · Cited by 584
Self-citationHam, A. M. (2018) · Transportation Research Part C: Emerging Technologies · doi:10.1016/j.trc.2018.03.025 · Cited by 323
Mahmoudi, M., & Zhou, X. (2016) · Transportation Research Part B: Methodological · doi:10.1016/j.trb.2016.03.009 · Cited by 316
A taxonomy for task allocation problems with temporal and ordering constraints
Nunes, E., Manner, M., Mitiche, H., & Gini, M. (2017) · Robotics and Autonomous Systems · doi:10.1016/j.robot.2016.10.008 · Cited by 252
Metadata
- Authors
- Ropke, S., & Cordeau, J.-F.
- Venue
- Transportation Science
- Published
- 2009-08
- Volume
- 43
- Issue
- 3
- Pages
- 267-286
- ISSN
- 0041-1655 (ISSN-L)
- 1526-5447
- OpenAlex
- W2119097848
- Cited by
- 487
- References
- 32
- FWCI
- 39.28
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.