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.
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
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-citation
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
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
Optimisation of MSW collection routes for minimum fuel consumption using 3D GIS modelling
Tavares, G., Zsigraiova, Z., Semiao, V., & Carvalho, M. G. (2009) · Waste Management · doi:10.1016/j.wasman.2008.07.013 · Cited by 301
Economic assessment of biodiesel production from waste frying oils
Araujo, V. K. W. S., Hamacher, S., & Scavarda, L. F. (2010) · Bioresource Technology · doi:10.1016/j.biortech.2010.01.101 · Cited by 124
Hyland, M. F., & Mahmassani, H. S. (2017) · Transportation Research Record: Journal of the Transportation Research Board · doi:10.3141/2653-04 · Cited by 69
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.