The DOI matches its Crossref record.
Time Dependent Vehicle Routing Problems: Formulations, Properties and Heuristic Algorithms
Abstract
The time dependent vehicle routing problem (TDVRP) is defined as follows. A vehicle fleet of fixed capacities serves customers of fixed demands from a central depot. Customers are assigned to vehicles and the vehicles routed so that the total time of the routes is minimized. The travel time between two customers or between a customer and the depot depends on the distance between the points and time of day. Time windows for serving the customers may also be present. The time dependent traveling salesman problem (TDTSP) is a special case of the TDVRP in which only one vehicle of infinite capacity is available. Mixed integer linear programming formulations of the TDVRP and the TDTSP are presented that treat the travel time functions as step functions. The characteristics and properties of the TDVRP preclude modification of most of the algorithms that have been developed for the vehicle routing problem. Several simple heuristic algorithms are given for the TDTSP and TDVRP without time windows based on the nearest-neighbor heuristic. A mathematical-programming-based heuristic for the TDTSP without time windows using cutting planes is also briefly discussed. Test results on small, randomly generated problems are reported.
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
Vehicle routing problems for city logistics
Cattaruzza, D., Absi, N., Feillet, D., & González-Feliu, J. (2017) · EURO Journal on Transportation and Logistics · doi:10.1007/s13676-014-0074-0 · Cited by 334
Peng, G., Dewil, R., Verbeeck, C., Gunawan, A., Xing, L., & Vansteenwegen, P. (2019) · Computers & Operations Research · doi:10.1016/j.cor.2019.05.030 · Cited by 113
Metadata
- Authors
- Malandraki, C., & Daskin, M. S.
- Venue
- Transportation Science
- Published
- 1992-08
- Volume
- 26
- Issue
- 3
- Pages
- 185-200
- ISSN
- 0041-1655 (ISSN-L)
- 1526-5447
- OpenAlex
- W2098156747
- Cited by
- 541
- References
- 0
- FWCI
- 5.48
- 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: Time Dependent Vehicle Routing Problems: Formulations, Properties and Heuristic Algorithms. https://app.cochat.ai/papers/10.1287/trsc.26.3.185
- The paper
- Malandraki, C., & Daskin, M. S. (1992). Time Dependent Vehicle Routing Problems: Formulations, Properties and Heuristic Algorithms. Transportation Science. https://doi.org/10.1287/trsc.26.3.185
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.
