The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
Abstract
The vehicle routing problem with time windows (VRPTW) is a generalization of the vehicle routing problem where the service of a customer can begin within the time window defined by the earliest and the latest times when the customer will permit the start of service. In this paper, we present the development of a new optimization algorithm for its solution. The LP relaxation of the set partitioning formulation of the VRPTW is solved by column generation. Feasible columns are added as needed by solving a shortest path problem with time windows and capacity constraints using dynamic programming. The LP solution obtained generally provides an excellent lower bound that is used in a branch-and-bound algorithm to solve the integer set partitioning formulation. Our results indicate that this algorithm proved to be successful on a variety of practical sized benchmark VRPTW test problems. The algorithm was capable of optimally solving 100-customer problems. This problem size is six times larger than any reported to date by other published research.
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
(1979) · Cited by 43,841
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
Self-citationLocal search in routing problems with time windows
Savelsbergh, M. W. P. (1985) · Annals of Operations Research · doi:10.1007/bf02022044 · 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
Self-citationSurvey Paper—Time Window Constrained Routing and Scheduling Problems
Solomon, M. M., & Desrosiers, J. (1988) · Transportation Science · doi:10.1287/trsc.22.1.1 · Cited by 657
Self-citationChristofides, N., Mingozzi, A., & Toth, P. (1981) · Mathematical Programming · doi:10.1007/bf01589353 · Cited by 535
Exact Algorithms for the Vehicle Routing Problem
Gilbert Laporte, A., & Nobert, Y. (1987) · North-Holland mathematics studies · doi:10.1016/s0304-0208(08)73235-3 · Cited by 429
Routing with time windows by column generation
Desrosiers, J., Soumis, F., & Desrochers, M. (1984) · Networks · doi:10.1002/net.3230140406 · Cited by 366
Self-citationA Generalized Permanent Labelling Algorithm For The Shortest Path Problem With Time Windows
Desrochers, M., & Soumis, F. (1988) · INFOR: Information Systems and Operational Research · doi:10.1080/03155986.1988.11732063 · Cited by 349
Self-citationState‐space relaxation procedures for the computation of bounds to routing problems
Christofides, N., Mingozzi, A., & Toth, P. (1981) · Networks · doi:10.1002/net.3230110207 · Cited by 330
Cited by
Branch-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
The vehicle routing problem: An overview of exact and approximate algorithms
Laporte, G. (1992) · European Journal of Operational Research · doi:10.1016/0377-2217(92)90192-c · Cited by 1,749
Handbook of Constraint Programming
(2006) · Foundations of Artificial Intelligence · doi:10.1016/s1574-6526(06)x8001-x · Cited by 1,483
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
Selected Topics in Column Generation
Lübbecke, M. E., & Desrosiers, J. (2005) · Operations Research · doi:10.1287/opre.1050.0234 · Cited by 1,102
Self-citationSurvey of research in the design and control of automated guided vehicle systems
Vis, I. F. A. (2006) · European Journal of Operational Research · doi:10.1016/j.ejor.2004.09.020 · Cited by 757
Feillet, D., Dejax, P., Gendreau, M., & Gueguen, C. (2004) · Networks · doi:10.1002/net.20033 · Cited by 693
Shortest Path Problems with Resource Constraints
Irnich, S., & Desaulniers, G. (2006) · Column Generation · doi:10.1007/0-387-25486-2_2 · Cited by 597
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
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
New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem
Baldacci, R., Mingozzi, A., & Roberti, R. (2011) · Operations Research · doi:10.1287/opre.1110.0975 · Cited by 506
Branch and Cut and Price for the Pickup and Delivery Problem with Time Windows
Ropke, S., & Cordeau, J.-F. (2009) · Transportation Science · doi:10.1287/trsc.1090.0272 · Cited by 487
Baldacci, R., Mingozzi, A., & Roberti, R. (2012) · European Journal of Operational Research · doi:10.1016/j.ejor.2011.07.037 · Cited by 474
A Branch-and-Price Algorithm for the Generalized Assignment Problem
Savelsbergh, M. (1997) · Operations Research · doi:10.1287/opre.45.6.831 · Cited by 437
Record Breaking Optimization Results Using the Ruin and Recreate Principle
Schrimpf, G., Schneider, J., Stamm-Wilbrandt, H., & Dueck, G. (2000) · Journal of Computational Physics · doi:10.1006/jcph.1999.6413 · Cited by 413
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
Chapter 2 Time constrained routing and scheduling
Desrosiers, J., Dumas, Y., Solomon, M. M., & Soumis, F. (1995) · Handbooks in Operations Research and Management Science · doi:10.1016/s0927-0507(05)80106-9 · Cited by 374
Self-citationA Two-Stage Hybrid Local Search for the Vehicle Routing Problem with Time Windows
Bent, R., & Van Hentenryck, P. (2004) · Transportation Science · doi:10.1287/trsc.1030.0049 · Cited by 355
Simulated annealing metaheuristics for the vehicle routing problem with time windows
Chiang, W.-C., & Russell, R. A. (1996) · Annals of Operations Research · doi:10.1007/bf02601637 · Cited by 354
Drive: 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
Heuristic methods for vehicle routing problem with time windows
Tan, K. C., Lee, L. H., Zhu, Q. L., & Ou, K. (2001) · Artificial Intelligence in Engineering · doi:10.1016/s0954-1810(01)00005-x · Cited by 310
PSO-based algorithm for home care worker scheduling in the UK
Akjiratikarl, C., Yenradee, P., & Drake, P. R. (2007) · Computers & Industrial Engineering · doi:10.1016/j.cie.2007.06.002 · Cited by 296
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
Ghoseiri, K., & Ghannadpour, S. F. (2010) · Applied Soft Computing · doi:10.1016/j.asoc.2010.04.001 · Cited by 282
Vehicle routing with time windows: An overview of exact, heuristic and metaheuristic methods
El-Sherbeny, N. A. (2010) · Journal of King Saud University - Science · doi:10.1016/j.jksus.2010.03.002 · Cited by 257
A survey of resource constrained shortest path problems: Exact solution approaches
Pugliese, L. D. P., & Guerriero, F. (2013) · Networks · doi:10.1002/net.21511 · Cited by 147
Formulating and Solving Routing Problems on Quantum Computers
Harwood, S., Gambella, C., Trenev, D., Simonetto, A., Bernal Neira, D., & Greenberg, D. (2021) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2021.3049230 · Cited by 145
Scheduling food bank collections and deliveries to ensure food safety and improve access
Davis, L. B., Sengul, I., Ivy, J. S., Brock, L. G., & Miles, L. (2014) · Socio-Economic Planning Sciences · doi:10.1016/j.seps.2014.04.001 · Cited by 128
A technical review of column generation in integer programming
Wilhelm, W. E. (2001) · Optimization and Engineering · doi:10.1023/a:1013141227104 · Cited by 108
An exact algorithm for agile earth observation satellite scheduling with time-dependent profits
Peng, G., Song, G., Xing, L., Gunawan, A., & Vansteenwegen, P. (2020) · Computers & Operations Research · doi:10.1016/j.cor.2020.104946 · Cited by 93
Metadata
- Authors
- Desrochers, M., Desrosiers, J., & Solomon, M.
- Venue
- Operations Research
- Published
- 1992-04
- Volume
- 40
- Issue
- 2
- Pages
- 342-354
- ISSN
- 0030-364X (ISSN-L)
- 1526-5463
- OpenAlex
- W2040678783
- Cited by
- 1,197
- References
- 16
- FWCI
- 45.20
- 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.