The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
A Heuristic Algorithm for the Vehicle-Dispatch Problem
Abstract
This paper introduces and illustrates an efficient algorithm, called the sweep algorithm, for solving medium- as well as large-scale vehicle-dispatch problems with load and distance constraints for each vehicle. The locations that are used to make up each route are determined according to the polar-coordinate angle for each location. An iterative procedure is then used to improve the total distance traveled over all routes. The algorithm has the feature that the amount of computation required increases linearly with the number of locations if the average number of locations for each route remains relatively constant. For example, if the average number of locations per route is 7.5, the algorithm takes approximately 75 seconds to solve a 75-location problem on an IBM 360/67 and approximately 115 seconds to solve a 100-location problem. In contrast, the time to solve a problem with a fixed number of locations increases quadratically with the average number of locations per route. The sweep algorithm generally produces results that are significantly better than those produced by Gaskell's savings approach and are generally slightly better than Christofides and Eilon's results; however, the sweep algorithm is not as computationally efficient as Gaskell's and is slightly less so than Christofides and Eilon's.
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
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
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
Solution of a Large-Scale Traveling-Salesman Problem
Chvátal, V., Cook, W. J., Dantzig, G. B., Fulkerson, D. R., & Johnson, S. M. (2009) · Springer eBooks · doi:10.1007/978-3-540-68279-0_1 · Cited by 1,263
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
A Heuristic Approach to Solving Travelling Salesman Problems
Karg, R. L., & Thompson, G. L. (1964) · Management Science · doi:10.1287/mnsc.10.2.225 · Cited by 210
Cited by
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
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
Vehicle Routing Problem with Time Windows, Part I: Route Construction and Local Search Algorithms
Bräysy, O., & Gendreau, M. (2005) · Transportation Science · doi:10.1287/trsc.1030.0056 · Cited by 1,135
A generalized assignment heuristic for vehicle routing
Fisher, M. L., & Jaikumar, R. (1981) · Networks · doi:10.1002/net.3230110205 · Cited by 1,076
A simple and effective evolutionary algorithm for the vehicle routing problem
Prins, C. (2004) · Computers & Operations Research · doi:10.1016/s0305-0548(03)00158-8 · Cited by 1,058
Fifty Years of Vehicle Routing
Laporte, G. (2009) · Transportation Science · doi:10.1287/trsc.1090.0301 · Cited by 1,022
A genetic algorithm for the vehicle routing problem
Baker, B. M., & Ayechew, M. A. (2003) · Computers & Operations Research · doi:10.1016/s0305-0548(02)00051-5 · Cited by 883
Routing and scheduling of vehicles and crews
Raff, S. (1983) · Computers & Operations Research · doi:10.1016/0305-0548(83)90030-8 · Cited by 867
Vehicle Routing Problem with Time Windows, Part II: Metaheuristics
Bräysy, O., & Gendreau, M. (2005) · Transportation Science · doi:10.1287/trsc.1030.0057 · Cited by 844
Classical and modern heuristics for the vehicle routing problem
Laporte, G. (2000) · International Transactions in Operational Research · doi:10.1016/s0969-6016(00)00003-4 · Cited by 759
Psaraftis, H. N. (1980) · Transportation Science · doi:10.1287/trsc.14.2.130 · Cited by 601
Planning models for freight transportation
Crainic, T. G., & Laporte, G. (1997) · European Journal of Operational Research · doi:10.1016/s0377-2217(96)00298-6 · Cited by 592
An improved Ant System algorithm for theVehicle Routing Problem
Bullnheimer, B., Hartl, R. F., & Strauss, C. (1999) · Annals of Operations Research · doi:10.1023/a:1018940026670 · Cited by 548
Christofides, N., Mingozzi, A., & Toth, P. (1981) · Mathematical Programming · doi:10.1007/bf01589353 · Cited by 535
Battery swap station location-routing problem with capacitated electric vehicles
Yang, J., & Sun, H. (2015) · Computers & Operations Research · doi:10.1016/j.cor.2014.07.003 · Cited by 434
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
Applying the ANT System to the Vehicle Routing Problem
Bullnheimer, B., Hartl, R. F., & Strauss, C. (1999) · Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization · doi:10.1007/978-1-4615-5775-3_20 · Cited by 408
D-Ants: Savings Based Ants divide and conquer the vehicle routing problem
Reimann, M., Doerner, K., & Hartl, R. F. (2004) · Computers & Operations Research · doi:10.1016/s0305-0548(03)00014-5 · Cited by 387
Classification in vehicle routing and scheduling
Bodin, L., & Golden, B. (1981) · Networks · doi:10.1002/net.3230110204 · Cited by 333
A Survey on the Electric Vehicle Routing Problem: Variants and Solution Approaches
Erdelić, T., & Carić, T. (2019) · Journal of Advanced Transportation · doi:10.1155/2019/5075671 · Cited by 270
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
Jie, W., Yang, J., Zhang, M., & Huang, Y. (2019) · European Journal of Operational Research · doi:10.1016/j.ejor.2018.07.002 · Cited by 256
Sustainable Transportation Networks Incorporating Green Modes for Urban Freight Delivery
Shojaei, M. “., Fakhrmoosavi, F., Zockaie, A., Ghamami, M., Mittal, A., & Fishelson, J. (2022) · Journal of Transportation Engineering, Part A: Systems · doi:10.1061/jtepbs.0000669 · Cited by 14
Metadata
- Authors
- Gillett, B. E., & Miller, L. R.
- Venue
- Operations Research
- Published
- 1974-04
- Volume
- 22
- Issue
- 2
- Pages
- 340-349
- ISSN
- 0030-364X (ISSN-L)
- 1526-5463
- OpenAlex
- W2108753073
- Cited by
- 1,179
- References
- 7
- FWCI
- 72.84
- 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.