The DOI matches its Crossref record; 59 of the 59 references it cites were found in a registry or an index.
Rich Vehicle Routing Problem: Survey
Abstract
The Vehicle Routing Problem (VRP) is a well-known research line in the optimization research community. Its different basic variants have been widely explored in the literature. Even though it has been studied for years, the research around it is still very active. The new tendency is mainly focused on applying this study case to real-life problems. Due to this trend, the Rich VRP arises: combining multiple constraints for tackling realistic problems. Nowadays, some studies have considered specific combinations of real-life constraints to define the emerging Rich VRP scopes. This work surveys the state of the art in the field, summarizing problem combinations, constraints defined, and approaches found.
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
(1979) · Cited by 43,841
Lecture Notes in Computer Science 1205
(1999) · Industrial Robot: An International Journal · doi:10.1108/ir.1999.04926fae.001 · Cited by 38,662
A Formal Basis for the Heuristic Determination of Minimum Cost Paths
Hart, P., Nilsson, N., & Raphael, B. (1968) · IEEE Transactions on Systems Science and Cybernetics · doi:10.1109/tssc.1968.300136 · Cited by 12,738
Dantzig, G. B., & Ramser, J. H. (1959) · Management Science · doi:10.1287/mnsc.6.1.80 · Cited by 4,985
Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
Solomon, M. M. (1987) · Operations Research · doi:10.1287/opre.35.2.254 · Cited by 4,298
Scheduling of Vehicles from a Central Depot to a Number of Delivery Points
Clarke, G., & Wright, J. W. (1964) · Operations Research · doi:10.1287/opre.12.4.568 · Cited by 3,894
Ropke, S., & Pisinger, D. (2006) · Transportation Science · doi:10.1287/trsc.1050.0135 · Cited by 2,580
Metaheuristics : from desing to implementation
Talbi, E. (2009) · HAL · Cited by 2,494
Dowsland, K. A., & Thompson, J. M. (2012) · Handbook of Natural Computing · doi:10.1007/978-3-540-92910-9_49 · Cited by 2,432
Metaheuristics: From Design to Implementation
Talbi, E. (2009) · Wiley eBooks · doi:10.1002/9780470496916 · Cited by 2,380
Ant colonies for the travelling salesman problem
Dorigo, M., & Gambardella, L. M. (1997) · Biosystems · doi:10.1016/s0303-2647(97)01708-5 · Cited by 2,023
Depth-first iterative-deepening
Korf, R. E. (1985) · Artificial Intelligence · doi:10.1016/0004-3702(85)90084-0 · Cited by 1,562
The Vehicle Routing Problem: Latest Advances and New Challenges
(2008) · Operations Research/Computer Science Interfaces · doi:10.1007/978-0-387-77778-8 · Cited by 1,483
A general heuristic for vehicle routing problems
Pisinger, D., & Ropke, S. (2007) · Computers & Operations Research · doi:10.1016/j.cor.2005.09.012 · Cited by 1,443
Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems
Shaw, P. (1998) · Lecture Notes in Computer Science · doi:10.1007/3-540-49481-2_30 · Cited by 1,366
Complexity of vehicle routing and scheduling problems
Lenstra, J. K., & Kan, A. H. G. R. (1981) · Networks · doi:10.1002/net.3230110211 · Cited by 1,325
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
Bektaş, T., & Laporte, G. (2011) · Transportation Research Part B: Methodological · doi:10.1016/j.trb.2011.02.004 · Cited by 1,219
Constraint satisfaction in logic programming
Hentenryck, P. V. (1989) · Medical Entomology and Zoology · Cited by 1,218
Vehicle Routing Problem with Time Windows, Part I: Route Construction and Local Search Algorithms
Bräysy, O., & Gendreau, M. (2005) · Transportation Science · doi:10.1287/trsc.1030.0056 · Cited by 1,135
A Green Vehicle Routing Problem
Erdoğan, S., & Miller-Hooks, E. (2012) · Transportation Research Part E: Logistics and Transportation Review · doi:10.1016/j.tre.2011.08.001 · Cited by 1,133
Generalized best-first search strategies and the optimality of A*
Dechter, R., & Pearl, J. (1985) · Journal of the ACM · doi:10.1145/3828.3830 · Cited by 1,071
A simple and effective evolutionary algorithm for the vehicle routing problem
Prins, C. (2004) · Computers & Operations Research · doi:10.1016/s0305-0548(03)00158-8 · Cited by 1,058
Fifty Years of Vehicle Routing
Laporte, G. (2009) · Transportation Science · doi:10.1287/trsc.1090.0301 · Cited by 1,022
A unified tabu search heuristic for vehicle routing problems with time windows
Cordeau, J.-F., Laporte, G., & Mercier, A. (2001) · Journal of the Operational Research Society · doi:10.1057/palgrave.jors.2601163 · Cited by 897
Survey of Green Vehicle Routing Problem: Past and future trends
Lin, C., Choy, K. L., Ho, G. T. S., Chung, S., & Lam, H. Y. (2013) · Expert Systems with Applications · doi:10.1016/j.eswa.2013.07.107 · Cited by 880
A tabu search heuristic for periodic and multi-depot vehicle routing problems
Cordeau, J.-F., Gendreau, M., & Laporte, G. (1997) · Networks · doi:10.1002/(sici)1097-0037(199709)30:2<105::aid-net5>3.0.co;2-g · Cited by 864
Vehicle Routing Problem with Time Windows, Part II: Metaheuristics
Bräysy, O., & Gendreau, M. (2005) · Transportation Science · doi:10.1287/trsc.1030.0057 · Cited by 844
MAX-MIN Ant System and local search for the traveling salesman problem
Stutzle, T., & Hoos, H. (2002) · Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97) · doi:10.1109/icec.1997.592327 · Cited by 831
The vehicle routing problem: A taxonomic review
Eksioglu, B., Vural, A. V., & Reisman, A. (2009) · Computers & Industrial Engineering · doi:10.1016/j.cie.2009.05.009 · Cited by 786
A review of recent research on green road freight transportation
Demir, E., Bektaş, T., & Laporte, G. (2014) · European Journal of Operational Research · doi:10.1016/j.ejor.2013.12.033 · Cited by 772
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
An adaptive large neighborhood search heuristic for the Pollution-Routing Problem
Demir, E., Bektaş, T., & Laporte, G. (2012) · European Journal of Operational Research · doi:10.1016/j.ejor.2012.06.044 · Cited by 726
A tabu search heuristic for the static multi-vehicle dial-a-ride problem
Cordeau, J.-F., & Laporte, G. (2003) · Transportation Research Part B: Methodological · doi:10.1016/s0191-2615(02)00045-0 · Cited by 702
Iterated Local Search: Framework and Applications
Lourenço, H. R., Martin, O. C., & Stützle, T. (2010) · International Series in Operations Research & Management Science · doi:10.1007/978-1-4419-1665-5_12 · Cited by 571
Vidal, T., Crainic, T. G., Gendreau, M., et al. (2012) · Computers & Operations Research · doi:10.1016/j.cor.2012.07.018 · Cited by 560
The fleet size and mix vehicle routing problem
Golden, B., Assad, A. A., Levy, L., & Gheysens, F. (1984) · Computers & Operations Research · doi:10.1016/0305-0548(84)90007-8 · Cited by 550
Proceedings of IEEE International Conference on Evolutionary Computation
(1996) · Proceedings of IEEE International Conference on Evolutionary Computation · doi:10.1109/icec.1996.542326 · Cited by 496
Baldacci, R., Mingozzi, A., & Roberti, R. (2012) · European Journal of Operational Research · doi:10.1016/j.ejor.2011.07.037 · Cited by 474
The bi-objective Pollution-Routing Problem
Demir, E., Bektaş, T., & Laporte, G. (2014) · European Journal of Operational Research · doi:10.1016/j.ejor.2013.08.002 · Cited by 460
A unified solution framework for multi-attribute vehicle routing problems
Vidal, T., Crainic, T. G., Gendreau, M., & Prins, C. (2014) · European Journal of Operational Research · doi:10.1016/j.ejor.2013.09.045 · Cited by 433
Heuristics for multi-attribute vehicle routing problems: A survey and synthesis
Vidal, T., Crainic, T. G., Gendreau, M., & Prins, C. (2013) · European Journal of Operational Research · doi:10.1016/j.ejor.2013.02.053 · Cited by 430
Desaulniers, G., Desrosiers, J., & Solomon, M. M. (2005) · Springer eBooks · doi:10.1007/b135457 · Cited by 414
1. An Overview of Vehicle Routing Problems
Toth, P., & Vigo, D. (2002) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898718515.ch1 · Cited by 343
Green logistics at Eroski: A case study
Ubeda, S., Arcelus, F. J., & Faulin, J. (2011) · International Journal of Production Economics · doi:10.1016/j.ijpe.2010.04.041 · Cited by 337
What you should know about the vehicle routing problem
Gilbert Laporte, A. (2007) · Naval Research Logistics (NRL) · doi:10.1002/nav.20261 · Cited by 329
Routing a Heterogeneous Fleet of Vehicles
Baldacci, R., Battarra, M., & Vigo, D. (2008) · Operations research, computer science. Interface series · doi:10.1007/978-0-387-77778-8_1 · Cited by 246
Metaheuristics for the Vehicle Routing Problem and Its Extensions: A Categorized Bibliography
Michel Gendreau, A., Potvin, J., Bräumlaysy, O., Hasle, G., & Løkketangen, A. (2008) · Operations research, computer science. Interface series · doi:10.1007/978-0-387-77778-8_7 · Cited by 203
Ant colony optimization for real-world vehicle routing problems: From theory to applications
Rizzoli, A. E., Montemanni, R., Lucibello, E., & Gambardella, L. M. (2007) · Swarm Intelligence · doi:10.1007/s11721-007-0005-x · Cited by 202
Bettinelli, A., Ceselli, A., & Righini, G. (2010) · Transportation Research Part C Emerging Technologies · doi:10.1016/j.trc.2010.07.008 · Cited by 186
A Column Generation Algorithm for a Rich Vehicle-Routing Problem
Ceselli, A., Righini, G., & Salani, M. (2009) · Transportation Science · doi:10.1287/trsc.1080.0256 · Cited by 171
Exact algorithms for routing problems under vehicle capacity constraints
Baldacci, R., Toth, P., & Vigo, D. (2010) · Annals of Operations Research · doi:10.1007/s10479-009-0650-0 · Cited by 161
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
Cordeau, J.-F., Laporte, G., & Mercier, A. (2004) · Journal of the Operational Research Society · doi:10.1057/palgrave.jors.2601707 · Cited by 107
Survey: Matheuristics for Rich Vehicle Routing Problems
Doerner, K. F., & Schmid, V. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-16054-7_15 · Cited by 99
Routing fleets with multiple driving ranges: Is it possible to use greener fleet configurations?
Juan, A. A., Goentzel, J., & Bektaş, T. (2014) · Applied Soft Computing · doi:10.1016/j.asoc.2014.03.012 · Cited by 95
Self-citationMultiple Ant Colony Optimization for a Rich Vehicle Routing Problem: A Case Study
Pellegrini, P., Favaretto, D., & Moretti, E. (2007) · Lecture notes in computer science · doi:10.1007/978-3-540-74827-4_79 · Cited by 35
Application of Two Nearest Neighbor Approaches to a Rich Vehicle Routing Problem
Pellegrini, P. (2005) · Cited by 12
Variants of VRP to Optimize Logistics Management Problems
Gomez-Santillan, C. G., Cruz–Reyes, L., Morales-Rodríguez, M. L., Barbosa, J. J. G., Castillo, O., Rivera, G., & Hernández, P. H. (2012) · IGI Global eBooks · doi:10.4018/978-1-4666-0297-7.ch008 · Cited by 10
Cited by
Evolutionary Large-Scale Multi-Objective Optimization: A Survey
Tian, Y., Si, L., Zhang, X., Cheng, R., He, C., Tan, K. C., & Jin, Y. (2022) · ACM Computing Surveys · doi:10.1145/3470971 · Cited by 401
Monte Carlo Tree Search: a review of recent modifications and applications
Świechowski, M., Godlewski, K., Sawicki, B., & Mańdziuk, J. (2023) · Artificial Intelligence Review · doi:10.1007/s10462-022-10228-y · Cited by 365
Evolutionary Transfer Optimization - A New Frontier in Evolutionary Computation Research
Tan, K. C., Feng, L., & Jiang, M. (2021) · IEEE Computational Intelligence Magazine · doi:10.1109/mci.2020.3039066 · Cited by 315
An improved discrete bat algorithm for symmetric and asymmetric Traveling Salesman Problems
Osaba, E., Yang, X.-S., Diaz, F., Lopez-Garcia, P., & Carballedo, R. (2016) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2015.10.006 · Cited by 312
Metadata
- Authors
- Caceres-Cruz, J., Arias, P., Guimarans, D., Riera, D., & Juan, A. A.
- Venue
- ACM Computing Surveys
- Published
- 2014-12-19
- Volume
- 47
- Issue
- 2
- Pages
- 1-28
- ISSN
- 0360-0300 (ISSN-L)
- 1557-7341
- OpenAlex
- W2112094258
- Cited by
- 280
- References
- 59
- FWCI
- 32.66
- 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
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.