The DOI matches its Crossref record; 138 of the 138 references it cites were found in a registry or an index.
Heuristics for multi-attribute vehicle routing problems: A survey and synthesis
Abstract
The attributes of vehicle routing problems are additional characteristics or constraints that aim to better take into account the specificities of real applications. The variants thus formed are supported by a well-developed literature, including a large variety of heuristics. This article first reviews the main classes of attributes, providing a survey of heuristics and meta-heuristics for Multi-Attribute Vehicle Routing Problems (MAVRP). It then takes a closer look at the concepts of 64 remarkable meta-heuristics, selected objectively for their outstanding performance on 15 classic MAVRP with different attributes. This cross-analysis leads to the identification of “winning strategies” in designing effective heuristics for MAVRP. This is an important step in the development of general and efficient solution methods for dealing with the large range of vehicle routing variants.
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
Optimization by Simulated Annealing
Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983) · Science · doi:10.1126/science.220.4598.671 · Cited by 45,134
(2007) · Handbook of Approximation Algorithms and Metaheuristics · doi:10.1201/9781420010749-33 · Cited by 6,607
Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
Graham, R. L., Lawler, E. L., Lenstra, J. K., & Kan, A. H. G. R. (1979) · Annals of Discrete Mathematics · doi:10.1016/s0167-5060(08)70356-x · Cited by 5,854
Glover, F., & Laguna, M. (1997) · Cited by 5,679
Glover, F. (1990) · ORSA Journal on Computing · doi:10.1287/ijoc.2.1.4 · Cited by 5,647
Glover, F. (1989) · ORSA Journal on Computing · doi:10.1287/ijoc.1.3.190 · Cited by 5,106
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
Mladenović, N., & Hansen, P. (1997) · Computers & Operations Research · doi:10.1016/s0305-0548(97)00031-2 · Cited by 4,254
Future paths for integer programming and links to artificial intelligence
Glover, F. (1986) · Computers & Operations Research · doi:10.1016/0305-0548(86)90048-1 · Cited by 4,181
(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
An Effective Heuristic Algorithm for the Traveling-Salesman Problem
Lin, S., & Kernighan, B. W. (1973) · Operations Research · doi:10.1287/opre.21.2.498 · Cited by 3,821
Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm
Černý, V. (1985) · Journal of Optimization Theory and Applications · doi:10.1007/bf00940812 · Cited by 3,436
(2003) · International Series in Operations Research & Management Science · doi:10.1007/b101874 · Cited by 3,430
Metaheuristics in combinatorial optimization: Overview and conceptual comparison
Blum, C., & Roli, A. (2003) · ACM Computing Surveys · doi:10.1145/937503.937505 · Cited by 3,236
Glover, F., & Laguna, M. (1997) · doi:10.1007/978-1-4615-6089-0 · Cited by 3,001
Ropke, S., & Pisinger, D. (2006) · Transportation Science · doi:10.1287/trsc.1050.0135 · Cited by 2,580
Metaheuristics in Combinatorial Optimization
Gendreau, M., & Potvin, J.-Y. (2005) · Annals of Operations Research · doi:10.1007/s10479-005-3971-7 · Cited by 2,338
Self-citationLocal Search in Combinatorial Optimization
(2003) · Princeton University Press eBooks · doi:10.1515/9780691187563 · Cited by 2,057
Computer Solutions of the Traveling Salesman Problem
Lin, S. (1965) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1965.tb04146.x · Cited by 1,986
(2010) · International Series in Operations Research & Management Science · doi:10.1007/978-1-4419-1665-5 · Cited by 1,642
On Evolution, Search, Optimization, Genetic Algorithms and Martial Arts : Towards Memetic Algorithms
Moscato, P. (1989) · Cited by 1,516
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
HEURISTICS FOR INTEGER PROGRAMMING USING SURROGATE CONSTRAINTS
Glover, F. (1977) · Decision Sciences · doi:10.1111/j.1540-5915.1977.tb01074.x · Cited by 1,363
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
Bektaş, T., & Laporte, G. (2011) · Transportation Research Part B: Methodological · doi:10.1016/j.trb.2011.02.004 · Cited by 1,219
A Heuristic Algorithm for the Vehicle-Dispatch Problem
Gillett, B. E., & Miller, L. R. (1974) · Operations Research · doi:10.1287/opre.22.2.340 · Cited by 1,179
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 generalized assignment heuristic for vehicle routing
Fisher, M. L., & Jaikumar, R. (1981) · Networks · doi:10.1002/net.3230110205 · Cited by 1,076
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-citationMetastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
Osman, I. H. (1993) · Annals of Operations Research · doi:10.1007/bf02023004 · Cited by 1,046
Fifty Years of Vehicle Routing
Laporte, G. (2009) · Transportation Science · doi:10.1287/trsc.1090.0301 · Cited by 1,022
The orienteering problem: A survey
Vansteenwegen, P., Souffriau, W., & Oudheusden, D. V. (2011) · European Journal of Operational Research · doi:10.1016/j.ejor.2010.03.045 · Cited by 989
Location-routing: Issues, models and methods
Nagy, G., & Salhi, S. (2006) · European Journal of Operational Research · doi:10.1016/j.ejor.2006.04.004 · Cited by 979
A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
Taillard, É. D., Badeau, P., Michel Gendreau, A., Guertin, F., & Potvin, J. (1997) · Transportation Science · doi:10.1287/trsc.31.2.170 · Cited by 957
Probabilistic diversification and intensification in local search for vehicle routing
Rochat, Y., & Taillard, É. D. (1995) · Journal of Heuristics · doi:10.1007/bf02430370 · Cited by 914
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-citationVariable neighbourhood search: methods and applications
Hansen, P., Mladenović, N., & Moreno Pérez, J. A. (2010) · Annals of Operations Research · doi:10.1007/s10479-009-0657-6 · Cited by 860
Parragh, S. N., Doerner, K. F., & Hartl, R. F. (2008) · Journal für Betriebswirtschaft · doi:10.1007/s11301-008-0036-4 · Cited by 857
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
Self-citationLocal Search in Combinatorial Optimization
(2018) · Princeton University Press eBooks · doi:10.2307/j.ctv346t9c · Cited by 808
Hybrid metaheuristics in combinatorial optimization: A survey
Blum, C., Puchinger, J., Raidl, G. R., & Roli, A. (2011) · Applied Soft Computing · doi:10.1016/j.asoc.2011.02.032 · Cited by 787
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
Dueck, G. (1993) · Journal of Computational Physics · doi:10.1006/jcph.1993.1010 · Cited by 765
Static pickup and delivery problems: a classification scheme and survey
Berbeglia, G., Cordeau, J., Gribkovskaia, I. V., & Gilbert Laporte, A. (2007) · Top · doi:10.1007/s11750-007-0009-0 · Cited by 746
Traveling Salesman Problems with Profits
Feillet, D., Dejax, P. J., & Michel Gendreau, A. (2005) · Transportation Science · doi:10.1287/trsc.1030.0079 · Cited by 744
Ant colony optimization techniques for the vehicle routing problem
Bell, J. E., & McMullen, P. R. (2004) · Advanced Engineering Informatics · doi:10.1016/j.aei.2004.07.001 · Cited by 712
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
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-citationPerformance 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
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
VEHICLE ROUTING: METHODS AND STUDIES
Golden, B., & Assad, A. A. (1988) · North-Holland eBooks · Cited by 691
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
Dynamic pickup and delivery problems
Berbeglia, G., Cordeau, J.-F., & Laporte, G. (2010) · European Journal of Operational Research · doi:10.1016/j.ejor.2009.04.024 · Cited by 679
Metaheuristics: A bibliography
Osman, I. H., & Laporte, G. (1996) · Annals of Operations Research · doi:10.1007/bf02125421 · Cited by 672
Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization
(1998) · Springer eBooks · doi:10.1007/978-1-4615-5775-3 · Cited by 669
A survey of very large-scale neighborhood search techniques
Ahuja, R. K., Ergun, Ö., Orlin, J. B., & Punnen, A. P. (2002) · Discrete Applied Mathematics · doi:10.1016/s0166-218x(01)00338-9 · Cited by 643
Chao, I., Golden, B., & Wasil, E. (1996) · European Journal of Operational Research · doi:10.1016/0377-2217(94)00289-4 · Cited by 628
The Traveling Salesman Problem: A Case Study in Local Optimization
Johnson, D. S., & McGeoch, L. A. (2008) · Cited by 595
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
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
An improved Ant System algorithm for theVehicle Routing Problem
Bullnheimer, B., Hartl, R. F., & Strauss, C. (1999) · Annals of Operations Research · doi:10.1023/a:1018940026670 · Cited by 548
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
Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem
Fukasawa, R., Longo, H., Lysgaard, J., Aragão, M. P. D., Reis, M., Uchoa, E., & Werneck, R. F. (2006) · Mathematical Programming · doi:10.1007/s10107-005-0644-x · Cited by 539
New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
Michel Gendreau, A., Hertz, A., & Gilbert Laporte, A. (1992) · Operations Research · doi:10.1287/opre.40.6.1086 · Cited by 521
New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem
Baldacci, R., Mingozzi, A., & Roberti, R. (2011) · Operations Research · doi:10.1287/opre.1110.0975 · Cited by 506
Parallel Metaheuristics: A New Class of Algorithms
Alba, E. (2005) · Cited by 468
Designing and reporting on computational experiments with heuristic methods
Barr, R. S., Golden, B. L., Kelly, J. P., Resende, M. G. C., & Stewart, W. R. (1995) · Journal of Heuristics · doi:10.1007/bf02430363 · Cited by 448
Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
Jepsen, M., Petersen, B., Spoorendonk, S., & Pisinger, D. (2008) · Operations Research · doi:10.1287/opre.1070.0449 · Cited by 410
Guided local search and its application to the traveling salesman problem
Voudouris, C., & Tsang, E. (1999) · European Journal of Operational Research · doi:10.1016/s0377-2217(98)00099-x · Cited by 409
Pisinger, D., & Ropke, S. (2019) · International Series in Operations Research & Management Science · doi:10.1007/978-3-319-91086-4_4 · Cited by 395
D-Ants: Savings Based Ants divide and conquer the vehicle routing problem
Reimann, M., Doerner, K., & Hartl, R. F. (2004) · Computers & Operations Research · doi:10.1016/s0305-0548(03)00014-5 · Cited by 387
A heuristic column generation method for the heterogeneous fleet VRP
Taillard, É. D. (1999) · RAIRO - Operations Research · doi:10.1051/ro:1999101 · Cited by 379
Baldacci, R., Christofides, N., & Mingozzi, A. (2008) · Mathematical Programming · doi:10.1007/s10107-007-0178-5 · Cited by 364
Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows
Røpke, S., Cordeau, J., & Gilbert Laporte, A. (2007) · Networks · doi:10.1002/net.20177 · Cited by 353
Golden, B., Wasil, E., Kelly, J. P., & Chao, I. (1998) · Springer eBooks · doi:10.1007/978-1-4615-5755-5_2 · Cited by 345
Classification in vehicle routing and scheduling
Bodin, L., & Golden, B. (1981) · Networks · doi:10.1002/net.3230110204 · Cited by 333
Routing problems: A bibliography
Gilbert Laporte, A., & Osman, I. H. (1995) · Annals of Operations Research · doi:10.1007/bf02098290 · Cited by 319
A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows
Bent, R. W., & Hentenryck, P. V. (2004) · Computers & Operations Research · doi:10.1016/j.cor.2004.08.001 · Cited by 276
Logistics Systems: Design and Optimization
Langevin, A., & Riopel, D. (2005) · Springer eBooks · doi:10.1007/b106452 · Cited by 274
Ejection chains, reference structures and alternating path methods for traveling salesman problems
Glover, F. (1996) · Discrete Applied Mathematics · doi:10.1016/0166-218x(94)00037-e · Cited by 265
Metaheuristics for the team orienteering problem
Archetti, C., Hertz, A., & Speranza, M. G. (2006) · Journal of Heuristics · doi:10.1007/s10732-006-9004-0 · Cited by 248
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
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
Variable neighborhood search for the dial-a-ride problem
Parragh, S. N., Doerner, K. F., & Hartl, R. F. (2009) · Computers & Operations Research · doi:10.1016/j.cor.2009.10.003 · Cited by 240
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
A hybrid genetic – Particle Swarm Optimization Algorithm for the vehicle routing problem
Marinakis, Y., & Marinaki, M. (2010) · Expert Systems with Applications · doi:10.1016/j.eswa.2009.06.085 · Cited by 230
Routing problems with loading constraints
Iori, M., & Martello, S. (2010) · Top · doi:10.1007/s11750-010-0144-x · Cited by 224
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-citationThe Consistent Vehicle Routing Problem
Groër, C., Golden, B., & Wasil, E. (2009) · Manufacturing & Service Operations Management · doi:10.1287/msom.1080.0243 · Cited by 213
A Tabu search heuristic for the vehicle routing problem with two‐dimensional loading constraints
Michel Gendreau, A., Iori, M., Gilbert Laporte, A., & Martello, S. (2007) · Networks · doi:10.1002/net.20192 · Cited by 209
Vehicle routing problems with split deliveries
Archetti, C., & Speranza, M. G. (2012) · International Transactions in Operational Research · doi:10.1111/j.1475-3995.2011.00811.x · Cited by 208
Routing and Scheduling of School Buses by Computer
Bodin, L. D., & Berman, L. (1979) · Transportation Science · doi:10.1287/trsc.13.2.113 · Cited by 203
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
Branch-and-Price-and-Cut for the Split-Delivery Vehicle Routing Problem with Time Windows
Desaulniers, G. (2010) · Operations Research · doi:10.1287/opre.1090.0713 · Cited by 199
A cooperative parallel meta-heuristic for the vehicle routing problem with time windows
Bouthillier, A. L., & Crainic, T. G. (2004) · Computers & Operations Research · doi:10.1016/j.cor.2003.11.023 · Cited by 194
Self-citationHybrid Metaheuristics: An Emerging Approach to Optimization
(2008) · Studies in Computational Intelligence · doi:10.1007/978-3-540-78295-7 · Cited by 193
Handbook of Swarm Intelligence
(2011) · Adaptation, Learning, and Optimization · doi:10.1007/978-3-642-17390-5 · Cited by 184
Balseiro, S. R., Loiseau, I., & Ramonet, J. (2011) · Computers & Operations Research · doi:10.1016/j.cor.2010.10.011 · Cited by 174
A GRASP × Evolutionary Local Search Hybrid for the Vehicle Routing Problem
Prins, C. (2008) · Studies in computational intelligence · doi:10.1007/978-3-540-85152-3_2 · Cited by 173
Self-citationA tabu search algorithm for the heterogeneous fixed fleet vehicle routing problem
Brandão, J. (2010) · Computers & Operations Research · doi:10.1016/j.cor.2010.04.008 · Cited by 151
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
Solving the vehicle routing problem with adaptive memory programming methodology
Tarantilis, C. D. (2004) · Computers & Operations Research · doi:10.1016/j.cor.2004.03.005 · Cited by 142
Scatter Search and Path-Relinking: Fundamentals, Advances, and Applications
Resende, M. G. C., Ribeiro, C. C., Glover, F., & Martí, R. (2010) · International series in management science/operations research/International series in operations research & management science · doi:10.1007/978-1-4419-1665-5_4 · Cited by 137
State-of-the Art Review—Evolutionary Algorithms for Vehicle Routing
Potvin, J. (2009) · INFORMS journal on computing · doi:10.1287/ijoc.1080.0312 · Cited by 130
Local Search for Vehicle Routing and Scheduling Problems: Review and Conceptual Integration
Funke, B., Grünert, T., & Irnich, S. (2005) · Journal of Heuristics · doi:10.1007/s10732-005-1997-2 · Cited by 122
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-citationPrescott‐Gagnon, E., Desaulniers, G., & Rousseau, L.-M. (2009) · Networks · doi:10.1002/net.20332 · Cited by 114
A new tabu search algorithm for the vehicle routing problem with backhauls
Brandão, J. (2005) · European Journal of Operational Research · doi:10.1016/j.ejor.2005.01.042 · Cited by 113
Alonso, F., Alvarez, M. J., & Beasley, J. E. (2007) · Journal of the Operational Research Society · doi:10.1057/palgrave.jors.2602405 · Cited by 113
Tutorials in Operations Research
Ribeiro, C. C., & Loiseau, I. (2012) · International Transactions in Operational Research · doi:10.1111/j.1475-3995.2011.00837.x · Cited by 113
A GRASP with evolutionary path relinking for the truck and trailer routing problem
Villegas, J. G., Prins, C., Prodhon, C., Medaglia, A. L., & Velasco, N. (2010) · Computers & Operations Research · doi:10.1016/j.cor.2010.11.011 · Cited by 112
Self-citationSolving Large-Scale Vehicle Routing Problems with Time Windows: The State-of-the-Art
Michel Gendreau, A., & Tarantilis, C. D. (2010) · PolyPublie (École Polytechnique de Montréal) · Cited by 111
Zachariadis, E. E., & Kiranoudis, C. T. (2010) · Computers & Operations Research · doi:10.1016/j.cor.2010.02.009 · Cited by 109
Path relinking for the vehicle routing problem
Ho, S. C., & Michel Gendreau, A. (2006) · Journal of Heuristics · doi:10.1007/s10732-006-4192-1 · Cited by 106
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
Enhanced Branch and Price and Cut for Vehicle Routing with Split Deliveries and Time Windows
Archetti, C., Bouchard, M., & Desaulniers, G. (2011) · Transportation Science · doi:10.1287/trsc.1100.0363 · Cited by 99
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
Node-ejection chains for the vehicle routing problem: Sequential and parallel algorithms
Rego, C. (2001) · Parallel Computing · doi:10.1016/s0167-8191(00)00102-2 · Cited by 91
Sequential search and its application to vehicle-routing problems
Irnich, S., Funke, B., & Grünert, T. (2005) · Computers & Operations Research · doi:10.1016/j.cor.2005.02.020 · Cited by 90
Bus routing in a multi-school system
Newton, R. M., & Thomas, W. H. (1974) · Computers & Operations Research · doi:10.1016/0305-0548(74)90047-1 · Cited by 77
Bumble Bees Mating Optimization Algorithm for the Vehicle Routing Problem
Marinakis, Y., & Marinaki, M. (2011) · Adaptation, learning, and optimization · doi:10.1007/978-3-642-17390-5_15 · Cited by 60
Parallel Ant Systems for the Capacitated Vehicle Routing Problem
Doerner, K. F., Hartl, R. F., Kiechle, G., Maria Lucka, A., & Reimann, M. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-24652-7_8 · Cited by 43
Modeling and Solving the Capacitated Vehicle Routing Problem on Trees
Chandran, B., & Raghavan, S. (2008) · Operations research, computer science. Interface series · doi:10.1007/978-0-387-77778-8_11 · Cited by 43
Doerner, K. F., Hartl, R. F., Siegfried Benkner, A., & Maria Lucka, A. (2006) · Parallel Processing Letters · doi:10.1142/s0129626406002691 · Cited by 42
The Attribute Based Hill Climber
Whittley, I. M., & Smith, G. D. (2004) · Journal of Mathematical Modelling and Algorithms · doi:10.1023/b:jmma.0000036583.17284.02 · Cited by 31
Barbakh, W. A., Wu, Y. N., & Fyfe, C. A. (2009) · Studies in computational intelligence · doi:10.1007/978-3-642-04005-4_10 · Cited by 27
Cited by
Wang, G., Gunasekaran, A., Ngai, E. W. T., & Papadopoulos, T. (2016) · International Journal of Production Economics · doi:10.1016/j.ijpe.2016.03.014 · Cited by 1,545
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
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
Ren, S., Zhang, Y., Liu, Y., Sakao, T., Huisingh, D., & Almeida, C. M. V. B. (2019) · Journal of Cleaner Production · doi:10.1016/j.jclepro.2018.11.025 · Cited by 525
Felipe, Á., Ortuño, M. T., Righini, G., & Tirado, G. (2014) · Transportation Research Part E: Logistics and Transportation Review · doi:10.1016/j.tre.2014.09.003 · Cited by 491
Metadata
- Authors
- Vidal, T., Crainic, T. G., Gendreau, M., & Prins, C.
- Venue
- European Journal of Operational Research
- Publisher
- Elsevier BV
- Published
- 2013-11
- Volume
- 231
- Issue
- 1
- Pages
- 1-21
- ISSN
- 0377-2217 (ISSN-L)
- OpenAlex
- W2094513248
- Cited by
- 430
- References
- 138
- FWCI
- 88.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.