The DOI matches its Crossref record; 50 of the 50 references it cites were found in a registry or an index.
Time-dependent routing problems: A review
Open accessAbstract
Time-dependent routing amounts to design "best" routes in a graph in which arc traversal times may vary over the planning horizon. In the last decade, a number of technological advances have stimulated an increased interest in this field. We survey the research in the area and present a comprehensive review of travel time modelling, applications and solution methods. In particular, we make a first classification in point-to-point and multiple-point problems. A second major classification is then performed with respect to the quality and evolution of information. Other criteria included: (i) node, arc or general routing; (ii) the possibility to choose the vehicle speed.
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
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
Self-citationVehicle Routing: Problems, Methods, and Applications, Second Edition
(2014) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611973594 · Cited by 1,131
Feillet, D., Dejax, P., Gendreau, M., & Gueguen, C. (2004) · Networks · doi:10.1002/net.20033 · Cited by 693
Self-citationVehicle dispatching with time-dependent travel times
Ichoua, S., Michel Gendreau, A., & Potvin, J. (2002) · European Journal of Operational Research · doi:10.1016/s0377-2217(02)00147-9 · Cited by 690
Time Dependent Vehicle Routing Problems: Formulations, Properties and Heuristic Algorithms
Malandraki, C., & Daskin, M. S. (1992) · Transportation Science · doi:10.1287/trsc.26.3.185 · Cited by 541
Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
Orda, A., & Rom, R. (1990) · Journal of the ACM · doi:10.1145/79147.214078 · Cited by 483
The Fastest Path through a Network with Random Time-Dependent Travel Times
Hall, R. W. (1986) · Transportation Science · doi:10.1287/trsc.20.3.182 · Cited by 404
The time-dependent pollution-routing problem
Franceschetti, A., Honhon, D., Woensel, T. V., Bektaş, T., & Gilbert Laporte, A. (2013) · Transportation Research Part B Methodological · doi:10.1016/j.trb.2013.08.008 · Cited by 385
Time dependent vehicle routing problem with a multi ant colony system
Donati, A. V., Montemanni, R., Casagrande, N., Rizzoli, A. E., & Gambardella, L. M. (2008) · European Journal of Operational Research · doi:10.1016/j.ejor.2006.06.047 · Cited by 374
A vehicle routing algorithm for the distribution of fresh vegetables and similar perishable food
Osvald, A., & Stirn, L. Z. (2008) · Journal of Food Engineering · doi:10.1016/j.jfoodeng.2007.07.008 · Cited by 366
Cited by
Last-mile delivery concepts: a survey from an operational research perspective
Boysen, N., Fedtke, S., & Schwerdfeger, S. (2021) · OR Spectrum · doi:10.1007/s00291-020-00607-8 · Cited by 621
Time-dependent vehicle routing problem with path flexibility
Huang, Y., Zhao, L., Van Woensel, T., & Gross, J.-P. (2017) · Transportation Research Part B: Methodological · doi:10.1016/j.trb.2016.10.013 · Cited by 257
Liu, C., Kou, G., Zhou, X., Peng, Y., Sheng, H., & Alsaadi, F. E. (2020) · Knowledge-Based Systems · doi:10.1016/j.knosys.2019.06.021 · Cited by 150
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
Metadata
- Authors
- Gendreau, M., Ghiani, G., & Guerriero, E.
- Venue
- Computers & Operations Research
- Publisher
- Elsevier BV
- Published
- 2015-12
- Volume
- 64
- Pages
- 189-197
- ISSN
- 0305-0548 (ISSN-L)
- OpenAlex
- W2233419640
- Cited by
- 253
- References
- 50
- FWCI
- 26.94
- Type
- journal article
- Language
- en
- Open access
- green
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 routing problems: A review. https://app.cochat.ai/papers/10.1016/j.cor.2015.06.001
- The paper
- Gendreau, M., Ghiani, G., & Guerriero, E. (2015). Time-dependent routing problems: A review. Computers & Operations Research. https://doi.org/10.1016/j.cor.2015.06.001
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.