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
Items 401–488 of 488
A Genetic Algorithm for the Set Partitioning Problem
Levine, D. (1993) · international conference on Genetic algorithms · Cited by 46
Optimization using variations of simulated annealing
Kalivas, J. H. (1992) · Chemometrics and Intelligent Laboratory Systems · doi:10.1016/0169-7439(92)80022-v · Cited by 46
Genetic algorithms in coding theory — a table for A3(n,d)
Vaessens, R. J. M., Aarts, E., & Lint, J. H. (1993) · Discrete Applied Mathematics · doi:10.1016/0166-218x(93)90141-a · Cited by 45
Finding approximate solutions to NP-hard problems by neural networks is hard
Yao, X. (1992) · Information Processing Letters · doi:10.1016/0020-0190(92)90261-s · Cited by 44
Cluster analysis by simulated annealing
Sun, L., Xie, Y., Song, X., et al. (1994) · Computers & Chemistry · doi:10.1016/0097-8485(94)85003-8 · Cited by 44
Evolution and Biocomputation: Computational Models of Evolution
Banzhaf, W., & Eeckman, F. H. (1995) · Cited by 43
Local search, reducibility and approximability of NP-optimization problems
Giorgio Ausiello, A., & Protasi, M. (1995) · Information Processing Letters · doi:10.1016/0020-0190(95)00006-x · Cited by 43
Multiple-type, two-dimensional bin packing problems: Applications and algorithms
Han, B. T., Diehr, G., & Cook, J. S. (1994) · Annals of Operations Research · doi:10.1007/bf02085642 · Cited by 43
Recurrent neural networks for linear programming: Analysis and design principles
Wang, J., & Chankong, V. (1992) · Computers & Operations Research · doi:10.1016/0305-0548(92)90051-6 · Cited by 43
Evolution and Biocomputation: Computational Models of Evolution
(1995) · Lecture notes in computer science · doi:10.1007/3-540-59046-3 · Cited by 43
Optimal mutation probability for genetic algorithms
Greenwell, R. N., Angus, J. E., & Finck, M. (1995) · Mathematical and Computer Modelling · doi:10.1016/0895-7177(95)00035-z · Cited by 41
Directed mutation in genetic algorithms
Bhandari, D., Pal, N. R., & Pal, S. K. (1994) · Information Sciences · doi:10.1016/0020-0255(94)90123-6 · Cited by 41
Optimization of cube-per-order index warehouse layouts with zoning constraints
Malmborg, C. J. (1995) · International Journal of Production Research · doi:10.1080/00207549508930160 · Cited by 40
Rao, M. R. (2014) · Chapman & Hall/CRC eBooks · doi:10.1201/b16812-16 · Cited by 40
Parallel N-ary speculative computation of simulated annealing
Sohn, A. (1995) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/71.473510 · Cited by 39
Simulated annealing type algorithms for multivariate optimization
Gelfand, S. B., & Mitter, S. K. (1991) · Algorithmica · doi:10.1007/bf01759052 · Cited by 38
Composite stock cutting through simulated annealing
Lutfiyya, H. L., McMillin, B., Poshyanonda, P., & Dağli, C. H. (1992) · Mathematical and Computer Modelling · doi:10.1016/0895-7177(92)90078-y · Cited by 38
Bin-packing by simulated annealing
Rao, R. L., & Iyengar, S. S. (1994) · Computers & Mathematics with Applications · doi:10.1016/0898-1221(94)90077-9 · Cited by 37
Wang, J., Yang, J., & Lee, H. (1994) · Mathematical and Computer Modelling · doi:10.1016/0895-7177(94)90086-8 · Cited by 37
Selection of optimal set of weights in a layered network using genetic algorithms
Pal, S. K., & Bhandari, D. (1994) · Information Sciences · doi:10.1016/0020-0255(94)90076-0 · Cited by 37
Kaparthi, S., & Suresh, N. C. (1994) · Decision Sciences · doi:10.1111/j.1540-5915.1994.tb00819.x · Cited by 37
Theodoracatos, V. E., & Grimsley, J. L. (1995) · Computer Methods in Applied Mechanics and Engineering · doi:10.1016/0045-7825(95)00795-3 · Cited by 36
Heuristic unidirectional flowpath design approaches for automated guided vehicle systems
Kouvelis, P., Gutierrez, G. G., & Chiang, W. (1992) · International Journal of Production Research · doi:10.1080/00207549208942960 · Cited by 36
Solving the N-Queens problem with a binary Hopfield-type network
Mańdziuk, J. (1995) · Biological Cybernetics · doi:10.1007/bf00201419 · Cited by 36
Generalization by neural networks
Shekhar, S., & Amin, M. B. (1992) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.134256 · Cited by 35
A stochastic neural network for resource constrained scheduling
Vaithyanathan, S., & Ignizio, J. P. (1992) · Computers & Operations Research · doi:10.1016/0305-0548(92)90046-8 · Cited by 35
Basic aspects of evolution strategies
Bäck, T., & Hoffmeister, F. (1994) · Statistics and Computing · doi:10.1007/bf00175353 · Cited by 34
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 34
Fractional cell formation in group technology
Murthy, C. V. R., & Srinivasan, G. (1995) · International Journal of Production Research · doi:10.1080/00207549508930212 · Cited by 34
From Genetic Algorithms to Efficient Optimization
Yüret, D. (1994) · Cited by 33
Clustering for vehicle routing with a competitive neural network
Potvin, J., & Robillard, C. (1995) · Neurocomputing · doi:10.1016/0925-2312(94)00012-h · Cited by 32
Paralleled hardware annealing for optimal solutions on electronic neural networks
Lee, B. W., & Sheu, B. J. (1993) · IEEE Transactions on Neural Networks · doi:10.1109/72.238314 · Cited by 32
Global optimization by artificial life : a new technique using genetic population evolution
Bicking, F., Fonteix, C., Corriou, J., & Marc, I. (1994) · RAIRO - Operations Research · doi:10.1051/ro/1994280100231 · Cited by 31
Mapping combinatorial optimization problems onto neural networks
Ramanujam, J. (1995) · Information Sciences · doi:10.1016/0020-0255(94)00052-d · Cited by 30
Criteria for an optimum simulated annealing schedule for problems of the travelling salesman type
Rees, S., & Ball, R. C. (1987) · Journal of Physics A Mathematical and General · doi:10.1088/0305-4470/20/5/032 · Cited by 29
A Multi-chromosome Genetic Algorithm for Pallet Loading
Juliff, K. (1993) · international conference on Genetic algorithms · Cited by 28
Boltzmann machines as a model for parallel annealing
Aarts, E., & Korst, J. (1991) · Algorithmica · doi:10.1007/bf01759053 · Cited by 28
Simulated annealing: An initial application in econometrics
Goffe, W. L., Ferrier, G. D., & Rogers, J. (1992) · Computational Economics · doi:10.1007/bf00436486 · Cited by 28
Comparison of Heuristics for the 0–1 Multidimensional Knapsack Problem
Hanafi, S., Fréville, A., & Abdellaoui, A. (1996) · Springer eBooks · doi:10.1007/978-1-4613-1361-8_27 · Cited by 26
Soft genetic operators in Evolutionary Algorithms
Voigt, H.-M. (1995) · Lecture notes in computer science · doi:10.1007/3-540-59046-3_8 · Cited by 26
Prakash, M., & Murty, M. N. (1995) · Pattern Recognition Letters · doi:10.1016/0167-8655(95)00041-e · Cited by 26
Lucasius, C. B., & Kateman, G. (1994) · Computers & Chemistry · doi:10.1016/0097-8485(94)85006-2 · Cited by 25
Lucasius, C. B., & Kateman, G. (1994) · Computers & Chemistry · doi:10.1016/0097-8485(94)85007-0 · Cited by 25
Optimal path determination in a graph by hopfield neural network
Cavalieri, S., Stefano, A. D., & Mirabella, O. (1994) · Neural Networks · doi:10.1016/0893-6080(94)90032-9 · Cited by 24
Recent Developments in Operational Research
Eilon, S. (1970) · Management Education and Development · doi:10.1177/135050767000100104 · Cited by 22
DISCRETE AND CONTINUOUS VARIABLE STRUCTURAL OPTIMIZATION USING TABU SEARCH
Dhingra, A. K., & Bennage, W. A. (1995) · Engineering Optimization · doi:10.1080/03052159508941189 · Cited by 22
Multiple job scheduling with artificial neural networks
Lo, Z.-P., & Bavarian, B. (1993) · Computers & Electrical Engineering · doi:10.1016/0045-7906(93)90039-t · Cited by 22
Combinatorial optimization techniques for spacecraft scheduling automation
Scherer, W. T., & Rotman, F. (1994) · Annals of Operations Research · doi:10.1007/bf02085657 · Cited by 21
Automatic starting point selection for function optimization
Brooks, S. P., & Morgan, B. J. T. (1994) · Statistics and Computing · doi:10.1007/bf00142569 · Cited by 19
IFIP Transactions B: Applications in Technology
(1992) · Elsevier eBooks · doi:10.1016/b978-0-444-89465-6.50001-6 · Cited by 19
A bibliography of heuristic search research through 1992
Stewart, B. S., Liaw, C.-F., & White, C. C. (1994) · IEEE Transactions on Systems Man and Cybernetics · doi:10.1109/21.281425 · Cited by 18
A multi-valued Boltzmann machine
Lin, C., & Lee, C. S. G. (1995) · IEEE Transactions on Systems Man and Cybernetics · doi:10.1109/21.370198 · Cited by 18
Aarts, E., & van Laarhoven, P. J. M. (1992) · Discrete Mathematics · doi:10.1016/0012-365x(92)90524-j · Cited by 17
Cooling schedules for learning in neural networks
Heskes, T., Slijpen, E. T. P., & Kappen, B. (1993) · Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics · doi:10.1103/physreve.47.4457 · Cited by 15
A selected artificial intelligence bibliography for operations researchers
Jaumard, B., Peng Si, O. W., & Simeone, B. (1988) · Annals of Operations Research · doi:10.1007/bf02186359 · Cited by 15
Computing the minimum covariance determinant estimator (MCD) by simulated annealing
Todorov, V. (1992) · Computational Statistics & Data Analysis · doi:10.1016/0167-9473(92)90067-p · Cited by 15
An Evolution Strategy with Momentum Adaptation of the Random Number Distribution.
Ostermeier, A. (1992) · Parallel Problem Solving from Nature · Cited by 14
Applications of neural networks in manufacturing management systems
Udo, G. J., & Gupta, Y. P. (1994) · Production Planning & Control · doi:10.1080/09537289408919496 · Cited by 14
Allocating data to distributed‐memory multiprocessors by genetic algorithms
Mansour, N., & Fox, G. (1994) · Concurrency Practice and Experience · doi:10.1002/cpe.4330060602 · Cited by 14
Some mathematical and computer modelling of neural networks
Segall, R. S. (1995) · Applied Mathematical Modelling · doi:10.1016/0307-904x(95)00021-b · Cited by 14
Optimization by hierarchical mutant production
Schober, A., Thuerk, M., & Eigen, M. (1993) · Biological Cybernetics · doi:10.1007/bf01185421 · Cited by 14
Spin glass, the travelling salesman problem, neural networks and all that
Venkataraman, G., & Athithan, G. (1991) · Pramana · doi:10.1007/bf02846491 · Cited by 14
USING THE POTTS GLASS FOR SOLVING THE CLUSTERING PROBLEM
BENGTSSON, M., & Roivainen, P. (1995) · International Journal of Neural Systems · doi:10.1142/s012906579500010x · Cited by 14
Mapping Tasks to Processors to Minimize Communication Time in a Multiprocessor System
Chakrapani, J., & Skorin‐Kapov, J. (1995) · Operations research, computer science. Interface series · doi:10.1007/978-1-4615-2223-2_3 · Cited by 13
O’Regan, G. (2012) · Springer eBooks · doi:10.1007/978-1-4471-2359-0_15 · Cited by 13
Guided Forward Search in Tardiness Scheduling of Large One Machine Problems
Morton, T. E., & Ramnath, P. (1995) · Springer eBooks · doi:10.1007/978-1-4615-2263-8_4 · Cited by 12
Modified simulated annealing for multiple-objective engineering design optimization
Lee, S., & Wang, H. (1992) · Journal of Intelligent Manufacturing · doi:10.1007/bf01474749 · Cited by 12
A review of combinatorial problems arising in feedforward neural network design
Amaldi, E., Mayoraz, E., & de Werra, D. (1994) · Discrete Applied Mathematics · doi:10.1016/0166-218x(92)00184-n · Cited by 12
Clustered Boltzmann Machines: Massively parallel architectures for constrained optimization problems
Gloria, A. D., Faraboschi, P., & Olivieri, M. (1993) · Parallel Computing · doi:10.1016/0167-8191(93)90046-n · Cited by 11
Stepwise-overlapped parallel annealing and its application to floorplan designs
Kim, Y., Jang, Y.-J., & Kim, M.-H. (1991) · Computer-Aided Design · doi:10.1016/0010-4485(91)90004-g · Cited by 10
Wang, J., & Chankong, V. (1991) · Journal of Intelligent Manufacturing · doi:10.1007/bf01471180 · Cited by 10
Characterization of training errors in supervised learning using gradient-based rules
Wang, J., & Malakooti, B. B. (1993) · Neural Networks · doi:10.1016/s0893-6080(09)80019-1 · Cited by 10
Decision tree design by simulated annealing
Bucy, R. S., & DiEsposti, R. (1993) · ESAIM Mathematical Modelling and Numerical Analysis · doi:10.1051/m2an/1993270505151 · Cited by 9
Implementation and evaluation of genetic algorithms for system partitioning
Curatelli, F. (1995) · International Journal of Electronics · doi:10.1080/00207219508926175 · Cited by 9
[Neural Networks: A Review from Statistical Perspective]: Comment
Амари, Ш.-И. (1994) · Statistical Science · doi:10.1214/ss/1177010639 · Cited by 8
Representation and processing in a stochastic neural network: An integrated approach
Hulle, M. M. V., & Orban, G. A. (1991) · Neural Networks · doi:10.1016/0893-6080(91)90018-z · Cited by 8
Use of neural networks for the optimum frequency assignment problem
Kurokawa, T., & Kozuka, S. (1994) · Electronics and Communications in Japan (Part I Communications) · doi:10.1002/ecja.4410771110 · Cited by 8
Deterministic and randomized local search
Aarts, E. E., Korst, J., & Zwietering, P. P. (1993) · TU/e Research Portal · Cited by 8
An efficient annealing algorithm for global optimization in Boltzmann machines
Ansari, N., Sarasa, R., & Wang, G. (1993) · Applied Intelligence · doi:10.1007/bf00871936 · Cited by 6
Singh, G. S., & Deshpande, K. (1993) · Advances in Engineering Software · doi:10.1016/0965-9978(93)90025-o · Cited by 5
LINEAR PROGRAMMING AND RECURRENT ASSOCIATIVE MEMORIES
Kalaba, R. E., Kim, M., & Moore, J. E. (1992) · International Journal of General Systems · doi:10.1080/03081079208945025 · Cited by 5
Implementation and Comparison of Three Neural Network Learning Algorithms
Huang, T., Zhang, C., Lee, S., & Wang, H. (1993) · Kybernetes · doi:10.1108/eb005954 · Cited by 5
Optimal histogram partitioning using a simulated annealing technique
Brunelli, R. (1992) · Pattern Recognition Letters · doi:10.1016/0167-8655(92)90093-f · Cited by 5
Efficient heuristics for robot acquisition planning for a CIM system
Cook, J. S., & Han, B. T. (1995) · OR Spectrum · doi:10.1007/bf01719252 · Cited by 3
AN ANALOG NEURAL NETWORK APPROACH TO GLOBAL ROUTING PROBLEM
Shih, P., & Feng, W. (1991) · Cybernetics & Systems · doi:10.1080/01969729108902310 · Cited by 2
An optimization technique with neural networks and its application to a ferry routing
Mitsuo, K., Santoso, T., Mas, M., & Takashi, T. (2005) · Springer eBooks · doi:10.1007/bfb0008437 · Cited by 1
A Metaheuristic for the Timetabling Problem.
Abada, H., & El‐Darzi, E. (1996) · Springer eBooks · doi:10.1007/978-1-4613-1361-8_9 · Cited by 1
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.