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 201–400 of 488
The general employee scheduling problem. An integration of MS and AI
Glover, F., & McMillan, C. (1986) · Computers & Operations Research · doi:10.1016/0305-0548(86)90050-x · Cited by 295
Channel assignment for cellular radio using simulated annealing
Duque-Anton, M., Kunz, D., & Ruber, B. (1993) · IEEE Transactions on Vehicular Technology · doi:10.1109/25.192382 · Cited by 294
Computers and artificial intelligence
Reilly, K. D. (1972) · Information Storage and Retrieval · doi:10.1016/0020-0271(72)90029-0 · Cited by 289
A Simulated Annealing Approach to the Network Design Problem with Variational Inequality Constraints
Friesz, T. L., Cho, H.-J., Mehta, N. J., Tobin, R. L., & Anandalingam, G. (1992) · Transportation Science · doi:10.1287/trsc.26.1.18 · Cited by 285
A Tabu Search Heuristic for the Vehicle Routing Problem with Stochastic Demands and Customers
Michel Gendreau, A., Gilbert Laporte, A., & Séguin, R. (1996) · Operations Research · doi:10.1287/opre.44.3.469 · Cited by 283
A genetic algorithm for bin packing and line balancing
Falkenauer, E., & Delchambre, A. (2003) · Proceedings 1992 IEEE International Conference on Robotics and Automation · doi:10.1109/robot.1992.220088 · Cited by 279
Design and evolution of modular neural network architectures
Happel, B. L. M., & Murre, J. M. J. (1994) · Neural Networks · doi:10.1016/s0893-6080(05)80155-8 · Cited by 275
IEEE Transactions on Neural Networks
(2023) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.72 · Cited by 275
Capacitated clustering problems by hybrid simulated annealing and tabu search
Osman, I. (1994) · International Transactions in Operational Research · doi:10.1016/0969-6016(94)90032-9 · Cited by 274
Self-citationChen, H. (1995) · Journal of the American Society for Information Science · doi:10.1002/(sici)1097-4571(199504)46:3<194::aid-asi4>3.0.co;2-s · Cited by 273
Automatic Definition of Modular Neural Networks
Gruau, F. (1994) · Adaptive Behavior · doi:10.1177/105971239400300202 · Cited by 269
Willshaw, D. J., & Von Der Malsburg, C. (1979) · Philosophical Transactions of the Royal Society of London. B, Biological Sciences · doi:10.1098/rstb.1979.0056 · Cited by 264
Trading on the Edge: Neural, Genetic, and Fuzzy Systems for Chaotic Financial Markets
Deboeck, G. J. (1994) · Cited by 260
Genetic Algorithms and Investment Strategies
Bauer, R. (1994) · Cited by 260
Proceedings of the 10th European conference on Artificial intelligence
Neumann, B. (1992) · Cited by 257
Fang, H.-L., Ross, P. D., & Corne, D. (1993) · Cited by 254
Applying the genetic approach to simulated annealing in solving some NP-hard problems
Lin, F.-T., Kao, C.-Y., & Hsu, C.-C. (1993) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/21.257766 · Cited by 252
The N-City Travelling Salesman Problem: Statistical Mechanics and the Metropolis Algorithm
Bonomi, E., & Lutton, J.-L. (1984) · SIAM Review · doi:10.1137/1026105 · Cited by 251
Journal of Computing and Information Technology
(2016) · Journal of Computing and Information Technology · doi:10.20532/cit · Cited by 250
A Markov chain analysis on simple genetic algorithms
Suzuki, J. (1995) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/21.370197 · Cited by 248
A knowledge-intensive genetic algorithm for supervised learning
Janikow, C. Z. (1994) · Machine Learning · doi:10.1007/bf00993043 · Cited by 246
New approaches for heuristic search: A bilateral linkage with artificial intelligence
Glover, F., & Greenberg, H. J. (1989) · European Journal of Operational Research · doi:10.1016/0377-2217(89)90185-9 · Cited by 244
An efficient tabu search procedure for the p-Median Problem
Rolland, E., Schilling, D. A., & Current, J. R. (1997) · European Journal of Operational Research · doi:10.1016/s0377-2217(96)00141-5 · Cited by 243
The Science of Breeding and Its Application to the Breeder Genetic Algorithm (BGA)
Mühlenbein, H., & Schlierkamp-Voosen, D. (1993) · Evolutionary Computation · doi:10.1162/evco.1993.1.4.335 · Cited by 242
A genetic algorithm for the linear transportation problem
Vignaux, G. A., & Michalewicz, Z. (1991) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/21.87092 · Cited by 239
The Interaction of Mutation Rate, Selection, and Self-Adaptation Within a Genetic Algorithm.
Bäck, T. (1992) · Parallel Problem Solving from Nature · Cited by 237
Avoiding local optima in thep-hub location problem using tabu search and GRASP
Klincewicz, J. G. (1992) · Annals of Operations Research · doi:10.1007/bf02060483 · Cited by 234
APPLYING EVOLUTIONARY PROGRAMMING TO SELECTED TRAVELING SALESMAN PROBLEMS
FOGEL, D. B. (1993) · Cybernetics and Systems · doi:10.1080/01969729308961697 · Cited by 232
Simulated annealing for constrained global optimization
Romeijn, H. E., & Smith, R. L. (1994) · Journal of Global Optimization · doi:10.1007/bf01100688 · Cited by 229
A Comparison of Discriminant Analysis versus Artificial Neural Networks
Yoon, Y., Swales, G., & Margavio, T. M. (1993) · Journal of the Operational Research Society · doi:10.1057/jors.1993.6 · Cited by 227
Genetic Algorithms and evolution strategies: Similarities and differences
Hoffmeister, F., & Bäck, T. (2006) · Lecture Notes in Computer Science · doi:10.1007/bfb0029787 · Cited by 225
Dorsey, R. E., & Mayer, W. J. (1995) · Journal of Business & Economic Statistics · doi:10.1080/07350015.1995.10524579 · Cited by 222
Generalized Deformable Models, Statistical Physics, and Matching Problems
Yuille, A. L. (1990) · Neural Computation · doi:10.1162/neco.1990.2.1.1 · Cited by 222
Flight Scheduling and Maintenance Base Planning
Feo, T. A., & Bard, J. F. (1989) · Management Science · doi:10.1287/mnsc.35.12.1415 · Cited by 221
Genetic local search algorithms for the traveling salesman problem
Ulder, N. L. J., Aarts, E., Bandelt, H., van Laarhoven, P. J. M., & Pesch, E. (1991) · Lecture notes in computer science · doi:10.1007/bfb0029740 · Cited by 220
Tabu search for nonlinear and parametric optimization (with links to genetic algorithms)
Glover, F. (1994) · Discrete Applied Mathematics · doi:10.1016/0166-218x(94)90211-9 · Cited by 218
Graph partitioning using annealed neural networks
Van den Bout, D. E., & Miller, T. K. (1990) · IEEE Transactions on Neural Networks · doi:10.1109/72.80231 · Cited by 218
Tabu search techniques: A tutorial and an application to neural networks
de Werra, D., & Hertz, A. (1989) · Operations-Research-Spektrum · doi:10.1007/bf01720782 · Cited by 217
What makes a problem hard for a genetic algorithm? Some anomalous results and their explanation
Forrest, S., & Mitchell, M. (1994) · Machine Learning · doi:10.1007/bf00993046 · Cited by 217
Genetic algorithms in chemistry
Hibbert, D. B. (1993) · Chemometrics and Intelligent Laboratory Systems · doi:10.1016/0169-7439(93)80028-g · Cited by 217
Combining simulated annealing with local search heuristics
Martin, O. C., & Otto, S. W. (1996) · Annals of Operations Research · doi:10.1007/bf02601639 · Cited by 216
Genetic Reinforcement Learning for Neurocontrol Problems
Whitley, D., Dominic, S., Das, R., & Anderson, C. W. (1993) · Machine Learning · doi:10.1007/bf00993045 · Cited by 215
Needed: An Empirical Science of Algorithms
Hooker, J. N. (1994) · Operations Research · doi:10.1287/opre.42.2.201 · Cited by 213
A Model for Determining Retail Product Category Assortment and Shelf Space Allocation
Borin, N., Farris, P., & Freeland, J. R. (1994) · Decision Sciences · doi:10.1111/j.1540-5915.1994.tb00809.x · Cited by 212
Simulated annealing : parallelization techniques
Azencott, R. (1992) · Cited by 211
A parallel tabu search algorithm for large traveling salesman problems
Fiechter, C.-N. (1994) · Discrete Applied Mathematics · doi:10.1016/0166-218x(92)00033-i · Cited by 210
Experimental analysis of simulated annealing based algorithms for the layout problem
Heragu, S. S., & Alfa, A. S. (1992) · European Journal of Operational Research · doi:10.1016/0377-2217(92)90042-8 · Cited by 208
Goldberg, D. E. (1990) · Complex Systems · Cited by 207
Necessary and sufficient condition for absolute stability of neural networks
Forti, M., Manetti, S., & Marini, M. (1994) · IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications · doi:10.1109/81.298364 · Cited by 206
Large-step markov chains for the TSP incorporating local search heuristics
Martin, O., Otto, S. W., & Felten, E. W. (1992) · Operations Research Letters · doi:10.1016/0167-6377(92)90028-2 · Cited by 201
Critical Event Tabu Search for Multidimensional Knapsack Problems
Glover, F., & Kochenberger, G. A. (1996) · Springer eBooks · doi:10.1007/978-1-4613-1361-8_25 · Cited by 189
Representational issues in genetic optimization
LIEPINS, G. E., & VOSE, M. D. (1990) · Journal of Experimental & Theoretical Artificial Intelligence · doi:10.1080/09528139008953717 · Cited by 185
(1993) · Lecture Notes in Economics and Mathematical Systems · doi:10.1007/978-3-642-46787-5 · Cited by 184
Heuristics for the generalised assignment problem: simulated annealing and tabu search approaches
Osman, I. H. (1995) · OR Spectrum · doi:10.1007/bf01720977 · Cited by 184
Self-citationAn Analysis of the Elastic Net Approach to the Traveling Salesman Problem
Durbin, R., Szeliski, R., & Yuille, A. (1989) · Neural Computation · doi:10.1162/neco.1989.1.3.348 · Cited by 184
Neural Networks for the MS/OR Analyst: An Application Bibliography
Sharda, R. (1994) · Interfaces · doi:10.1287/inte.24.2.116 · Cited by 181
GENETIC ALGORITHMS IN OPTIMIZATION PROBLEMS WITH DISCRETE AND INTEGER DESIGN VARIABLES
Lin, C.-C., & Hajela, P. (1992) · Engineering Optimization · doi:10.1080/03052159208941234 · Cited by 180
Connectionist approach to time series prediction: an empirical test
Sharda, R., & Patil, R. B. (1992) · Journal of Intelligent Manufacturing · doi:10.1007/bf01577272 · Cited by 179
Cell division and migration in a ‘genotype’ for neural networks
Cangelosi, A., Parisi, D., & Nolfi, S. (1994) · Network: Computation in Neural Systems · doi:10.1088/0954-898x/5/4/005 · Cited by 179
Construction-Site Layout Using Annealed Neural Network
Yeh, I.-C. (1995) · Journal of Computing in Civil Engineering · doi:10.1061/(asce)0887-3801(1995)9:3(201 · Cited by 176
Experiments in projection and clustering by simulated annealing
Klein, R. W., & Dubes, R. C. (1989) · Pattern Recognition · doi:10.1016/0031-3203(89)90067-8 · Cited by 176
A theoretical framework for simulated annealing
Romeo, F., & Sangiovanni-Vincentelli, A. (1991) · Algorithmica · doi:10.1007/bf01759049 · Cited by 173
Neural Networks, Decision Tree Induction and Discriminant Analysis: an Empirical Comparison
Curram, S. P., & Mingers, J. (1994) · Journal of the Operational Research Society · doi:10.1057/jors.1994.62 · Cited by 172
Pape, C. L. (1994) · Intelligent Systems Engineering · doi:10.1049/ise.1994.0009 · Cited by 172
Genetic Operators for Sequencing Problems
Fox, B. R., & McMahon, M. B. (1991) · Foundations of Genetic Algorithms · doi:10.1016/b978-0-08-050684-5.50021-5 · Cited by 170
The tabu search metaheuristic: How we used it
Hertz, A., & de Werra, D. (1990) · Annals of Mathematics and Artificial Intelligence · doi:10.1007/bf01531073 · Cited by 170
Glover, F. (1989) · Medical Entomology and Zoology · Cited by 170
(1994) · Lecture Notes in Computer Science · doi:10.1007/3-540-58484-6 · Cited by 170
Genetic Algorithms and Robotics
Davidor, Y. (1991) · World Scientific series in robotics and intelligent systems · doi:10.1142/1111 · Cited by 168
Understanding and using genetic algorithms Part 2. Representation, configuration and hybridization
Lucasius, C. B., & Kateman, G. (1994) · Chemometrics and Intelligent Laboratory Systems · doi:10.1016/0169-7439(94)85038-0 · Cited by 168
Constrained clustering as an optimization method
Rose, K., Gurewitz, E., & Fox, G. C. (1993) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.236251 · Cited by 168
A simulated annealing approach to the multiconstraint zero-one knapsack problem
Drexl, A. (1988) · Computing · doi:10.1007/bf02242185 · Cited by 164
Improving the performance of the Hopfield-Tank neural network through normalization and annealing
Van den Bout, D. E., & Miller, T. K. (1989) · Biological Cybernetics · doi:10.1007/bf00203001 · Cited by 162
Genetic Algorithms for Combinatorial Optimization: The Assemble Line Balancing Problem
Anderson, E. J., & Ferris, M. C. (1994) · INFORMS journal on computing · doi:10.1287/ijoc.6.2.161 · Cited by 161
The noising method: a new method for combinatorial optimization
Charon, I., & Hudry, O. (1993) · Operations Research Letters · doi:10.1016/0167-6377(93)90023-a · Cited by 160
WU, S.-J., & CHOW, P.-T. (1995) · Engineering Optimization · doi:10.1080/03052159508941187 · Cited by 160
A Simulated Annealing Methodology for Clusterwise Linear Regression
DeSarbo, W. S., Oliver, R. L., & Rangaswamy, A. (1989) · Psychometrika · doi:10.1007/bf02296405 · Cited by 158
Some experiments with simulated annealing techniques for packing problems
Dowsland, K. A. (1993) · European Journal of Operational Research · doi:10.1016/0377-2217(93)90195-s · Cited by 158
Artificial neural networks in manufacturing: concepts, applications, and perspectives
Huang, S.-Y., & Zhang, H. (1994) · IEEE Transactions on Components Packaging and Manufacturing Technology Part A · doi:10.1109/95.296402 · Cited by 155
Scheduling problems and traveling salesman: the genetic edge recombination
Whitley, D., Starkweather, T., & Fuquay, D. (1989) · international conference on Genetic algorithms · Cited by 152
Mathematical programming: State of the art 1994
Birge, J. R., & Murty, K. G. (1994) · Medical Entomology and Zoology · Cited by 150
A Knowledge-Intensive Genetic Algorithm for Supervised Learning
Janikow, C. Z. (1993) · Machine Learning · doi:10.1023/a:1022669929488 · Cited by 150
Genetic algorithms: Foundations and applications
Liepins, G. E., & Hilliard, M. R. (1989) · Annals of Operations Research · doi:10.1007/bf02022092 · Cited by 147
Simulated annealing methods with general acceptance probabilities
Anily, S., & Federgruen, A. (1987) · Journal of Applied Probability · doi:10.1017/s0021900200031387 · Cited by 146
Combinatorial optimization with use of guided evolutionary simulated annealing
Yip, P. P. C., & Pao, Y. (1995) · IEEE Transactions on Neural Networks · doi:10.1109/72.363466 · Cited by 146
The multiobjective equilibrium network design problem revisited: A simulated annealing approach
Friesz, T. L., Anandalingam, G. “., Mehta, N. J., Nam, K., Shah, S., & Tobin, R. L. (1993) · European Journal of Operational Research · doi:10.1016/0377-2217(93)90143-b · Cited by 145
Woodruff, D. L., & Rocke, D. M. (1994) · Journal of the American Statistical Association · doi:10.1080/01621459.1994.10476821 · Cited by 144
State-of-the-Art Survey—The Traveling Salesman Problem: A Neural Network Perspective
Potvin, J. (1993) · INFORMS journal on computing · doi:10.1287/ijoc.5.4.328 · Cited by 142
On solving travelling salesman problems by genetic algorithms
Braun, H. (2006) · Springer eBooks · doi:10.1007/bfb0029743 · Cited by 141
Using Artificial Neural Networks to Pick Stocks
Kryzanowski, L., Galler, M., & Wright, D. W. (1993) · Financial Analysts Journal · doi:10.2469/faj.v49.n4.21 · Cited by 141
Genetic algorithms and scatter search: unsuspected potentials
Glover, F. (1994) · Statistics and Computing · doi:10.1007/bf00175357 · Cited by 140
Simulated Annealing Without Rejected Moves
Greene, J. W., & Supowit, K. J. (1986) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.1986.1270190 · Cited by 137
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
Fujitsu scientific and technical journal
富士通 (1965) · Medical Entomology and Zoology · Cited by 134
On solving constrained optimization problems with neural networks: a penalty method approach
Lillo, W. E., Loh, M. H., Hui, S., & Żak, S. H. (1993) · IEEE Transactions on Neural Networks · doi:10.1109/72.286888 · Cited by 134
Tabu search method with random moves for globally optimal design
Hu, N. (1992) · International Journal for Numerical Methods in Engineering · doi:10.1002/nme.1620350508 · Cited by 134
Neural Networks: Concepts, Applications, and Implementations
Antognetti, P., & Milutinović, V. M. (1991) · Medical Entomology and Zoology · Cited by 132
Tabu search performance on the symmetric traveling salesman problem
Knox, J. (1994) · Computers & Operations Research · doi:10.1016/0305-0548(94)90016-7 · Cited by 132
Fort, J. (1988) · Biological Cybernetics · doi:10.1007/bf00336888 · Cited by 130
Artificial intelligence, heuristic frameworks and tabu search
Glover, F. (1990) · Managerial and Decision Economics · doi:10.1002/mde.4090110512 · Cited by 127
Hashing vectors for tabu search
Woodruff, D. L., & Zemel, E. (1993) · Annals of Operations Research · doi:10.1007/bf02022565 · Cited by 126
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
Bennage, W. A., & Dhingra, A. K. (1995) · International Journal for Numerical Methods in Engineering · doi:10.1002/nme.1620381606 · Cited by 124
Statistical mechanics as the underlying theory of ‘elastic’ and ‘neural’ optimisations
Simić, P. (1990) · Network Computation in Neural Systems · doi:10.1088/0954-898x_1_1_007 · Cited by 123
DSS for multiobjective project scheduling
Słowiński, R., Soniewicki, B., & Węglarz, J. (1994) · European Journal of Operational Research · doi:10.1016/0377-2217(94)90353-0 · Cited by 123
Training neural nets with the reactive tabu search
Battiti, R., & Tecchiolli, G. (1995) · IEEE Transactions on Neural Networks · doi:10.1109/72.410361 · Cited by 123
ARTIFICIAL NEURAL NETWORKS: A NEW APPROACH TO MODELING INTERREGIONAL TELECOMMUNICATION FLOWS*
Fischer, M. M., & Gopal, S. (1994) · Journal of Regional Science · doi:10.1111/j.1467-9787.1994.tb00880.x · Cited by 121
Solving the maximum clique problem using a tabu search approach
Michel Gendreau, A., Patrick Soriano, A., & Salvail, L. (1993) · Annals of Operations Research · doi:10.1007/bf02023002 · Cited by 120
Malakooti, B. B., & Zhou, Y. Q. (1994) · Management Science · doi:10.1287/mnsc.40.11.1542 · Cited by 120
Balakrishnan, P. V. S., Cooper, M. C., Jacob, V. S., & Lewis, P. A. (1994) · Psychometrika · doi:10.1007/bf02294390 · Cited by 120
A genetic algorithmic framework for process design and optimization
Androulakis, I. P., & Venkatasubramanian, V. (1991) · Computers & Chemical Engineering · doi:10.1016/0098-1354(91)85009-j · Cited by 119
Using a tabu search approach for solving the two-dimensional irregular cutting problem
Błażewicz, J., Hawryluk, P., & Walkowiak, R. (1993) · Annals of Operations Research · doi:10.1007/bf02022998 · Cited by 118
Schedule synchronization for public transit networks
Domschke, W. (1989) · OR Spectrum · doi:10.1007/bf01721163 · Cited by 118
Hybrid genetic algorithms for bin-packing and related problems
Reeves, C. R. (1996) · Annals of Operations Research · doi:10.1007/bf02125404 · Cited by 116
Unrelated parallel machine scheduling using local search
Glass, C. A., Potts, C. N., & Shade, P. (1994) · Mathematical and Computer Modelling · doi:10.1016/0895-7177(94)90205-4 · Cited by 115
Genetic algorithms for numerical optimization
Michalewicz, Z., & Janikow, C. Z. (1991) · Statistics and Computing · doi:10.1007/bf01889983 · Cited by 114
What Makes a Problem Hard for a Genetic Algorithm? Some Anomalous Results and Their Explanation
Forrest, S., & Mitchell, M. (1993) · Machine Learning · doi:10.1023/a:1022626114466 · Cited by 114
On the effectiveness of crossover in simulated evolutionary optimization
Fogel, D. B., & Stayton, L. C. (1994) · Biosystems · doi:10.1016/0303-2647(94)90040-x · Cited by 111
Estimating Missing Values Using Neural Networks
Gupta, A. K., & Lam, M. S. (1996) · Journal of the Operational Research Society · doi:10.1057/jors.1996.21 · Cited by 111
Tabu search and design optimization
Bland, J. A., & Dawson, G. P. (1991) · Computer-Aided Design · doi:10.1016/0010-4485(91)90089-f · Cited by 111
Genetic algorithms and highly constrained problems: The time-table case
Colorni, A., Dorigo, M., & Maniezzo, V. (2006) · Springer eBooks · doi:10.1007/bfb0029731 · Cited by 110
Parallel implementations of the statistical cooling algorithm
Aarts, E., de Bont, F. M. J., Habers, E. H. A., & van Laarhoven, P. J. M. (1986) · Integration · doi:10.1016/0167-9260(86)90002-7 · Cited by 110
Neural network methods in combinatorial optimization
Looi, C. (1992) · Computers & Operations Research · doi:10.1016/0305-0548(92)90044-6 · Cited by 107
Hörchner, U., & Kalivas, J. H. (1995) · Analytica Chimica Acta · doi:10.1016/0003-2670(95)00163-t · Cited by 106
Neural networks: theory and applications
(1992) · Choice Reviews Online · doi:10.5860/choice.29-2754 · Cited by 105
Massively parallel tabu search for the quadratic assignment problem
Chakrapani, J., & Skorin‐Kapov, J. (1993) · Annals of Operations Research · doi:10.1007/bf02022999 · Cited by 105
Gao, Y. C., Qi, X., & Palmieri, F. (1998) · IEEE Transactions on Neural Networks · doi:10.1109/72.661129 · Cited by 104
Peterson, C. (1990) · Neural Computation · doi:10.1162/neco.1990.2.3.261 · Cited by 102
A study of the application of Kohonen-type neural networks to the Travelling Salesman Problem
Favata, F., & Walker, R. (1991) · Biological Cybernetics · doi:10.1007/bf00202610 · Cited by 101
A tabu search algorithm for frequency assignment
Castelino, D., Hurley, S., & Stephens, N. M. (1996) · Annals of Operations Research · doi:10.1007/bf02125459 · Cited by 101
Finding point correspondences using simulated annealing
Starink, J. P. P., & Backer, E. (1995) · Pattern Recognition · doi:10.1016/0031-3203(94)00087-3 · Cited by 100
An empirical study of genetic operators in genetic algorithms
Yao, X. (1993) · Microprocessing and Microprogramming · doi:10.1016/0165-6074(93)90215-7 · Cited by 98
The Complexity of the Lin–Kernighan Heuristic for the Traveling Salesman Problem
Papadimitriou, C. H. (1992) · SIAM Journal on Computing · doi:10.1137/0221030 · Cited by 98
Intelligent Scheduling Systems
(1995) · Springer eBooks · doi:10.1007/978-1-4615-2263-8 · Cited by 96
Boltzmann machines for travelling salesman problems
Aarts, E., & Korst, J. (1989) · European Journal of Operational Research · doi:10.1016/0377-2217(89)90355-x · Cited by 96
A massively parallel genetic algorithm for RNA secondary structure prediction
Shapiro, B. A., & Navetta, J. (1994) · The Journal of Supercomputing · doi:10.1007/bf01204728 · Cited by 96
On the convergence of ?Threshold Accepting?
Althfer, I., & Koschnick, K.-U. (1991) · Applied Mathematics & Optimization · doi:10.1007/bf01447741 · Cited by 95
Cell formation in manufacturing systems through simulated annealing: An experimental evaluation
Venugopal, V., & Narendran, T. T. (1992) · European Journal of Operational Research · doi:10.1016/0377-2217(92)90158-6 · Cited by 95
Neural Networks for Optimization Problems with Inequality Constraints: The Knapsack Problem
Ohlsson, M., Peterson, C., & Söderberg, B. (1993) · Neural Computation · doi:10.1162/neco.1993.5.2.331 · Cited by 95
Embedding a sequential procedure within an evolutionary algorithm for coloring problems in graphs
Costa, D., Hertz, A., & Dubuis, C. (1995) · Journal of Heuristics · doi:10.1007/bf02430368 · Cited by 92
Local search for satisfiability (SAT) problem
Gu, J. (1993) · IEEE Transactions on Systems Man and Cybernetics · doi:10.1109/21.247892 · Cited by 92
Approximating maximum clique with a Hopfield network
Jagota, A. (1995) · IEEE Transactions on Neural Networks · doi:10.1109/72.377977 · Cited by 92
Kitano, H. (1994) · Physica D Nonlinear Phenomena · doi:10.1016/0167-2789(94)90285-2 · Cited by 91
Watt, R., Maslana, E. S., Navabi, M. J., & Mylrea, K. C. (1992) · Anesthesiology · doi:10.1097/00000542-199209001-00506 · Cited by 91
Kuik, R., SALOMON, M., Wassenhove, L. N. V., & MAES, J. (1993) · IIE Transactions · doi:10.1080/07408179308964266 · Cited by 90
Pardalos, P. M., Pitsoulis, L., Mavridou, T. D., & Resende, M. G. C. (1995) · Lecture notes in computer science · doi:10.1007/3-540-60321-2_26 · Cited by 89
Optimization of functions with many minima
Bilbro, G. L., & Snyder, W. E. (1991) · IEEE Transactions on Systems Man and Cybernetics · doi:10.1109/21.108301 · Cited by 89
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
A feedforward neural network for multiple criteria decision making
Wang, J., & Malakooti, B. B. (1992) · Computers & Operations Research · doi:10.1016/0305-0548(92)90089-n · Cited by 88
Neural networks and operations research: An overview
Burke, L. I., & Ignizio, J. P. (1992) · Computers & Operations Research · doi:10.1016/0305-0548(92)90043-5 · Cited by 88
Do intelligent configuration search techniques outperform random search for large molecules?
Judson, R., Colvin, M. E., Meza, J. C., Huffer, A., & Gutierrez, D. (1992) · International Journal of Quantum Chemistry · doi:10.1002/qua.560440214 · Cited by 83
An efficient constrained learning algorithm with momentum acceleration
Perantonis, S. J., & Karras, D. A. (1995) · Neural Networks · doi:10.1016/0893-6080(94)00067-v · Cited by 81
A Simulated Annealing-Based Approach to Three-Dimensional Component Packing
Szykman, S., & Cagan, J. (1995) · Journal of Mechanical Design · doi:10.1115/1.2826140 · Cited by 81
On the power of neural networks for solving hard problems
Bruck, J., & Goodman, J. W. (1990) · Journal of Complexity · doi:10.1016/0885-064x(90)90001-t · Cited by 81
Structure and Performance of Fine-Grain Parallelism in GeneticSearch
Baluja, S. (2019) · CRC Press eBooks · doi:10.1201/9780429128332-7 · Cited by 79
Miller, G. F., & Todd, P. M. (1995) · Lecture notes in computer science · doi:10.1007/3-540-59046-3_10 · Cited by 78
A neural network algorithm for the multiple traveling salesmen problem
Wacholder, E., Han, J., & Mann, R. C. (1989) · Biological Cybernetics · doi:10.1007/bf00204755 · Cited by 78
GENETIC ALGORITHMS: WHAT FITNESS SCALING IS OPTIMAL?
Крейнович, В., QUINTANA, C., & Fuentes, O. (1993) · Cybernetics & Systems · doi:10.1080/01969729308961696 · Cited by 78
Old Bachelor Acceptance: A New Class of Non-Monotone Threshold Accepting Methods
Hu, T. C., Kahng, A. B., & Tsao, C.-W. A. (1995) · INFORMS journal on computing · doi:10.1287/ijoc.7.4.417 · Cited by 78
Experimental Analysis of Algorithms
McGeoch, C. C. (2002) · Nonconvex optimization and its applications · doi:10.1007/978-1-4757-5362-2_14 · Cited by 77
Moscato, P. (1993) · Annals of Operations Research · doi:10.1007/bf02022564 · Cited by 77
Applying tabu search with influential diversification to multiprocessor scheduling
Hübscher, R., & Glover, F. (1994) · Computers & Operations Research · doi:10.1016/0305-0548(94)90017-5 · Cited by 76
Genetic Algorithms for Machine Learning
(1994) · Springer eBooks · doi:10.1007/978-1-4615-2740-4 · Cited by 75
Fast parallel constraint satisfaction
Kirousis, L. M. (1993) · Artificial Intelligence · doi:10.1016/0004-3702(93)90063-h · Cited by 75
Tabu search for graph partitioning
Rolland, É., Pirkul, H., & Glover, F. (1996) · Annals of Operations Research · doi:10.1007/bf02125455 · Cited by 75
Scheduling the Australian State Cricket Season Using Simulated Annealing
Willis, R. J., & Terrill, B. J. (1994) · Journal of the Operational Research Society · doi:10.1057/jors.1994.40 · Cited by 72
SALSA: a new approach to scheduling with timing constraints
Nestor, J. A., & Krishnamoorthy, G. (1993) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/43.238604 · Cited by 72
A study of genetic crossover operations on the facilities layout problem
Chan, K. C., & Tansri, H. (1994) · Computers & Industrial Engineering · doi:10.1016/0360-8352(94)90049-3 · Cited by 70
Simulated annealing with extended neighbourhood
Yao, X. (1991) · International Journal of Computer Mathematics · doi:10.1080/00207169108804011 · Cited by 70
Teodorović, D., & Pavkovic, G. D. (1992) · Transportation Planning and Technology · doi:10.1080/03081069208717490 · Cited by 70
A Genetic Algorithm for Survivable Network Design
Davis, L. D., Orvosh, D., Cox, A. J., & Qiu, Y. (1993) · international conference on Genetic algorithms · Cited by 69
Tabu learning: a neural network search method for solving nonconvex optimization problems
Beyer, D., & Ogier, R. G. (1991) · International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn.1991.170523 · Cited by 69
Complexity Optimized Data Clustering by Competitive Neural Networks
Buhmann, J. M., & Kühnel, H. (1993) · Neural Computation · doi:10.1162/neco.1993.5.1.75 · Cited by 68
A simulated annealing approach to the nesting problem in the textile manufacturing industry
Heckmann, R., & Lengauer, T. (1995) · Annals of Operations Research · doi:10.1007/bf02099693 · Cited by 67
Optimization algorithms - Simulated annealing and neural network processing
Jeffrey, W., & Rosner, R. (1986) · The Astrophysical Journal · doi:10.1086/164700 · Cited by 67
Neural network for solving linear programming problems with bounded variables
Xia, Y., & Wang, J. (1995) · IEEE Transactions on Neural Networks · doi:10.1109/72.363493 · Cited by 67
The analysis of local search problems and their heuristics
Yannakakis, M. (1990) · Lecture notes in computer science · doi:10.1007/3-540-52282-4_52 · Cited by 66
Neural networks in computational materials science: training algorithms
Skinner, A., & Broughton, J. Q. (1995) · Modelling and Simulation in Materials Science and Engineering · doi:10.1088/0965-0393/3/3/006 · Cited by 66
Genetic algorithms and their applications to the design of neural networks
Jones, A. J. (1993) · Neural Computing and Applications · doi:10.1007/bf01411373 · Cited by 65
Parallel Genetic Algorithms: Introduction and Overview of Current Research
Dorigo, M., Maniezzo, V., & Stender, J. (1993) · Dépôt institutionnel de l'Université libre de Bruxelles (Université Libre de Bruxelles) · Cited by 61
Implicit parallelism in genetic algorithms
Bertoni, A., & Dorigo, M. (1993) · Artificial Intelligence · doi:10.1016/0004-3702(93)90071-i · Cited by 61
Multiple sequence alignment by parallel simulated annealing
Ishikawa, M., Toya, T., Hoshida, M., et al. (1993) · Computer applications in the biosciences · doi:10.1093/bioinformatics/9.3.267 · Cited by 61
A Hierarchy of Evolution Programs: An Experimental Study
Michalewicz, Z. (1993) · Evolutionary Computation · doi:10.1162/evco.1993.1.1.51 · Cited by 60
A Two-Dimensional Genetic Algorithm for the Ising Problem.
Anderson, C. A., Jones, K. F., & Ryan, J. K. (1991) · Complex Systems · Cited by 59
An adaptive simulated annealing algorithm for global optimization over continuous variables
Jones, A. E. W., & Forbes, G. W. (1995) · Journal of Global Optimization · doi:10.1007/bf01106604 · Cited by 59
Ensemble approach to simulated annealing
Ruppeiner, G., Pedersen, J. M., & Salamon, P. (1991) · Journal de Physique I · doi:10.1051/jp1:1991146 · Cited by 58
Wong, E. (1991) · Algorithmica · doi:10.1007/bf01759054 · Cited by 58
Problem and Heuristic Space Search Strategies for Job Shop Scheduling
Storer, R. H., Wu, S. D., & Vaccari, R. (1995) · INFORMS journal on computing · doi:10.1287/ijoc.7.4.453 · Cited by 58
The complexity of constraint satisfaction revisited
Mackworth, A. K., & Freuder, E. C. (1993) · Artificial Intelligence · doi:10.1016/0004-3702(93)90170-g · Cited by 56
On the problem of local minima in recurrent neural networks
Bianchini, M., Gori, M., & Maggini, M. (1994) · IEEE Transactions on Neural Networks · doi:10.1109/72.279182 · Cited by 56
Effective neural algorithms for the traveling salesman problem
Xu, X.-S., & TSAI, W. T. (1991) · Neural Networks · doi:10.1016/0893-6080(91)90004-o · Cited by 55
Kulkarni, U. R., & Kiang, M. Y. (1995) · European Journal of Operational Research · doi:10.1016/0377-2217(94)00326-8 · Cited by 54
Genetic algorithms in process planning
Váncza, J., & Márkus, A. (1991) · Computers in Industry · doi:10.1016/0166-3615(91)90031-4 · Cited by 54
CONTINUOUS EVOLUTIONARY PROGRAMMING: ANALYSIS AND EXPERIMENTS
Fogel, G. B., & Fogel, D. B. (1995) · Cybernetics & Systems · doi:10.1080/01969729508927488 · Cited by 54
Scheduling for minimizing total actual flow time by neural networks
Arizono, I., Yamamoto, A., & Ohta, H. (1992) · International Journal of Production Research · doi:10.1080/00207549208942908 · Cited by 54
Accelerating the standard backpropagation method using a genetic approach
Kinnebrock, W. (1994) · Neurocomputing · doi:10.1016/0925-2312(94)90008-6 · Cited by 52
Scheduling with neural networks—the case of the hubble space telescope
Johnston, M., & Adorf, H. M. (1992) · Computers & Operations Research · doi:10.1016/0305-0548(92)90045-7 · Cited by 51
Stochastic annealing for synthesis under uncertainty
Painton, L., & Diwekar, U. M. (1995) · European Journal of Operational Research · doi:10.1016/0377-2217(94)00245-8 · Cited by 50
Terminal assignment in a communications network using genetic algorithms
Abuali, F. N., Schoenefeld, D. A., & Wainwright, R. L. (1994) · doi:10.1145/197530.197559 · Cited by 49
Neural network system for forecasting method selection
Chu, C., & Widjaja, D. (1994) · Decision Support Systems · doi:10.1016/0167-9236(94)90071-x · Cited by 48
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.