The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
An Integer Programming Approach to the Vehicle Scheduling Problem
Abstract
This paper describes an integer programming formulation of the vehicle scheduling problem and illustrates how such a formulation can be extended to incorporate restrictions on work load, coverage and service that occur in real world vehicle scheduling problems. The integer programme is solved using the Revised Simplex method, additional constraints being introduced to retain integrality during convergence. The feasible region of this integer programme is initially restricted so that only routes constructed through sets of radially contiguous locations are considered. The effect of relaxing these over-constraints is explored. The method is demonstrated on fifteen problems ranging in size from 21 to 100 locations and the results generally show an improvement on previously published results. This is particularly true of the larger problems. This method compares favourably with other methods in computational efficiency.
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
Bellman, R. E. (2010) · doi:10.1515/9781400835386 · Cited by 14,588
Cited by
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
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
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
Electric Vehicle Charge Scheduling with Flexible Service Operations
Klein, P. S., & Schiffer, M. (2023) · Transportation Science · doi:10.1287/trsc.2022.0272 · Cited by 17
Metadata
- Authors
- Foster, B. A., & Ryan, D. M.
- Venue
- Journal of the Operational Research Society
- Publisher
- Informa UK Limited
- Published
- 1976-06
- Volume
- 27
- Issue
- 2
- Pages
- 367-384
- ISSN
- 0160-5682 (ISSN-L)
- 1476-9360
- OpenAlex
- W2012355441
- Cited by
- 231
- References
- 1
- FWCI
- 17.60
- 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: An Integer Programming Approach to the Vehicle Scheduling Problem. https://app.cochat.ai/papers/10.1057/jors.1976.63
- The paper
- Foster, B. A., & Ryan, D. M. (1976). An Integer Programming Approach to the Vehicle Scheduling Problem. Journal of the Operational Research Society. https://doi.org/10.1057/jors.1976.63
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.