The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
The Truck Dispatching Problem
Abstract
The paper is concerned with the optimum routing of a fleet of gasoline delivery trucks between a bulk terminal and a large number of service stations supplied by the terminal. The shortest routes between any two points in the system are given and a demand for one or several products is specified for a number of stations within the distribution system. It is desired to find a way to assign stations to trucks in such a manner that station demands are satisfied and total mileage covered by the fleet is a minimum A procedure based on a linear programming formulation is given for obtaining a near optimal solution. The calculations may be readily performed by hand or by an automatic digital computing machine. No practical applications of the method have been made as yet. A number of trial problems have been calculated, however.
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
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
Self-citationDiscrete-Variable Extremum Problems
Dantzig, G. B. (1957) · Operations Research · doi:10.1287/opre.5.2.266 · Cited by 910
Self-citationThe Traveling-Salesman Problem
Flood, M. M. (1956) · Operations Research · doi:10.1287/opre.4.1.61 · Cited by 682
Cited by
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
The Vehicle Routing Problem: Latest Advances and New Challenges
(2008) · Operations Research/Computer Science Interfaces · doi:10.1007/978-0-387-77778-8 · Cited by 1,483
The vehicle routing problem: State of the art classification and review
Braekers, K., Ramaekers, K., & Van Nieuwenhuyse, I. (2016) · Computers & Industrial Engineering · doi:10.1016/j.cie.2015.12.007 · Cited by 1,265
A review of dynamic vehicle routing problems
Pillac, V., Gendreau, M., Guéret, C., & Medaglia, A. L. (2013) · European Journal of Operational Research · doi:10.1016/j.ejor.2012.08.015 · Cited by 1,253
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
Fifty Years of Vehicle Routing
Laporte, G. (2009) · Transportation Science · doi:10.1287/trsc.1090.0301 · Cited by 1,022
Routing and scheduling of vehicles and crews
Raff, S. (1983) · Computers & Operations Research · doi:10.1016/0305-0548(83)90030-8 · Cited by 867
Extreme Learning Machines [Trends & Controversies]
Cambria, E., Huang, G.-B., Kasun, L. L. C., Zhou, H., Vong, C. M., Lin, J., Yin, J., Cai, Z., Liu, Q., Li, K., et al. (2013) · IEEE Intelligent Systems · doi:10.1109/mis.2013.140 · Cited by 710
A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems
Vidal, T., Crainic, T. G., Gendreau, M., Lahrichi, N., & Rei, W. (2012) · Operations Research · doi:10.1287/opre.1120.1048 · Cited by 709
Govindan, K., Jafarian, A., Khodaverdi, R., & Devika, K. (2014) · International Journal of Production Economics · doi:10.1016/j.ijpe.2013.12.028 · Cited by 649
Development of a fuel consumption optimization model for the capacitated vehicle routing problem
Xiao, Y., Zhao, Q., Kaku, I., & Xu, Y. (2012) · Computers & Operations Research · doi:10.1016/j.cor.2011.08.013 · Cited by 636
Akkerman, R., Farahani, P., & Grunow, M. (2010) · OR Spectrum · doi:10.1007/s00291-010-0223-2 · Cited by 546
Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem
Fukasawa, R., Longo, H., Lysgaard, J., Aragão, M. P. D., Reis, M., Uchoa, E., & Werneck, R. F. (2006) · Mathematical Programming · doi:10.1007/s10107-005-0644-x · Cited by 539
Balas, E., & Padberg, M. W. (1976) · SIAM Review · doi:10.1137/1018115 · Cited by 449
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
Lei, S., Chen, C., Li, Y., & Hou, Y. (2019) · IEEE Transactions on Smart Grid · doi:10.1109/tsg.2019.2899353 · Cited by 427
Chiang, W.-C., Li, Y., Shang, J., & Urban, T. L. (2019) · Applied Energy · doi:10.1016/j.apenergy.2019.03.117 · Cited by 391
Islam, M. T., & Huda, N. (2018) · Resources, Conservation and Recycling · doi:10.1016/j.resconrec.2018.05.026 · Cited by 375
Towards enhancing the last-mile delivery: An effective crowd-tasking model with scalable solutions
Wang, Y., Zhang, D., Liu, Q., Shen, F., & Lee, L. H. (2016) · Transportation Research Part E: Logistics and Transportation Review · doi:10.1016/j.tre.2016.06.002 · Cited by 352
Classification in vehicle routing and scheduling
Bodin, L., & Golden, B. (1981) · Networks · doi:10.1002/net.3230110204 · Cited by 333
THE LAST MILE CHALLENGE: EVALUATING THE EFFECTS OF CUSTOMER DENSITY AND DELIVERY WINDOW PATTERNS
Boyer, K. K., Prud'homme, A. M., & Chung, W. (2009) · Journal of Business Logistics · doi:10.1002/j.2158-1592.2009.tb00104.x · Cited by 321
Optimization of a truck-drone in tandem delivery network using k-means and genetic algorithm
Mourelo Ferrandez, S., Harbison, T., Weber, T., Sturges, R., & Rich, R. (2016) · Journal of Industrial Engineering and Management · doi:10.3926/jiem.1929 · Cited by 315
Li, X., Tian, P., & Leung, S. C. H. (2010) · International Journal of Production Economics · doi:10.1016/j.ijpe.2010.01.013 · Cited by 288
Retail Store Density and the Cost of Greenhouse Gas Emissions
Cachon, G. P. (2014) · Management Science · doi:10.1287/mnsc.2013.1819 · Cited by 287
Rich Vehicle Routing Problem: Survey
Caceres-Cruz, J., Arias, P., Guimarans, D., Riera, D., & Juan, A. A. (2015) · ACM Computing Surveys · doi:10.1145/2666003 · Cited by 280
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
Hannan, M. A., Akhtar, M., Begum, R. A., Basri, H., Hussain, A., & Scavino, E. (2018) · Waste Management · doi:10.1016/j.wasman.2017.10.019 · Cited by 262
Path-Planning for Unmanned Aerial Vehicles with Environment Complexity Considerations: A Survey
Jones, M., Djahel, S., & Welsh, K. (2023) · ACM Computing Surveys · doi:10.1145/3570723 · Cited by 258
A taxonomy for task allocation problems with temporal and ordering constraints
Nunes, E., Manner, M., Mitiche, H., & Gini, M. (2017) · Robotics and Autonomous Systems · doi:10.1016/j.robot.2016.10.008 · Cited by 252
Hyland, M. F., & Mahmassani, H. S. (2017) · Transportation Research Record: Journal of the Transportation Research Board · doi:10.3141/2653-04 · Cited by 69
Vehicle routing problems with road‐network information: State of the art
Ben Ticha, H., Absi, N., Feillet, D., & Quilliot, A. (2018) · Networks · doi:10.1002/net.21808 · Cited by 51
Algorithm for DNA sequence assembly by quantum annealing
Nałęcz-Charkiewicz, K., & Nowak, R. M. (2022) · BMC Bioinformatics · doi:10.1186/s12859-022-04661-7 · Cited by 37
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
- Dantzig, G. B., & Ramser, J. H.
- Venue
- Management Science
- Published
- 1959-10
- Volume
- 6
- Issue
- 1
- Pages
- 80-91
- ISSN
- 0025-1909 (ISSN-L)
- 1526-5501
- OpenAlex
- W2111563176
- Cited by
- 4,985
- References
- 3
- FWCI
- 10.47
- 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.