The DOI matches its Crossref record.
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
Cited by
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
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
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
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
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
- 0
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: The Truck Dispatching Problem. https://app.cochat.ai/papers/10.1287/mnsc.6.1.80
- The paper
- Dantzig, G. B., & Ramser, J. H. (1959). The Truck Dispatching Problem. Management Science. https://doi.org/10.1287/mnsc.6.1.80
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.
