The DOI matches its Crossref record; 190 of the 190 references it cites were found in a registry or an index.
Metaheuristics in Combinatorial Optimization
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
(1979) · Cited by 43,841
An introduction to probability theory and its applications
(1958) · Journal of the Franklin Institute · doi:10.1016/0016-0032(58)90688-4 · Cited by 29,269
Genetic Algorithms in Search, Optimization and Machine Learning
Goldberg, D. E., & Robson, D. (1988) · Cited by 18,391
Goldberg, D. E., & Shakespeare, W. (2002) · Cited by 16,088
Ant system: optimization by a colony of cooperating agents
Dorigo, M., Maniezzo, V., & Colorni, A. (1996) · IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics) · doi:10.1109/3477.484436 · Cited by 12,067
Genetic Algorithms + Data Structures = Evolution Programs
Michalewicz, Z. (1992) · Artificial Intelligence · doi:10.1007/978-3-662-02830-8 · Cited by 11,553
An Introduction to Genetic Algorithms
Mitchell, M. (1996) · doi:10.7551/mitpress/3927.001.0001 · Cited by 11,340
Goldberg, D. E. (1989) · Medical Entomology and Zoology · Cited by 10,109
Ant colony system: a cooperative learning approach to the traveling salesman problem
Dorigo, M., & Gambardella, L. M. (1997) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.585892 · Cited by 8,081
The origins of order; self organization and selection in evolution
(1994) · International Journal of Biochemistry · doi:10.1016/0020-711x(94)90119-8 · Cited by 6,649
(2007) · Handbook of Approximation Algorithms and Metaheuristics · doi:10.1201/9781420010749-33 · Cited by 6,607
Combinatorial Optimization: Algorithms and Complexity.
Johnson, D. S., Papadimitriou, C. H., & Steiglitz, K. (1984) · The American Mathematical Monthly · doi:10.2307/2322374 · Cited by 5,942
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
Integer and Combinatorial Optimization
Williams, H. P., Nemhauser, G. L., & Wolsey, L. A. (1990) · Journal of the Operational Research Society · doi:10.2307/2583737 · Cited by 5,485
Bäck, T. (1996) · Oxford University Press eBooks · doi:10.1093/oso/9780195099713.001.0001 · Cited by 5,113
Glover, F. (1989) · ORSA Journal on Computing · doi:10.1287/ijoc.1.3.190 · Cited by 5,106
Genetic Algorithms + Data Structures = Evolution Programs
Michalewicz, Z. (1996) · Springer eBooks · doi:10.1007/978-3-662-03315-9 · Cited by 5,095
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
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
Optimization, Learning and Natural Algorithms
Dorigo, M. (1992) · Medical Entomology and Zoology · Cited by 3,307
Integer and Combinatorial Optimization
Nemhauser, G., & Wolsey, L. (1988) · Wiley eBooks · doi:10.1002/9781118627372 · Cited by 3,176
Glover, F., & Laguna, M. (1997) · doi:10.1007/978-1-4615-6089-0 · Cited by 3,001
Handbook of Evolutionary Computation
(1997) · Institute of Physics eBooks · doi:10.1887/0750308958 · Cited by 2,990
Ant Algorithms for Discrete Optimization
Dorigo, M., Caro, G. D., & Gambardella, L. M. (1999) · Artificial Life · doi:10.1162/106454699568728 · Cited by 2,808
Artificial Intelligence through Simulated Evolution
Fogel, L. J., Owens, A. J., & Walsh, M. J. (1966) · International Linear Collider · Cited by 2,796
Greedy Randomized Adaptive Search Procedures
Feo, T. A., & Resende, M. G. C. (1995) · Journal of Global Optimization · doi:10.1007/bf01096763 · Cited by 2,778
Hoos (2000) · doi:10.1016/s0167-739x(00)00043-1 · Cited by 2,737
Modern heuristic techniques for combinatorial problems
Reeves, C. R. (1993) · Medical Entomology and Zoology · Cited by 2,580
Evolutionsstrategie : Optimierung technischer Systeme nach Prinzipien der biologischen Evolution
Rechenberg, I. (1973) · Frommann-Holzboog eBooks · Cited by 2,440
Dowsland, K. A., & Thompson, J. M. (2012) · Handbook of Natural Computing · doi:10.1007/978-3-540-92910-9_49 · Cited by 2,432
An Introduction to Chaotic Dynamical Systems
Devaney, R. L., & Eckmann, J.-P. (1987) · Physics Today · doi:10.1063/1.2820117 · Cited by 2,344
Greedy Randomized Adaptive Search Procedures
Resende, M. G. C., & Ribeiro, C. C. (2006) · International Series in Operations Research & Management Science · doi:10.1007/0-306-48056-5_8 · Cited by 2,310
Corne, D., Dorigo, M., Glover, F., Dasgupta, D., Moscato, P., Poli, R., & Price, K. V. (1999) · Cited by 2,136
Local Search in Combinatorial Optimization
(2003) · Princeton University Press eBooks · doi:10.1515/9780691187563 · Cited by 2,057
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
Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation
Larraanaga, P., & Lozano, J. A. (2001) · Kluwer Academic Publishers eBooks · Cited by 1,914
Genetic algorithms with sharing for multimodal function optimization
Goldberg, D. E., & Richardson, J. T. (1987) · international conference on Genetic algorithms · Cited by 1,912
Variable neighborhood search: Principles and applications
Hansen, P., & Mladenović, N. (2001) · European Journal of Operational Research · doi:10.1016/s0377-2217(00)00100-4 · Cited by 1,902
AntNet: Distributed Stigmergetic Control for Communications Networks
Di Caro, G., & Dorigo, M. (1998) · Journal of Artificial Intelligence Research · doi:10.1613/jair.530 · Cited by 1,579
On Evolution, Search, Optimization, Genetic Algorithms and Martial Arts : Towards Memetic Algorithms
Moscato, P. (1989) · Cited by 1,516
An introduction to simulated evolutionary optimization
Fogel, D. B. (1994) · IEEE Transactions on Neural Networks · doi:10.1109/72.265956 · Cited by 1,503
The Ant Colony Optimization Metaheuristic
(2004) · Ant Colony Optimization · doi:10.7551/mitpress/1290.003.0004 · Cited by 1,406
Bar-yam, Y. (2019) · CRC Press eBooks · doi:10.1201/9780429034961 · Cited by 1,375
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
Vent, W. (1975) · Feddes Repertorium · doi:10.1002/fedr.19750860506 · Cited by 1,331
(1989) · European Journal of Operational Research · doi:10.1016/0377-2217(89)90373-1 · Cited by 1,324
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
Baluja, S. (1994) · Cited by 1,290
An Analysis Of The Behavior Of A Class Of Genetic Adaptive Systems.
Jong, K. A. D. (1975) · Deep Blue (University of Michigan) · doi:10.7302/10966 · Cited by 1,290
Dueck, G., & Scheuer, T. (1990) · Journal of Computational Physics · doi:10.1016/0021-9991(90)90201-b · Cited by 1,232
From recombination of genes to the estimation of distributions I. Binary parameters
Mühlenbein, H., & Paaß, G. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-61723-x_982 · Cited by 1,207
Lourenço, H. R., Martin, O. C., & Stützle, T. (2006) · International Series in Operations Research & Management Science · doi:10.1007/0-306-48056-5_11 · Cited by 1,164
Job Shop Scheduling by Simulated Annealing
van Laarhoven, P. J. M., Aarts, E. H. L., & Lenstra, J. K. (1992) · Operations Research · doi:10.1287/opre.40.1.113 · Cited by 1,123
A probabilistic heuristic for a computationally difficult set covering problem
Feo, T. A., & Resende, M. G. C. (1989) · Operations Research Letters · doi:10.1016/0167-6377(89)90002-3 · Cited by 1,065
BOA: the Bayesian optimization algorithm
Pelikán, M., Goldberg, D. E., & Cantú‐Paz, E. (1999) · Cited by 1,053
Metastrategy 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
Whitley, L. D. (1989) · international conference on Genetic algorithms · Cited by 992
A Fast Taboo Search Algorithm for the Job Shop Problem
Nowicki, E., & Smutnicki, C. (1996) · Management Science · doi:10.1287/mnsc.42.6.797 · Cited by 976
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
Self-citationThe self-organizing exploratory pattern of the argentine ant
Deneubourg, J. L., Aron, S., Goss, S., & Pasteels, J. M. (1990) · Journal of Insect Behavior · doi:10.1007/bf01417909 · Cited by 921
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
Glover, F., Taillard, E., & Taillard, E. (1993) · Annals of Operations Research · doi:10.1007/bf02078647 · Cited by 902
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
Efficient and Accurate Parallel Genetic Algorithms
Cantú‐Paz, E. (2001) · Genetic algorithms and evolutionary computation · doi:10.1007/978-1-4615-4369-5 · Cited by 869
Handbook of applied optimization
(2002) · Choice Reviews Online · doi:10.5860/choice.40-1593 · Cited by 867
The Ant Colony Optimization Metaheuristic: Algorithms, Applications, and Advances
Dorigo, M., & Stützle, T. (2003) · International Series in Operations Research & Management Science · doi:10.1007/0-306-48056-5_9 · 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
Self-citationRobust taboo search for the quadratic assignment problem
Taillard, É. D. (1991) · Parallel Computing · doi:10.1016/s0167-8191(05)80147-4 · Cited by 835
Local Search in Combinatorial Optimization
(2018) · Princeton University Press eBooks · doi:10.2307/j.ctv346t9c · Cited by 834
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
Battiti, R., & Tecchiolli, G. (1994) · ORSA Journal on Computing · doi:10.1287/ijoc.6.2.126 · Cited by 801
An updated survey of GA-based multiobjective optimization techniques
Coello, C. A. (2000) · ACM Computing Surveys · doi:10.1145/358923.358929 · Cited by 773
Dueck, G. (1993) · Journal of Computational Physics · doi:10.1006/jcph.1993.1010 · Cited by 765
Ant colony optimization for resource-constrained project scheduling
Merkle, D., Middendorf, M., & Schmeck, H. (2002) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2002.802450 · Cited by 759
A Survey of Optimization by Building and Using Probabilistic Models
Pelikan, M., Goldberg, D. E., & Lobo, F. G. (2002) · Computational Optimization and Applications · doi:10.1023/a:1013500812258 · Cited by 750
Fundamentals of Scatter Search and Path Relinking
Glover, F., Laguna, M., & Martí, R. (2000) · Cited by 743
Genetic Algorithms for the Traveling Salesman Problem
Grefenstette, J. J., Gopal, R., Rosmaita, B. J., et al. (1985) · international conference on Genetic algorithms · Cited by 731
MACS-VRPTW: a multiple ant colony system for vehicle routing problems with time windows
Gambardella, L. M., Taillard, É. D., & Agazzi, G. (1999) · Cited by 725
Ant colonies for the quadratic assignment problem
Gambardella, L. M., Taillard, É. D., & Dorigo, M. (1999) · Journal of the Operational Research Society · doi:10.1057/palgrave.jors.2600676 · Cited by 704
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
The Simple Genetic Algorithm: Foundations and Theory
Vose, M. D. (1999) · Medical Entomology and Zoology · Cited by 701
Convergence of an annealing algorithm
Lundy, M., & Mees, A. (1986) · Mathematical Programming · doi:10.1007/bf01582166 · Cited by 693
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
(2012) · Systems Science · doi:10.1201/b13095-12 · Cited by 637
Removing the Genetics from the Standard Genetic Algorithm
Baluja, S., & Caruana, R. (1995) · Machine Learning Proceedings 1995 · doi:10.1016/b978-1-55860-377-6.50014-1 · Cited by 573
Tabu Search and Adaptive Memory Programming — Advances, Applications and Challenges
Glover, F. (1997) · Operations research, computer science. Interface series · doi:10.1007/978-1-4615-4102-8_1 · Cited by 560
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
Genetic Algorithms: Principles and Perspectives: A Guide to GA Theory
Reeves, C. R., & Rowe, J. E. (2002) · Thammasat University Digital Collections · Cited by 557
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
The Theory and Practice of Simulated Annealing
Henderson, D., Jacobson, S. H., & Johnson, A. W. (2006) · International Series in Operations Research & Management Science · doi:10.1007/0-306-48056-5_10 · Cited by 514
Harvey, W. D., & Ginsberg, M. L. (1995) · Cited by 513
MIMIC: Finding Optima by Estimating Probability Densities
Bonet, J. S. D., Isbell, C. L., & Viola, P. A. (1996) · Cited by 457
Ginsberg, M. L. (1993) · Journal of Artificial Intelligence Research · doi:10.1613/jair.1 · Cited by 456
Memetic algorithms: a short introduction
Moscato, P. (1999) · McGraw-Hill Ltd., UK eBooks · Cited by 455
A dynamic model and parallel tabu search heuristic for real-time ambulance relocation
Gendreau, M., Laporte, G., & Semet, F. (2001) · Parallel Computing · doi:10.1016/s0167-8191(01)00103-x · Cited by 455
Self-citationThe Hyper-Cube Framework for Ant Colony Optimization
Blum, C., & Dorigo, M. (2004) · IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics) · doi:10.1109/tsmcb.2003.821450 · Cited by 432
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
Applying the ANT System to the Vehicle Routing Problem
Bullnheimer, B., Hartl, R. F., & Strauss, C. (1999) · Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization · doi:10.1007/978-1-4615-5775-3_20 · Cited by 408
Variable neighborhood search for the p-median
Hansen, P., & Mladenović, N. (1997) · Location Science · doi:10.1016/s0966-8349(98)00030-8 · Cited by 403
An improved annealing scheme for the QAP
Connolly, D. T. (1990) · European Journal of Operational Research · doi:10.1016/0377-2217(90)90301-q · Cited by 400
Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems
Gomes, C. P., Selman, B., Crato, N., & Kautz, H. (2000) · Journal of Automated Reasoning · doi:10.1023/a:1006314320276 · Cited by 395
Genetic algorithms with multi-parent recombination
Eiben, A. E., Raué, P. E., & Ruttkay, Z. (1994) · Lecture Notes in Computer Science · doi:10.1007/3-540-58484-6_252 · Cited by 391
An Ant Colony System Hybridized with a New Local Search for the Sequential Ordering Problem
Gambardella, L. M., & Dorigo, M. (2000) · INFORMS Journal on Computing · doi:10.1287/ijoc.12.3.237.12636 · Cited by 373
How Genetic Algorithms Really Work: Mutation and Hillclimbing.
Mühlenbein, H. (1992) · Publikationsdatenbank der Fraunhofer-Gesellschaft (Fraunhofer-Gesellschaft) · Cited by 365
A Two-Stage Hybrid Local Search for the Vehicle Routing Problem with Time Windows
Bent, R., & Van Hentenryck, P. (2004) · Transportation Science · doi:10.1287/trsc.1030.0049 · Cited by 355
An Introduction to Variable Neighborhood Search
Hansen, P., & Mladenović, N. (1999) · Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization · doi:10.1007/978-1-4615-5775-3_30 · Cited by 340
GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization
Laguna, M., & Martí, R. (1999) · INFORMS journal on computing · doi:10.1287/ijoc.11.1.44 · Cited by 339
Evolution in Time and Space – The Parallel Genetic Algorithm
Mühlenbein, H. (1991) · Foundations of genetic algorithms · doi:10.1016/b978-0-08-050684-5.50023-9 · Cited by 328
Large-step Markov chains for the Traveling Salesman Problem
Martin, O. (2018) · doi:10.6083/nk322d67m · Cited by 321
An overview of evolutionary computation
Spears, W. M., Jong, K. A., Bäck, T., Fogel, D. B., & Garis, H. (1993) · Lecture Notes in Computer Science · doi:10.1007/3-540-56602-3_163 · Cited by 312
An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling Problem
Congram, R. K., Potts, C. N., & van de Velde, S. L. (2002) · INFORMS Journal on Computing · doi:10.1287/ijoc.14.1.52.7712 · Cited by 306
Glover, F., Laguna, M., & Martı́, R. (2003) · Cited by 297
Variable Neighborhood Decomposition Search
Hansen, P., Mladenović, N., & Perez-Britos, D. (2001) · Journal of Heuristics · doi:10.1023/a:1011336210885 · Cited by 296
A genetic local search algorithm for solving symmetric and asymmetric traveling salesman problems
Freisleben, B., & Merz, P. (2002) · Proceedings of IEEE International Conference on Evolutionary Computation · doi:10.1109/icec.1996.542671 · Cited by 277
Genetic Algorithms, Path Relinking, and the Flowshop Sequencing Problem
Reeves, C. R., & Yamada, T. (1998) · Evolutionary Computation · doi:10.1162/evco.1998.6.1.45 · 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
Simulated annealing : parallelization techniques
Azencott, R. (1992) · Wiley eBooks · Cited by 265
Intelligence Through Simulated Evolution: Forty Years of Evolutionary Programming
Fogel, L. J. (1999) · Medical Entomology and Zoology · Cited by 262
Landscapes and their correlation functions
Stadler, P. F. (1996) · Journal of Mathematical Chemistry · doi:10.1007/bf01165154 · Cited by 258
An Introduction to Tabu Search
Michel Gendreau, A. (2006) · Kluwer Academic Publishers eBooks · doi:10.1007/0-306-48056-5_2 · Cited by 256
Model-Based Search for Combinatorial Optimization: A Critical Survey
Zlochin, M., Birattari, M., Meuleau, N., & Dorigo, M. (2004) · Annals of Operations Research · doi:10.1023/b:anor.0000039526.52305.af · Cited by 247
Parallel GRASP with path-relinking for job shop scheduling
Aiex, R. M., Binato, S., & Resende, M. G. C. (2003) · Parallel Computing · doi:10.1016/s0167-8191(03)00014-0 · Cited by 247
Reeves, C. R. (1993) · Cited by 229
Hansen, P., & Mladenović, N. (2003) · International Series in Operations Research & Management Science · doi:10.1007/0-306-48056-5_6 · Cited by 227
Squeaky Wheel OptimizationPreprint
Clements, D. P., & Joslin, D. E. (2011) · arXiv (Cornell University) · doi:10.1613/jair.561 · Cited by 221
Adaptive memory programming: A unified view of metaheuristics
Taillard, É. D., Gambardella, L. M., Gendreau, M., & Potvin, J.-Y. (2001) · European Journal of Operational Research · doi:10.1016/s0377-2217(00)00268-x · Cited by 217
Self-citationCombining simulated annealing with local search heuristics
Martin, O. C., & Otto, S. W. (1996) · Annals of Operations Research · doi:10.1007/bf02601639 · Cited by 216
Voudouris, C., Tsang, E. P. K., & Alsheddy, A. (2010) · International Series in Operations Research & Management Science · doi:10.1007/978-1-4419-1665-5_11 · Cited by 215
A phylogenetic, ontogenetic, and epigenetic view of bio-inspired hardware systems
Sipper, M., Sanchez, E., Mange, D., Tomassini, M., Perez-Uribe, A., & Stauffer, A. (1997) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.585894 · Cited by 210
Landscapes, operators and heuristic search
Reeves, C. R. (1999) · Annals of Operations Research · doi:10.1023/a:1018983524911 · Cited by 201
A Grasp for Job Shop Scheduling
Binato, S., Hery, W. J., Loewenstern, D., & Resende, M. G. C. (2002) · Operations research, computer science. Interface series · doi:10.1007/978-1-4615-1507-4_3 · Cited by 196
A tabu search heuristic procedure for the fixed charge transportation problem
Sun, M., Aronson, J. E., McKeown, P. G., & Drinka, D. (1998) · European Journal of Operational Research · doi:10.1016/s0377-2217(97)00284-1 · Cited by 195
Modeling building-block interdependency
Watson, R. A. R., Hornby, G. S., & Pollack, J. B. (1998) · Lecture notes in computer science · doi:10.1007/bfb0056853 · Cited by 187
Local search with constraint propagation and conflict-based heuristics
Jussien, N., & Lhomme, O. (2002) · Artificial Intelligence · doi:10.1016/s0004-3702(02)00221-7 · Cited by 184
Solving Vehicle Routing Problems Using Constraint Programming and Metaheuristics
Backer, B. D., Furnon, V., Shaw, P., Kilby, P., & Prosser, P. (2000) · Journal of Heuristics · doi:10.1023/a:1009621410177 · Cited by 183
Practice and Theory of Automated Timetabling III
Burke, E. K., & Erben, W. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44629-x · Cited by 175
A Simplex-Based Tabu Search Method for Capacitated Network Design
Crainic, T. G., Michel Gendreau, A., & Farvolden, J. M. (2000) · INFORMS journal on computing · doi:10.1287/ijoc.12.3.223.12638 · Cited by 171
Simulated Crossover in Genetic Algorithms
Syswerda, G. (1993) · Foundations of genetic algorithms · doi:10.1016/b978-0-08-094832-4.50021-0 · Cited by 168
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
Adaptive Memory Programming: A Unified View of Meta-Heuristics
Taillard, É. D., Gambardella, L. M., Michel Gendreau, A., & Potvin, J. (1998) · doi:10.71910/supsi.7446 · Cited by 164
Self-citationIntensification and diversification with elite tabu search solutions for the linear ordering problem
Laguna, M., Martí, R., & Campos, V. (1999) · Computers & Operations Research · doi:10.1016/s0305-0548(98)00104-x · Cited by 163
Fleurent, C., & Glover, F. (1999) · INFORMS journal on computing · doi:10.1287/ijoc.11.2.198 · Cited by 163
Scatter Search and Path Relinking: Advances and Applications
Glover, F., Laguna, M., & Martí, R. (2006) · Kluwer Academic Publishers eBooks · doi:10.1007/0-306-48056-5_1 · Cited by 160
Strategies for the Parallel Implementation of Metaheuristics
Cung, V., Martins, S. L., Ribeiro, C. C., & Roucairol, C. (2002) · Operations research, computer science. Interface series · doi:10.1007/978-1-4615-1507-4_13 · Cited by 146
Towards a theory of landscapes
Stadler, P. F., & Santa Fe Institute (2008) · Springer eBooks · doi:10.1007/bfb0103571 · Cited by 143
An Experimental Evaluation of a Scatter Search for the Linear Ordering Problem
Campos, V., Glover, F., Laguna, M., & Martí, R. (2001) · Journal of Global Optimization · doi:10.1023/a:1012793906010 · Cited by 142
Solving zero-one mixed integer programming problems using tabu search
Løkketangen, A., & Glover, F. (1998) · European Journal of Operational Research · doi:10.1016/s0377-2217(97)00295-6 · Cited by 137
Greedy Randomized Adaptive Search Procedures
Ángel-Bello, F., González–Velarde, J. L., & Álvarez, A. (2006) · Springer eBooks · doi:10.1007/0-387-33416-5_10 · Cited by 136
A tabu search procedure for multicommodity location/allocation with balancing requirements
Crainic, T. G., Michel Gendreau, A., Patrick Soriano, A., & Toulouse, M. (1993) · Annals of Operations Research · doi:10.1007/bf02023001 · Cited by 136
A Tabu Search Heuristic for the Vehicle Routing Problem with Backhauls and Time Windows
Duhamel, C. D., Potvin, J., & Rousseau, J. M. (1997) · Transportation Science · doi:10.1287/trsc.31.1.49 · Cited by 134
Self-citationScatter Search and Path Relinking
Martí, R., Pantrigo, J. J., Duarte, A., Campos, V., & Glover, F. (2012) · IGI Global eBooks · doi:10.4018/978-1-4666-2479-5.ch001 · Cited by 133
Ant Colony Optimization: An Overview
Maniezzo, V., & Carbonaro, A. (2002) · Operations research, computer science. Interface series · doi:10.1007/978-1-4615-1507-4_21 · Cited by 129
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
Tabu Search Heuristics for the Vehicle Routing Problem
Cordeau, J., & Gilbert Laporte, A. (2005) · Kluwer Academic Publishers eBooks · doi:10.1007/0-387-23667-8_6 · Cited by 126
Towards hybrid evolutionary algorithms
Preux, P., & Talbi, E. (1999) · International Transactions in Operational Research · doi:10.1016/s0969-6016(99)00019-2 · Cited by 126
Developments of Variable Neighborhood Search
Hansen, P., & Mladenović, N. (2002) · Operations research, computer science. Interface series · doi:10.1007/978-1-4615-1507-4_19 · Cited by 125
A Parallel Tabu Search Algorithm Using Ejection Chains for the Vehicle Routing Problem
Rego, C., & Roucairol, C. (1996) · Springer eBooks · doi:10.1007/978-1-4613-1361-8_40 · Cited by 125
Reeves, C. R. (2006) · Kluwer Academic Publishers eBooks · doi:10.1007/0-306-48056-5_3 · Cited by 125
A framework for the description of evolutionary algorithms
Hertz, A., & Kobler, D. (2000) · European Journal of Operational Research · doi:10.1016/s0377-2217(99)00435-x · Cited by 124
Tabu Search heuristics for the Vehicle Routing Problem with Time Windows
Bräysy, O., & Michel Gendreau, A. (2002) · Top · doi:10.1007/bf02579017 · Cited by 114
Goldberg, D. E., Deb, K., & Korb, B. (1991) · international conference on Genetic algorithms · Cited by 110
Metaheuristic optimization via memory and evolution : tabu search and scatter search
Rego, C., & Alidaee, B. (2005) · Cited by 109
A Parallel Grasp for the Steiner Tree Problem in Graphs Using a Hybrid Local Search Strategy
Martins, S. L., Resende, M. G. C., Ribeiro, C. C., & Pardalos, P. M. (2000) · Journal of Global Optimization · doi:10.1023/a:1026546708757 · Cited by 106
A Constraint Programming Framework for Local Search Methods
Pesant, G., & Michel Gendreau, A. (1999) · Journal of Heuristics · doi:10.1023/a:1009694016861 · Cited by 101
Ant Colony Optimization and Stochastic Gradient Descent
Meuleau, N., & Dorigo, M. (2002) · Artificial Life · doi:10.1162/106454602320184202 · Cited by 98
A view of local search in constraint programming
Pesant, G., & Michel Gendreau, A. (1996) · Lecture notes in computer science · doi:10.1007/3-540-61551-2_86 · Cited by 95
Reactive search, a history-sensitive heuristic for MAX-SAT
Battiti, R., & Protasi, M. (1997) · ACM Journal of Experimental Algorithmics · doi:10.1145/264216.264220 · Cited by 94
Optimization Software Class Libraries
Voß, S., & Woodruff, D. L. (2005) · Kluwer Academic Publishers eBooks · doi:10.1007/0-306-48126-x_1 · Cited by 93
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
Gene Pool Recombination in Genetic Algorithms
Mühlenbein, H., & Voigt, H.-M. (1996) · Springer eBooks · doi:10.1007/978-1-4613-1361-8_4 · Cited by 89
Nonsystematic backtracking search
Harvey, W. D. (1995) · Cited by 77
A Taxonomy of Evolutionary Algorithms in Combinatorial Optimization
Calégari, P., Coray, G., Hertz, A., Kobler, D., & Kuonen, P. (1999) · Journal of Heuristics · doi:10.1023/a:1009625526657 · Cited by 77
Systematic versus stochastic constraint satisfaction
Freuder, E. C., Dechter, R., Ginsberg, M. L., Selman, B., & Tsang, E. P. K. (1995) · International Joint Conference on Artificial Intelligence · Cited by 68
Relaxed tours and path ejections for the traveling salesman problem
Rego, C. (1998) · European Journal of Operational Research · doi:10.1016/s0377-2217(97)00288-9 · Cited by 65
Discovery of RNA structural elements using evolutionary computation
Fogel, G. B. (2002) · Nucleic Acids Research · doi:10.1093/nar/gkf653 · Cited by 59
ACO Applied to Group Shop Scheduling: A Case Study on Intensification and Diversification
Blum, C. (2002) · Lecture notes in computer science · doi:10.1007/3-540-45724-0_2 · Cited by 57
Thermostatistical persistency: A powerful improving concept for simulated annealing algorithms
Chardaire, P., Lutton, J. L., & Sutter, A. (1995) · European Journal of Operational Research · doi:10.1016/0377-2217(94)00058-k · Cited by 37
Evolutionary computation techniques and their applications
Michalewicz, Z., & Michalewicz, M. (2002) · doi:10.1109/icips.1997.672732 · Cited by 31
Fitness Landscapes and Performance of Meta-Heuristics
Fonlupt, C., Robilliard, D., Preux, P., & Talbi, E. (1999) · Springer eBooks · doi:10.1007/978-1-4615-5775-3_18 · Cited by 30
GENI Ants for the Traveling Salesman Problem
Louarn, F.-X. L., Michel Gendreau, A., & Potvin, J. (2004) · Annals of Operations Research · doi:10.1023/b:anor.0000039518.73626.a5 · Cited by 19
Self-citationAnt colony optimization for the edge-weighted k -cardinality tree problem
Blum, C. (2002) · Cited by 16
Cited by
Cuckoo Search via Lévy flights
Yang, X.-S., & Deb, S. (2009) · 2009 World Congress on Nature & Biologically Inspired Computing (NaBIC) · doi:10.1109/nabic.2009.5393690 · Cited by 6,185
Differential Evolution: A Survey of the State-of-the-Art
Das, S., & Suganthan, P. N. (2011) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2010.2059031 · Cited by 5,307
Ant colony optimization theory: A survey
Dorigo, M., & Blum, C. (2005) · Theoretical Computer Science · doi:10.1016/j.tcs.2005.05.020 · Cited by 2,295
Askarzadeh, A. (2016) · Computers & Structures · doi:10.1016/j.compstruc.2016.03.001 · Cited by 2,216
A survey on optimization metaheuristics
Boussaïd, I., Lepagnot, J., & Siarry, P. (2013) · Information Sciences · doi:10.1016/j.ins.2013.02.041 · Cited by 1,655
Metadata
- Authors
- Gendreau, M., & Potvin, J.-Y.
- Venue
- Annals of Operations Research
- Published
- 2005-11
- Volume
- 140
- Issue
- 1
- Pages
- 189-213
- ISSN
- 0254-5330 (ISSN-L)
- 1572-9338
- OpenAlex
- W2039568841
- Cited by
- 2,338
- References
- 190
- FWCI
- 88.29
- 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.