The DOI matches its Crossref record; 488 of the 488 references it cites were found in a registry or an index.
Metaheuristics: A bibliography
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
Genetic algorithms in search, optimization, and machine learning
(1989) · Choice Reviews Online · doi:10.5860/choice.27-0936 · Cited by 49,010
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
Lecture Notes in Computer Science 1205
(1999) · Industrial Robot: An International Journal · doi:10.1108/ir.1999.04926fae.001 · Cited by 38,662
Neural Networks: A Comprehensive Foundation
Haykin, S. (1998) · Cited by 30,070
Genetic Programming: On the Programming of Computers by Means of Natural Selection
Koza, J. R. (1992) · Medical Entomology and Zoology · Cited by 13,082
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
Self-organized formation of topologically correct feature maps
Kohonen, T. (1982) · Biological Cybernetics · doi:10.1007/bf00337288 · Cited by 9,529
An introduction to computing with neural nets
Lippmann, R. (1987) · IEEE ASSP Magazine · doi:10.1109/massp.1987.1165576 · Cited by 7,825
Lecture Notes in Artificial Intelligence
Brézillon, P., & Bouquet, P. (1999) · Cited by 7,473
Handbook of Genetic Algorithms
Davis, L. D. (1991) · Cumulative Index of Computer Aided Architectural Design · Cited by 7,330
Muiltiobjective Optimization Using Nondominated Sorting in Genetic Algorithms
Srinivas, N., & Deb, K. (1994) · Evolutionary Computation · doi:10.1162/evco.1994.2.3.221 · Cited by 6,935
Introduction to the theory of neural computation
(1994) · Neural Networks · doi:10.1016/0893-6080(94)90014-0 · Cited by 6,401
“Neural” computation of decisions in optimization problems
Hopfield, J. J., & Tank, D. W. (1985) · Biological Cybernetics · doi:10.1007/bf00339943 · Cited by 6,031
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
Holland, J. H. (1992) · Scientific American · doi:10.1038/scientificamerican0792-66 · Cited by 5,764
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
Glover, F. (1989) · ORSA Journal on Computing · doi:10.1287/ijoc.1.3.190 · Cited by 5,106
Whitley, D. (1994) · Statistics and Computing · doi:10.1007/bf00175354 · Cited by 4,522
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
Combinatorial optimization:Algorithms and complexity
Rabiner, L. (1984) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/tassp.1984.1164450 · Cited by 3,576
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
Integer and Combinatorial Optimization
Nemhauser, G., & Wolsey, L. (1988) · Wiley eBooks · doi:10.1002/9781118627372 · Cited by 3,176
Fundamentals of neural networks: architectures, algorithms, and applications
Fausett, L. V. (1994) · CERN Document Server (European Organization for Nuclear Research) · Cited by 3,025
Glover, F., & Laguna, M. (1997) · doi:10.1007/978-1-4615-6089-0 · Cited by 3,001
Self-organized formation of topographically correct feature maps
Kohonen, T. (1982) · Biological Cybernetics · Cited by 2,995
Simulated annealing: theory and applications.
(1988) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(88)90023-7 · Cited by 2,966
Neural networks — A comprehensive foundation
Wilusz, T. (1995) · Neurocomputing · doi:10.1016/0925-2312(95)90026-8 · Cited by 2,868
Optimization of Control Parameters for Genetic Algorithms
Grefenstette, J. (1986) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/tsmc.1986.289288 · Cited by 2,854
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
Modern heuristic techniques for combinatorial problems
Reeves, C. R. (1993) · Medical Entomology and Zoology · Cited by 2,580
A massively parallel architecture for a self-organizing neural pattern recognition machine
Carpenter, G. A., & Grossberg, S. (1987) · Computer Vision, Graphics, and Image Processing · doi:10.1016/s0734-189x(87)80014-2 · Cited by 2,525
Adaptive probabilities of crossover and mutation in genetic algorithms
Srinivas, M., & Patnaik, L. M. (1994) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/21.286385 · Cited by 2,512
(2003) · Selected Papers of Alan J Hoffman · doi:10.1142/9789812796936_others05 · Cited by 2,465
A niched Pareto genetic algorithm for multiobjective optimization
Horn, J., Nafpliotis, N., & Goldberg, D. E. (2002) · Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence · doi:10.1109/icec.1994.350037 · Cited by 2,433
Dowsland, K. A., & Thompson, J. M. (2012) · Handbook of Natural Computing · doi:10.1007/978-3-540-92910-9_49 · Cited by 2,432
Lectu re Notes in Economics and Mathematical Systems
Beckmann, M. J., & Künzi, H. P. (1975) · Cited by 2,414
Simulated Annealing: Theory and Applications
van Laarhoven, P. J. M., & Aarts, E. H. L. (1987) · Springer eBooks · doi:10.1007/978-94-015-7744-1 · Cited by 2,385
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
An Overview of Evolutionary Algorithms in Multiobjective Optimization
Fonseca, C. M., & Fleming, P. J. (1995) · Evolutionary Computation · doi:10.1162/evco.1995.3.1.1 · Cited by 2,266
Srinivas, M., & Patnaik, L. M. (1994) · Computer · doi:10.1109/2.294849 · Cited by 2,180
Computing with Neural Circuits: A Model
Hopfield, J. J., & Tank, D. W. (1986) · Science · doi:10.1126/science.3755256 · Cited by 2,116
An Overview of Evolutionary Algorithms for Parameter Optimization
Bäck, T., & Schwefel, H.-P. (1993) · Evolutionary Computation · doi:10.1162/evco.1993.1.1.1 · Cited by 2,111
International Journal of Production Research
HAWKINS, T. H. (1962) · Nature · doi:10.1038/1931144a0 · Cited by 2,111
Local Search in Combinatorial Optimization
(2003) · Princeton University Press eBooks · doi:10.1515/9780691187563 · Cited by 2,057
OR-Library: Distributing Test Problems by Electronic Mail
Beasley, J. E. (1990) · Journal of the Operational Research Society · doi:10.1057/jors.1990.166 · Cited by 1,899
Simulated Tempering: A New Monte Carlo Scheme
Marinari, E., & Parisi, G. (1992) · Europhysics Letters (EPL) · doi:10.1209/0295-5075/19/6/002 · Cited by 1,818
Introduction to the Theory of Neural Computation
Hertz, J., Krogh, A., & Palmer, R. G. (2018) · CRC Press eBooks · doi:10.1201/9780429499661 · Cited by 1,772
Genetic Algorithms and Simulated Annealing
Davis, L. D. (1987) · Cited by 1,759
Some Computer Organizations and Their Effectiveness
Flynn, M. J. (1972) · IEEE Transactions on Computers · doi:10.1109/tc.1972.5009071 · Cited by 1,713
The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization
(1986) · Journal of the Operational Research Society · doi:10.1057/jors.1986.93 · Cited by 1,679
The Traveling Salesman Problem
(2019) · Fundamentals of Supply Chain Theory · doi:10.1002/9781119584445.ch10 · Cited by 1,614
Global Optimization of Statistical Functions with Simulated Annealing
Goffe, W. L., Ferrier, G. D., & Rogers, J. (1994) · Journal of Econometrics · doi:10.1016/0304-4076(94)90038-8 · Cited by 1,610
Journal of the Royal Statistical Society: Series B (Methodological)
(2018) · Journal of the Royal Statistical Society Series B (Methodological) · doi:10.1111/(issn)2517-6161 · Cited by 1,610
Foundations of Constraint Satisfaction
(1993) · Elsevier eBooks · doi:10.1016/c2013-0-07627-x · Cited by 1,603
Fundamentals of neural networks
Fausett, L. V. (1993) · Cited by 1,570
Genetic Algorithms and Random Keys for Sequencing and Optimization
Bean, J. C. (1994) · INFORMS journal on computing · doi:10.1287/ijoc.6.2.154 · Cited by 1,543
An introduction to simulated evolutionary optimization
Fogel, D. B. (1994) · IEEE Transactions on Neural Networks · doi:10.1109/72.265956 · Cited by 1,503
Convergence analysis of canonical genetic algorithms
Rudolph, G. (1994) · IEEE Transactions on Neural Networks · doi:10.1109/72.265964 · Cited by 1,484
Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
Johnson, D. S., Aragon, C. R., McGeoch, L. A., & Schevon, C. (1989) · Operations Research · doi:10.1287/opre.37.6.865 · Cited by 1,457
Arabian Journal for Science and Engineering
(2013) · Arabian Journal for Science and Engineering · doi:10.1007/13369.2191-4281 · Cited by 1,444
(1990) · Discrete Applied Mathematics · doi:10.1016/0166-218x(90)90039-f · Cited by 1,440
Heuristics: Intelligent search strategies for computer problem solving.
(1985) · Information Processing & Management · doi:10.1016/0306-4573(85)90100-1 · Cited by 1,430
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
(1989) · European Journal of Operational Research · doi:10.1016/0377-2217(89)90373-1 · Cited by 1,324
Routing and scheduling in a flexible job shop by tabu search
Brandimarte, P. (1993) · Annals of Operations Research · doi:10.1007/bf02023073 · Cited by 1,322
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
Very fast simulated re-annealing
Ingber, L. (1989) · Mathematical and Computer Modelling · doi:10.1016/0895-7177(89)90202-1 · Cited by 1,286
Bertsimas, D., & Tsitsiklis, J. (1993) · Statistical Science · doi:10.1214/ss/1177011077 · Cited by 1,284
Neural Networks: Algorithms, Applications and Programming Techniques
Leave, C. (1992) · Journal of the Operational Research Society · doi:10.1057/jors.1992.170 · Cited by 1,283
Proceedings of the third international conference on Genetic algorithms
Schaffer, J. D. (1989) · international conference on Genetic algorithms · Cited by 1,280
Cooling Schedules for Optimal Annealing
Hajek, B. (1988) · Mathematics of Operations Research · doi:10.1287/moor.13.2.311 · Cited by 1,246
Neural networks for optimization and signal processing
Krzyzak, A. (1994) · Neurocomputing · doi:10.1016/0925-2312(94)90041-8 · Cited by 1,235
Dueck, G., & Scheuer, T. (1990) · Journal of Computational Physics · doi:10.1016/0021-9991(90)90201-b · Cited by 1,232
Self-organization and associative memory: 3rd edition
Kohonen, T. (1989) · Springer eBooks · Cited by 1,223
Predictive Models for the Breeder Genetic Algorithm I. Continuous Parameter Optimization
Mühlenbein, H., & Schlierkamp-Voosen, D. (1993) · Evolutionary Computation · doi:10.1162/evco.1993.1.1.25 · Cited by 1,199
IEICE transactions on information and systems
電子情報通信学会 (1992) · Institute of Electronics, Information and Communication Engineers eBooks · Cited by 1,185
Neural networks for optimization and signal processing
(1993) · Choice Reviews Online · doi:10.5860/choice.31-2156 · Cited by 1,183
Bomze, I. M., Budinich, M., Pardalos, P. M., & Pelillo, M. (1999) · Handbook of Combinatorial Optimization · doi:10.1007/978-1-4757-3023-4_1 · Cited by 1,148
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
Managerial Applications of Neural Networks: The Case of Bank Failure Predictions
Tam, K. Y., & Kiang, M. Y. (1992) · Management Science · doi:10.1287/mnsc.38.7.926 · Cited by 1,118
Glover, F. (1990) · Interfaces · doi:10.1287/inte.20.4.74 · Cited by 1,092
Szu, H., & Hartley, R. (1987) · Physics Letters A · doi:10.1016/0375-9601(87)90796-1 · Cited by 1,089
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
(1991) · Lecture Notes in Computer Science · doi:10.1007/bfb0029723 · Cited by 1,049
Neural Networks: A Review from a Statistical Perspective
Cheng, B., & Titterington, D. M. (1994) · Statistical Science · doi:10.1214/ss/1177010638 · Cited by 1,048
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
Self-citationWoodhouse, C. (2024) · The Astrophotography Manual · doi:10.4324/9781003463108-19 · Cited by 1,037
Simulated annealing: Practice versus theory
Ingber, L. (1993) · Mathematical and Computer Modelling · doi:10.1016/0895-7177(93)90204-c · Cited by 1,008
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
Neural Networks: Algorithms, Applications and Programming Techniques.
Leave, C., Freeman, J. A., & Skapura, D. M. (1992) · The Journal of the Operational Research Society · doi:10.2307/2584109 · Cited by 924
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
Algorithms for constraint-satisfaction problems: a survey
Kumar, V. (1992) · doi:10.1609/aimag.v13i1.976 · Cited by 874
A genetic algorithm for flowshop sequencing
Reeves, C. R. (1995) · Computers & Operations Research · doi:10.1016/0305-0548(93)e0014-k · Cited by 872
Johnson, D. S., Aragon, C. R., McGeoch, L. A., & Schevon, C. (1991) · Operations Research · doi:10.1287/opre.39.3.378 · Cited by 845
Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems
Minton, S., Johnston, M. D., Philips, A. B., & Laird, P. (1992) · Artificial Intelligence · doi:10.1016/0004-3702(92)90007-k · Cited by 843
Robust taboo search for the quadratic assignment problem
Taillard, É. D. (1991) · Parallel Computing · doi:10.1016/s0167-8191(05)80147-4 · Cited by 835
Genetic algorithms as a strategy for feature selection
Leardi, R., Boggia, R., & Terrile, M. (1992) · Journal of Chemometrics · doi:10.1002/cem.1180060506 · Cited by 828
Koza, J. R. (1992) · Medical Entomology and Zoology · Cited by 825
Proceedings of the fourth international conference on Genetic algorithms
Belew, R. K., & Booker, L. B. (1991) · Cited by 822
Simulated annealing algorithms: an overview
Rutenbar, R. A. (1989) · IEEE Circuits and Devices Magazine · doi:10.1109/101.17235 · Cited by 807
Constrained Optimization Via Genetic Algorithms
Homaifar, A., Qi, C. X., & Lai, S. H. (1994) · SIMULATION · doi:10.1177/003754979406200405 · Cited by 802
Simulated annealing: A tool for operational research
Eglese, R. W. (1990) · European Journal of Operational Research · doi:10.1016/0377-2217(90)90001-r · Cited by 801
Battiti, R., & Tecchiolli, G. (1994) · ORSA Journal on Computing · doi:10.1287/ijoc.6.2.126 · Cited by 801
An analogue approach to the travelling salesman problem using an elastic net method
Durbin, R., & Willshaw, D. (1987) · Nature · doi:10.1038/326689a0 · Cited by 797
An overview of genetic algorithms: Part 1, fundamentals
Beasley, D. W. C., Bull, D., & Martin, R. R. (1993) · Bristol Research (University of Bristol) · Cited by 797
Genetic algorithms and neural networks: optimizing connections and connectivity
Whitley, D., Starkweather, T., & Bogart, C. (1990) · Parallel Computing · doi:10.1016/0167-8191(90)90086-o · Cited by 747
A Survey of Evolution Strategies.
Bäck, T., Hoffmeister, F., & Schwefel, H. (1991) · Cited by 746
Knowledge-based artificial neural networks
Towell, G. G., & Shavlik, J. W. (1994) · Artificial Intelligence · doi:10.1016/0004-3702(94)90105-8 · Cited by 746
Bankruptcy prediction using neural networks
Wilson, R. L., & Sharda, R. (1994) · Decision Support Systems · doi:10.1016/0167-9236(94)90024-8 · Cited by 722
The parallel genetic algorithm as function optimizer
Mühlenbein, H., Schomisch, M., & Born, J. (1991) · Parallel Computing · doi:10.1016/s0167-8191(05)80052-3 · Cited by 716
Johnson, D. S., Papadimitriou, C. H., & Yannakakis, M. (1988) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(88)90046-3 · Cited by 705
Convergence of an annealing algorithm
Lundy, M., & Mees, A. (1986) · Mathematical Programming · doi:10.1007/bf01582166 · Cited by 693
A genetic algorithm for multiprocessor scheduling
Hou, E. S. H., Ansari, N., & Ren, H. (1994) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/71.265940 · Cited by 683
Chaotic simulated annealing by a neural network model with transient chaos
Chen, L., & Aihara, K. (1995) · Neural Networks · doi:10.1016/0893-6080(95)00033-v · Cited by 661
Using tabu search techniques for graph coloring
Hertz, A., & de Werra, D. (1987) · Computing · doi:10.1007/bf02239976 · Cited by 657
Quantum annealing: A new method for minimizing multidimensional functions
Finnila, A. B., Gomez, M. A., Sebenik, C., Stenson, C., & Doll, J. D. (1994) · Chemical Physics Letters · doi:10.1016/0009-2614(94)00117-0 · Cited by 644
(2019) · Acta Physica Polonica B · doi:10.5506/aphyspolb · Cited by 628
Simulated annealing for permutation flow-shop scheduling
Osman, I., & Potts, C. (1989) · Omega · doi:10.1016/0305-0483(89)90059-5 · Cited by 614
Self-citationPartial constraint satisfaction
Freuder, E. C., & Wallace, R. J. (1992) · Artificial Intelligence · doi:10.1016/0004-3702(92)90004-h · Cited by 614
Proceedings of the 5th International Conference on Genetic Algorithms
Forrest, S. (1993) · Cited by 609
A Practical Guide to Neural Nets
McCord-Nelson, M., & Illingworth, W. T. (1991) · CERN Document Server (European Organization for Nuclear Research) · Cited by 603
Applying tabu search to the job-shop scheduling problem
Dell’Amico, M., & Trubian, M. (1993) · Annals of Operations Research · doi:10.1007/bf02023076 · Cited by 603
Tabu search for the job-shop scheduling problem with multi-purpose machines
Hurink, J. L., Jurisch, B., & Thole, M. (1994) · OR Spectrum · doi:10.1007/bf01719451 · Cited by 599
Network-based heuristics for constraint-satisfaction problems
Dechter, R., & Pearl, J. (1987) · Artificial Intelligence · doi:10.1016/0004-3702(87)90002-6 · Cited by 595
Genetic algorithms, noise, and the sizing of populations
Goldberg, D. E., Deb, K., & Clark, J. H. (1991) · Cited by 584
Combinations of genetic algorithms and neural networks: a survey of the state of the art
Schaffer, J. D., Whitley, D., & Eshelman, L. J. (2003) · [Proceedings] COGANN-92: International Workshop on Combinations of Genetic Algorithms and Neural Networks · doi:10.1109/cogann.1992.273950 · Cited by 570
IEICE transactions on fundamentals of electronics, communications and computer sciences
電子情報通信学会 (1992) · Institute of Electronics, Information and Communication Engineers eBooks · Cited by 560
Scheduling Problems and Traveling Salesmen: The Genetic Edge Recombination Operator
Whitley, L. D., Starkweather, T., & Fuquay, D. (1989) · international conference on Genetic algorithms · Cited by 551
A Genetic Algorithm for the Set Covering Problem
Al-Sultan, K. S., Hussain, M. F., & Nizami, J. S. (1996) · Journal of the Operational Research Society · doi:10.1057/jors.1996.82 · Cited by 551
ISIS—a knowledge‐based system for factory scheduling
Fox, M. S., & Smith, S. F. (1984) · Expert Systems · doi:10.1111/j.1468-0394.1984.tb00424.x · Cited by 551
On the stability of the Travelling Salesman Problem algorithm of Hopfield and Tank
Wilson, G. V., & Pawley, G. S. (1988) · Biological Cybernetics · doi:10.1007/bf00363956 · Cited by 546
New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling
Storer, R. H., Wu, S. D., & Vaccari, R. (1992) · Management Science · doi:10.1287/mnsc.38.10.1495 · Cited by 546
HYBRID ALGORITHMS FOR THE CONSTRAINT SATISFACTION PROBLEM
Prosser, P. (1993) · Computational Intelligence · doi:10.1111/j.1467-8640.1993.tb00310.x · Cited by 528
Enhancement schemes for constraint processing: Backjumping, learning, and cutset decomposition
Dechter, R. (1990) · Artificial Intelligence · doi:10.1016/0004-3702(90)90046-3 · Cited by 497
Schedule Optimization Using Genetic Algorithms
Syswerda, G. (1991) · Medical Entomology and Zoology · Cited by 494
A review of evolutionary artificial neural networks
Yao, X. (1993) · International Journal of Intelligent Systems · doi:10.1002/int.4550080406 · Cited by 492
Institute of Physics Conference Series
(2010) · Institute of physics conference series/Institute of Physics conference series · doi:10.1201/tfinsphycon · Cited by 474
Modern Heuristic Search Methods
Rayward-Smith, V. J., Osman, I. H., Reeves, C. R., & Smith, G. D. (1996) · Cited by 459
Self-citationA simulated annealing algorithm for the clustering problem
Selim, S. Z., & Alsultan, K. (1991) · Pattern Recognition · doi:10.1016/0031-3203(91)90097-o · Cited by 459
Tabu Search Applied to the Quadratic Assignment Problem
Skorin‐Kapov, J. (1990) · INFORMS journal on computing · doi:10.1287/ijoc.2.1.33 · Cited by 458
Ginsberg, M. L. (1993) · Journal of Artificial Intelligence Research · doi:10.1613/jair.1 · Cited by 456
Artificial neural network models for forecasting and decision making
Hill, T., Marquez, L., O'Connor, M., & Remus, W. (1994) · International Journal of Forecasting · doi:10.1016/0169-2070(94)90045-0 · Cited by 450
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
Using genetic algorithms for concept learning
De Jong, K. A., Spears, W. M., & Gordon, D. F. (1993) · Machine Learning · doi:10.1007/bf00993042 · Cited by 445
A NEW METHOD FOR MAPPING OPTIMIZATION PROBLEMS ONTO NEURAL NETWORKS
Peterson, C., & Söderberg, B. (1989) · International Journal of Neural Systems · doi:10.1142/s0129065789000414 · Cited by 443
Modeling genetic algorithms with Markov chains
Nix, A. E., & Vose, M. D. (1992) · Annals of Mathematics and Artificial Intelligence · doi:10.1007/bf01530781 · Cited by 442
Genetic algorithms in optimal multistage distribution network planning
Miranda, V., Ranito, J. V., & Proenca, L. M. (1994) · IEEE Transactions on Power Systems · doi:10.1109/59.331452 · Cited by 441
Testing heuristics: We have it all wrong
Hooker, J. N. (1995) · Journal of Heuristics · doi:10.1007/bf02430364 · Cited by 437
Genetic evolution of the topology and weight distribution of neural networks
Maniezzo, V. (1994) · IEEE Transactions on Neural Networks · doi:10.1109/72.265959 · Cited by 436
Global optimization and simulated annealing
Dekkers, A., & Aarts, E. (1991) · Mathematical Programming · doi:10.1007/bf01594945 · Cited by 435
Genetic Algorithms and Very Fast Simulated Reannealing: A comparison
Ingber, L., & Rosen, B. (1992) · Mathematical and Computer Modelling · doi:10.1016/0895-7177(92)90108-w · Cited by 424
Otten, R. H. J. M., & van Ginneken, L. P. P. P. (1989) · The Kluwer International Series in Engineering and Computer Science · doi:10.1007/978-1-4613-1627-5 · Cited by 421
Journal of Business and Economic Statistics
Fildes, R. (1994) · International Journal of Forecasting · doi:10.1016/0169-2070(94)90039-6 · Cited by 413
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
Pardalos, P. M., & Xue, J. (1994) · Journal of Global Optimization · doi:10.1007/bf01098364 · Cited by 382
A theoretical investigation into the performance of the Hopfield model
Aiyer, S. V. B., Niranjan, M., & Fallside, F. (1990) · IEEE Transactions on Neural Networks · doi:10.1109/72.80232 · Cited by 381
Simulated annealing based economic dispatch algorithm
Wong, K. P., & Fung, C. C. (1993) · IEE Proceedings C Generation, Transmission and Distribution · doi:10.1049/ip-c.1993.0074 · Cited by 377
Allocating hard real-time tasks: An NP-Hard problem made easy
Tindell, K. W., Burns, A., & Wellings, A. J. (1992) · Real-Time Systems · doi:10.1007/bf00365407 · Cited by 369
Simulated annealing: a proof of convergence
Granville, V., Krivanek, M., & Rasson, J.-P. (1994) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.295910 · Cited by 368
Backpropagation neural networks
Wythoff, B. J. (1993) · Chemometrics and Intelligent Laboratory Systems · doi:10.1016/0169-7439(93)80052-j · Cited by 367
How Genetic Algorithms Really Work: Mutation and Hillclimbing.
Mühlenbein, H. (1992) · Publikationsdatenbank der Fraunhofer-Gesellschaft (Fraunhofer-Gesellschaft) · Cited by 365
An Investigation of Some Properties of an Ant Algorithm
Colorni, A., Dorigo, M., Maniezzo, V., Männer, R., & Manderick, B. (1992) · Cited by 364
Genetic algorithms in optimization of system reliability
Painton, L., & Campbell, J. (1995) · IEEE Transactions on Reliability · doi:10.1109/24.387368 · Cited by 362
Local search in combinatorial optimization
Crama, Y., Kolen, A. W. J., & Pesch, E. J. (1995) · Lecture Notes in Computer Science · doi:10.1007/bfb0027029 · Cited by 361
Algorithms for the maximum satisfiability problem
Hansen, P., & Jaumard, B. (1990) · Computing · doi:10.1007/bf02241270 · Cited by 360
Convergence and finite-time behavior of simulated annealing
Mitra, D., Romeo, F., & Sangiovanni-Vincentelli, A. (1986) · Advances in Applied Probability · doi:10.2307/1427186 · Cited by 358
Foundations of Genetic Algorithms
(1996) · Genetic Algorithms and Engineering Design · doi:10.1002/9780470172254.ch1 · Cited by 357
Simulated annealing metaheuristics for the vehicle routing problem with time windows
Chiang, W.-C., & Russell, R. A. (1996) · Annals of Operations Research · doi:10.1007/bf02601637 · Cited by 354
Optimization Using Simulated Annealing
Brooks, S. P., & Morgan, B. J. T. (1995) · The Statistician · doi:10.2307/2348448 · Cited by 348
Learning and Evolution in Neural Networks
Nolfi, S., Parisi, D., & Elman, J. L. (1994) · Adaptive Behavior · doi:10.1177/105971239400300102 · Cited by 345
The ant colony metaphor for searching continuous design spaces
Bilchev, G., & Parmee, I. C. (1995) · Lecture Notes in Computer Science · doi:10.1007/3-540-60469-3_22 · Cited by 341
Self-organizing feature maps and the travelling salesman problem
Angéniol, B., de La Croix Vaubois, G., & Le Texier, J.-Y. (1988) · Neural Networks · doi:10.1016/0893-6080(88)90002-0 · Cited by 340
A genetic approach to the quadratic assignment problem
Tate, D. M., & Smith, A. E. (1995) · Computers & Operations Research · doi:10.1016/0305-0548(93)e0020-t · Cited by 332
Proceedings of the 10th European conference on artificial intelligence
Siklóssy, L., & Tepandi, J. (1993) · Engineering Applications of Artificial Intelligence · doi:10.1016/0952-1976(93)90070-e · Cited by 327
Handling Constraints in Genetic Algorithms
Michalewicz, Z., & Janikow, C. Z. (1991) · international conference on Genetic algorithms · Cited by 326
Comparison of iterative searches for the quadratic assignment problem
Taillard, É. D. (1995) · Location Science · doi:10.1016/0966-8349(95)00008-6 · Cited by 325
A Jinear formulation of the machine-part cell formation problem
BOCTOR, F. F. (1991) · International Journal of Production Research · doi:10.1080/00207549108930075 · Cited by 325
Large-step Markov chains for the Traveling Salesman Problem
Martin, O. (2018) · doi:10.6083/nk322d67m · Cited by 321
Parallel recombinative simulated annealing: A genetic algorithm
Mahfoud, S. W., & Goldberg, D. E. (1995) · Parallel Computing · doi:10.1016/0167-8191(94)00071-h · Cited by 320
Routing problems: A bibliography
Gilbert Laporte, A., & Osman, I. H. (1995) · Annals of Operations Research · doi:10.1007/bf02098290 · Cited by 319
Self-citationSerial and Parallel Genetic Algorithms as Function Optimizers
Gordon, V. S., & Whitley, L. D. (1993) · Cited by 316
Genetic Algorithms as an Approach to Configuration and Topology Design
Chapman, C. D., Saitou, K., & Jakiela, M. J. (1994) · Journal of Mechanical Design · doi:10.1115/1.2919480 · Cited by 316
Solving Quadratic Assignment Problems by ‘Simulated Annealing’
Wilhelm, M. R., & Ward, T. L. (1987) · IIE Transactions · doi:10.1080/07408178708975376 · Cited by 315
Ogbu, F. A., & Smith, D. K. (1990) · Computers & Operations Research · doi:10.1016/0305-0548(90)90001-n · Cited by 310
Genetic and hybrid algorithms for graph coloring
Fleurent, C., & Ferland, J. A. (1996) · Annals of Operations Research · doi:10.1007/bf02125407 · Cited by 309
VLSI cell placement techniques
Shahookar, K., & Mazumder, P. (1991) · ACM Computing Surveys · doi:10.1145/103724.103725 · Cited by 308
Genetic algorithms and tabu search: Hybrids for optimization
Glover, F., Kelly, J. P., & Laguna, M. (1995) · Computers & Operations Research · doi:10.1016/0305-0548(93)e0023-m · Cited by 306
A Tabu search approach to the clustering problem
Al‐Sultan, K. S. (1995) · Pattern Recognition · doi:10.1016/0031-3203(95)00022-r · Cited by 304
Algorithms for Reengineering 1991 Census Geography
Openshaw, S., & Rao, L. (1995) · Environment and Planning A: Economy and Space · doi:10.1068/a270425 · Cited by 303
Neural Nets: A Theory for Brains and Machines
Rocha, A. F. (1992) · Medical Entomology and Zoology · Cited by 299
Understanding and using genetic algorithms Part 1. Concepts, properties and context
Lucasius, C. B., & Kateman, G. (1993) · Chemometrics and Intelligent Laboratory Systems · doi:10.1016/0169-7439(93)80079-w · Cited by 296
Cited by
Mladenović, N., & Hansen, P. (1997) · Computers & Operations Research · doi:10.1016/s0305-0548(97)00031-2 · Cited by 4,254
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
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
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
The Cross-Entropy Method for Combinatorial and Continuous Optimization
Rubinstein, R. (1999) · Methodology And Computing In Applied Probability · doi:10.1023/a:1010091220143 · Cited by 903
Metadata
- Authors
- Osman, I. H., & Laporte, G.
- Venue
- Annals of Operations Research
- Published
- 1996-10
- Volume
- 63
- Issue
- 5
- Pages
- 511-623
- ISSN
- 0254-5330 (ISSN-L)
- 1572-9338
- OpenAlex
- W1981689130
- Cited by
- 672
- References
- 488
- FWCI
- 14.42
- 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.