The DOI matches its Crossref record; 49 of the 49 references it cites were found in a registry or an index.
A unified solution framework for multi-attribute vehicle routing problems
Abstract
Vehicle routing attributes are extra characteristics and decisions that complement the academic problem formulations and aim to properly account for real-life application needs. Hundreds of methods have been introduced in recent years for specific attributes, but the development of a single, general-purpose algorithm, which is both efficient and applicable to a wide family of variants remains a considerable challenge. Yet, such a development is critical for understanding the proper impact of attributes on resolution approaches, and to answer the needs of actual applications. This paper contributes towards addressing these challenges with a component-based design for heuristics, targeting multi-attribute vehicle routing problems, and an efficient general-purpose solver. The proposed Unified Hybrid Genetic Search metaheuristic relies on problem-independent unified local search, genetic operators, and advanced diversity management methods. Problem specifics are confined to a limited part of the method and are addressed by means of assignment, sequencing, and route-evaluation components, which are automatically selected and adapted and provide the fundamental operators to manage attribute specificities. Extensive computational experiments on 29 prominent vehicle routing variants, 42 benchmark instance sets and overall 1099 instances, demonstrate the remarkable performance of the method which matches or outperforms the current state-of-the-art problem-tailored algorithms. Thus, generality does not necessarily go against efficiency for these problem classes.
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
Adhi Harmoko, S., M.Komp, Jacquard, J. M., Zuse, K., & Eniac (2005) · Cited by 18,035
No free lunch theorems for optimization
Wolpert, D. H., & Macready, W. G. (1997) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.585893 · Cited by 14,237
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
Object-Oriented Software Construction
Meyer, B. (1988) · UCLA - Biblioteca de Ciencias y Tecnologia Felix Morales Bueno · Cited by 4,011
(2002) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898718515 · Cited by 4,008
Ropke, S., & Pisinger, D. (2006) · Transportation Science · doi:10.1287/trsc.1050.0135 · Cited by 2,580
(2010) · International Series in Operations Research & Management Science · doi:10.1007/978-1-4419-1665-5 · Cited by 1,642
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
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
Self-citationA 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
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
Self-citationLocal Search in Combinatorial Optimization
(2018) · Princeton University Press eBooks · doi:10.2307/j.ctv346t9c · Cited by 808
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 Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems
Vidal, T., Crainic, T. G., Gendreau, M., Lahrichi, N., & Rei, W. (2012) · Operations Research · doi:10.1287/opre.1120.1048 · Cited by 709
Self-citationA 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
Local search in routing problems with time windows
Savelsbergh, M. W. P. (1985) · Annals of Operations Research · doi:10.1007/bf02022044 · Cited by 693
Vehicle 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
Yang, X.-S. (2021) · Nature-Inspired Optimization Algorithms · doi:10.1016/b978-0-12-821986-7.00008-1 · Cited by 677
Development of a fuel consumption optimization model for the capacitated vehicle routing problem
Xiao, Y., Zhao, Q., Kaku, I., & Xu, Y. (2012) · Computers & Operations Research · doi:10.1016/j.cor.2011.08.013 · Cited by 636
Shekhar, S., Xiong, H. Y., & Zhou, X. S. (2017) · Encyclopedia of GIS · doi:10.1007/978-3-319-17885-1_101452 · Cited by 568
A Classification of Hyper-heuristic Approaches
Burke, E. K., Hyde, M., Kendall, G., Ochoa, G., Özcan, E., & Woodward, J. R. (2010) · International Series in Operations Research & Management Science · doi:10.1007/978-1-4419-1665-5_15 · Cited by 563
Vidal, T., Crainic, T. G., Gendreau, M., et al. (2012) · Computers & Operations Research · doi:10.1016/j.cor.2012.07.018 · Cited by 560
Self-citationThe Granular Tabu Search and Its Application to the Vehicle-Routing Problem
Toth, P., & Vigo, D. (2003) · INFORMS journal on computing · doi:10.1287/ijoc.15.4.333.24890 · Cited by 558
Survey Paper—Time Window Constrained Routing and Scheduling Problems
Solomon, M. M., & Desrosiers, J. (1988) · Transportation Science · doi:10.1287/trsc.22.1.1 · Cited by 552
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
Recent Advances in Memetic Algorithms
Hart, W. E., Smith, J. E., & Krasnogor, N. (2005) · Springer eBooks · doi:10.1007/3-540-32363-5 · Cited by 446
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
Self-citationGolden, B., Wasil, E., Kelly, J. P., & Chao, I. (1998) · Springer eBooks · doi:10.1007/978-1-4615-5755-5_2 · Cited by 345
A Unified Framework for Deterministic Time Constrained Vehicle Routing and Crew Scheduling Problems
Desaulniers, G., Desrosiers, J., loachim, I., Solomon, M. M., Soumis, F., & Villeneuve, D. (1998) · Fleet Management and Logistics · doi:10.1007/978-1-4615-5755-5_3 · Cited by 238
A parallel iterated tabu search heuristic for vehicle routing problems
Cordeau, J., & Maischberger, M. (2011) · Computers & Operations Research · doi:10.1016/j.cor.2011.09.021 · Cited by 235
Fleet Management and Logistics.
Ittmann, H. W., Crainic, T. G., & Gilbert Laporte, A. (1999) · Journal of the Operational Research Society · doi:10.2307/3010639 · Cited by 221
Self-citationMetaheuristics 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
Balseiro, S. R., Loiseau, I., & Ramonet, J. (2011) · Computers & Operations Research · doi:10.1016/j.cor.2010.10.011 · Cited by 174
Resource extension functions: properties, inversion, and generalization to segments
Irnich, S. (2007) · OR Spectrum · doi:10.1007/s00291-007-0083-6 · Cited by 163
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
Routing Optimization for Waste Management
Sahoo, S., Kim, S., Kim, B., Kraas, B., & Popov, A. (2005) · INFORMS Journal on Applied Analytics · doi:10.1287/inte.1040.0109 · Cited by 145
A hybrid evolution strategy for the open vehicle routing problem
Repoussis, P. P., Tarantilis, C. D., Bräysy, O., & Ioannou, G. D. (2008) · Computers & Operations Research · doi:10.1016/j.cor.2008.11.003 · Cited by 121
Crainic, T. G., & Toulouse, M. (2010) · International series in management science/operations research/International series in operations research & management science · doi:10.1007/978-1-4419-1665-5_17 · Cited by 115
Self-citationOptimization Software Class Libraries
VoÃ, S., & Woodruff, D. L. (2002) · Operations research, computer science. Interface series · doi:10.1007/b101931 · Cited by 115
Cordeau, J.-F., Laporte, G., & Mercier, A. (2004) · Journal of the Operational Research Society · doi:10.1057/palgrave.jors.2601707 · Cited by 107
Bräysy, O., Dullaert, W. E. H., Hasle, G., Mester, D. I., & Michel Gendreau, A. (2008) · Transportation Science · doi:10.1287/trsc.1070.0217 · Cited by 105
Ibaraki, T., Imahori, S., Nonobe, K., Sobue, K., Uno, T., & Yagiura, M. (2007) · Discrete Applied Mathematics · doi:10.1016/j.dam.2007.04.022 · Cited by 96
The case for strategic oscillation
Glover, F., & Hao, J. (2009) · Annals of Operations Research · doi:10.1007/s10479-009-0597-1 · Cited by 94
Arc-Guided Evolutionary Algorithm for the Vehicle Routing Problem With Time Windows
Repoussis, P. P., Tarantilis, C. D., & Ioannou, G. D. (2009) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2008.2011740 · Cited by 92
Zachariadis, E. E., & Kiranoudis, C. T. (2010) · Expert Systems with Applications · doi:10.1016/j.eswa.2010.08.061 · Cited by 84
A unified tabu search algorithm for vehicle routing problems with soft time windows
Fu, Z., Eglese, R., & Li, Y. O. (2007) · Journal of the Operational Research Society · doi:10.1057/palgrave.jors.2602371 · Cited by 75
Polacek, M., Benkner, S., Doerner, K. F., et al. (2008) · BuR - Business Research · doi:10.1007/bf03343534 · Cited by 58
Time-window relaxations in vehicle routing heuristics
Vidal, T., Crainic, T. G., Michel Gendreau, A., & Prins, C. (2014) · Journal of Heuristics · doi:10.1007/s10732-014-9273-y · Cited by 55
Self-citation
Cited by
The vehicle routing problem: State of the art classification and review
Braekers, K., Ramaekers, K., & Van Nieuwenhuyse, I. (2016) · Computers & Industrial Engineering · doi:10.1016/j.cie.2015.12.007 · Cited by 1,265
On the min-cost Traveling Salesman Problem with Drone
Ha, Q. M., Deville, Y., Pham, Q. D., & Hà, M. H. (2018) · Transportation Research Part C: Emerging Technologies · doi:10.1016/j.trc.2017.11.015 · Cited by 622
The Electric Fleet Size and Mix Vehicle Routing Problem with Time Windows and Recharging Stations
Hiermann, G., Puchinger, J., Ropke, S., & Hartl, R. F. (2016) · European Journal of Operational Research · doi:10.1016/j.ejor.2016.01.038 · Cited by 584
Pisinger, D., & Ropke, S. (2019) · International Series in Operations Research & Management Science · doi:10.1007/978-3-319-91086-4_4 · Cited by 395
Rich Vehicle Routing Problem: Survey
Caceres-Cruz, J., Arias, P., Guimarans, D., Riera, D., & Juan, A. A. (2015) · ACM Computing Surveys · doi:10.1145/2666003 · Cited by 280
Metadata
- Authors
- Vidal, T., Crainic, T. G., Gendreau, M., & Prins, C.
- Venue
- European Journal of Operational Research
- Publisher
- Elsevier BV
- Published
- 2014-05
- Volume
- 234
- Issue
- 3
- Pages
- 658-673
- ISSN
- 0377-2217 (ISSN-L)
- OpenAlex
- W2028630422
- Cited by
- 433
- References
- 49
- FWCI
- 58.37
- 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.