The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Routing with time windows by column generation
Abstract
Consider a set of trips where each trip is specified a priori by a place of origin, a destination, a duration, a cost, and a time interval within which the trip must begin. The trips may include visits to one or more specific points. Our problem is to determine the number of vehicles required, together with their routes and schedules, so that each trip begins within its given time interval, while the fixed costs related to the number of vehicles, and the travel costs between trips, are minimized. The problem is a generalization of the m‐traveling salesman problem. We use column generation on a set partitioning problem solved by simplex and branch‐and‐bound; columns are generated by a shortest path algorithm with time windows on the nodes. Numerical results for several school bus transportation problems with up to 151 trips are discussed.
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
Integer Programming Formulation of Traveling Salesman Problems
Miller, C. E., Tucker, A. W., & Zemlin, R. A. (1960) · Journal of the ACM · doi:10.1145/321043.321046 · Cited by 2,020
A generalized assignment heuristic for vehicle routing
Fisher, M. L., & Jaikumar, R. (1981) · Networks · doi:10.1002/net.3230110205 · Cited by 1,076
State‐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
Combinatorial optimization and vehicle fleet planning: Perspectives and prospects
Magnanti, T. L. (1981) · Networks · doi:10.1002/net.3230110209 · Cited by 166
Scheduling and Fleet Routing Models for Transportation Systems
Levin, A. (1971) · Transportation Science · doi:10.1287/trsc.5.3.232 · Cited by 138
Plus court chemin avec contraintes d'horaires
Desrosiers, J., Pelletier, P., & Soumis, F. (1983) · RAIRO - Operations Research · doi:10.1051/ro/1983170403571 · Cited by 90
Self-citationRoute Constrained Fleet Scheduling
Orloff, C. S. (1976) · Transportation Science · doi:10.1287/trsc.10.2.149 · Cited by 85
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
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
Self-citationSelected Topics in Column Generation
Lübbecke, M. E., & Desrosiers, J. (2005) · Operations Research · doi:10.1287/opre.1050.0234 · Cited by 1,102
Self-citationThe 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-citationCluster analysis and mathematical programming
Hansen, P., & Jaumard, B. (1997) · Mathematical Programming · doi:10.1007/bf02614317 · Cited by 646
Shortest Path Problems with Resource Constraints
Irnich, S., & Desaulniers, G. (2006) · Column Generation · doi:10.1007/0-387-25486-2_2 · Cited by 597
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-citationChapter 3 Stochastic and dynamic networks and routing
Powell, W. B., Jaillet, P., & Odoni, A. (1995) · Handbooks in Operations Research and Management Science · doi:10.1016/s0927-0507(05)80107-0 · Cited by 334
An algorithm for the resource constrained shortest path problem
Beasley, J. E., & Christofides, N. (1989) · Networks · doi:10.1002/net.3230190402 · Cited by 327
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 technical review of column generation in integer programming
Wilhelm, W. E. (2001) · Optimization and Engineering · doi:10.1023/a:1013141227104 · Cited by 108
“Initial work was in the context of VRPTW (e.g., Desrochers et al., 1992a; Desrosiers et al., 1996; Desrosiers et al., 1984).”
MethodElectric vehicles: A review of network modelling and future research needs
Jing, W., Yan, Y., Kim, I., & Sarvi, M. (2016) · Advances in Mechanical Engineering · doi:10.1177/1687814015627981 · Cited by 79
Metadata
- Authors
- Desrosiers, J., Soumis, F., & Desrochers, M.
- Venue
- Networks
- Publisher
- Wiley
- Published
- 1984-12
- Volume
- 14
- Issue
- 4
- Pages
- 545-565
- ISSN
- 0028-3045 (ISSN-L)
- 1097-0037
- OpenAlex
- W2093952957
- Cited by
- 366
- References
- 7
- FWCI
- 17.26
- 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.