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
Kuo, Y. (2010) · Computers & Industrial Engineering · doi:10.1016/j.cie.2010.03.012 · Cited by 343
A dynamic vehicle routing problem with time-dependent travel times
Haghani, A. E., & Jung, S. (2004) · Computers & Operations Research · doi:10.1016/j.cor.2004.04.013 · Cited by 341
Vehicle routing under time-dependent travel times: The impact of congestion avoidance
Kok, A. L., Hans, E. W., & Schutten, J. M. J. (2011) · Computers & Operations Research · doi:10.1016/j.cor.2011.05.027 · Cited by 336
Analysis of Travel Times and CO 2 Emissions in Time‐Dependent Vehicle Routing
Jabali, O., VanWoensel, T., & de Kok, A. G. (2012) · Production and Operations Management · doi:10.1111/j.1937-5956.2012.01338.x · Cited by 332
Time-Varying Travel Times in Vehicle Routing
Fleischmann, B., Gietz, M., & Gnutzmann, S. (2004) · Transportation Science · doi:10.1287/trsc.1030.0062 · Cited by 242
FASTEST PATHS IN TIME-DEPENDENT NETWORKS FOR INTELLIGENT VEHICLE-HIGHWAY SYSTEMS APPLICATION∗
Kaufman, D. E., & Smith, R. L. (1993) · IVHS journal · doi:10.1080/10248079308903779 · Cited by 225
Dynamic Vehicle Routing Based on Online Traffic Information
Fleischmann, B., Gnutzmann, S., & Sandvoß, E. (2004) · Transportation Science · doi:10.1287/trsc.1030.0074 · Cited by 224
Barcelö, J., Montero, L., Marqués, L., & Carmona, C. (2010) · Transportation Research Record: Journal of the Transportation Research Board · doi:10.3141/2175-03 · Cited by 221
Vehicle routing and scheduling with time-varying data: A case study
Maden, W., Eglese, R. W., & Black, D. (2009) · Journal of the Operational Research Society · doi:10.1057/jors.2009.116 · Cited by 196
The real-time time-dependent vehicle routing problem
Chen, H.-K., Hsueh, C.-F., & Chang, M. (2005) · Transportation Research Part E Logistics and Transportation Review · doi:10.1016/j.tre.2005.01.003 · Cited by 192
Formal-Language-Constrained Path Problems
Barrett, C., Jacob, R., & Marathe, M. (2000) · SIAM Journal on Computing · doi:10.1137/s0097539798337716 · Cited by 181
Balseiro, S. R., Loiseau, I., & Ramonet, J. (2011) · Computers & Operations Research · doi:10.1016/j.cor.2010.10.011 · Cited by 174
Round-Based Public Transit Routing
Delling, D., Pajor, T., & Werneck, R. F. (2015) · Transportation Science · doi:10.1287/trsc.2014.0534 · Cited by 168
Branch and Price for the Time-Dependent Vehicle Routing Problem with Time Windows
Dabia, S., Ropke, S., van Woensel, T., & De Kok, T. (2013) · Transportation Science · doi:10.1287/trsc.1120.0445 · Cited by 165
Figliozzi, M. (2011) · Transportation Research Part E Logistics and Transportation Review · doi:10.1016/j.tre.2011.11.006 · Cited by 155
An iterated local search algorithm for the time-dependent vehicle routing problem with time windows
Hashimoto, H., Yagiura, M., & Ibaraki, T. (2007) · Discrete Optimization · doi:10.1016/j.disopt.2007.05.004 · Cited by 150
An Exact Algorithm for the Elementary Shortest Path Problem with Resource Constraints
Lozano, L., Duque, D., & Medaglia, A. L. (2015) · Transportation Science · doi:10.1287/trsc.2014.0582 · Cited by 134
The time-dependent vehicle routing problem with soft time windows and stochastic travel times
Taş, D., Dellaert, N., Woensel, T. V., & de Kok, A. G. (2014) · Transportation Research Part C Emerging Technologies · doi:10.1016/j.trc.2014.08.007 · Cited by 125
Arc routing problems with time-dependent service costs
Tagmouti, M., Michel Gendreau, A., & Potvin, J. (2006) · European Journal of Operational Research · doi:10.1016/j.ejor.2006.06.028 · Cited by 124
Fast Routing in Very Large Public Transportation Networks Using Transfer Patterns
Bast, H., Carlsson, E., Eigenwillig, A., et al. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-15775-2_25 · Cited by 122
Delling, D., & Wagner, D. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-05465-5_8 · Cited by 120
Path comparisons for a priori and time-adaptive decisions in stochastic, time-varying networks
Miller-Hooks, E. D., & Mahmassani, H. S. (2002) · European Journal of Operational Research · doi:10.1016/s0377-2217(02)00231-x · Cited by 115
Delling, D. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-87744-8_28 · Cited by 99
A fast solution method for the time-dependent orienteering problem
Verbeeck, C., Sörensen, K., Aghezzaf, E., & Vansteenwegen, P. (2013) · European Journal of Operational Research · doi:10.1016/j.ejor.2013.11.038 · Cited by 98
Vehicle-routeing with Time Windows and Time-varying Congestion
Ahn, B.-H., & Shin, J.-Y. (1991) · Journal of the Operational Research Society · doi:10.1057/jors.1991.81 · Cited by 97
BidirectionalA* search on time‐dependent road networks
Nannicini, G., Delling, D., Schultes, D., & Liberti, L. (2011) · Networks · doi:10.1002/net.20438 · Cited by 97
A Road Timetable to aid vehicle routing and scheduling
Eglese, R. W., Maden, W., & Slater, A. (2005) · Computers & Operations Research · doi:10.1016/j.cor.2005.03.029 · Cited by 95
Intriguingly Simple and Fast Transit Routing
Dibbelt, J., Pajor, T., Strasser, B., et al. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-38527-8_6 · Cited by 92
Pattanamekar, P., Park, D., Rilett, L. R., Lee, J., & Lee, C.-K. (2003) · Transportation Research Part C Emerging Technologies · doi:10.1016/s0968-090x(03)00029-9 · Cited by 81
Delling, D. (2009) · Algorithmica · doi:10.1007/s00453-009-9341-0 · Cited by 79
(2015) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611973679 · Cited by 69
The dynamic shortest path problem with anticipation
Thomas, B. W., & White, C. C. (2005) · European Journal of Operational Research · doi:10.1016/j.ejor.2005.09.019 · Cited by 67
A Heuristic Search Approach for a Nonstationary Stochastic Shortest Path Problem with Terminal Cost
Bander, J. L., & White, C. C. (2002) · Transportation Science · doi:10.1287/trsc.36.2.218.562 · Cited by 61
Genetic Algorithm for the Time-Dependent Vehicle Routing Problem
Jung, S., & Haghani, A. E. (2001) · Transportation Research Record Journal of the Transportation Research Board · doi:10.3141/1771-21 · Cited by 58
A way to optimally solve a time-dependent Vehicle Routing Problem with Time Windows
Soler, D., Albiach, J., & Martı́nez, E. (2008) · Operations Research Letters · doi:10.1016/j.orl.2008.07.007 · Cited by 57
Wen, L. G., Çatay, B., & Eglese, R. W. (2013) · European Journal of Operational Research · doi:10.1016/j.ejor.2013.10.044 · Cited by 53
Round-Based Public Transit Routing
Delling, D., Pajor, T., & Werneck, R. F. (2012) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611972924.13 · Cited by 50
Zhang, T., Chaovalitwongse, W. A., & Zhang, Y. (2014) · Journal of Combinatorial Optimization · doi:10.1007/s10878-014-9741-1 · Cited by 47
Finding least fuel emission paths in a network with time‐varying speeds
Qian, J., & Eglese, R. W. (2013) · Networks · doi:10.1002/net.21524 · Cited by 44
Time-minimum routes in time-dependent networks
Fujimura, K. (1995) · IEEE Transactions on Robotics and Automation · doi:10.1109/70.388776 · Cited by 36
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
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.