The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.
Classification in vehicle routing and scheduling
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Dantzig, G. B., & Ramser, J. H. (1959) · Management Science · doi:10.1287/mnsc.6.1.80 · Cited by 4,985
Ford, D. R., & Fulkerson, D. R. (1962) · Cited by 4,072
Scheduling of Vehicles from a Central Depot to a Number of Delivery Points
Clarke, G., & Wright, J. W. (1964) · Operations Research · doi:10.1287/opre.12.4.568 · Cited by 3,894
An Effective Heuristic Algorithm for the Traveling-Salesman Problem
Lin, S., & Kernighan, B. W. (1973) · Operations Research · doi:10.1287/opre.21.2.498 · Cited by 3,821
Computer Solutions of the Traveling Salesman Problem
Lin, S. (1965) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1965.tb04146.x · Cited by 1,986
The Traveling-Salesman Problem and Minimum Spanning Trees
Held, M., & Karp, R. M. (1970) · Operations Research · doi:10.1287/opre.18.6.1138 · Cited by 1,440
A Heuristic Algorithm for the Vehicle-Dispatch Problem
Gillett, B. E., & Miller, L. R. (1974) · Operations Research · doi:10.1287/opre.22.2.340 · Cited by 1,179
The traveling-salesman problem and minimum spanning trees: Part II
Held, M., & Karp, R. M. (1971) · Mathematical Programming · doi:10.1007/bf01584070 · Cited by 1,018
Ford, L. R., & Fulkerson, D. R. (1963) · Princeton University Press eBooks · doi:10.1515/9781400875184 · Cited by 891
The fleet size and mix vehicle routing problem
Golden, B., Assad, A. A., Levy, L., & Gheysens, F. (1984) · Computers & Operations Research · doi:10.1016/0305-0548(84)90007-8 · Cited by 550
Self-citationChristofides, N., Mingozzi, A., & Toth, P. (1981) · Mathematical Programming · doi:10.1007/bf01589353 · Cited by 535
Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane
Karp, R. M. (1977) · Mathematics of Operations Research · doi:10.1287/moor.2.3.209 · Cited by 439
Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality
Crowder, H., & Padberg, M. W. (1980) · Management Science · doi:10.1287/mnsc.26.5.495 · Cited by 294
Approximate Traveling Salesman Algorithms
Golden, B., Bodin, L. D., Doyle, T., et al. (1980) · Operations Research · doi:10.1287/opre.28.3.694 · Cited by 277
Self-citationRouting and Scheduling of School Buses by Computer
Bodin, L. D., & Berman, L. (1979) · Transportation Science · doi:10.1287/trsc.13.2.113 · Cited by 175
Self-citationScheduling Dial-a-Ride Transportation Systems
Stein, D. M. (1978) · Transportation Science · doi:10.1287/trsc.12.3.232 · Cited by 158
Russell, R. A., & Igo, W. (1979) · Networks · doi:10.1002/net.3230090102 · Cited by 156
Route Constrained Fleet Scheduling
Orloff, C. S. (1976) · Transportation Science · doi:10.1287/trsc.10.2.149 · Cited by 85
Bus routing in a multi-school system
Newton, R. M., & Thomas, W. H. (1974) · Computers & Operations Research · doi:10.1016/0305-0548(74)90047-1 · Cited by 77
A shortest augmenting path method for solving minimal perfect matching problems
Derigs, U. (1981) · Networks · doi:10.1002/net.3230110407 · Cited by 71
Geometric Approaches to Solving the Traveling Salesman Problem
Norback, J. P., & Love, R. F. (1977) · Management Science · doi:10.1287/mnsc.23.11.1208 · Cited by 51
Cited by
Routing and scheduling of vehicles and crews
Raff, S. (1983) · Computers & Operations Research · doi:10.1016/0305-0548(83)90030-8 · Cited by 867
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
Combined location-routing problems: A synthesis and future research directions
Min, H., Jayaraman, V., & Srivastava, R. (1998) · European Journal of Operational Research · doi:10.1016/s0377-2217(97)00172-0 · Cited by 486
Heuristics for multi-attribute vehicle routing problems: A survey and synthesis
Vidal, T., Crainic, T. G., Gendreau, M., & Prins, C. (2013) · European Journal of Operational Research · doi:10.1016/j.ejor.2013.02.053 · Cited by 430
Scheduling and routing algorithms for AGVs: A survey
Qiu, L., Hsu, W.-J., Huang, S.-Y., & Wang, H. (2002) · International Journal of Production Research · doi:10.1080/00207540110091712 · Cited by 402
Metadata
- Authors
- Bodin, L., & Golden, B.
- Venue
- Networks
- Publisher
- Wiley
- Published
- 1981-06
- Volume
- 11
- Issue
- 2
- Pages
- 97-108
- ISSN
- 0028-3045 (ISSN-L)
- 1097-0037
- OpenAlex
- W2063961786
- Cited by
- 333
- References
- 21
- FWCI
- 24.23
- 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.