The DOI matches its Crossref record; 33 of the 33 references it cites were found in a registry or an index.
A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems
Abstract
We propose an algorithmic framework that successfully addresses three vehicle routing problems: the multidepot VRP, the periodic VRP, and the multidepot periodic VRP with capacitated vehicles and constrained route duration. The metaheuristic combines the exploration breadth of population-based evolutionary search, the aggressive-improvement capabilities of neighborhood-based metaheuristics, and advanced population-diversity management schemes. Extensive computational experiments show that the method performs impressively in terms of computational efficiency and solution quality, identifying either the best known solutions, including the optimal ones, or new best solutions for all currently available benchmark instances for the three problem classes. The proposed method also proves extremely competitive for the capacitated VRP.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Holland, J. H. (1992) · The MIT Press eBooks · doi:10.7551/mitpress/1090.001.0001 · Cited by 47,002
Adhi Harmoko, S., M.Komp, Jacquard, J. M., Zuse, K., & Eniac (2005) · Cited by 18,035
Dantzig, G. B., & Ramser, J. H. (1959) · Management Science · doi:10.1287/mnsc.6.1.80 · Cited by 4,985
Completely Derandomized Self-Adaptation in Evolution Strategies
Hansen, N., & Ostermeier, A. (2001) · Evolutionary Computation · doi:10.1162/106365601750190398 · Cited by 4,397
(2002) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898718515 · Cited by 4,008
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
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 Tabu Search Heuristic for the Vehicle Routing Problem
Michel Gendreau, A., Hertz, A., & Gilbert Laporte, A. (1994) · Management Science · doi:10.1287/mnsc.40.10.1276 · Cited by 1,303
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
Self-citationA 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
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-citationVehicle 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
Self-citationClassical 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
Time Constrained Routing and Scheduling
Desrosiers, J., Solomon, M. M., Soumis, F., & Dumas, Y. (1992) · PolyPublie (École Polytechnique de Montréal) · doi:10.1016/s0927-0507%2805%2980106-9 · Cited by 709
Performance of various computers using standard linear equations software
Dongarra, J. J. (1992) · ACM SIGARCH Computer Architecture News · doi:10.1145/141868.141871 · Cited by 708
Shekhar, S., Xiong, H. Y., & Zhou, X. S. (2017) · Encyclopedia of GIS · doi:10.1007/978-3-319-17885-1_101452 · Cited by 568
The 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
Industrial aspects and literature survey: Fleet composition and routing
Hoff, A., Andersson, H., Christiansen, M., Hasle, G., & Løkketangen, A. (2010) · Computers & Operations Research · doi:10.1016/j.cor.2010.03.015 · Cited by 371
Golden, B., Wasil, E., Kelly, J. P., & Chao, I. (1998) · Springer eBooks · doi:10.1007/978-1-4615-5755-5_2 · Cited by 345
Chapter 3 Stochastic and dynamic networks and routing
Powell, W. B., Jaillet, P., & Odoni, A. (1995) · Handbooks in Operations Research and Management Science · doi:10.1016/s0927-0507(05)80107-0 · Cited by 334
Replacement strategies to preserve useful diversity in steady-state genetic algorithms
LOZANO, M., HERRERA, F., & CANO, J. (2008) · Information Sciences · doi:10.1016/j.ins.2008.07.031 · Cited by 205
Parallel Strategies for Meta-Heuristics
Crainic, T. G., & Toulouse, M. (2006) · International Series in Operations Research & Management Science · doi:10.1007/0-306-48056-5_17 · Cited by 166
Self-citationRussell, R. A., & Igo, W. (1979) · Networks · doi:10.1002/net.3230090102 · Cited by 156
Evolutionary Algorithms for the Vehicle Routing Problem with Time Windows
Br�ysy, O., Dullaert, W. E. H., & Michel Gendreau, A. (2004) · Journal of Heuristics · doi:10.1007/s10732-005-5431-6 · Cited by 127
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-citationZachariadis, E. E., & Kiranoudis, C. T. (2010) · Computers & Operations Research · doi:10.1016/j.cor.2010.02.009 · Cited by 109
The case for strategic oscillation
Glover, F., & Hao, J. (2009) · Annals of Operations Research · doi:10.1007/s10479-009-0597-1 · Cited by 94
On a periodic vehicle routing problem
Coene, S., Arnout, A., & Spieksma, F. C. R. (2010) · Journal of the Operational Research Society · doi:10.1057/jors.2009.154 · Cited by 86
An Experimental Study of the Ant Colony System for the Period Vehicle Routing Problem
Matos, A. C., & Oliveira, R. C. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-28646-2_26 · Cited by 36
An Exact Algorithm for Multi Depot and Multi Period Vehicle Scheduling Problem
Kang, K. H., Lee, Y. H., & Lee, B. K. (2005) · Lecture notes in computer science · doi:10.1007/11424925_38 · Cited by 23
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
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
Self-citationHeuristics 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-citation
Metadata
- Authors
- Vidal, T., Crainic, T. G., Gendreau, M., Lahrichi, N., & Rei, W.
- Venue
- Operations Research
- Published
- 2012-06
- Volume
- 60
- Issue
- 3
- Pages
- 611-624
- ISSN
- 0030-364X (ISSN-L)
- 1526-5463
- OpenAlex
- W2119601963
- Cited by
- 709
- References
- 33
- FWCI
- 88.94
- 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.