The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
Drive: Dynamic Routing of Independent Vehicles
Abstract
We present DRIVE (Dynamic Routing of Independent VEhicles), a planning module to be incorporated in a decision support system for the direct transportation at Van Gend and Loos BV. Van Gend and Loos BV is the largest company providing road transportation in the Benelux, with about 1400 vehicles transporting 160,000 packages from thousands of senders to tens of thousands of addressees per day. The heart of DRIVE is a branch-and-price algorithm. Approximation and incomplete optimization techniques as well as a sophisticated column management scheme have been employed to create the right balance between solution speed and solution quality. DRIVE has been tested by simulating a dynamic planning environment with real-life data and has produced very encouraging results.
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
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
Self-citationA 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
Self-citationLocal Search in Combinatorial Optimization
(2018) · Princeton University Press eBooks · doi:10.2307/j.ctv346t9c · Cited by 834
Time Constrained Routing and Scheduling
Desrosiers, J., Solomon, M. M., Soumis, F., & Dumas, Y. (1992) · PolyPublie (École Polytechnique de Montréal) · doi:10.1016/s0927-0507%2805%2980106-9 · Cited by 709
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
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
Self-citationSolving binary cutting stock problems by column generation and branch-and-bound
Vance, P. H., Barnhart, C., Johnson, E. L., & Nemhauser, G. L. (1994) · Computational Optimization and Applications · doi:10.1007/bf01300970 · Cited by 226
Computer Scheduling of Public Transport: Urban Passenger Vehicle and Crew Scheduling
Feder, P. I. (1982) · Technometrics · doi:10.1080/00401706.1982.10487724 · Cited by 186
MINTO, a mixed INTeger optimizer
Nemhauser, G. L., Savelsbergh, M. W. P., & Sigismondi, G. C. (1994) · Operations Research Letters · doi:10.1016/0167-6377(94)90013-2 · Cited by 161
Self-citation
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
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
The vehicle routing problem: A taxonomic review
Eksioglu, B., Vural, A. V., & Reisman, A. (2009) · Computers & Industrial Engineering · doi:10.1016/j.cie.2009.05.009 · Cited by 786
Survey 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
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
Dynamic pickup and delivery problems
Berbeglia, G., Cordeau, J.-F., & Laporte, G. (2010) · European Journal of Operational Research · doi:10.1016/j.ejor.2009.04.024 · Cited by 679
Shortest Path Problems with Resource Constraints
Irnich, S., & Desaulniers, G. (2006) · Column Generation · doi:10.1007/0-387-25486-2_2 · Cited by 597
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
A review of design and control of automated guided vehicle systems
Le-Anh, T., & De Koster, M. B. M. (2006) · European Journal of Operational Research · doi:10.1016/j.ejor.2005.01.036 · Cited by 473
Ant Colony System for a Dynamic Vehicle Routing Problem
Montemanni, R., Gambardella, L. M., Rizzoli, A. E., & Donati, A. V. (2005) · Journal of Combinatorial Optimization · doi:10.1007/s10878-005-4922-6 · Cited by 414
Real-time vehicle routing: Solution concepts, algorithms and parallel computing strategies
Ghiani, G., Guerriero, F., Laporte, G., & Musmanno, R. (2003) · European Journal of Operational Research · doi:10.1016/s0377-2217(02)00915-3 · Cited by 350
Mahmoudi, M., & Zhou, X. (2016) · Transportation Research Part B: Methodological · doi:10.1016/j.trb.2016.03.009 · Cited by 316
A technical review of column generation in integer programming
Wilhelm, W. E. (2001) · Optimization and Engineering · doi:10.1023/a:1013141227104 · Cited by 108
Metadata
- Authors
- Savelsbergh, M., & Sol, M.
- Venue
- Operations Research
- Published
- 1998-08
- Volume
- 46
- Issue
- 4
- Pages
- 474-490
- ISSN
- 0030-364X (ISSN-L)
- 1526-5463
- OpenAlex
- W2124874218
- Cited by
- 334
- References
- 12
- FWCI
- 17.33
- 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.