Annals of Operations Research

, Volume 63, Issue 5, pp 511–623 | Cite as

Metaheuristics: A bibliography

  • Ibrahim H. Osman
  • Gilbert Laporte
Bibliography

Abstract

Metaheuristics are the most exciting development in approximate optimization techniques of the last two decades. They have had widespread successes in attacking a variety of difficult combinatorial optimization problems that arise in many practical areas. This bibliography provides a classification of a comprehensive list of 1380 references on the theory and application of metaheuristics. Metaheuristics include but are not limited to constraint logic programming; greedy random adaptive search procedures; natural evolutionary computation; neural networks; non-monotonic search strategies; space-search methods; simulated annealing; tabu search; threshold algorithms and their hybrids. References are presented in alphabetical order under a number of subheadings.

Keywords

Artificial intelligence bibliography combinatorial optimization constraint logic programming evolutionary computation genetic algorithms greedy random adaptive search procedure heuristics hybrids local search metaheuristics neural networks non-monotonic search strategies problem-space method simulated annealing tabu search threshold algorithms 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. E.H.L. Aarts, E. de Bout, E. Habers and P.J.M. van Laarhoven, Parallel implementations of the statistical cooling algorithm, Integration 4 (1986) 209.Google Scholar
  2. E.H.L. Aarts, J. Wessels and P.J. Zwietering, The application of neural networks for decision support, in:Proceedings of the First European Congress on Fuzzy and Intelligent Technologies, ed. H.J. Zimmerman, (Springer, Aachen, 1993) p. 379.Google Scholar
  3. E.H.L. Aarts, J.H.M. Korst and P.J. Zwietering, Deterministic and randomized local search, in:Mathematical Perspectives of Neural Networks, ed. P. Smolensky, M. Mozer and D.E. Rumelhart (1995), forthcoming.Google Scholar
  4. E.H.L. Aarts, J.H.M. Korst and P.J.M. van Laarhoven, A quantitative analysis of the simulated annealing algorithm. A case study for the travelling salesman problem, Journal of Statistical Physics 50 (1988) 187.CrossRefGoogle Scholar
  5. E.H.L. Aarts, P.J.M. van Laarhoven, J.K. Lenstra and N.L.J. Ulder, A computational study of local search algorithm for job shop scheduling, ORSA Journal on Computing 6 (1994) 108.Google Scholar
  6. E.H.L. Aarts and H.P. Stehouwer, Neural networks and the travelling salesman problem, Working paper, Eindhoven University of Technology, The Netherlands (1993).Google Scholar
  7. E.H.L. Aarts and J.H.M. Korst,Simulated Annealing and Boltzmann Machines. A Stochastic Approach to Combinatorial Optimization and Neural Computing (Wiley, Chichester, 1989a).Google Scholar
  8. E.H.L. Aarts and J.H.M. Korst, Boltzmann machines for travelling salesman problems, European Journal of Operational Research 39 (1989b) 79.CrossRefGoogle Scholar
  9. E.H.L. Aarts and J.H.M. Korst, Boltzmann machines as a model for parallel annealing, Algorithmica 6 (1991) 437.CrossRefGoogle Scholar
  10. E.H.L. Aarts and J.K. Lenstra,Local Search in Combinatorial Optimization (Wiley, Chichester, 1996), forthcoming.Google Scholar
  11. E.H.L. Aarts and P.J.M. van Laarhoven, Local search in coding theory, Discrete Mathematics 106 (1992) 11.CrossRefGoogle Scholar
  12. H. Abada and E. El-Darzi, A metaheuristic for the timetabling problem, in:Metaheuristics. Theory and Applications, ed. I.H. Osman and J.P. Kelly (Kluwer, Boston, 1996).Google Scholar
  13. W.A.T.W. Abdullah, Seeking global minima, Journal of Computational Physics 110 (1994) 320.CrossRefGoogle Scholar
  14. S. Abe, J. Kawakami and K. Hirasawa, Solving inequality constrained combinatorial optimization problems by the Hopfield neural networks, Neural Networks 5 (1992) 663.Google Scholar
  15. J. Abela, D.A. Abramson, M. Krishnamoorthy, A. Desilva and G. Mills, Computing optimal schedules for landing craft, Working paper, School of Computing and Information Technology, Griffith University, Australia (1993).Google Scholar
  16. D.A. Abramson, A very high-speed architecture for simulated annealing, Computer 25 (1992) 27.CrossRefGoogle Scholar
  17. D.A. Abramson, Constructing school timetables using simulated annealing. Sequential and parallel algorithms, Management Science 37 (1991) 98.Google Scholar
  18. D.A. Abramson, G. Mills and S. Perkins, Parallelisation of a genetic algorithm for the computation of efficient train schedules, Working paper, School of Computing and Information Technology, Griffith University, Australia (1993).Google Scholar
  19. D.A. Abramson, H. Dang and M. Krishnamoorthy, A comparison of two methods for solving 0–1 integer programs using a general purpose simulated annealing algorithm, Annals of Operations Research 63 (1996) 129.Google Scholar
  20. D.A. Abramson and J. Abela, A parallel genetic algorithm for solving the school timetabling problem, Working paper, School of Computing and Information Technology, Griffith University, Australia (1992).Google Scholar
  21. F.N. Abuali, D.A. Schoenefeld and R.L. Wainwright, Designing telecommunications networks using genetic algorithms and probabilistic minimum spanning trees, in:Proceedings of the 1994 ACM Symposium on Applied Computing, SAC 1994 (ACM Press, Phoenix 1994) p. 242.Google Scholar
  22. F. Abuali, D.A. Schoenefeld and R.L Wainwright, Terminal assignment in a communications network using genetic algorithm, in:Proceedings of the 22nd Annual Computer Science Conference (ACM Press, Phoenix 1994) p. 74.Google Scholar
  23. B. Adensodiaz, Restricted neighborhood in the tabu search for the flowshop problem, European Journal of Operational Research 62 (1992) 27.CrossRefGoogle Scholar
  24. I. Ahmad and M.K. Dhodhi, Task assignment using a problem-space genetic algorithm, Concurrency Practice and Experience 7 (1995a) 411.Google Scholar
  25. I. Ahmad and M.K. Dhodhi, On them-way graph partitioning problem, Computer Journal 38 (1995b) 237.Google Scholar
  26. R.H. Ahmadi and C.S. Tang, An operation partitioning problem for automated assembly system design, Operations Research 39 (1991) 824.Google Scholar
  27. S.V.B. Aiyer, M. Niranjan and F. Fallside, A theoretical investigation into the performance of the Hopfield model, IEEE Transactions on Neural Networks 1 (1990) 204.CrossRefGoogle Scholar
  28. A.N. Aizawa and B.W. Wah, A sequential sampling procedure for genetic algorithms, Computers and Mathematics with Applications 27 (1994) 77.CrossRefMathSciNetGoogle Scholar
  29. A.S. Al-Mahmeed, Tabu search, combination and integration, in:Metaheuristics. Theory and Applications, ed. I.H. Osman and J.P. Kelly (Kluwer, Boston, 1996).Google Scholar
  30. K.S. Al-Sultan, A tabu search approach to the clustering problem, Pattern Recognition 28 (1995) 1443.CrossRefGoogle Scholar
  31. K.S. Al-Sultan and S.Z. Selim, A global algorithm for the fuzzy clustering problem, Pattern Recognition 26 (1993) 1357.CrossRefGoogle Scholar
  32. A.S. Alfa, M.Y. Chen and S.S. Heragu, Integrating the grouping and layout problems in cellular manufacturing systems, Computers and Industrial Engineering 23 (1992) 55.CrossRefGoogle Scholar
  33. A.S. Alfa, S.S. Heragu and M.Y. Chen, A 3-opt based simulated annealing algorithm for vehicle routing problems, Computers and Industrial Engineering 21 (1991) 635.CrossRefGoogle Scholar
  34. J.R.A. Allwright and D.B. Carpenter, A distributed implementation of simulated annealing for the travelling salesman problem, Parallel Computing 10 (1989) 335.CrossRefGoogle Scholar
  35. A.E.A. Almaini, J.F. Miller, P. Thomson and S. Billina, State assignment of finite state machines using a genetic algorithm, IEE Proceedings — Computers and Digital Techniques 142 (1995) 279.CrossRefGoogle Scholar
  36. C.J. Alpert and A.B. Kahng, Recent directions in netlist partitioning. A survey, Integration — The VLSI Journal 19 (1995) 1.Google Scholar
  37. I. Althofer and K.U. Koschnick, On the convergence of threshold accepting, Applied Mathematics and Optimization 24 (1991) 183.CrossRefGoogle Scholar
  38. R. Alvarez-Valdes, G. Martin and J.M. Tamarit, Constructive and tabu search algorithms for the school timetabling problem, Working paper, Department D'Estadistica Investigacio Operativa, Faculdad de Matematicas, Universidad de Valencia, Spain (1993).Google Scholar
  39. E. Amaldi, E. Mayoraz and D. de Werra, A review of combinatorial problems arising in feedforward neural network design, Discrete Applied Mathematics 52 (1994) 111.CrossRefGoogle Scholar
  40. J.K. Amaral, Tumer and J. Ghosh, Designing genetic algorithms for the State Assignment Problem, IEEE Transactions on Systems, Man and Cybernetics 25 (1995) 68.Google Scholar
  41. S. Amari, A.R. Barron, E. Bienenstock, S. Geman, L. Breiman, J.L. McClelland, B.D. Ripley, R. Tibshirani, B. Cheng and D.M. Titterington, A review from a statistical perspective. Comments and rejoinders, Statistical Science 9 (1994) 31.Google Scholar
  42. A. Amberg, W. Domschke and S. Voß, Capacitated minimum spanning trees. Algorithms using intelligent search, Working Paper, Institut für Betriebswirtschaftlehre, Fachgebiet Operations Research, Technische Hochschule Darmstadt, Germany (1995).Google Scholar
  43. S. Amellal and B. Kaminska, Functional synthesis of digital-systems with TASS, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 13 (1994) 537.CrossRefGoogle Scholar
  44. M.M. Amini and M. Racer, A rigorous computational comparison of alternative solution methods for the generalized assignment problem, Management Science 40 (1994) 868.Google Scholar
  45. C.A. Anderson, K. Fraughnaugh, M. Parker and J. Ryan, Path assignment for call routing: An application of tabu search, Annals of Operations Research 41 (1993) 301.CrossRefGoogle Scholar
  46. C.A. Anderson, K.F. Jones and J. Ryan, A two-dimensional genetic algorithm for the Ising problem, Complex Systems 5 (1991) 327.Google Scholar
  47. E.J. Anderson and M.C. Ferris, Genetic algorithms for combinatorial optimization. The assembly line balancing problem, ORSA Journal on Computing 6 (1994) 161.Google Scholar
  48. I.P. Androulakis and V. Venkatasubramanian, A genetic algorithmic framework for process design and optimization, Computers and Chemical Engineering 15 (1991) 217.CrossRefGoogle Scholar
  49. Y.P. Aneja and M. Parlar, Algorithms for Weber facility location in the presence of forbidden regions and/or barriers to travel, Transportation Science 28 (1994) 70.Google Scholar
  50. B. Angeniol, G. de la Crois-Vanbois and J. le Texier, Self-organizing feature maps and the TSP, Neural Networks 1 (1988) 289.CrossRefGoogle Scholar
  51. B. Angeniol, The neural networks market. A commercial survey, in:Artificial Neural Networks, ed. T. Kohonen, K. Makisara, O. Simula and J. Kangas (North-Holland, Amsterdam, 1991).Google Scholar
  52. S. Anily and A. Federgruen, Simulated annealing methods with general acceptance probabilities, Journal of Applied Probability 24 (1987) 657.Google Scholar
  53. N. Ansari, R. Sarasa and G.S. Wang, An efficient annealing algorithm for global optimization in Boltzmann machines, Applied Intelligence 3 (1993) 177.CrossRefGoogle Scholar
  54. P. Antognetti and V. Milutinovic,Neural Networks. Concepts, Applications, and Implementations (Prentice-Hall, Englewood Cliffs, 1991).Google Scholar
  55. G. Anzellotti, R. Battiti, I. Lazzizzera, G. Soncini, A. Sartori, G. Tecchiolli and P. Lee, TOTEM. A highly parallel CHIP for triggering applications with inductive learning based on the reactive tabu search, International Journal of Modern Physics C — Physics and Computers 6 (1995) 555.CrossRefGoogle Scholar
  56. J. Arabas, A genetic approach to the Hopfield neural-network in the optimization problems, Bulletin of the Polish Academy of Sciences — Chemistry 42 (1994) 59.Google Scholar
  57. S. Areibi and A. Vannelli, Circuit partitioning using a tabu search approach, IEEE International Symposium on Circuits and Systems 3 (1993) 1643.Google Scholar
  58. I. Arizono, A. Yamamoto and H. Ohta, Scheduling for minimizing total actual flow time by neural networks, International Journal of Production Research 30 (1992) 503.Google Scholar
  59. J.S. Arora, M.W. Huang and C.C. Hsieh, Methods for optimization of nonlinear problems with discrete variables. A review, Structural Optimization 8 (1994) 69.CrossRefGoogle Scholar
  60. S. Arunkumar and T. Chockalingham, Genetic search algorithms and their randomized operators, Computers and Mathematics with Applications 25 (1993) 91.CrossRefGoogle Scholar
  61. J.B. Atkinson, A greedy look-ahead heuristic for combinatorial optimization. Application to vehicle scheduling with time, Journal of the Operational Research Society 45 (1994) 673.Google Scholar
  62. G. Ausiello and M. Protasi, Local search, reducibility and approximability of NP-optimization problems, Information Processing Letters 54 (1995) 73.CrossRefGoogle Scholar
  63. R. Azencott, Simulated annealing, Asterisque 161 (1988) 223.Google Scholar
  64. R. Azencott, Simulated Annealing. Parallelization Techniques (Wiley, Chichester, 1992).Google Scholar
  65. G.P. Babu and M.N. Murty, A near optimal initial seed value selection inK-means algorithm using a genetic algorithm, Pattern Recognition Letters 14 (1993) 763.CrossRefGoogle Scholar
  66. G.P. Babu and M.N. Murty, Simulated annealing for selecting optimal initial seeds in thek-means algorithm, Indian Journal of Pure and Applied Mathematics 25 (1994) 85.Google Scholar
  67. F.Q. Bac and V.I. Perov, New evolutionary genetic algorithms for NP-complete combinatorial optimization problems, Biological Cybernetics 69 (1993) 229.CrossRefGoogle Scholar
  68. T. Bäck, F. Hoffmeister and H.-P. Schwefel, A survey of evolution strategies, in:Proceedings of the 4th International Conference on Genetic Algorithms, ed. R.K. Belew and L.B. Booker (Morgan Kaufmann, San Mateo, 1991) p. 2.Google Scholar
  69. T. Bäck, The interaction of mutation rate, selection and self-adaptation within a genetic algorithm, in:Parallel Problem Solving from Nature, PPSN II Proceedings, ed. R. Männer and B. Manderick (North-Holland, Amsterdam, 1992).Google Scholar
  70. T. Bäck and F. Hoffmeister, Basic aspects of evolution strategies, Statistics and Computing 4 (1994) 65.CrossRefGoogle Scholar
  71. T. Bäck and H.-P. Schwefel, An overview of evolutionary algorithms for parameter optimization, Evolutionary Computation 1 (1993) 1.Google Scholar
  72. A. Bahrami and C.H. Dagli, Hybrid intelligent packing system (HIPS) through integration of artificial neural networks, artificial-intelligence, and mathematical-programming, Applied Intelligence 4 (1994) 321.CrossRefGoogle Scholar
  73. F. Baiardi and S. Orlando, Strategies for a massively parallel implementation of simulated annealing, in:Lecture Notes in Computer Science 366 (1989) p. 273.Google Scholar
  74. J. Balakrishnan and P.D. Jog, Manufacturing cell-formation using similarity coefficients and a parallel genetic TSP algorithm. Formulation and comparison, Mathematical and Computer Modelling 21 (1995) 61.CrossRefGoogle Scholar
  75. P.V. Balakrishnan, M.C. Cooper, V.S. Jacob and P.A. Lewis, A study of the classification capabilities of neural networks using unsupervised learning. A comparison withK-means clustering, Psychometrika 59 (1994) 509.Google Scholar
  76. P.V. Balakrishnan and V.S. Jacob, Genetic algorithms for product design, Working paper WP93-9-015, College of Business, The Ohio State University (1993).Google Scholar
  77. S. Baluja, Structure and performance of fine-grain parallelism in genetic search, in:Proceedings of the 5th International Conference on Genetic Algorithms, ed. S. Forrest (Morgan Kaufmann, San Mateo, 1993) p. 155.Google Scholar
  78. S.H. Bang, O.T.C. Chen, J.C.F. Chang and B.J. Sheu, Paralleled hardware annealing in multilevel Hopfield neural networks for optimal-solutions, IEEE Transactions on Circuits and Systems II — Analog and Digital Signal Processing 42 (1995) 46.CrossRefGoogle Scholar
  79. W. Banzhaf and F.H. Eckman,Evolution and Biocomputation. Computational Models of Evolution, Lecture Notes in Computer Science 899 (Springer, Berlin, 1995).Google Scholar
  80. V.C. Barbosa, A distributed implementation of simulated annealing, Journal of Parallel and Distributed Computing 6 (1989) 411.CrossRefGoogle Scholar
  81. V.C. Barbosa and M.C.S. Boeres, An OCCAM-based evaluation of a parallel version of simulated annealing, Microprocessing and Microprogramming 30 (1990) 85.CrossRefGoogle Scholar
  82. J.F. Bard, K. Venkatraman and T.A. Feo, Single machine scheduling with flow time and earliness penalties, Journal of Global Optimization 3 (1993) 289.CrossRefGoogle Scholar
  83. J.F. Bard and T.A. Feo, An algorithm for the manufacturing equipment selection problem, IIE Transactions 23 (1991) 83.Google Scholar
  84. J.F. Bard and T.A. Feo, Operations sequencing in discrete parts manufacturing, Management Science 35 (1989) 249.Google Scholar
  85. J.W. Barnes, M. Laguna and F. Glover, An overview of tabu search approaches to production scheduling problems, in:Intelligent Scheduling Systems, ed. D.E. Brown and W.T. Scherer, Operations Research/Computer Science Interfaces 3 (Kluwer, Boston, 1995).Google Scholar
  86. J.W. Barnes and J.B. Chambers, Solving the job-shop scheduling problem with tabu search, IIE Transactions 27 (1995) 257.Google Scholar
  87. J.W. Barnes and M. Laguna, A tabu search experience in production scheduling, Annals of Operations Research 41 (1993) 141.CrossRefGoogle Scholar
  88. J.W. Barnes and M. Laguna, Solving the multiple-machine weighted flow time problem using tabu search, IIE Transactions 25 (1993) 121.Google Scholar
  89. B.S. Barr, B.L. Golden, J.P. Kelly, M.G.C. Resende and W.R. Stewart, Designing and reporting on computational experiments with heuristic methods, Journal of Heuristics 1 (1995) 9.Google Scholar
  90. D. Barrios, J.A.P. Ruydiaz, J. Rios and J. Segovia, Conditions for convergence of genetic algorithms through Walsh-series, Computers and Artificial Intelligence 13 (1994) 441.Google Scholar
  91. E.B. Bartlett, A stochastic training algorithm for artificial neural networks, Neurocomputing 6 (1994) 31.CrossRefGoogle Scholar
  92. R. Battiti, Ractive search. Toward self-tuning heuristics, in:Modern Heuristic Search Methods, ed. V.J. Rayward-Smith, I.H. Osman, C.R. Reeves and G.D. Smith (Wiley, Chichester, 1996).Google Scholar
  93. R. Battiti and G. Tecchiolli, The continuous reactive tabu search. Blending combinatorial optimization and stochastic search for global optimization, Annals of Operations Research 63 (1996) 153.Google Scholar
  94. R. Battiti, G. Tecchiolli and P. Tonella, Vector quantization with the reactive tabu search, in:Metaheuristics. Theory and Applications, ed. I.H. Osman and J.P. Kelly (Kluwer, Boston, 1996).Google Scholar
  95. R. Battiti and G. Tecchiolli, Local search with memory. Benchmarking RTS, OR Spektrum 17 (1995a) 67.CrossRefGoogle Scholar
  96. R. Battiti and G. Tecchiolli, Training neural nets with the reactive tabu, IEEE Transactions on Neural Networks 6 (1995b) 1185.CrossRefGoogle Scholar
  97. R. Battiti and G. Tecchiolli, The reactive tabu, ORSA Journal on Computing 6 (1994) 126.Google Scholar
  98. R. Battiti and G. Tecchiolli, Parallel biased search for combinatorial optimization. Genetic algorithms and tabu, Microprocessors and Microsystems 16 (1992) 351.CrossRefGoogle Scholar
  99. D.L. Battle and M.D. Vose, Isomorphisms of genetic algorithms, Artificial Intelligence 60 (1993) 155.CrossRefGoogle Scholar
  100. R.J. Bauer,Genetic Algorithms and Investment Strategies (Wiley, Chichester, 1994).Google Scholar
  101. E.B. Baum, Towards practical neural computation for combinatorial optimization problems, in:Neural Networks for Computing, AIP Conference Proceedings, ed. J.S. Denker (Snowbird, UT, 1986).Google Scholar
  102. J.C. Bean, Genetic algorithms and random keys for sequencing and optimization, ORSA Journal on Computing 6 (1994) 154.Google Scholar
  103. D. Beasley, D.R. Bull and R.R. Martin, An overview of genetic algorithms 1. Fundamentals, University Computing 15 (1993a) 58.Google Scholar
  104. D. Beasley, D.R. Bull and R.R. Martin, An overview of genetic algorithms 2. Research topics, University Computing 15 (1993b) 170.Google Scholar
  105. J.E. Beasley, OR-library. Distributed test problems by electronic mail, Journal of the Operational Research Society 41 (1990) 1069 (ftp site address: mscmga.ms.ic.ac.uk).Google Scholar
  106. J.E. Beasley and F. Goffinet, A delaunay triangulation-based heuristic for the Euclidean Steiner problem, Networks 24 (1994) 215.Google Scholar
  107. J.E. Beasley and P.C. Chu, A genetic algorithm for the set covering problem, Working Paper, The Management School, Imperial College, London (1994).Google Scholar
  108. R.K. Belew and L.B. Booker,Proceedings of the Fourth International Conference on Genetic Algorithms (Morgan Kaufmann, San Mateo, 1991).Google Scholar
  109. C.J.P. Bélisle, Convergence theorems for a class of simulated annealing algorithms on R(D), Journal of Applied Probability 29 (1992) 885.Google Scholar
  110. D.A. Bell, F.J. McErlean, P.M. Stewart and S.I. McClean, Application of simulated annealing to clustering tuples in databases, Journal of the American Society for Information Science 41 (1990) 98.CrossRefGoogle Scholar
  111. H.F. Beltran and D. Skorin-Kapov, On minimum-cost isolated failure immune networks, Telecommunication Systems 3 (1994) 183.CrossRefGoogle Scholar
  112. M. Benaim and L. Tomasini, Competitive and self-organizing algorithms based on the minimization of an information criterion, in:Artificial Neural Networks, ed. T. Kohonen, K. Makisara, O. Simula and J. Kangas (North-Holland, Amsterdam, 1991).Google Scholar
  113. D. Benarieh and O. Maimon, Annealing method for PCB assembly scheduling on 2 sequential-machines, International Journal of Computer Integrated Manufacturing 5 (1992) 361.Google Scholar
  114. M. Bengtsson and Roivainen, Using the Potts-Glass for solving the clustering problem, International Journal of Neural Systems 6 (1995) 119.CrossRefPubMedGoogle Scholar
  115. W.A. Bennage and A.K. Dhingra, Single and multi-objective structural optimization in discrete-continuous variables using simulated annealing, International Journal for Numerical Methods in Engineering 38 (1995) 2753.CrossRefGoogle Scholar
  116. M.S.T. Benten and S.M. Sait, Genetic scheduling of task graphs, International Journal of Electronics 77 (1994) 401.Google Scholar
  117. P.J. Bentley, The evolution of solid object designs using genetic algorithms, in:Modern Heuristic Search Methods, ed. V.J. Rayward-Smith, I.H. Osman, C.R. Reeves and G.D. Smith (Wiley, Chichester, 1996).Google Scholar
  118. A. Bertoni and M. Dorigo, Implicit parallelism in genetic algorithms, Artificial Intelligence 61 (1993) 307.CrossRefGoogle Scholar
  119. D.J. Bertsimas and J. Tsitsiklis, Simulated annealing, Statistical Science 8 (1993) 10.Google Scholar
  120. D.A. Beyer and R.G. Ogier, Tabu learning. A neural network search method for solving nonconvex optimization problems, in:Proceedings of the International Conference on Neural Networks (IEEE Computer Society Press, Los Alamitos, California, 1991) p. 953.Google Scholar
  121. D. Bhandari and S.K. Pal, Directed mutation in genetic algorithms, Information Sciences 79 (1994) 251.CrossRefGoogle Scholar
  122. S. Bhide, N. John and M.R. Kabuka, A Boolean neural network approach for the travelling salesman problem, IEEE Transactions on Computers 42 (1993) 1271.CrossRefGoogle Scholar
  123. M. Bianchini, M. Gori and M. Maggini, On the problem of local minima in recurrent neural networks, IEEE Transactions on Neural Networks 5 (1994) 167.CrossRefGoogle Scholar
  124. F. Bicking, C. Fonteix, J.P. Corriou and I. Marc, Global optimization by artificial life. A new technique using genetic population evolution, RAIRO — Operations Research 28 (1994) 23.Google Scholar
  125. J.E. Biegel and J.J. Davern, Genetic algorithms and job shop scheduling, Computers and Industrial Engineering 19 (1990) 81.CrossRefGoogle Scholar
  126. C. Bierwirth, A generalized permutation approach to job shop scheduling with genetic algorithms, OR Spektrum 17 (1995) 87.CrossRefGoogle Scholar
  127. J. Biethahn and V. Nissen,Evolutionary Algorithms in Management Applications (Springer, Berlin, 1995), forthcoming.Google Scholar
  128. G.L. Bilbro and W.E. Snyder, Optimization of functions with many minima, IEEE Transactions on Systems, Man and Cybernetics 21 (1991) 840.Google Scholar
  129. G. Bilchev and I.C. Parmee, The ant colony metaphor for searching continuous design spaces,Lecture Notes in Computer Science 993 (1995), forthcoming.Google Scholar
  130. A. Bizzarri, Convergence properties of a modified Hopfield—Tank model, Biological Cybernetics 64 (1991) 293.CrossRefPubMedMathSciNetGoogle Scholar
  131. J.A. Bland, A derivative-free exploratory tool for function minimisation based on tabu search, Advances in Engineering Software 19 (1994) 91.CrossRefGoogle Scholar
  132. J.A. Bland and G.P. Dawson, Large-scale layout of facilities using a heuristic hybrid algorithm, Applied Mathematical Modelling 18 (1994) 500.CrossRefGoogle Scholar
  133. J.A. Bland and G.P. Dawson, Tabu search and design optimization, Computer-Aided Design 23 (1991) 195.CrossRefGoogle Scholar
  134. J.J. Bland, Discrete-variable optimal structural design using tabu search, Structural Optimization 10 (1995) 87.CrossRefGoogle Scholar
  135. J.L. Blanton and R.L. Wainwright, Multiple vehicle routing with time windows using genetic algorithms, in:Proceedings of the Fifth International Conference on Genetic Algorithms, ed. S. Forrest (Morgan Kaufmann, San Mateo, 1993) p. 452.Google Scholar
  136. J. Blazewicz and R. Walkowiak, A local search approach for 2-dimensional irregular cutting, OR Spektrum 17 (1995) 93.CrossRefGoogle Scholar
  137. J. Blazewicz, P. Hawryluk and R. Walkowiak, Using a tabu search approach for solving the two-dimensional irregular cutting problem, Annals of Operations Research 41 (1993) 313.CrossRefGoogle Scholar
  138. F.F. Boctor, A linear formulation of the machine-part cell-formation problem, International Journal of Production Research 29 (1991) 343.Google Scholar
  139. K.D. Boese and A.B. Kahng, Best-so-far vs where-you-are. Implications for optimal finite-time annealing, Systems and Control Letters 22 (1994) 71.CrossRefMathSciNetGoogle Scholar
  140. N. Boissin and J.-L. Lutton, A parallel simulated annealing algorithm, Parallel Computing 19 (1993) 859.CrossRefMathSciNetGoogle Scholar
  141. E. Bonomi and J.-L. Lutton, The asymptotic behaviour of the quadratic sum assignment problem. A statistical mechanics approach, European Journal of Operational Research 26 (1986) 295.CrossRefGoogle Scholar
  142. E. Bonomi and J.-L. Lutton, TheN-city travelling salesman problem and the metropolis algorithm, SIAM Review 26 (1984) 551.CrossRefGoogle Scholar
  143. N. Borin, P.W. Farris and J.R. Freeland, A model for determining retail product category assortment and shelf space allocation, Decision Sciences 25 (1994) 359.Google Scholar
  144. N. Borin and P. Farris, A sensitivity analysis of retailer shelf management models, Journal of Retailing 71 (1995) 153.CrossRefGoogle Scholar
  145. J. Bos, Zoning in forest management. A quadratic assignment problem solved by simulated annealing, Journal of Environmental Management 37 (1993) 127.CrossRefGoogle Scholar
  146. S. Bose and A.R. Saha, Implementation of a heuristic method for standard cell placement, International Journal of Electronics 74 (1993) 281.Google Scholar
  147. J. Bovet, C. Constantin and D. de Werra, A convoy scheduling problem, Discrete Applied Mathematics 30 (1991) 1.CrossRefGoogle Scholar
  148. P. Brandimarte, Neighborhood search-based optimization algorithms for production scheduling. A survey, Computer Integrated Manufacturing Systems 5 (1992) 167.CrossRefGoogle Scholar
  149. P. Brandimarte, Routing and scheduling in a flexible job shop by tabu search, Annals of Operations Research 41 (1993) 157.CrossRefGoogle Scholar
  150. P. Brandimarte and M. Calderini, A hierarchical bicriterion approach to integrated process plan selection and job-shop scheduling, International Journal of Production Research 33 (1995) 161.Google Scholar
  151. H. Brasel, T. Tautenhahn and F. Werner, Constructive heuristic algorithms for the open shop problem, Computing 51 (1993) 95.Google Scholar
  152. H. Braun, On solving travelling salesman problems by genetic algorithms,Lecture Notes in Computer science 496 (1991) 129.Google Scholar
  153. C. Brind, C. Muller and P. Prosser, Stochastic techniques for resource management, BT Technology Journal 13 (1995) 55.Google Scholar
  154. S.P. Brooks, A hybrid optimization algorithm, Applied Statistics — Journal of the Royal Statistical Society Series C44 (1995) 530.Google Scholar
  155. S.P. Brooks and B.J.T. Morgan, Optimization using simulated annealing, Statistician 44 (1995) 241.Google Scholar
  156. S.P. Brooks and B.J.T. Morgan, Automatic starting point selection for function optimization, Statistics and Computing 4 (1994) 173.CrossRefGoogle Scholar
  157. D.E. Brown and C.L. Huntley, A practical application of simulated annealing to clustering, Pattern Recognition 25 (1992) 401.CrossRefGoogle Scholar
  158. J. Bruck and J. Goodman, On the power of neural networks for solving hard problems, Journal of Complexity 6 (1990) 127.CrossRefGoogle Scholar
  159. P. Brucker and J. Hurink, Complex sequencing problems and local search heuristics, in:Metaheuristics. Theory and Applications, ed. I.H. Osman and J.P. Kelly (Kluwer, Boston, 1996).Google Scholar
  160. R. Brunelli, Training neural nets through stochastic minimization, Neural Networks 7 (1994) 1405.CrossRefGoogle Scholar
  161. R. Brunelli, Optimal histogram partitioning using a simulated annealing technique, Pattern Recognition Letters 13 (1992) 581.CrossRefGoogle Scholar
  162. M.J. Brusco and L.W. Jacobs, Cost-analysis of alternative formulations for personnel scheduling in continuously operating organizations, European Journal of Operational Research 86 (1995) 249.CrossRefGoogle Scholar
  163. M.J. Brusco and L.W. Jacobs, A simulated annealing approach to the cyclic staff-scheduling problem, Naval Research Logistics 40 (1993a) 69.Google Scholar
  164. M.J. Brusco and L.W. Jacobs, A simulated annealing approach to the solution of flexible labor scheduling problems, Journal of the Operational Research Society 44 (1993b) 1191.Google Scholar
  165. M.J. Brusco, L.W. Jacobs, R.J. Bongiorno, D.V. Lyons and B.X. Tang, Improving personnel scheduling at airline stations, Operations Research 43 (1995) 741.Google Scholar
  166. B.P. Buckles and F.E. Petry,Genetic Algorithms (IEEE Computer Society Press, Los Alamitos, California, 1992).Google Scholar
  167. R.S. Bucy and R.S. Diesposti, Decision tree design by simulated annealing, RAIRO — Mathematical Modelling and Numerical Analysis 27 (1993) 515.Google Scholar
  168. J. Buhman and H. Kuhnel, Complexity optimized data clustering by competitive neural networks, Neural Computation 5 (1993) 75.Google Scholar
  169. T. Bultan and C. Aykanat, Circuit partitioning using mean-field annealing, Neurocomputing 8 (1995) 171.CrossRefGoogle Scholar
  170. R.E. Burkard and E. Cela, Heuristics for biquadratic assignment problems and their computational comparison, European Journal of Operational Research 83 (1995) 283.CrossRefMathSciNetGoogle Scholar
  171. E. Burke, D. Elliman and R. Weare, Specialised recombinative operators for timetabling problems,Lecture Notes in Computer Science 993 (1995), forthcoming.Google Scholar
  172. L.I. Burke, A neural design for solution of the maximal independent set problem, European Journal of Operational Research 62 (1992) 186.CrossRefGoogle Scholar
  173. L.I. Burke and J.P. Ignizio, Neural networks and operations-research. An overview, Computers and Operations Research 19 (1992) 179.CrossRefGoogle Scholar
  174. A. Burns, N. Hayes and M.F. Richardson, Generating feasible cyclic schedules, Control Engineering Practice 3 (1995) 151.CrossRefGoogle Scholar
  175. J. Cagan, Shape annealing solution to the constrained geometric knapsack problem, Computer-Aided Design 26 (1994) 763.CrossRefGoogle Scholar
  176. J. Cagan and W.J. Mitchell, Optimally directed shape generation by shape annealing, Environment and Planning B — Planning and Design 20 (1993) 5.Google Scholar
  177. A. Cangelosi, D. Parisi and S. Nolfi, Cell-division and migration in a genotype for neural networks, Network-Computation in Neural Systems 5 (1994) 497.CrossRefGoogle Scholar
  178. B.Y Cao and G. Uebe, Solving transportation problems with nonlinear side constraints with tabu search, Computers and Operations Research 22 (1995) 593.CrossRefGoogle Scholar
  179. M.F. Cardoso, R.L. Salcedo and S.F. Deazevedo, Nonequilibrium simulated annealing. A faster approach to combinatorial minimisation, Industrial and Engineering Chemistry Research 33 (1994) 1908.CrossRefGoogle Scholar
  180. S.E. Carlson, R. Shonkwiler and M.E. Ingrim, Comparison of 3 non-derivative optimization methods with a genetic algorithm for component selection, Journal of Engineering Design 5 (1994) 367.Google Scholar
  181. G.A. Carpenter and S. Grossberg, A massively parallel architecture for a self-organizing neural network, Computer Vision, Graphics and Image Processing 37 (1987) 54.CrossRefGoogle Scholar
  182. H.M. Cartwright and B. Jesson, The analysis of waste flow data from multi-unit industrial complexes using genetic algorithms, in:Modern Heuristic Search Methods, ed. V.J. Rayward-Smith, I.H. Osman, C.R. Reeves and G.D. Smith (Wiley, Chichester, 1996).Google Scholar
  183. H.M. Cartwright and R.A. Long, Simultaneous optimization of chemical flowshop sequencing and topology using genetic algorithms, Industrial and Engineering Chemistry Research 32 (1993) 2706.CrossRefGoogle Scholar
  184. A. Casotto, F. Romeo and A. Sangiovanni-Vincentelli, A parallel simulated annealing algorithm for the placement of macro-cells, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 6 (1987) 838.CrossRefGoogle Scholar
  185. D.J. Castelino, S. Hurley and N.M. Stephens, A tabu search algorithm for frequency assignment, Annals of Operations Research 63 (1996) 301.Google Scholar
  186. D.J. Castelino and N.M. Stephens, Tabu thresholding for the frequency assignment problem, in:Metaheuristics. Theory and Applications, ed. I.H. Osman and J.P. Kelly (Kluwer, Boston, 1996).Google Scholar
  187. O. Catoni, Exponential triangular cooling schedules for simulated annealing algorithms. A case-study,Lecture Notes in Control and Information Sciences 177 (1992a) p. 74.Google Scholar
  188. O. Catoni, Rough large deviation estimates for simulated annealing. Application to exponential schedules, Annals of Probability 20 (1992b) 1109.Google Scholar
  189. S. Cavalieri, A. Distefano and O. Mirabella, Optimal path determination in a graph by Hopfield neural-networks, Neural Networks 7 (1994) 397.CrossRefGoogle Scholar
  190. V. Cerny, A thermodynamical approach to the travelling salesman problem. An efficient simulated annealing algorithm, Journal of Optimization Theory and Applications 45 (1985) 41.CrossRefGoogle Scholar
  191. M. Cesare, J.C. Santamarina, C.J. Turkstra and E. Vanmarcke, Risk-based bridge management. Optimisation and inspection scheduling, Canadian Journal of Civil Engineering 21 (1994) 897.Google Scholar
  192. P. Chaisemartin, G. Dreyfus, M. Fontet, E. Kouka, P. Loubieres and P. Siarry, Placement and channel routing by simulated annealing. Some recent developments, Computer Systems Science and Engineering 4 (1989) 35.Google Scholar
  193. J. Chakrapani and J. Skorin-Kapov, Connection machine implementation of a tabu search algorithm for the traveling salesman problem, Journal of Computing and Information Technology 1 (1993a) 29.Google Scholar
  194. J. Chakrapani and J. Skorin-Kapov, Massively parallel tabu search for the quadratic assignment problem, Annals of Operations Research 41 (1993b) 327.CrossRefGoogle Scholar
  195. J. Chakrapani and J. Skorin-Kapov, Mapping tasks to processors to minimize communication time in a multiprocessor system, Harriman School for Management Policy, State University of New York, Stony Brook (1993c).Google Scholar
  196. J. Chakrapani and J. Skorin-Kapov, A connectionist approach to the quadratic assignment problem, Computers and Operations Research 19 (1992) 287.CrossRefGoogle Scholar
  197. U.K. Chakravorty and D.G. Dastidar, Using reliability analysis to estimate the number of generations to convergence in genetic algorithms, Information Processing Letters 46 (1993) 199.CrossRefGoogle Scholar
  198. R.D. Chamberlain, M.N. Edelman, M.A. Franklin and E.E. Witte, Simulated annealing on a multiprocessor, in:Proceedings of the International Conference on Computer Design (1988) p. 540.Google Scholar
  199. M. Chams, A. Hertz and D. de Werra, Some experiments with simulated annealing for colouring graphs, European Journal of Operational Research 32 (1987) 260.CrossRefGoogle Scholar
  200. K.C. Chan and H. Tansri, A study of genetic crossover operations on the facilities layout problem, Computers and Industrial Engineering 26 (1994) 537.CrossRefGoogle Scholar
  201. W.T. Chan, T.F. Fwa and C.Y. Tan, Road-maintenance planning using genetic algorithms 1. Formulation, Journal of Transportation Engineering — ASCE 120 (1994) 693.Google Scholar
  202. R. Chandrasekharam, S. Subramanian and S. Chaudhury, Genetic algorithms for node partitioning problem and applications in VLSI design, IEEE Proceedings — E: Computers and Digital Techniques 140 (1993) 255.Google Scholar
  203. R. Chandrasekharam, V.V. Vinod and S. Subramanian, Genetic algorithm for embedding a complete graph in a hypercube with a VLSI application, Microprocessing and Microprogramming 40 (1994a) 537.CrossRefGoogle Scholar
  204. R. Chandrasekharam, V.V. Vinod and S. Subramanian, Genetic algorithm for test scheduling with different objectives, Integration — The VLSI Journal 17 (1994b) 153.CrossRefGoogle Scholar
  205. P.C. Chang and R.C. Hsu, A simulated annealing approach to parallel processor scheduling problems with precedence relations, Journal of the Chinese Institute of Engineers 17 (1994) 485.Google Scholar
  206. R.I. Chang and P.Y. Hsiao, Solving system partitioning problem using a massively parallel bio-computing network, IFIP Transactions A — Computer Science and Technology 51 (1994) 129.Google Scholar
  207. T.M. Chang and Y. Yih, Determining the number of kanbans and lotsizes in a generic kanban system. A simulated annealing approach, International Journal of Production Research 32 (1994) 1991.Google Scholar
  208. C.D. Chapman, K. Saitou and M.J. Jakiela, Genetic algorithms as an approach to configuration and topology design, Journal of Mechanical Design 116 (1994) 1005.Google Scholar
  209. P. Chardaire, Location of concentrators using simulated annealing, in:Applications of Modern Heuristics Methods, ed. V.J. Rayward-Smith (Alfred Waller, Henley-on-Thames, 1995).Google Scholar
  210. P. Chardaire, J.-L. Lutton and A. Sutter, Thermostatistical persistency. A powerful improving concept for simulated annealing algorithms, European Journal of Operational Research 86 (1995) 565.CrossRefGoogle Scholar
  211. P. Chardaire and J.-L. Lutton, Using simulated annealing to solve concentrator location problems in telecommunication networks,Lecture Notes in Economics and Mathematical Systems 396 (1993) p. 176.Google Scholar
  212. I. Charon and O. Hudry, Mixing different components of metaheuristics, in:Metaheuristics. Theory and Applications, ed. I.H. Osman and J.P. Kelly (Kluwer, Boston, 1996).Google Scholar
  213. I. Charon and O. Hudry, The noising method. A new method for combinatorial optimization, Operations Research Letters 14 (1993) 133.CrossRefMathSciNetGoogle Scholar
  214. K.M. Cheh, Goldberg J.B. and R.G. Askin, A note on the effect of neighborhood-structure in simulated annealing, Computers and Operations Research 18 (1991) 537.CrossRefGoogle Scholar
  215. C. Chen, F. Swift and R. Racine, A computer application in apparel manufacturing management, Computers and Industrial Engineering 23 (1992) 439.CrossRefGoogle Scholar
  216. C.L. Chen, N.A. Cotruvo and W. Baek, A simulated annealing solution to the cell-formation problem, International Journal of Production Research 33 (1995) 2601.Google Scholar
  217. C.L. Chen, V.S. Vempati and N. Aljaber, An application of genetic algorithms for flow-shop problems, European Journal of Operational Research 80 (1995) 389.CrossRefGoogle Scholar
  218. H.C. Chen, Machine learning for information-retrieval. Neural networks, symbolic learning and genetic algorithms, Journal of the American Society for Information Science 46 (1995) 194.CrossRefGoogle Scholar
  219. L.N. Chen and K. Aihara, Chaotic simulated annealing by a neural-network model with transient chaos, Neural Networks 8 (1995) 915.CrossRefGoogle Scholar
  220. S.K. Chen, P. Mangiameli and D. West, The comparative ability of self-organizing neural networks to define cluster structure, Omega 23 (1995) 271.CrossRefGoogle Scholar
  221. W.H. Chen and B. Srivastava, Simulated annealing procedures for forming machine cells in group technology, European Journal of Operational Research 75 (1994) 100.CrossRefGoogle Scholar
  222. Y.L. Chen and C.C. Liu, Optimal multiobjective var planning using an interactive satisfying method, IEEE Transactions on Power Systems 10 (1995) 664.CrossRefGoogle Scholar
  223. B. Cheng and D.M. Titterington, Neural networks. A review from a statistical perspective, Statistical Science 9 (1994) 2.Google Scholar
  224. R.W. Cheng, M. Gen and M. Sasaki, Film-copy deliverer problem using genetic algorithms, Computers and Industrial Engineering 29 (1995) 549.CrossRefGoogle Scholar
  225. R.W. Cheng and M. Gen, Crossover on intensive search and traveling salesman problem, Computers and Industrial Engineering 27 (1994) 485.CrossRefGoogle Scholar
  226. M. Chester,Neural Networks. A Tutorial (Prentice-Hall, Englewood Cliffs, 1993).Google Scholar
  227. W.-C. Chiang and R.A. Russell, Simulated annealing metaheuristics for the vehicle routing problem with time windows, Annals of Operations Research 63 (1996) 3.Google Scholar
  228. W.-C. Chiang and P. Kouvelis, Simulated annealing and tabu search approaches to undirectional flowpath design for automated guided vehicle systems, Annals of Operations Research 50 (1994) 115.CrossRefGoogle Scholar
  229. C. Chiu, C.Y. Maa and M.A. Shanblaff, An artificial neural network algorithm for dynamic programming, International Journal of Neural Systems 1 (1990) 211.CrossRefGoogle Scholar
  230. T. Chockalingam and S. Arunkumar, Genetic algorithm-based heuristics for the mapping problem, Computers and Operations Research 22 (1995) 55.CrossRefGoogle Scholar
  231. T. Chockalingam and S. Arunkumar, A randomized heuristic for the mapping problem. The genetic approach, Parallel Computing 18 (1992) 1157.CrossRefGoogle Scholar
  232. C.J. Chou, C.C. Liu and Y.T. Hsiao, A multiobjective optimization approach to loading balance and grounding planning in 3-phase 4-wire distribution-systems, Electric Power Systems Research 31 (1994) 163.CrossRefGoogle Scholar
  233. M. Christoph and K.H. Hoffmann, Scaling behavior of optimal simulated annealing schedules, Journal of Physics A — Mathematical and General 26 (1993) 3267.CrossRefGoogle Scholar
  234. C.H. Chu and D. Widjaja, Neural network system for forecasting method selection, Decision Support Systems 12 (1994) 13.CrossRefGoogle Scholar
  235. P.C. Chu and J.E. Beasley, A genetic algorithm for the generalized assignment problem, Working paper, The Management School, Imperial College, London (1995).Google Scholar
  236. Y.K. Chung and G.W. Fischer, A neural algorithm for finding the shortest flow path for an automated guided vehicle system, IIE Transactions 27 (1995) 773.Google Scholar
  237. CHARME, Bull. CEDIAG, Louveciennes, France (1993).Google Scholar
  238. CHIP, Reference Manual, COSYTEC, Parc Club Orsay-Université, Orsay, France (1993).Google Scholar
  239. A. Cichocki and R. Unbehauen,Neural Networks for Optimization and Signal Processing (Wiley, New York, 1993).Google Scholar
  240. S.E. Cieniawski, J.W. Eheart and S. Ranjithan, Using genetic algorithms to solve a multi-objective groundwater monitoring problem, Water Resources Research 31 (1995) 399.CrossRefGoogle Scholar
  241. G.A. Cleveland and S.F. Smith, Using genetic algorithms to schedule flow shop release, in:Proceedings of the 3rd International Conference on Genetic Algorithms, ed. J.D. Schaffer (Morgan Kaufmann, San Mateo, 1989) p. 160.Google Scholar
  242. J.P. Cohoon, S.U. Hegde, W.N. Martin and D.S. Richards, Distributed genetic algorithms for the floorplan design problem, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 10 (1991) 483.CrossRefGoogle Scholar
  243. J.P. Cohoon, W.N. Martin and D. Richards, A multi-population genetic algorithm for solving theK-partition problem on hyper-cubes, in:Proceedings of the 4th International Conference on Genetic Algorithms (Morgan Kaufmann, San Mateo 1991) p. 244.Google Scholar
  244. N.E. Collins, R.W. Eglese and B.L. Golden, Simulated annealing. An annotated bibliography, American Journal of Mathematical and Management Sciences 9 (1988) 209.Google Scholar
  245. A. Colorni, M. Dorigo, V. Maniezzo and M. Trubian, Ant systems for job shop scheduling, Belgian Journal of Operations Research, Statistics and Computer Science 34 (1994) 39.Google Scholar
  246. A. Colorni, M. Dorigo and V. Maniezzo, An investigation of some properties of an ant algorithm, in:Parallel Problem Solving from Nature, PPSN II Proceedings, ed. R. Männer and B. Manderick (North-Holland, Amsterdam 1992a).Google Scholar
  247. A. Colorni, M. Dorigo and V. Maniezzo, Genetic algorithms: A new approach to the timetable problem, in:Combinatorial Optimization, ed. M. Akgul, W. Horst, W. Hamcher and S. Tuefekci (Springer, Berlin 1992b).Google Scholar
  248. A. Colorni, M. Dorigo and V. Maniezzo, Genetic algorithms and highly constrained problems. The time-table case,Lecture Notes in Computer Science 496 (1991a) p. 55.Google Scholar
  249. A. Colorni, M. Dorigo and V. Maniezzo, Positive feedback as a search strategy, Working paper 91-16, Department of Electronics, Politecnico di Milano, Italy (1991b).Google Scholar
  250. M. Conlon, The controlled random search procedure for function optimization, Communications in Statistics-Simulation and Computation 21 (1992) 919.Google Scholar
  251. D.T. Connolly, General purpose simulated annealing, Journal of the Operational Research Society 43 (1992) 495.Google Scholar
  252. D.T. Connolly, An improved annealing schedule for the QAP, European Journal of Operational Research 46 (1990) 93.CrossRefGoogle Scholar
  253. D.G. Conway and M.A. Venkataramanan, Genetic search and the dynamic facility layout problem, Computers and Operations Research 21 (1994) 955.CrossRefGoogle Scholar
  254. J.S. Cook and B.T. Han, Efficient heuristics for robot acquisition planning for a CIM system, OR Spektrum 17 (1995) 99.CrossRefGoogle Scholar
  255. A.L. Corcoran and R.L. Wainwright, A genetic algorithm for packing in three dimensions, in:Proceedings of the 1992 ACM/SIGAPP Symposium on Applied Computing (ACM Press, Kansas, 1992) p. 1021.Google Scholar
  256. J.-F. Cordeau, M. Gendreau and G. Laporte, A tabu search heuristic for periodic and multidepot vehicle routing problems, Working paper CRT-95-75, Centre de recherche sur les transports, Montreal (1995).Google Scholar
  257. D. Corne and P. Ross, Some combinatorial landscapes on which a genetic algorithm outperforms other stochastic iterative methods,Lecture Notes in Computer Science 993 (1995), forthcoming.Google Scholar
  258. D. Costa, An evolutionary tabu search algorithm and the NHL scheduling problem, INFOR 33 (1995) 161.Google Scholar
  259. D. Costa, A tabu search algorithm for computing an operational timetable, European Journal of Operational Research 76 (1994) 98.CrossRefGoogle Scholar
  260. D. Costa, A. Hertz and O. Dubuis, Embedding of a sequential procedure within an evolutionary algorithm for coloring problems in graphs, Journal of Heuristics 1 (1995) 105.Google Scholar
  261. P. Courrieu, A convergent generator of neural networks, Networks 6 (1993) 835.Google Scholar
  262. I.B. Crabtree, Resource scheduling. Comparing simulated annealing with constraint programming, BT Technology Journal 13 (1995) 121.Google Scholar
  263. G. Craig, M. Krishnamoorthy and M. Palaniswami, Comparison of heuristic algorithms for the degree constrained minimum spanning tree, in:Metaheuristics. Theory and Applications, ed. I.H. Osman and J.P. Kelly (Kluwer, Boston, 1996).Google Scholar
  264. T.G. Crainic, M. Gendreau, P. Soriano and M. Toulouse, A tabu search procedure for multi-commodity location-allocation with balancing requirements, Annals of Operations Research 41 (1993) 359.CrossRefGoogle Scholar
  265. T.G. Crainic, M. Toulouse and M. Gendreau, Parallel asynchronous tabu search for multi-commodity location-allocation with balancing requirements, Annals of Operations Research 63 (1996) 277.Google Scholar
  266. T.G. Crainic, M. Toulouse and M. Gendreau, Synchronous tabu search parallelization strategies for multicomodity location-allocation with balancing requirements, OR Spektrum 17 (1995) 113.CrossRefGoogle Scholar
  267. H. Crockett, Applications of neural networks in finance,Proceedings of the ASIS Annual Meeting 31 (1994) p. 105.Google Scholar
  268. A.E. Croker and V. Dhar, A knowledge representation for constraint satisfaction problems, IEEE Transactions on Knowledge and Data Engineering 5 (1993) 740.CrossRefGoogle Scholar
  269. D. Cubanski and D. Cyganski, Multivariate classification through adaptive Delaunay-based C-0 spline approximation, IEEE Transactions on Pattern Analysis and Machine Intelligence 17 (1995) 403.CrossRefGoogle Scholar
  270. M. Cuppini, A genetic algorithm for channel assignment problems, European Transactions on Telecommunications and Related Technologies 5 (1994) 285.Google Scholar
  271. F. Curatelli, Implementation and evaluation of genetic algorithms for system partitioning, International Journal of Electronics 78 (1995) 435.Google Scholar
  272. S.P. Curram and J. Mingers, Neural networks, decision tree induction and discriminant analysis. An empirical comparison, Journal of the Operational Research Society 45 (1994) 440.Google Scholar
  273. A.J. Cuticchia, J. Arnold and W.E. Timberlake, The use of simulated annealing in chromosome reconstruction experiments based on binary scoring, Genetics 132 (1992) 591.PubMedGoogle Scholar
  274. R. Cuykendall and R. Reese, Scaling the neural TSP algorithm, Biological Cybernetics 60 (1989) 365.CrossRefGoogle Scholar
  275. C.H. Dagli and S. Sittisathanchai, Genetic neuro-scheduler for job shop scheduling, Computers and Industrial Engineering 25 (1993) 267.CrossRefGoogle Scholar
  276. B. Dahlin and O. Sallnas, Harvest scheduling under adjacency constraints. A case study from the Swedish sub-alpine region, Scandinavian Journal of Forest Research 8 (1993) 281.Google Scholar
  277. F. Dammeyer, P. Forst and S. Voß, On the cancellation sequence method of tabu search, ORSA Journal on Computing 3 (1991) 262.Google Scholar
  278. R.L. Daniels and J.B. Mazzola, A tabu search heuristic for the flexible resource flow shop scheduling problem, Annals of Operations Research 41 (1993) 207.CrossRefGoogle Scholar
  279. A. Danjou, M. Grana, F.J. Torrealdea and M.C. Hernandez, Solving satisfiability via Boltzmann machines, IEEE Transactions on Pattern Analysis and Machine Intelligence 15 (1993) 514.CrossRefGoogle Scholar
  280. F. Darema, S. Kirkpatrick and V.A. Norton, Parallel algorithms for chip placement by simulated annealing, IBM Journal of Research and Development 31 (1987) 391.Google Scholar
  281. H. Das, P.T. Cummings and M.D. Levan, Scheduling of serial multiproduct batch processes via simulated annealing, Computers and Chemical Engineering 14 (1990) 1351.CrossRefGoogle Scholar
  282. Y. Davidor, H.-P. Schwefel and R. Männer,Parallel Problem Solving from Nature. PPSN III Proceedings, Lecture Notes in Computer Science 866 (Springer, Berlin, 1994).Google Scholar
  283. L. Davis,Handbook of Genetic Algorithms (Van Nostrand Reinhold, New York, 1991).Google Scholar
  284. L. Davis,Genetic Algorithms and Simulated Annealing (Pitman, London, 1987).Google Scholar
  285. L. Davis and A. Cox, A genetic algorithm for survivable network design, in:Proceedings of the 5th International Conference on Genetic Algorithms, ed. S. Forrest (Morgan Kaufmann, San Mateo, 1993) p. 408.Google Scholar
  286. M. de la Maza and D. Yuret, Dynamic hill climbing, AI Expert 9 (1994) 26.Google Scholar
  287. D. de Werra and A. Hertz, Tabu search techniques. A tutorial and an application to neural networks, OR Spektrum 11 (1989) 131.CrossRefGoogle Scholar
  288. S.G. Deamorim, J.P. Barthelemy and C.C. Ribeiro, Clustering and clique partitioning. Simulated annealing and tabu search approaches, Journal of Classification 9 (1992) 17.MathSciNetGoogle Scholar
  289. G.J. Deboeck,The Trading Edge. Neural, Genetic and Fuzzy Systems for Chaotic and Financial Markets (Wiley, Chichester, 1994).Google Scholar
  290. R. Dechter, Constraint networks, in:Encyclopedia of Artifical Intelligence, Vol. 1, ed. S.C. Shaprio (Wiley, Chichester, 1992).Google Scholar
  291. R. Dechter, Enhancement schemes for constraint satisfaction processing. Backjumping, learning and cutset decomposition, Artificial Intelligence 41 (1990) 273.CrossRefGoogle Scholar
  292. R. Dechter and I. Meiri, Experimental evaluation of preprocessing algorithms for constraint satisfaction problems, Artificial Intelligence 68 (1994) 211.CrossRefGoogle Scholar
  293. R. Dechter and J. Pearl, Network based heuristics for the constraint satisfaction problems, Artifical Intelligence 34 (1988) 1.CrossRefGoogle Scholar
  294. A. Degloria, P. Faraboschi and M. Olivieri, Block placement with a Boltzmann machine, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 13 (1994) 694.CrossRefGoogle Scholar
  295. A. Degloria, P. Faraboschi and M. Olivieri, Clustered Boltzmann machines. Massively parallel architectures for constrained optimization problems, Parallel Computing 19 (1993a) 163.CrossRefGoogle Scholar
  296. A. Degloria, P. Faraboschi and M. Olivieri, Design of a massively parallel SIMD architecture for the Boltzmann machine, Microprocessing and Microprogramming 37 (1993b) 153.CrossRefGoogle Scholar
  297. C. Degroot, D. Wurtz and K.H. Hoffmann, Optimizing complex problems by nature algorithms. Simulated annealing and evolution strategy. A comparative study,Lecture Notes in Computer Science 496 (1991) p. 445.Google Scholar
  298. C. Degroot, D. Wurtz and K.H Hoffmann, Simulated annealing and evolution strategy. A comparison, Helvetica Physica Acta 63 (1990) 843.Google Scholar
  299. K.A. DeJong and W.M. Spears, On the state of evolutionary computation, in:Proceedings of the 5th International Conference on Genetic Algorithms, ed. S. Forrest (Morgan Kaufmann, San Mateo, 1993) p. 618.Google Scholar
  300. K.A. DeJong and W.M. Spears, An analysis of the interacting roles of population-size and crossover in genetic algorithms,Lecture Notes in Computer Science 496 (1991) p. 38.Google Scholar
  301. K.A. DeJong and W.M. Spears, Using genetic algorithms to solve NP-complete problems, in:Proceedings of the 3rd International Conference on Genetic Algorithms (Morgan Kaufmann, San Mateo, 1989) p. 124.Google Scholar
  302. K.A. DeJong, W.M. Spears and D.A. Gordon, Using genetic algorithms for concept learning, in:Genetic Algorithms for Machine Learning, ed. J.J. Grefenstette (Kluwer, Boston, 1994).Google Scholar
  303. A. Dekkers and E.H.L. Aarts, Global optimization and simulated annealing, Mathematical Programming 50 (1991) 367.CrossRefGoogle Scholar
  304. M. Dell'Amico and F. Maffioli, A new tabu search approach to the 0–1 equicut problem, in:Metaheuristics. Theory and Applications, ed. I.H. Osman and J.P. Kelly (Kluwer, Boston, 1996).Google Scholar
  305. M. Dell'Amico, S. Martello and D. Vigo, Heuristic algorithms for single processor scheduling with earliness and flow time penalties, in:Metaheuristics. Theory and Applications, ed. I.H. Osman and J.P. Kelly (Kluwer, Boston, 1996).Google Scholar
  306. M. Dell'Amico and M. Trubian, Applying tabu search to the job-shop scheduling problem, Annals of Operations Research 41 (1993) 231.CrossRefGoogle Scholar
  307. F.D. DellaCroce, R. Tadei, and G. Volta, A genetic algorithm for the job shop problem, Computers and Operations Research 22 (1995) 15.CrossRefGoogle Scholar
  308. F.D. DellaCroce, R. Tadei and R. Rolando, Solving a real-world project scheduling problem with a genetic approach, Belgian Journal of Operations Research, Statistics and Computer Science 33 (1993) 65.Google Scholar
  309. P.J. Denning, Genetic algorithms, American Scientist 80 (1992) 12.Google Scholar
  310. W.S. Desarbo, R.L. Oliver and A. Rangaswamy, A simulated annealing methodology for clusterwise linear-regression, Psychometrika 54 (1989) 707.Google Scholar
  311. A.K. Dhingra and W.A. Bennage, Discrete and continuous variable structural optimization using tabu search, Engineering Optimization 24 (1995) 177.Google Scholar
  312. M.K. Dhodhi, F.H. Hielscher, R.H. Storer and J. Bhasker, Datapath synthesis using a problem-space genetic algorithm, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 14 (1995) 934.CrossRefGoogle Scholar
  313. R. Diekmann, R. Luling and J. Simon, Problem independent distributed simulated annealing and its applications,Lecture Notes in Economics and Mathematical Systems 396 (1993) p. 17.Google Scholar
  314. P. Dige, C. Lund and H.F. Ravn, Timetabling by simulated annealing,Lecture Notes in Economics and Mathematical Systems 396 (1993) p. 1151.Google Scholar
  315. H. Ding, A.A. Elkeib and R. Smith, Optimal clustering of power networks using genetic algorithms, Electric Power Systems Research 30 (1994) 209.CrossRefGoogle Scholar
  316. N. Dodd, Slow annealing versus multiple fast annealing runs. An empirical investigation, Parallel Computing 16 (1990) 269.CrossRefGoogle Scholar
  317. W.B. Dolan, P.T. Cummings and M.D. Levan, Algorithmic efficiency of simulated annealing for heat-exchanger network design, Computers and Chemical Engineering 14 (1990) 1039.CrossRefGoogle Scholar
  318. W. Domschke, Schedule synchronization for public transit networks, OR Spektrum 11 (1989) 17.CrossRefGoogle Scholar
  319. W. Domschke, P. Forst and S. Voß, Tabu search techniques for the quadratic semi-assignment problem, in:New Directions for Operations Research in Manufacturing, ed. G. Fandel, T. Gulledge and A. Jones (Springer, Berlin, 1992).Google Scholar
  320. W. Domschke and G. Krispin, Location and layout planning. A survey, Working Paper, Institut für Betriebswirtschaftlehre, Fachgebiet Operations Research, Technische Hochschule Darmstadt, Germany (1996).Google Scholar
  321. M. Dorigo, Using transputers to increase speed and flexibility of genetics based machine learning systems, Microprocessing and Microprogamming 34 (1992) 147.CrossRefGoogle Scholar
  322. M. Dorigo and V. Maniezzo, Parallel genetic algorithms. Introduction and overview of current research, in:Parallel Genetic Algorithms. Theory and Applications, ed. J. Stender (ISO Press, Amsterdam, 1992).Google Scholar
  323. M. Dorigo, V. Maniezzo and A. Colorni, The ant system. Optimizaton by a colony of cooperating agents, IEEE Transaction on Systems, Man and Cybernetics (1995), forthcoming.Google Scholar
  324. J. Dorn, R. Kerr and G. Thalhammer, Reactive scheduling. Improving the robustness of schedules and restricting the effects of shop-floor disturbances by fuzzy-reasoning, International Journal of Human-Computer Studies 42 (1995) 287.CrossRefGoogle Scholar
  325. U. Dorndorf and E. Pesch, Evolution-based learning in a job shop scheduling environment, Computers and Operations Research 22 (1995) 25.CrossRefGoogle Scholar
  326. U. Dorndorf and E. Pesch, Fast clustering algorithms, ORSA Journal on Computing 6 (1994) 141.Google Scholar
  327. R. Dorne and J.K. Hao, An evolutionary approach for frequency assignment in cellular radio networks, in:Proceedings of the of IEEE International Conference on Evolutionary Computation, ICEC'95 (IEEE Computer Society Press, Los Alamitos, California, 1995).Google Scholar
  328. R.E. Dorsey and W.J. Mayer, Genetic algorithms for estimation problems with multiple optima, nondifferentiability, and other irregular features, Journal of Business and Economic Statistics 13 (1995) 53.Google Scholar
  329. K.A. Dowsland, Simple tabu thresholding and the pallet loading problem, in:Metaheuristics. Theory and Applications, ed. I.H. Osman and J.P. Kelly (Kluwer, Boston, 1996).Google Scholar
  330. K.A. Dowsland, Simulated annealing solutions for multi-objective scheduling and timetabling, in:Modern Heuristic Search Methods, ed. V.J. Rayward-Smith, I.H. Osman, C.R. Reeves and G.D. Smith (Wiley, Chichester, 1996).Google Scholar
  331. K.A. Dowsland, Some experiments with simulated annealing techniques for packing problems, European Journal of Operational Research 68 (1993) 389.CrossRefGoogle Scholar
  332. K.A. Dowsland, Hillclimbing, simulated annealing and the Steiner problem in graphs, Engineering Optimization 17 (1991) 91.Google Scholar
  333. K.A. Dowsland, A timetabling problem in which clashes are inevitable, Journal of the Operational Research Society 41 (1990) 907.Google Scholar
  334. A. Drexl, A simulated annealing approach to the multiconstraint zero-one knapsack problem, Computing 40 (1988) 1.Google Scholar
  335. A. Drexl and K. Haase, Sequential analysis based randomized regret methods for lot sizing and scheduling, Journal of Operational Research Society 47 (1996) 251.Google Scholar
  336. A. Drexl, J. Juretzka and F. Salewski, Academic course scheduling under workload and changeover constraints, Working paper No. 337, Institut für Betriebswirtschaftslehre der Universität Kiel, Germany (1993).Google Scholar
  337. N. Dubois and D. de Werra, EPCOT. An efficient procedure for colouring optimally with tabu search, Computers and Mathematics with Applications 25 (1993) 35.CrossRefMathSciNetGoogle Scholar
  338. E.J. Dubuc, Bandwidth reduction by simulated annealing, International Journal for Numerical Methods in Engineering 37 (1994) 3977.CrossRefGoogle Scholar
  339. G. Dueck and T. Scheuer, Threshold accepting. A general purpose optimization algorithm appearing superior to simulated annealing, Journal of Computational Physics 90 (1990) 161.CrossRefMathSciNetGoogle Scholar
  340. H. Dufourd, M. Gendreau and G. Laporte, Locating a transit line using tabu search, Location Science (1996), forthcoming.Google Scholar
  341. T. Duncan, A review of commercially available constraint programming tools, Working paper AIAI-TR-149, Artificial Intelligence Applications Institute, University of Edinburgh (1994a).Google Scholar
  342. T. Duncan, Intelligent vehicle scheduling. Experiences with a constraint based approach, Working paper AIAI-TR-150, Artificial Intelligence Applications Institute, University of Edinburgh (1994b).Google Scholar
  343. M. Duqueanton, D. Kunz and B. Ruber, Channel assignment for cellular radio using simulated annealing, IEEE Transactions on Vehiclular Technology 42 (1993) 14.CrossRefGoogle Scholar
  344. M.D. Durand, Parallel simulated annealing. Accuracy vs speed in placement, IEEE Design and Test of Computers 6 (1989) 8.Google Scholar
  345. R. Durbin, R. Szeliski and A. Yuille, An analysis of the elastic net approach to the TSP, Neural Computation 2 (1990) 348.Google Scholar
  346. R. Durbin, R. Szeliski and A. Yuille, An analysis of the elastic net approach to the travelling salesman problem, Neural Computation 1 (1989) 348.Google Scholar
  347. R. Durbin and D. Willshaw, An analogue approach to the TSP using an elastic net method, Nature 326 (1987) 689.CrossRefPubMedGoogle Scholar
  348. F.F. Easton and N. Mansour, A distributed genetic algorithm for the employee staffing and scheduling problem, in:Proceedings of the 5th International Conference on Genetic Algorithms, ed. S. Forrest (Morgan Kaufmann, San Mateo, 1993) p. 360.Google Scholar
  349. M. Efe, Statistical-analysis of parallel randomized algorithms for VLSI placement and implementation on workstation networks, Microprocessors and Microsystems 19 (1995) 341.CrossRefGoogle Scholar
  350. R.W. Eglese, Routing winter gritting vehicles, Discrete Applied Mathematics 48 (1994) 231.CrossRefGoogle Scholar
  351. R.W. Eglese, Simulated annealing. A tool for operational research, European Journal of Operational Research 46 (1990) 271.CrossRefGoogle Scholar
  352. R.W. Eglese, Heuristics in operational research, in:Recent Developments in Operational Research, ed. V. Belton and B. O'Keefe (Pergamon Press, Oxford, 1986).Google Scholar
  353. R.W. Eglese and L.Y.O. Li, A tabu search based heuristic for arc routing with a capacity constraint and time deadline, in:Metaheuristics. Theory and Applications, ed. I.H. Osman and J.P. Kelly (Kluwer, Boston, 1996).Google Scholar
  354. A.E. Eiben, E.H.L. Aarts and K.M. van Hee, Global convergence of genetic algorithms. A Markov-chain analysis,Lecture Notes in Computer Science 496 (1991) p. 4.Google Scholar
  355. S.S. Erenguc and H. Pirkul, Heuristic, genetic and tabu search. Foreword, Computers and Operations Research 21 (1994) 799.CrossRefGoogle Scholar
  356. E. Erwin, K. Obermayer and K. Schulten, Convergence properties of self-organizing maps, in:Artificial Neural Networks, ed. T. Kohonen, K. Makisara, O. Simula and J. Kangas (North-Holland, Amsterdam, 1991).Google Scholar
  357. R. Ettelaie and M.A. Moore, Zero-temperature scaling and simulated annealing, Journal de Physique 48 (1987) 1255.Google Scholar
  358. U. Faigle and W. Kern, On the convergence of simulated annealing algorithms, SIAM Journal on Control and Optimization 29 (1991) 153.CrossRefGoogle Scholar
  359. U. Faigle and B. Schrader, On the convergence of stationary distributions in simulated annealing algorithms, Information Processing Letters 27 (1988) 189.CrossRefGoogle Scholar
  360. U. Faigle and W. Kern, Some convergence results for probabilistic tabu search, ORSA Journal on Computing 4 (1992) 32.Google Scholar
  361. A. Fairley and D.F. Yates, An alternative method of choosing the crossover point when solving the knapsack problem with genetic algorithms, Working paper, Department of Computer Science, University of Liverpool (1993).Google Scholar
  362. E. Falkenauer, Solving equal piles with a grouping genetic algorithm, in:Proceedings of the 6th International Conference on Genetic Algorithms, ICGA95 (Morgan Kaufmann, San Mateo, 1995) p. 492.Google Scholar
  363. E. Falkenauer, A new representation and operators for GAs applied to grouping problems, Evolutionary Computation 2 (1994) 123.Google Scholar
  364. E. Falkenauer, The grouping genetic algorithms. Widening the scope of the GAs, Belgian Journal of Operations Research, Statistics and Computer Science 33 (1993) 79.Google Scholar
  365. E. Falkenauer, A genetic algorithm for grouping, in:Proceedings of the 5th International Symposium on Applied Stochastic Models and Data Analysis (World Scientific Press, Singapore, 1991) p. 198.Google Scholar
  366. E. Falkenauer and S. Bouffouix, A genetic algorithm for job shop, in:Proceedings of the 1991 IEEE International Conference on Robotics and Automation (IEEE Computer Society Press, Los Alamitos, California, 1991) p. 824.Google Scholar
  367. E. Falkenauer and A. Delchambre, A genetic algorithm for bin packing and line balancing, in:Proceedings of the 1992 IEEE International Conference on Robotics and Automation (IEEE Computer Society Press, Los Alamitos, California, 1992) p. 1186.Google Scholar
  368. E. Falkenauer and P. Gaspart, Creating part families with a grouping genetic algorithm, in:Proceedings of the International Symposium on Intelligent Robotics, ISIR '93, ed. M. Vidyasagar (McGraw-Hill, New Delhi, 1993) p. 375.Google Scholar
  369. H.L. Fang, P. Ross and D. Corne, A promising genetic algorithm approach to job-shop scheduling, rescheduling and open-shop scheduling problems, in:Proceedings of the 5th International Conference on Genetic Algorithms, ed. S. Forrest (Morgan Kaufmann, San Mateo, 1993) p. 375.Google Scholar
  370. L.V. Fausett, Fundamentals of Neural Networks. Architectures, Algorithms, and Applications (Prentice-Hall, Englewood Cliffs, 1994).Google Scholar
  371. F. Favata and R. Walker, A study of the application of Kohonen type neural networks to the traveling salesman problem, Biological Cybernetics 64 (1991) 463.CrossRefGoogle Scholar
  372. T.A. Feo, A GRASP for scheduling printed wiring based board assembly, Working paper, Operations Research Group, Department of Mechanical Engineering, The University of Texas at Austin (1993).Google Scholar
  373. T.A. Feo, The cutting path and tool selection problem in computer-aided process planning, Journal of Manufacturing Systems 8 (1989) 17.Google Scholar
  374. T.A. Feo and J.F. Bard, Flight scheduling and maintenance base planning, Management Science 35 (1989) 1415.Google Scholar
  375. T.A. Feo and M.G.C. Resende, Greedy randomized adaptive search procedures, Journal of Global Optimization 6 (1995) 109.CrossRefMathSciNetGoogle Scholar
  376. T.A. Feo, M.G.C. Resende and S.H. Smith, A greedy randomized adaptive search procedure for maximum independent set, Operations Research 42 (1994) 860.Google Scholar
  377. T.A. Feo and M.G.C. Resende, A probabilistic heuristic for a computationally difficult set covering problem, Operations Research Letters 8 (1989) 67.CrossRefGoogle Scholar
  378. T.A. Feo, K. Sarathy and J. McGahan, A GRASP for single machine scheduling with sequence dependent set, Working paper, Operations Research Group, Department of Mechanical Engineering, The University of Texas at Austin (1994).Google Scholar
  379. T.A. Feo, K. Venkatraman and J.F. Bard, A GRASP for a difficult single machine scheduling problem, Computers and Operations Research 18 (1991) 635.CrossRefGoogle Scholar
  380. M. Ferri and M. Piccioni, Optimal selection of statistical units. An approach via simulated annealing, Computational Statistics and Data Analysis 13 (1992) 47.CrossRefMathSciNetGoogle Scholar
  381. C.N. Fiechter, A parallel tabu search algorithm for large traveling salesman problems, Discrete Applied Mathematics 51 (1994) 243.CrossRefGoogle Scholar
  382. B. Filipic, Enhancing genetic search to schedule a production unit, in:Proceedings of the 10th European Conference on Artificial Intelligence, ed. B. Neumann (Wiley, New York, 1992) p. 603.Google Scholar
  383. A.B. Finnila, M.A. Gomez, C. Sebenik, C. Stenson and J.D. Doll, Quantum annealing. A new method for minimizing multidimensional functions, Chemical Physics Letters 219 (1994) 343.CrossRefGoogle Scholar
  384. M.M. Fischer and S. Gopal, Artificial neural networks. A new approach to modeling interregional telecommunication flows, Journal of Regional Science 34 (1994) 503.Google Scholar
  385. S.T. Fischer, A note on the complexity of local search problems, Information Processing Letters 53 (1995) 69.CrossRefGoogle Scholar
  386. M.A. Fleischer and S.H. Jacobson, Cybernetic optimization by simulated annealing. An implementation of parallel processing using probabilistic feedback control, in:Metaheuristics. Theory and Applications, ed. I.H. Osman and J.P. Kelly (Kluwer, Boston, 1996).Google Scholar
  387. C. Fleurent and J.A. Ferland, Genetic and hybrid algorithms for graph coloring, Annals of Operations Research 63 (1996) 437.Google Scholar
  388. M. Flynn, Some computer organizations and their effectiveness, IEEE Transactions on Computers 21 (1972) 948.Google Scholar
  389. T.C. Fogarty,Evolutionary Computing, AISB Workshop, Lecture Notes in Computer Science 993 (Springer, Berlin, 1995).Google Scholar
  390. T.C. Fogarty,Evolutionary Computing Proceedings, Lecture Notes in Computer Science 865 (Springer, Berlin, 1994).Google Scholar
  391. D.B. Fogel, A comparison of evolutionary programming and genetic algorithms on selected constrained optimization problems, Simulation 64 (1995) 397.Google Scholar
  392. D.B. Fogel, An introduction to simulated evolutionary optimization, IEEE Transactions on Neural Networks 5 (1994a) 3.CrossRefGoogle Scholar
  393. D.B. Fogel, Asymptotic convergence properties of genetic algorithms and evolutionary programming. Analysis and experiments, Cybernetics and Systems 25 (1994b) 389.Google Scholar
  394. D.B. Fogel, Applying evolutionary programming to selected traveling salesman problems, Cybernetics and Systems 24 (1993) 27.MathSciNetGoogle Scholar
  395. D.B. Fogel and J.W. Atmar, Comparing genetic operators with Gaussian mutations in simulated evolutionary processes using linear systems, Biological Cybernetics 63 (1990) 111.Google Scholar
  396. G.B. Fogel and D.B. Fogel, Continous evolutionary programming. Analysis and experiments, Cybernetics and Systems 26 (1995) 79.Google Scholar
  397. D.B. Fogel and L.C. Stayton, On the effectiveness of crossover in simulated evolutionary optimization, Biosystems 32 (1994) 171.CrossRefPubMedGoogle Scholar
  398. L.J. Fogel, A.J. Owens and M.J. Walsh,Artificial Intelligence Through Simulated Evolution (Wiley, New York 1966).Google Scholar
  399. C.M. Fonseca and P.J. Fleming, An overview of evolutionary algorithms in multiobjective optimization, Evolutionary Computation 3 (1995), forthcoming.Google Scholar
  400. C.M. Fonseca and P.J. Fleming, Genetic algorithms for multiple objective optimization: formulation, discussion and generalization, in:Proceedings of the 5th International Conference on Genetic Algorithms, ed. S. Forrest (Morgan Kaufmann, San Mateo, 1993) p. 416.Google Scholar
  401. S.Y. Foo, Y. Takefuji and H. Szu, Job shop scheduling based on modified Tank-Hopfield linear programming networks, Engineering Applications of Artificial Intelligence 7 (1994) 321.CrossRefGoogle Scholar
  402. M.A. Forbes, J.N. Holt, P.J. Kilby and A.M. Watts, BUDI. A software system for bus dispatching, Journal of the Operational Research Society 45 (1994) 497.Google Scholar
  403. S. Forrest,Proceedings of an International Conference on Genetic Algorithms (Morgan Kaufmann, San Mateo, 1993).Google Scholar
  404. S. Forrest and M. Mitchell, What makes a problem hard for a genetic algorithm? Some results and their explanation, Machine Learning 13 (1993) 285.CrossRefGoogle Scholar
  405. J.C. Fort, Solving a combinatorial problem via self-organizing process. An application of the Kohonen algorithm to the traveling salesman problem, Biological Cybernetics 59 (1988) 33.CrossRefPubMedGoogle Scholar
  406. P.H. Fortemps, A job shop scheduling with set up time, Belgian Journal of Operations Research, Statistics and Computer Science 33 (1993) 103.Google Scholar
  407. M. Forti, S. Manetti and M. Marini, Necessary and sufficient condition for absolute stability of neural networks, IEEE Transactions on Circuits and Systems I — Fundamental Theory and Applications 41 (1994) 491.CrossRefGoogle Scholar
  408. B.L. Fox, Faster simulated annealing, SIAM Journal on Optimization 5 (1995) 488.CrossRefGoogle Scholar
  409. B.L. Fox, Random restarting versus simulated annealing, Computers and Mathematics with Applications 27 (1994) 33.CrossRefGoogle Scholar
  410. B.L. Fox, Integrating and accelerating tabu search, simulated annealing, and genetic algorithms, Annals of Operations Research 41 (1993) 47.CrossRefGoogle Scholar
  411. B.R. Fox and M.B. McMahon, Genetic operators for sequencing problems, in:Foundations of Genetic algorithms, ed. G.J.E. Rawlings (Morgan Kaufmann, San Mateo, 1991).Google Scholar
  412. M.S. Fox, Constraint directed search. A case study of job shop scheduling, Working paper CMU-RI-TR-83-22, The Robotics Institute, Carnegie-Mellon University (1983).Google Scholar
  413. M.S. Fox and S.F. Smith, ISIS. A knowledge-based system for factury scheduling, Expert Systems 1 (1984) 25.Google Scholar
  414. M. Foy and C. Uhrik, Exploiting domain knowledge, neural networks and genetic algorithms to harvest traffic simulation results, IFIP transactions B — Applications in Technology 11 (1993) 119.Google Scholar
  415. P.M. França, M. Gendreau, G. Laporte and F.M. Müller, Them-traveling salesman problem with minimax objective, Transportation Science 29 (1995) 267.Google Scholar
  416. J.A. Freeman,Exploring Neural Networks with Mathematics (Addison-Wesley, Wokingham, England, 1994).Google Scholar
  417. J.A. Freeman and D.M. Skapura,Neural Networks. Algorithms, Applications and Programming Techniques (Addison-Wesley, Wokingham, England, 1991).Google Scholar
  418. E.C. Freuder and R.J. Wallace, Partial constraint satisfaction, Artificial Intelligence 58 (1992) 21.CrossRefMathSciNetGoogle Scholar
  419. C. Friden, A. Hertz and D. de Werra, TABARIS. An exact algorithm based on tabu search for finding a maximum independent set in a graph, Computers and Operations Research 17 (1990) 437.CrossRefGoogle Scholar
  420. C. Friden, A. Hertz and D. de Werra, STABULUS. A technique for finding stable sets in large graphs with tabu search, Computing 42 (1989) 35.Google Scholar
  421. T.L. Friesz, G. Anandalingam, N.J. Mehta, K. Nam, S.J. Shah and R.L. Tobin, The multi-objective equilibrium network design problem revisited. A simulated annealing approach, European Journal of Operational Research 65 (1993) 44.CrossRefGoogle Scholar
  422. T.L. Friesz, H.J. Cho, N.J. Mehta, K. Nam, R.L. Tobin and G. Anandalingam, A simulated annealing approach to the network design problem with variational inequality constraints, Transportation Science 26 (1992) 18.Google Scholar
  423. D. Frost and R. Dechter, Dead-end driven learning, in:Proceedings of the 12th National Conference for Artificial Intelligence (AAAI, 1994) p. 294.Google Scholar
  424. R. Frost, SDSC Ebsa. Ensemble based simulated annealing (1995) (ftp site address: ftp.sdsc.edu,files in: /pub/sdsc/math/Ebsa).Google Scholar
  425. J.E. Galletly, An overview of genetic algorithms, Kybernetes 21 (1992) 26.Google Scholar
  426. R. Gangadharan and C. Rajendran, A simulated annealing heuristic for scheduling in a flowshop with bicriteria, Computers and Industrial Engineering 27 (1994) 473.CrossRefGoogle Scholar
  427. B.I. Garcia, J.-Y. Potvin and J.-M. Rousseau, A parallel implementation of the tabu search heuristic for vehicle-routing problems with time window constraints, Computers and Operations Research 21 (1994) 1025.CrossRefGoogle Scholar
  428. M.R. Garey and D.S. Johnson,Computers and Intractability. A Guide to the Theory of NP-Completeness (Freemann, New York, 1979).Google Scholar
  429. A.H. Gee and R.W. Prager, Limitations of neural networks for solving traveling salesman problems, IEEE Transactions on Neural Networks 6 (1995) 280.CrossRefGoogle Scholar
  430. E. Gelenbe,Neural Networks. Advances and Applications (North-Holland, Amsterdam, 1991).Google Scholar
  431. S.B. Gelfand and S.K. Mitter, Simulated annealing type algorithms for multivariate optimization, Algorithmica 6 (1991a) 419.CrossRefGoogle Scholar
  432. S.B. Gelfand and S.K. Mitter, Weak convergence of Markov-chain sampling methods and annealing algorithms to diffusions, Journal of Optimization Theory and Applications 68 (1991b) 483.CrossRefGoogle Scholar
  433. D.D. Gemmill, Solution to the assortment problem via the genetic algorithm, Mathematical and Computer Modelling 16 (1992) 89.CrossRefGoogle Scholar
  434. M. Gendreau, A. Hertz and G. Laporte, A tabu search heuristic for the vehicle routing problem, Management Science 40 (1994) 1276.Google Scholar
  435. M. Gendreau, G. Laporte and J.-Y. Potvin, Vehicle routing 1. Metaheuristics, in:Local Search in Combinatorial Optimization, ed. E.H.L. Aarts and J.K. Lenstra (Wiley, Chichester, 1996), forthcoming.Google Scholar
  436. M. Gendreau, G. Laporte and R. Séguin, A tabu search heuristic for the vehicle routing problem with stochastic demands and customers, Operations Research (1996), forthcoming.Google Scholar
  437. M. Gendreau, P. Soriano and L. Salvail, Solving the maximum clique problem using a tabu search approach, Annals of Operations Research 41 (1993) 385.CrossRefGoogle Scholar
  438. J.A. George, J.M. George and B.W. Lamar, Packing different-sized circles into a rectangular container, European Journal of Operational Research 84 (1995) 693.CrossRefGoogle Scholar
  439. H. Ghaziri, Solving routing problems by a self-organizing feature map, in:Artificial Neural Networks, ed. T. Kohonen, K. Makisara, O. Simula and J. Kangas (North-Holland, Amsterdam, 1991).Google Scholar
  440. H. Ghaziri, Supervision in the self-organizing feature map: Application to the vehicle routing problem, in:Metaheuristics. Theory and Applications, ed. I.H. Osman and J.P. Kelly (Kluwer, Boston, 1996).Google Scholar
  441. M. Ghosh, S.S. Manna and B.K. Chakrabarti, The traveling salesman problem on a dilute lattice. A simulated annealing study, Journal of Physics A — Mathematical and General 21 (1988) 1483.CrossRefGoogle Scholar
  442. J.C. Gilkinson, L.C. Rabelo and B.O. Bush, A real-world scheduling problem using genetic algorithm, Computers and Industrial Engineering 29 (1995) 177.CrossRefGoogle Scholar
  443. G.C. Gini and C. Rogialli, CONSTRUCTOR. A constraint-based language, Computer Systems Science and Engineering 9 (1994) 255.Google Scholar
  444. R.S. Ginsberg, Dynamic backtracking, Journal of Artificial Intelligence Research 1 (1993) 25.Google Scholar
  445. L. Gislen, C. Peterson and B. Soderberg, Teachers and classes with neural networks, International Journal of Neural Systems 1 (1989) 167.CrossRefGoogle Scholar
  446. C.A. Glass, C.N. Potts and P. Shade, Unrelated parallel machine scheduling using local search, Mathematical and Computer Modelling 20 (1994) 41.CrossRefGoogle Scholar
  447. C.A. Glass and C.N. Potts, A comparison of local search methods for flow shop scheduling, Annals of Operations Research 63 (1996) 489.Google Scholar
  448. F. Glover, Multilevel tabu search and embedded search neighbourhoods for the travelling salesman problem, ORSA Journal on Computing (1996), forthcoming.Google Scholar
  449. F. Glover, Tabu search fundamentals and uses, Working paper, Graduate School of Business, University of Colorado, Boulder (1995a).Google Scholar
  450. F. Glover, Tabu thresholding. Improved search by non-monotonic trajectories, ORSA Journal on Computing 7 (1995b) 426.Google Scholar
  451. F. Glover, Scatter search and star-paths. Beyond the genetic metaphor, OR Spektrum 17 (1995c) 125.CrossRefGoogle Scholar
  452. F. Glover, Optimization by ghost image processes in neural networks, Computers and Operations Research 21 (1994a) 801.CrossRefMathSciNetGoogle Scholar
  453. F. Glover, Tabu search for nonlinear and parametric optimization (with links to genetic algorithms), Discrete Applied Mathematics 49 (1994b) 231.CrossRefMathSciNetGoogle Scholar
  454. F. Glover, Tabu search. Improved solution alternatives, in:Mathematical Programming State of the Art, ed. J.R. Birge and K.G. Murty (University of Michigan Press, Ann Arbor, 1994c).Google Scholar
  455. F. Glover, Genetic algorithms and scatter search. Unexpected potentials, Statistics and Computing 4 (1994d) 131.Google Scholar
  456. F. Glover, New ejection chain and alternating path methods for traveling salesman problems, in:Operations Research and Computer Science. New Developments in Their Interfaces, ed. O. Balci, R. Shardi and S.A. Zenios (Pergamon Press, Oxford, 1992).Google Scholar
  457. F. Glover, Artificial intelligence, heuristic frameworks and tabu search, Managerial and Decision Economics 11 (1990a) 365.Google Scholar
  458. F. Glover, Tabu search. A tutorial, Interfaces 20 (1990b) 74.Google Scholar
  459. F. Glover, Tabu search. Part II, ORSA Journal on Computing 2 (1990c) 4.Google Scholar
  460. F. Glover, Tabu search. Part I, ORSA Journal on Computing 1 (1989) 190.Google Scholar
  461. F. Glover, Future paths for integer programming and links to artificial intelligence, Computers and Operations Research 13 (1986) 533.CrossRefGoogle Scholar
  462. F. Glover, Heuristics for integer programming using surrogate constraints, Decision Sciences 8 (1977) 156.Google Scholar
  463. F. Glover and H.J. Greenberg, New approaches for heuristic search. A bilateral linkage with artificial intelligence, European Journal of Operational Research 39 (1989) 119.CrossRefGoogle Scholar
  464. F. Glover, J.P. Kelly and M. Laguna, Genetic algorithms and tabu search. Hybrids for optimization, Computers and Operations Research 22 (1995) 111.CrossRefGoogle Scholar
  465. F. Glover and G.A. Kochenberger, Critical event tabu search for multidimensional knapsack problems, in:Metaheuristics. Theory and Applications, ed. I.H. Osman and J.P. Kelly (Kluwer, Boston, 1996).Google Scholar
  466. F. Glover, M. Lee and J. Ryan, Least-cost network topology design for a new service. An application of tabu search, Annals of Operations Research 33 (1991) 351.CrossRefGoogle Scholar
  467. F. Glover and M. Laguna, Tabu search, in:Modern Heuristic Techniques for Combinatorial Problems, ed. C.C. Reeves (Blackwell, Oxford, 1993).Google Scholar
  468. F. Glover and M. Laguna, Target analysis to improve a tabu search method for machine scheduling, Arabian Journal for Science and Engineering 16 (1991) 239.Google Scholar
  469. F. Glover, M. Laguna, E.D. Taillard and D. de Werra,Tabu Search, Annals of Operations Research 43 (Baltzer, Basel, 1993).Google Scholar
  470. F. Glover and C. McMillan, The general employee scheduling problem. An integration of MS and AI, Computers and Operations Research 13 (1986) 563.CrossRefGoogle Scholar
  471. F. Glover, J.M. Mulvey and K. Hoyland, Solving dynamic stochastic control problems in finance using tabu search with variable scaling, in:Metaheuristics. Theory and Applications, ed. I.H. Osman and J.P. Kelly (Kluwer, Boston, 1996).Google Scholar
  472. F. Glover and E. Pesch, TSP ejection chain, Working paper, Graduate School of Business, University of Colorado, Boulder (1995).Google Scholar
  473. F. Glover, E. Pesch and I.H. Osman, Efficient facility layout planning, Graduate School of Business, University of Colorado, Boulder (1995).Google Scholar
  474. F. Glover and J. Skorin-Kapov, Heuristic advances in optimization integrating tabu search, ejection chains and neural networks, Working paper, Graduate School of Business, University of Colorado, Boulder (1993).Google Scholar
  475. F. Glover, E.D. Taillard and D. de Werra, A user's guide to tabu search, Annals of Operations Research 41 (1993) 3.CrossRefGoogle Scholar
  476. F. Glover, J. Xu and S.Y. Chiu, Designing a tabu search approach for the Steiner tree star problem, Working paper, Graduate School of Business, University of Colorado, Boulder (1995).Google Scholar
  477. W.L. Goffe, G.D. Ferrier and J. Rogers, Global optimization of statistical functions with simulated annealing, Journal of Econometrics 60 (1994) 65.CrossRefGoogle Scholar
  478. W.L. Goffe, G.D. Ferrier and J. Rogers, Simulated annealing. An initial application in econometrics, Computer Science in Economics and Management 5(1992) 113.CrossRefGoogle Scholar
  479. D.E. Goldberg, A note on Boltzmann tournament selection for genetic algorithms and population oriented simulated annealing, Complex Systems 4 (1990) 445.Google Scholar
  480. D.E. Goldberg,Genetic Algorithms in Search, Optimization, and Machine Learning (Addison-Wesley, Wokingham, England, 1989).Google Scholar
  481. D.E. Goldberg, K. Deb and J.H. Clark, Genetic algorithms, noise and the sizing of populations, Complex Systems 6 (1992) 333.Google Scholar
  482. B.L. Golden, Charting new directions in OR and CS, ORSA Journal on Computing 6 (1994) 107.Google Scholar
  483. B.L. Golden and C.C. Skiscim, Using simulated annealing to solve routing and location-problems, Naval Research Logistics 33 (1986) 261.MathSciNetGoogle Scholar
  484. B.L. Golden and W. Stewart, Empirical analysis of heuristics, in:The Traveling Salesman Problem. A Guided Tour of Combinatorial Oprimization, ed. E. Lawler, J. Lenstra, A. Rinnooy Kan and D. Shmoys (Wiley, New York 1985).Google Scholar
  485. M. Goldstein, Self-organizing feature maps for the multiple traveling salesman problem, in:Proceedings of the IEEE International Neural Network Conference (Paris, 1990) p. 258.Google Scholar
  486. V.S. Gordon and D. Whitley, Serial and parallel genetic algorithms as function optimizers, in:Proceedings of the International Conference on Genetic Algorithms, ed. S. Forrest (Morgan Kaufmann, San Mateo, 1993) p. 177.Google Scholar
  487. M. Gorges-Schleuter, Explicit parallelism of genetic algorithms through population structures,Lecture Notes in Computer Science 496 (1991) p. 150.Google Scholar
  488. V. Granville, M. Krivanek and J.P. Rasson, Simulated annealing. A proof of convergence, IEEE Transactions On Pattern Analysis and Machine Intelligence 16 (1994) 652.CrossRefGoogle Scholar
  489. H. Greenberg, Computational testing. Why, how and how much, ORSA Journal on Computing 2 (1990) 7.Google Scholar
  490. J.W. Greene and K.J. Supowit, Simulated annealing without rejected moves, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 5 (1986) 221.CrossRefGoogle Scholar
  491. D.R. Greening, Parallel simulated annealing techniques, Physica D42 (1990) 293.Google Scholar
  492. R.N. Greenwell, J.E. Angus and M. Finck, Optimal mutation probability for genetic algorithms, Mathematical and Computer Modelling 21 (1995) 1.CrossRefGoogle Scholar
  493. J.J. Grefenstette,Genetic Algorithms for Machine Learning (Kluwer, Boston, 1994).Google Scholar
  494. J.J. Grefenstette, Genetic algorithms, IEEE Expert-Intelligent Systems and Their Applications 8 (1993) 5.Google Scholar
  495. J.J. Grefenstette, Incorporating problem specific knowledge into genetic algorithms, in:Genetic Algorithms and Simulated Annealing, ed. L. Davis (Pitman, London, 1987).Google Scholar
  496. J.J. Grefenstette, A user's guide to GENESIS, Working paper, Navy Center for Applied Research in Artificial Intelligence, Naval Research Laboratory, Washington DC (1987a).Google Scholar
  497. J.J. Grefenstette, Optimization of control parameters for genetic algorithms, IEEE Transactions on Systems, Man and Cybernetics 16 (1986) 122.Google Scholar
  498. J.J. Grefenstette,Proceedings of an International Conference on Genetic Algorithms (Morgan Kaufmann, San Mateo, 1985).Google Scholar
  499. J.J. Grefenstette, GENESIS. A system for using genetic search procedure, in:Proceedings of the 1984 Conference on Intelligent Systems and Machines (1984) p. 161.Google Scholar
  500. P. Greistorfer, Computational experiments with heuristics for a capacitated arc routing problem, Working paper, Department of Business, University of Graz, Austria (1994).Google Scholar
  501. A. Grigoriev, Artificial intelligence or stochastic relaxation. Simulated annealing challenge in heuristic programming, in:Artificial Intelligence 2, ed. D. Levy and D. Beal (Ellis Horwood, Hertfordshire, England, 1991).Google Scholar
  502. F. Gruau, Automatic definition of modular neural networks, Adaptive Behavior 3 (1994) 151.Google Scholar
  503. J. Gu, Local search for satisfiability (SAT) problem, IEEE Transactions on Systems, Man and Cybernetics 23 (1993) 1108.Google Scholar
  504. J. Gu, Design of efficient local search algorithms,Lecture Notes in Artificial Intelligence 604 (1992) p. 651.Google Scholar
  505. J. Gu and X.F. Huang, Efficient local search with search space smoothing. A case-study of the traveling salesman problem (TSP), IEEE Transactions on Systems, Man and Cybernetics 24 (1994) 728.Google Scholar
  506. J. Gu, X.F. Huang and B. Du, A quantitative solution to constraint satisfaction problem (CSP), New Generation Computing 13 (1994) 99.Google Scholar
  507. A. Guinet, Scheduling independent jobs on uniform parallel machines to minimize tardiness criteria, Journal of Intelligent Manufacturing 6 (1995) 95.CrossRefGoogle Scholar
  508. L.F. Gulyanitskii, L.B. Koshlai and I.V. Sergienko, Convergence of a simulation method for solution of combinatorial optimization problems, Cybernetics and Systems Analysis 29 (1993) 445.CrossRefGoogle Scholar
  509. A. Gupta and M.S. Lam, Estimating missing values using neural networks, Journal of the Operational Research Society 47 (1996) 229.Google Scholar
  510. D.K. Gupta, An enhancement scheme for constraint satisfaction problems (CSPS), International Journal of Computer Mathematics 47 (1993) 177.Google Scholar
  511. M.C. Gupta, Y.P. Gupta and A. Kumar, Minimizing flow time variance in a single-machine system using genetic algorithms, European Journal of Operational Research 70 (1993) 289.CrossRefGoogle Scholar
  512. V. Gupta and E. Schenfeld, Annealed embeddings of communication patterns in an interconnection cached network, IEEE Transactions on Parallel and Distributed Systems 6 (1995) 1153.CrossRefGoogle Scholar
  513. Y.P. Gupta, M.C. Gupta, A. Kumar and C. Sundram, Minimizing total intercell and intracell moves in cellular manufacturing. Genetic algorithm approach, International Journal of Computer Integrated Manufacturing 8 (1995) 92.Google Scholar
  514. J. Haddock and J. Mittenthal, Simulation optimization using simulated annealing, Computers and Industrial Engineering 22 (1992) 387.CrossRefGoogle Scholar
  515. B. Hajek and G. Sasaki, Simulated annealing. To cool or not?, Systems and Control Letters 12 (1989) 443.CrossRefGoogle Scholar
  516. B. Hajek, Cooling schedules for optimal annealing, Mathematics of Operations Research 13 (1988) 311.Google Scholar
  517. P. Hajela and C.Y. Lin, Genetic algorithms in optimization problems with discrete and integer design variables, Engineering Optimization 19 (1992) 309.Google Scholar
  518. T. Hamada, C.K. Cheng and P.M. Chau, An efficient multilevel placement technique using hierarchical partitioning, IEEE Transactions on Circuits and Systems I — Fundamental Theory and Applications 39 (1992) 432.CrossRefGoogle Scholar
  519. B.T. Han, G. Diehr and J.S. Cook, Multipletype, two-dimensional bin packing problems. Applications and algorithms, Annals of Operations Research 50 (1994) 239.CrossRefMathSciNetGoogle Scholar
  520. M.M. Han, S. Tatsumi, Y. Kitamura and T. Okumoto, Parallel genetic algorithms based on a multiprocessor system fin and its application, IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences E78A (1995) 1595.Google Scholar
  521. S. Hanafi, A. Fréville and A. El-Abdellaoui, Comparison of heuristics for the 0–1 multidimensional knapsack problem, in:Metaheuristics. Theory and Applications, ed. I.H. Osman and J.P. Kelly (Kluwer, Boston, 1996).Google Scholar
  522. P. Hansen, The steepest ascent mildest descent heuristic for combinatorial programming, Presented at the Congress on Numerical Methods in Combinatorial Optimization, Capri (1986).Google Scholar
  523. P. Hansen, E.D. Pedrosa and C.C. Ribeiro, Location and sizing of offshore platforms for oil-exploration, European Journal of Operational Research 58 (1992) 202.CrossRefGoogle Scholar
  524. P. Hansen and B. Jaumard, Algorithms for the maximum satisfiability problem, Computing 44 (1990) 279.MathSciNetGoogle Scholar
  525. P. Hansen and K.-W. Lih, Heuristic reliability optimization by tabu search, Annals of Operations Research 63 (1996) 321.Google Scholar
  526. O. Hansson and A. Mayer, Decision-theoretic control of constraint satisfaction and scheduling, in:Intelligent Scheduling Systems, ed. D.E. Brown and W.T. Scherer,Operations Research/Computer Science Interfaces 3 (Kluwer, Boston, 1995).Google Scholar
  527. J.K. Hao, A clausal genetic representation and its related evolutionary procedures for satisfability problems, in:Proceedings of the International Conference on Artificial Neural Networks and Genetic Algorithms, ICANNGA'95 (Springer, Berlin, 1995) p. 289.Google Scholar
  528. J.K. Hao and R. Dorne, An empirical comparison of two evolutionary methods for satisfiability problems, in:Proceedings of the IEEE International Conference on Evolutionary Computation (Orlando, Florida, 1994).Google Scholar
  529. J.K. Hao and R. Dorne, Study of genetic search for the frequency assignment problem,Lecture Notes in Computer Science (Springer, Berlin, 1995), forthcoming.Google Scholar
  530. B.L.M. Happel and J.M.J. Murre, Design and evolution of modular neural-network architectures, Neural Networks 7 (1994) 985.Google Scholar
  531. X. Hardyao, Finding approximate solutions to NP-hard problems by neural networks is hard, Information Processing Letters 41 (1992) 93.CrossRefGoogle Scholar
  532. D. Harel and M. Sardas, Randomized graph drawing with heavy-duty preprocessing, Journal of Visual Languages and Computing 6 (1995) 233.CrossRefGoogle Scholar
  533. G. Harhalakis, J.M. Proth and X.L. Xie, Manufacturing cell design using simulated annealing. An industrial application, Journal of Intelligent Manufacturing 1 (1990) 185.CrossRefGoogle Scholar
  534. J.P. Hart and A.W. Shogan, Semi-greedy heuristics. An empirical study, Operations Research Letters 6 (1987) 107.CrossRefMathSciNetGoogle Scholar
  535. S.M. Hart and C.L.S. Chen, Simulated annealing and the mapping problem. A computational study, Computers and Operations Research 21 (1994) 455.CrossRefGoogle Scholar
  536. M. Hasan and I.H. Osman, Local search algorithms for the maximal planar layout problem, International Transactions in Operational Research 2 (1995) 89.CrossRefGoogle Scholar
  537. S. Hashiba and T.C. Chang, Heuristic and simulated annealing approaches to PCB assembly setup reduction, IFIP Transactions B — Applications in Technology 3 (1992) 769.Google Scholar
  538. S. Haykin,Neural Networks. A Comprehensive Foundation (MacMillan, New York, 1994).Google Scholar
  539. P. Healy and R. Moll, A new extension of local search applied to the dial-a-ride problem, European Journal of Operational Research 83 (1995) 83.CrossRefGoogle Scholar
  540. R. Heckmann and T. Lengauer, A simulated annealing approach to the nesting problem in the textile manufacturing industry, Annals of Operations Research 57 (1995) 103.CrossRefGoogle Scholar
  541. J. Heistermann, Application of a genetic approach as an algorithm for neural networks,Lecture Notes in Computer Science 496 (1991) p. 297.Google Scholar
  542. B.J. Hellstrom and L.N. Kanal, Asymmetric mean-field neural networks for multiprocessor scheduling, Neural Networks 5 (1992) 671.Google Scholar
  543. S.S. Heragu, Modeling the machine layout problem, Computers and Industrial Engineering 19 (1990) 294.CrossRefGoogle Scholar
  544. S.S. Heragu and A.S. Alfa, Experimental analysis of simulated annealing based algorithms for the layout problem, European Journal of Operational Research 57 (1992) 190.CrossRefGoogle Scholar
  545. S.S. Heragu and A.S. Alfa, A simulated annealing based approach to solve the facility layout problem, in:Proceedings of the 4th Advanced Technology Conference (U.S. Postal Service, Washington 1990) p. 489.Google Scholar
  546. S.S. Heragu and B. Mazacioglu, Variations of the simulated annealing algorithm applied to the order picking problem, Working paper 37-91-295, Department of Decision Sciences and Engineering Systems, Rensselaer Polytechnic Institute, Troy, New York (1991).Google Scholar
  547. L. Hérault, Réseaux de neurons récursifs pour l'optimisation combinatoire: Application à la théorie des graphes et à la vision par ordinateur, Ph.D. Thesis, Institut National Polytechnique de Grenoble, France (1991).Google Scholar
  548. L. Hérault and J.J. Niez, Neural network and combinatorial optimization. A study of NP-complete graph problems, in:Neural Networks. Advances and Applications, ed. E. Gelenbe (North-Holland, Amsterdam, 1991).Google Scholar
  549. L. Hérault and J.J. Niez, Neural networks and graphK-partitioning, Complex Systems 3 (1989) 521.Google Scholar
  550. E. Herbert and K.A. Dowsland, A family of genetic algorithms for the pallet loading problem, Annals of Operations Research 63 (1996) 415.Google Scholar
  551. J.W. Hermann and C.Y. Lee, Solving a class scheduling problem with genetic algorithm, ORSA Journal on Computing 7 (1995) 443.Google Scholar
  552. A. Hertz, Finding a feasible course schedule using tabu search, Discrete Applied Mathematics 35 (1992) 255.CrossRefGoogle Scholar
  553. A. Hertz, Tabu search for large scale timetabling problems, European Journal of Operational Research 54 (1991) 39.CrossRefGoogle Scholar
  554. A. Hertz, B. Jaumard and M. Poggi de Aragao, Local optima topology for thek-coloring problem, Discrete Applied Mathematics 49 (1994) 257.CrossRefGoogle Scholar
  555. A. Hertz, B. Jaumard, C.C. Ribeiro and W.P. Formosinho, A multicriteria tabu search approach to cell formation problems in group technology with multiple objectives, RAIRO — Operations Research 28 (1994) 303.Google Scholar
  556. A. Hertz, E.D. Taillard and D. de Werra, Tabu search, in:Local Search in Optimization, ed. E.H.L. Aarts and J.K. Lenstra (Wiley, Chichester 1996), forthcoming.Google Scholar
  557. A. Hertz and D. de Werra, The tabu search metaheuristic. How we used it, Annals of Mathematics and Artificial Intelligence 1 (1990) 111.CrossRefGoogle Scholar
  558. A. Hertz and D. de Werra, Using tabu search techniques for graph-coloring, Computing 39 (1987) 345.Google Scholar
  559. J. Hertz, A. Krogh and R.G. Palmer,Introduction to the Theory of Neural Computation (Addison-Wesley, Wokingham, England, 1991).Google Scholar
  560. T.M. Heskes, E.T.P. Slijpen and B. Kappen, Cooling schedules for learning in neural networks, Physical Review E47 (1993) 4457.Google Scholar
  561. J. Hesser, R. Männer and O. Stucky, On Steiner trees and genetic algorithms,Lecture Notes in Artificial Intelligence 565 (1991) p. 509.Google Scholar
  562. D.B. Hibbert, Genetic algorithms in chemistry, Chemometrics and Intelligent Laboratory Systems 19 (1993) 277.CrossRefGoogle Scholar
  563. T. Hill, L. Marquez, M. O'Connor and W. Remus, Artificial neural-network models for forecasting and decision making, International Journal of Forecasting 10 (1994) 5.CrossRefGoogle Scholar
  564. K.S. Hindi, Solving the CLSP by a tabu search heuristic, Journal of the Operational Research Society 47 (1996) 151.Google Scholar
  565. K.S. Hindi, Solving the single-item, capacitated dynamic lot-sizing problem with startup and reservation costs by tabu search, Computers and Industrial Engineering 28 (1995) 701.CrossRefGoogle Scholar
  566. K.S. Hindi and E. Toczylowski, Detailed scheduling of batch-production in a cell with parallel facilities and common renewable resources, Computers and Industrial Engineering 28 (1995) 839.CrossRefGoogle Scholar
  567. K.S. Hindi and Y.M. Hamam, Solving the part families problem in discrete-parts manufacture by simulated annealing, Production Planning and Control 5 (1994) 160.Google Scholar
  568. D.T. Hiquebran, A.S. Alfa, J.A. Shapiro and D.H. Gittoes, A revised simulated annealing and cluster-1st route-2nd algorithm applied to the vehicle routing problem, Engineering Optimization 22 (1994) 77.Google Scholar
  569. C.A. Hjorring, The vehicle routing problem and local search meta-heuristics, Ph.D. Thesis, Department of Engineering Science, The University of Auckland, NZ (1995).Google Scholar
  570. K.H. Hoffmann, M. Christoph and M. Hanf, Optimizing simulated annealing,Lecture Notes in Computer Science 496 (1991) p. 221.Google Scholar
  571. K.H. Hoffmann and P. Salamon, The optimal simulated annealing schedule for a simple model, Journal of Physics A — Mathematical and General 23 (1990) 3511.CrossRefGoogle Scholar
  572. K.H. Hoffmann, D. Wurtz, C. Degroot and M. Hanf, Concepts in optimizing simulated annealing schedules. An adaptive approach for parallel and vector machines,Lecture Notes in Economics and Mathematical Systems 367 (1991) p. 155.Google Scholar
  573. F. Hoffmeister and T. Bäck, Genetic algorithms and evolution strategies. Similarities and differences,Lecture Notes in Computer Science 496 (1991) p. 455.Google Scholar
  574. J. Hofmann and C. Schiemangk, Placement heuristics for generation of FMS layouts,Lecture Notes in Control and Information Sciences 143 (1990) p. 780.Google Scholar
  575. J.H. Holland,Adaptation in Natural and Artificial Systems (MIT Press, Cambridge, 1992a).Google Scholar
  576. J.H. Holland, Genetic algorithms, Scientific American 267 (1992b) 66.Google Scholar
  577. C.W. Holsapple, V.S. Jacob, R. Pakath and J.S. Zaveri, A genetics based hybrid scheduler for generating static schedules in flexible manufacturing contexts, IEEE Transactions on Systems, Man, and Cybernetics 23 (1993) 953.Google Scholar
  578. A. Homaifar, C.X. Qi and S.H. Lai, Constrained optimization via genetic algorithms, Simulation 62 (1994) 242.Google Scholar
  579. A. Homaifar, S. Guan and G. Liepins, A new approach on the traveling salesman problem by genetic algorithms, in:Proceedings of the 5th International Conference on Genetic Algorithms, ed. S. Forrest (Morgan Kaufmann, San Mateo, 1993) p. 460.Google Scholar
  580. C.E. Hong and B.M. McMillin, Relaxing synchronization in distributed simulated annealing, IEEE Transactions on Parallel and Distributed Systems 6 (1995) 189.CrossRefGoogle Scholar
  581. G. Hong, M. Zuckermann, R. Harris and M. Grant, A fast algorithm for simulated annealing, Physica Scripta T38 (1991) 40.Google Scholar
  582. J.N. Hooker, Testing heuristics. We have it all wrong, Journal of Heuristics 1 (1995) 33.Google Scholar
  583. J.N. Hooker, Needed. An empirical science of algorithms, Operations Research 42 (1994) 201.Google Scholar
  584. J.N. Hooker and N.R. Natraj, Solving general routing and scheduling problem by chain decomposition and tabu search, Transportation Science 29 (1995) 30.Google Scholar
  585. P.M. Hooper, Nearly orthogonal randomized designs, Journal of the Royal Statistical Society Series B — Methodological 55 (1993) 221.Google Scholar
  586. J.J. Hopfield and D. Tank, Computing with neural circuits. A model, Science 233 (1986) 624.Google Scholar
  587. J.J. Hopfield and D. Tank, Neural computations of decisions in optimization problems, Biological Cybernetics 52 (1985) 141.PubMedGoogle Scholar
  588. U. Horchner and J.H. Kalivas, Further investigation on a comparative study of simulated annealing and genetic algorithm for wavelength selection, Analytica Chimica Acta 311 (1995) 1.CrossRefGoogle Scholar
  589. J. Horn, N. Nafpliotis and D.E. Goldberg, A niched Pareto genetic algorithm for multiobjective optimization, in:Proceedings of the 1st IEEE Conference on Evolutionary Computation (1994) p. 82.Google Scholar
  590. J.T. Horng and B.J. Liu, Extending SQL with graph matching, set covering and partitioning, Journal of the Chinese Institute of Engineers 17 (1994) 13.Google Scholar
  591. E.S.H. Hou, N. Ansari and H. Ren, A genetic algorithm for multiprocessor scheduling, IEEE Transactions on Parallel and Distributed Systems 5 (1994) 113.CrossRefGoogle Scholar
  592. T.C. Hu, A.B. Khang and C.-W.A. Tsao, Old bachelor acceptance. A new class of non-monotonic threshold accepting methods, ORSA Journal on Computing 7 (1995) 417.Google Scholar
  593. N.F. Hu, Tabu search method with random moves for globally optimal design, International Journal for Numerical Methods in Engineering 35 (1992) 1055.Google Scholar
  594. S.H. Huang and H.C. Zhang, Artificial neural networks in manufacturing. Concepts, applications, and perspectives, IEEE Transactions on Components Packaging and Manufacturing Technology Part A 17 (1994) 212.CrossRefGoogle Scholar
  595. T. Huang, C. Zhang, S. Lee and H.P. Wang, Implementation and comparison of 3 neural network learning algorithms, Kybernetes 22 (1993) 22.Google Scholar
  596. W.-C. Huang and C.-Y. Kao, A genetic algorithm approach for set covering problems, Working paper, Department of Computer Science and Information Engineering, National Taiwan University, Taipei (1992).Google Scholar
  597. M.L. Huber, Structural optimization of vapor-pressure correlations using simulated annealing and threshold accepting. Application to R134A, Computers and Chemical Engineering 18 (1994) 929.CrossRefGoogle Scholar
  598. R. Hubscher and F. Glover, Applying tabu search with influential diversification to multiprocessor scheduling, Computers and Operations Research 21 (1994) 877.CrossRefGoogle Scholar
  599. A. Hunter, Sugal V2.1, SUnderland Genetic Algorithms Library, University of Sunderland, England (1996) (ftp site address: osiris@sund.ac.uk,files in: /pub/sugal).Google Scholar
  600. C.L. Huntley and D.E. Brown, A parallel heuristic for quadratic assignment problems, Computers and Operations Research 18 (1991) 275.CrossRefGoogle Scholar
  601. J. Hurink, B. Jurisch and M. Thole, Tabu search for the job-shop scheduling problem with multipurpose machines, OR Spektrum 15 (1994) 205.CrossRefGoogle Scholar
  602. P. Husbands, An ecosystems model for integrated production planning, The International Journal of Computer Integrated Manufacturing 6 (1993) 74.Google Scholar
  603. P. Husbands, F. Mill and S. Warrington, Genetic algorithms, production plan optimization and scheduling,Lecture Notes in Computer Science 496 (1991) p. 80.Google Scholar
  604. Y. Ichikawa and T. Sawa, Neural network application for direct feedback controllers, IEEE Transactions on Neural Networks 3 (1992) 224.CrossRefGoogle Scholar
  605. O. Icmeli and S.S. Erenguc, A tabu search procedure for the resource constrained project scheduling problem with discounted cash flows, Computers and Operations Research (1994) 841.Google Scholar
  606. H. Igarashi, A solution for combinational optimization problems using a 2-layer random-field model. Mean-field approximation, Systems and Computers in Japan 25 (1994) 61.Google Scholar
  607. ILOG: ILOG Solver, Schedule, Collected papers, ILOG Headquarters, Gentilly, France (1994).Google Scholar
  608. L. Ingber, ASA. Adaptive simulated annealing, (1995) (ftp site: ftp.alumi.caltech.edu,files in: /pub/ingber).Google Scholar
  609. L. Ingber, Simulated annealing. Practice versus theory, Mathematical and Computer Modelling 18 (1993) 29.CrossRefMathSciNetGoogle Scholar
  610. L. Ingber, Very fast simulated re-annealing, Mathematical and Computer Modelling 12 (1989) 967.CrossRefGoogle Scholar
  611. L. Ingber, H. Fujio and M.F. Wehner, Mathematical comparison of combat computer models to exercise data, Mathematical and Computer Modelling 15 (1991) 65.CrossRefGoogle Scholar
  612. L. Ingber and B. Rosen, Genetic algorithms and very fast simulated re-annealing. A comparison, Mathematical and Computer Modelling 16 (1992) 87.CrossRefMathSciNetGoogle Scholar
  613. L. Ingber, M.F. Wehner, G.M. Jabbour and T.M. Barnhill, Application of statistical mechanics methodology to term structure bond-pricing models, Mathematical and Computer Modelling 15 (1991) 77.CrossRefGoogle Scholar
  614. H. Ishibuchi, S. Misaki and H. Tanaka, Modified simulated annealing algorithms for the flow-shop sequencing problem, European Journal of Operational Research 81 (1995) 388.CrossRefGoogle Scholar
  615. H. Ishibuchi, K. Nozaki, N. Yamamoto and H. Tanaka, Selection of fuzzy if-then rules by a genetic method, Electronics and Communications in Japan Part III — Fundamental Electronic Science 77 (1994) 94.Google Scholar
  616. H. Ishibuchi, N. Yamamoto, S. Misaki and H. Tanaka, Local search algorithms for flow-shop scheduling with fuzzy due-dates, International Journal of Production Economics 33 (1994) 53.CrossRefGoogle Scholar
  617. H. Ishibuchi, N. Yamamoto, T. Murata and H. Tanaka, Genetic algorithms and neighborhood search algorithms for fuzzy flowshop scheduling problems, Fuzzy Sets and Systems 67 (1994) 81.CrossRefMathSciNetGoogle Scholar
  618. M. Ishikawa, T. Toya, M. Hoshida, K. Nitta, A. Ogiwara and M. Kanehisa, Multiple sequence alignment by parallel simulated annealing, Computer Applications in the Biosciences 9 (1993) 267.PubMedGoogle Scholar
  619. R. Jackson, P. Boggs, S. Nash and S. Powell, Report of the ad hoc committee to revise the guidelines for reporting computational experiments in mathematical programming, Mathematical Programming 49 (1990) 413.CrossRefGoogle Scholar
  620. L.W. Jacobs and M.J. Brusco, A local-search heuristic for large set-covering problems, Naval Research Logistics 42 (1995) 1129.MathSciNetGoogle Scholar
  621. S.H. Jacobson, How difficult is the frequency selection problem, Operations Research Letters 17 (1995) 139.CrossRefGoogle Scholar
  622. A. Jagota, Approximating maximum clique with a Hopfield network, IEEE Transactions on Neural Networks 6 (1995) 724.CrossRefGoogle Scholar
  623. L.C. Jain, Hybrid connectionist systems in research and teaching, IEEE Aerospace and Electronic Systems Magazine 10 (1995) 14.CrossRefGoogle Scholar
  624. S. Jajodia, I. Minis, G. Harhalakis and J.M. Proth, CLASS. Computerized layout solutions using simulated annealing, International Journal of Production Research 30 (1992) 95.Google Scholar
  625. H. James, Software for studying and developing applications of artificial neural networks, Economic Journal 104 (1994) 181.Google Scholar
  626. M. Jampel, Constraint logic programming. A bibliography, Working paper, City University, London (1995).Google Scholar
  627. C.Z. Janikow, A knowledge-intensive genetic algorithm for supervised learning, Machine Learning 13 (1993) 189.CrossRefGoogle Scholar
  628. J. Jansen, R.C.M.H. Douven and E.E.M Vanberkum, An annealing algorithm for searching optimal block-designs, Biometrical Journal 34 (1992) 529.MathSciNetGoogle Scholar
  629. G.K. Janssens and A. van Breedam, A simulated annealing postprocessor for the vehicle routing problem, in:Applications of Modern Heuristic Methods, ed. V. Rayward-Smith (Alfred Waller, Henley-on-Thames, 1995).Google Scholar
  630. B. Jaumard, P.S. Ow and B. Simeone, A selected artificial intelligence bibliography for operations researchers, Annals of Operations Research 12 (1988) 1.Google Scholar
  631. C. Jedrzejek and L. Cieplinski, Heuristic versus statistical physics approach to optimization problems, Acta Physica Polonica B 26 (1995) 977.Google Scholar
  632. D.E. Jeffcoat and R.L. Bulfin, Simulated annealing for resource-constrained scheduling, European Journal of Operational Research 70 (1993) 43.CrossRefGoogle Scholar
  633. W. Jeffrey and R. Rosner, Optimization algorithms. Simulated annealing and neural network processing, Astrophysical Journal 310 (1986) 473.CrossRefGoogle Scholar
  634. C.S. Jeong and M.H. Kim, Fast parallel simulated annealing for traveling salesman problem on SIMD-machines with linear interconnections, Parallel Computing 17 (1991) 221.CrossRefGoogle Scholar
  635. L.M. Jin and S.P. Chan, A genetic approach for network partitioning, International Journal of Computer Mathematics 42 (1992a) 47.Google Scholar
  636. L.M. Jin and S.P. Chan, Analog placement by formulation of macro-components and genetic partitioning, International Journal of Electronics 73 (1992b) 157.Google Scholar
  637. S. Jockusch and H. Ritter, Self-organizing maps. Local competition and evolutionary optimization, Neural Networks 7 (1994) 1229.CrossRefGoogle Scholar
  638. P. Jog, J.Y. Suh and D. van Gucht, Parallel genetic algorithms applied to the travelling salesman problem, SIAM Journal on Optimization 1 (1991) 515.CrossRefGoogle Scholar
  639. D.S. Johnson, C.R. Aragon, L.A. McGeoch and C. Schevon, Optimization by simulated annealing. An experimental evaluation 2. Graph-coloring and number partitioning, Operations Research 39 (1991) 378.Google Scholar
  640. D.S. Johnson, C.R. Aragon, L.A. McGeoch and C. Schevon, Optimization by simulated annealing. An experimental evaluation 1. Graph partitioning, Operations Research 37 (1989) 865.Google Scholar
  641. D.S. Johnson and L.A. McGeoch, The travelling salesman problem. A case study in local search, in:Local Search in Optimization, ed. E.H.L. Aarts and J.K. Lenstra (Wiley, Chichester, 1996), forthcoming.Google Scholar
  642. D.S. Johnson, C. Papadimitriou and M. Yannakis, How easy is local search, Journal of Computer and System Sciences 37 (1988) 79.CrossRefGoogle Scholar
  643. D.S. Johnson and C. Papadimitriou, Performance guarantees for heuristics, in:The Traveling Salesman Problem. A Guided Tour of Combinatorial Optimization, ed. E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan and D.B. Shmoys (Wiley, New York, 1985).Google Scholar
  644. M.D. Johnston and H.M. Adorf, Scheduling with neural networks. The case of the Hubble space telescope, Computers and Operations Research 19 (1992) 209.CrossRefGoogle Scholar
  645. A. Jones, L. Rabelo and Y.W. Yih, A hybrid approach for real-time sequencing and scheduling, International Journal of Computer Integrated Manufacturing 8 (1995) 145.Google Scholar
  646. A.E.W. Jones and G.W. Forbes, An adaptive simulated annealing algorithm for global optimization over continuous-variables, Journal of Global Optimization 6 (1995) 1.CrossRefGoogle Scholar
  647. A.J. Jones, Genetic algorithms and their applications to the design of neural networks, Neural Computing and Applications 1 (1993) 32.CrossRefGoogle Scholar
  648. D.R. Jones and M.A. Beltramo, Solving partitioning problems with genetic algorithms, in:Proceedings of the 4th International Conference on Genetic Algorithms (Morgan Kaufmann, San Mateo, 1991) p. 442.Google Scholar
  649. G. Jones, A.M. Robertson and P. Willett, An introduction to genetic algorithms and to their use in information retrieval, Online and CDROM Review 18 (1994) 3.Google Scholar
  650. R.M. Jorgensen, H. Thomsen and R.V.V. Vidal, The afforestation problem. A heuristic method based on simulated annealing, European Journal of Operational Research 56 (1992) 184.CrossRefGoogle Scholar
  651. K. Jörnsten and A. Løkketangen, Tabu search for weightedK-cardinality trees, Working paper M9303, Institute of Informatics, Molde College, Molde, Norway (1993).Google Scholar
  652. J. Jszefowska, G. Waligsra and J. Weglarz, A tabu search algorithm for some discrete-continuous scheduling problems, in:Modern Heuristic Search Methods, ed. V.J. Rayward-Smith, I.H. Osman, C.R. Reeves and G.D. Smith (Wiley, Chichester, 1996).Google Scholar
  653. R.S. Judson, M.E. Colvine, J.C. Meza, A. Huffer and D. Gutierrez, Do intelligent configuration search techniques outperform random search for large molecules, International Journal of Quantum Chemistry 44 (1992) 277.CrossRefGoogle Scholar
  654. K. Juliff, A multi-chromosome genetic algorithm for pallet loading, in:Proceedings of the 5th International Conference on Genetic Algorithms, ed. S. Forrest (Morgan Kaufmann, San Mateo, 1993) p. 467.Google Scholar
  655. R.A. Julstrom, A genetic algorithm for the rectilinear steiner problem, in:Proceedings of the 5th International Conference on Genetic Algorithms, ed. S. Forrest (Morgan Kaufmann, San Mateo, 1993) p. 474.Google Scholar
  656. N. Kadaba, XROUTE. A knowledge-based routing system using neural networks and genetic algorithms, Ph.D. Dissertation, North Dakota State University (1990).Google Scholar
  657. R. Kalaba, M. Kim and J.E. Moore, Linear programming and recurrent associative memories, International Journal of General Systems 20 (1992) 177.Google Scholar
  658. J.H. Kalivas, Optimization using variations of simulated annealing, Chemometrics and Intelligent Laboratory Systems 15 (1992) 1.CrossRefGoogle Scholar
  659. T. Kampke, Simulated annealing: Use of a new tool in bin packing, Annals of Operations Research 16 (1988) 327.Google Scholar
  660. S. Kaparthi and N.C. Suresh, Performance of selected part-machine grouping techniques for data sets of wide ranging sizes and imperfection, Decision Sciences 25 (1994) 515.Google Scholar
  661. S. Kaparthi, N.C. Suresh and R.P. Cerveny, An improved neural-network leader algorithm for part-machine grouping in group technology, European Journal of Operational Research 69 (1993) 342.CrossRefGoogle Scholar
  662. A. Kapsalis, P. Chardaire, V.J. Rayward-Smith and G.D. Smith, The radio link frequency assignment problem. A case study using genetic algorithms,Lecture Notes in Computer Science 993 (1995), forthcoming.Google Scholar
  663. A. Kapsalis, V.J. Rayward-Smith and G.D. Smith, Solving the graphical Steiner tree problem using genetics, Journal of the Operational Research Society 44 (1993) 397.Google Scholar
  664. V. Karamcheti and M. Malek, A TSP engine for performing tabu search, in:Proceedings of the International Conference on Application Specific Array Processing (IEEE Computer Society Press, Los Alamitos, California, 1991) p. 309.Google Scholar
  665. T. Kawaguchi and T. Todaka, Operation scheduling by annealed neural networks, IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences E78A (1995) 656.Google Scholar
  666. A.J. Keane, A brief comparison of some evolutionary optimization methods, in:Modern Heuristic Search Methods, ed. V.J. Rayward-Smith, I.H. Osman, C.R. Reeves and G.D. Smith (Wiley, Chichester, 1996).Google Scholar
  667. A.J. Keane, Genetic algorithm optimization of multi-peak problems. Studies in convergence and robustness, Artificial Intelligence in Engineering 9 (1995) 75.CrossRefGoogle Scholar
  668. J.P. Kelly, B.L. Golden and A.A. Assad, Large-scale controlled rounding using tabu search with strategic oscillation, Annals of Operations Research 41 (1993) 69.CrossRefGoogle Scholar
  669. J.P. Kelly, M. Laguna and F. Glover, A study of diversification strategies for the quadratic assignment problem, Computers and Operations Research 21 (1994) 885.CrossRefGoogle Scholar
  670. W. Kern, On the depth of combinatorial optimization problems, Discrete Applied Mathematics 43 (1993) 115.CrossRefGoogle Scholar
  671. T. Kido, K. Takagi and M. Nalanishi, Analysis and comparisons of genetic algorithm, simulated annealing, tabu search and evolutionary combination algorithm, Informatica 18 (1994) 399.Google Scholar
  672. T. Kido, H. Kitano and M. Nakamishi, A hybrid search for genetic algorithms. Combining genetic algorithms, tabu search and simulated annealing, in:Proceedings of the 5th International Conference on Genetic Algorithms, ed. S. Forrest (Morgan Kaufmann, San Mateo, 1993) p. 641.Google Scholar
  673. M.D. Kidwell, Using genetic algorithms to schedule distributed tasks on a bus-based system, in:Proceedings of the 5th International Conference on Genetic Algorithms, ed. S. Forrest (Morgan Kaufmann, San Mateo, 1993) p. 368.Google Scholar
  674. C. Kim, W. Kim, H. Shin, K. Rhee, H. Chung and J. Kim, Combined hierarchical placement algorithm for row-based layouts, Electronics Letters 29 (1993) 1508.Google Scholar
  675. H. Kim, K. Nara and M. Gen, A method for maintenance scheduling using GA combined with SA, Computers and Industrial Engineering 27 (1994) 477.CrossRefGoogle Scholar
  676. Y.T. Kim, Y.J. Jang and M.W. Kim, Stepwise overlapped parallel annealing and its application to floorplan designs, Computer-Aided Design 23 (1991) 133.CrossRefGoogle Scholar
  677. R.K. Kincaid, Solving the damper placement problem via local search heuristics, OR Spektrum 17 (1995) 149.CrossRefGoogle Scholar
  678. R.K. Kincaid, Minimizing distortion in truss structures. A comparison of simulated annealing and tabu search, Structural Optimization 5 (1993) 217.CrossRefGoogle Scholar
  679. R.K. Kincaid, Good solutions to discrete noxious location problems via metaheuristics, Annals of Operations Research 40 (1992) 265.CrossRefGoogle Scholar
  680. R.K. Kincaid, A.D. Martin and J.A. Hinkley, Heuristic search for the polymer straightening problem, Computational Polymer Science 5 (1995) 1.Google Scholar
  681. W. Kinnebrock, Accelerating the standard backpropagation method using a genetic approach, Neurocomputing 6 (1994) 583.CrossRefGoogle Scholar
  682. S. Kirkpatrick, C.D. Gelatt and P.M. Vecchi, Optimization by simulated annealing, Science 220 (1983) 671.Google Scholar
  683. L.M. Kirousis, Fast parallel constraint satisfaction, Artificial Intelligence 64 (1993) 147.CrossRefGoogle Scholar
  684. B.S. Kiselev, N.Y. Kulakov and A.L. Mikaelyan, A modification of the annealing imitation method for solving combinatorial optimization problems, Telecommunications and Radio Engineering 48 (1993) 123.Google Scholar
  685. H. Kita, H. Odani and I. Nishikawa, Solving a placement problem by means of an analog neural network, IEEE Transactions on Industrial Electronics 39 (1992) 543.CrossRefGoogle Scholar
  686. H. Kitano, Neurogenetic learning. An integrated method of designing and training neural networks using genetic algorithms, Physica D75 (1994) 225.Google Scholar
  687. R.W. Klein and K.C. Dubes, Experiments in projection and clustering by simulated annealing, Pattern Recognition 22 (1989) 213.CrossRefGoogle Scholar
  688. J.G. Klincewicz, Avoiding local optima in thep-hub location problem using tabu search and GRASP, Annals of Operations Research 40 (1992) 283.CrossRefMathSciNetGoogle Scholar
  689. J.G. Klincewicz and A. Rajan, Using GRASP to solve the component grouping, Working paper, AT&T Bell Laboratories, Holmdel, New Jersey (1992).Google Scholar
  690. J. Knox, Tabu search performance on the symmetrical traveling salesman problem, Computers and Operations Research 21 (1994) 867.CrossRefGoogle Scholar
  691. J. Knox, The application of tabu search to the symmetric traveling, Ph.D. Dissertation, Graduate School of Business, University of Colorado, Boulder (1989).Google Scholar
  692. S. Koakutsu, Y. Sugai and H. Hirata, Block placement by improved simulated annealing based on genetic algorithm,Lecture Notes in Control and Information Sciences 180 (1992) p. 648.Google Scholar
  693. S.J. Koh and C.Y. Lee, A tabu search for the survivable fiber optic communication-network design, Computers and Industrial Engineering 28 (1995) 689.CrossRefGoogle Scholar
  694. T. Kohonen,Self-Organizing and Associative Memory, 3rd edition (Springer, Berlin, 1992).Google Scholar
  695. T. Kohonen, Self-organized formation of topological correct feature maps, Biological Cybernetics 43 (1982) 59.CrossRefGoogle Scholar
  696. F. Kolahan, M. Liang and M. Zuo, Solving the combined part sequencing and tool replacement problem for an automated machining center. A tabu search approach, Computers and Industrial Engineering 28 (1995) 731.CrossRefGoogle Scholar
  697. A. Kolen and E. Pesch, Genetic local search in combinatorial optimization, Discrete Applied Mathematics 48 (1994) 273.CrossRefMathSciNetGoogle Scholar
  698. M. Kolonko, A piecewise Markovian model for simulated annealing with stochastic cooling schedules, Journal of Applied Probability 32 (1995) 649.Google Scholar
  699. G. Kontoravdis and J.F. Bard, Improved heuristics for the vehicle routing problem with time windows, ORSA Journal on Computing 7 (1995) 10.Google Scholar
  700. H. Kopfer, Concepts of genetic algorithms and their application to the freight optimization problem in commercial shipping, OR Spektrum 14 (1992) 137.CrossRefGoogle Scholar
  701. H. Kopfer, G. Pankratz and E. Erkens, Development of a hybrid genetic algorithm for vehicle-routing, OR Spektrum 16 (1994) 21.CrossRefGoogle Scholar
  702. E. Korutcheva, M. Opper and B. Lopez, Statistical mechanics of the knapsack problem, Journal of Physics A — Mathematical and General 27 (1994) 645.CrossRefGoogle Scholar
  703. C. Koulmas, S.R. Antony and R. Jaen, A survey of simulated annealing applications to operations research problems, Omega 22 (1994) 41.CrossRefGoogle Scholar
  704. V.K. Koumousis and P.G. Georgiou, Genetic algorithms in discrete optimization of steel truss roofs, Journal of Computing in Civil Engineering 8 (1994) 309.Google Scholar
  705. P. Kouvelis and W.C. Chiang, A simulated annealing procedure for single row layout problems in flexible manufacturing systems, International Journal of Production Research 30 (1992) 717.Google Scholar
  706. P. Kouvelis, W.C. Chiang and J. Fitzsimmons, Simulated annealing for machine layout problems in the presence of zoning constraints, European Journal of Operational Research 57 (1992) 203.CrossRefGoogle Scholar
  707. P. Kouvelis, G.J. Gutierrez and W.C. Chiang, Heuristic unidirectional flowpath design approaches for automated guided vehicle systems, International Journal of Production Research 30 (1992) 1327.Google Scholar
  708. M. Kovacic, Timetable construction with markovian neural network, European Journal of Operational Research 69 (1993) 92.CrossRefGoogle Scholar
  709. J.R. Koza,Genetic Programming. On the Programming of Computers by Means of Natural Selection (MIT Press, Cambridge, MA 1992).Google Scholar
  710. J.R. Koza,Genetic Programming II. Automatic Discovery of Reusable Subprograms (MIT Press, Cambridge, MA 1994).Google Scholar
  711. S.A. Kravitz and R.A. Rutenbar, Placement by simulated annealing on a multiprocessor, IEEE Transaction on Computer Aided Design 6 (1987) 534.CrossRefGoogle Scholar
  712. V. Kreinovich, C. Quintana and O. Fuentes, Genetic algorithms. What fitness scaling is optimal, Cybernetics and Systems 24 (1993) 9.Google Scholar
  713. K. Krishna, K. Ganeshan and D.J. Ram, Distributed simulated annealing algorithms for job shop scheduling, IEEE Transactions on Systems, Man and Cybernetics 25 (1995) 1102.Google Scholar
  714. B. Kroger, Guillotineable bin packing. A genetic approach, European Journal of Operational Research 84 (1995) 645.CrossRefGoogle Scholar
  715. B. Kroger, P. Schwenderling and O. Vornberger, Parallel genetic packing of rectangles,Lecture Notes in Computer Science 496 (1991) p. 160.Google Scholar
  716. L. Kryzanowski, M. Galler and D.W. Wright, Using artificial neural networks to pick stocks, Financial Analysts Journal 49 (1993) 21.Google Scholar
  717. H.M. Ku and I.M. Karimi, An evaluation of simulated annealing for batch process scheduling, Industrial and Engineering Chemistry Research 30 (1991) 163.CrossRefGoogle Scholar
  718. R. Kuik, M. Salomon, L.N. van Wassenhove and J. Maes, Linear programming, simulated annealing and tabu search heuristics for lotsizing in bottleneck assembly systems, IIE Transactions 25 (1993) 62.Google Scholar
  719. R. Kuik and M. Salomon, Multilevel lot-sizing problem. Evaluation of a simulated annealing heuristic, European Journal of Operational Research 45 (1990) 25.CrossRefMathSciNetGoogle Scholar
  720. U.R. Kulkarni and M.Y. Kiang, Dynamic grouping of parts in flexible manufacturing systems. A self-organizing neural networks approach, European Journal of Operational Research 84 (1995) 192.CrossRefGoogle Scholar
  721. V. Kumar, Algorithms for constraint satisfaction problems. A survey, AI Magazine 13 (1992) 32.Google Scholar
  722. M. Kuroda and A. Kawada, Improvement on the computational efficiency of inverse queueing network analysis, Computers and Industrial Engineering 27 (1994) 421.CrossRefGoogle Scholar
  723. T. Kurokawa and S. Kozuka, Use of neural networks for the optimum frequency assignment problem, Electronics and Communications in Japan Part I — Communication 77 (1994) 106.Google Scholar
  724. V. Kvasnicka and J. Pospichal, Messay simulated annealing, Journal of Chemometrics 9 (1995) 309.CrossRefGoogle Scholar
  725. V. Kvasnicka and J. Pospichal, Fast evaluation of chemical distance by tabu search algorithm, Journal of Chemical Information and Computer Sciences 34 (1994) 1109.CrossRefGoogle Scholar
  726. M. Laguna, Clustering for the design of sonet rings in interoffice telecommunications, Management Science 40 (1994) 1533.Google Scholar
  727. M. Laguna, Tabu search primer, Working paper, Graduate School of Business, University of Colorado, Boulder (1993).Google Scholar
  728. M. Laguna, J.W. Barnes and F. Glover, Intelligent scheduling with tabu search. An application to jobs with linear delay penalties and sequence dependent setup costs and times, Applied Intelligence 3 (1993) 159.CrossRefGoogle Scholar
  729. M. Laguna, J.W. Barnes and F. Glover, Tabu search methods for a single-machine scheduling problem, Journal of Intelligent Manufacturing 2 (1991) 63.CrossRefGoogle Scholar
  730. M. Laguna and F. Glover, Bandwidth packing. A tabu search approach, Management Science 39 (1993) 492.Google Scholar
  731. M. Laguna and F. Glover, Integrating target analysis and tabu search for improved scheduling systems, Expert Systems with Applications 6 (1993a) 287.CrossRefGoogle Scholar
  732. M. Laguna, J.P. Kelly, J.L.G. Velarde and F. Glover, Tabu search for the multilevel generalized assignment problem, European Journal of Operational Research 82 (1995) 176.CrossRefGoogle Scholar
  733. M. Laguna and P. Laguna, Applying tabu search to the 2-dimensional Ising spin-glass, International Journal of Modern Physics C — Physics and Computers 6 (1995) 11.CrossRefGoogle Scholar
  734. M. Laguna and J.L.G. Velarde, A search heuristic for just-in-time scheduling in parallel machines, Journal of Intelligent Manufacturing 2 (1991) 253.CrossRefGoogle Scholar
  735. G. Laporte and I.H. Osman,Metaheuristics in Combinatorial Optimization, Annals of Operations Research 63 (Baltzer, Basel, 1996).Google Scholar
  736. G. Laporte and I.H. Osman, Routing problems. A biliography, Annals of Operations Research 61 (1995) 227.CrossRefGoogle Scholar
  737. S. Lash, Genetic algorithms for weighted tardiness scheduling on parallel machines, Working paper 93-01, Department of Industrial Engineering, and Management Sciences, Northwestern University, Evanston, Illinois (1993).Google Scholar
  738. J.B. Lasserre, P.P. Varaiya and J. Walrand, Simulated annealing, random search, multistart or sad, Systems and Control Letters 8 (1987) 297.CrossRefGoogle Scholar
  739. C. Lau,Neural Networks. Theoretical Foundations and Analysis (IEEE Computer Society Press, Los Alamitos, California, 1992).Google Scholar
  740. P.S. Laursen, An experimental comparison of 3 heuristics for the WVCP, European Journal of Operational Research 73 (1994) 181.CrossRefGoogle Scholar
  741. P.S. Laursen, Simulated annealing for the QAP. Optimal tradeoff between simulation time and solution quality, European Journal of Operational Research 69 (1993) 238.CrossRefGoogle Scholar
  742. E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan and D.B. Shmoys,The Traveling Salesman Problem. A Guided Tour of Combinatorial Optimization (Wiley, Chichester, 1985).Google Scholar
  743. R. Leardi, R. Boggia and M. Terrile, Genetic algorithms as a strategy for feature-selection, Journal of Chemometrics 6 (1992) 267.CrossRefGoogle Scholar
  744. J.P. Leclercq and V. Englebert, Automatic graph's drawing, Belgian Journal of Operations Research, Statistics and Computer Science 33 (1993) 33.Google Scholar
  745. B.W. Lee and B.J. Sheu, Paralleled hardware annealing for optimal solutions on electronic neural networks, IEEE Transactions on Neural Networks 4 (1993) 588.CrossRefGoogle Scholar
  746. B.W. Lee and B.J. Sheu,Hardware Annealing in Analog VLSI Neurocomputing (Kluwer, Boston, 1991).Google Scholar
  747. C.K. Lee and K.I. Yang, Network design of one-way streets with simulated annealing, Papers in Regional Science 73 (1994) 119.Google Scholar
  748. C.Y. Lee, Genetic algorithms for single-machine job scheduling with common due-date and symmetrical penalties, Journal of the Operations Research Society of Japan 37 (1994) 83.Google Scholar
  749. C.Y. Lee and J.Y. Choi, A genetic algorithm for job sequencing problems with distinct due-dates and general early-tardy penalty weights, Computers and Operations Research 22 (1995) 857.CrossRefGoogle Scholar
  750. C.Y. Lee and S.J. Kim, Parallel genetic algorithms for the earliness tardiness job scheduling problem with general penalty weights, Computers and Industrial Engineering 28 (1995) 231.CrossRefGoogle Scholar
  751. F.H. Lee, G.S. Stiles and V. Swaminathan, Parallel annealing on distributed memory systems, Programming and Computer Software 21 (1995) 1.Google Scholar
  752. I. Lee, R. Sikora and M.J. Shaw, Joint lot sizing and sequencing with genetic algorithms for scheduling and evolving the chromosome structure, in:Proceedings of the 5th International Conference on Genetic Algorithms, ed. S. Forrest (Morgan Kaufmann, San Mateo, 1993) p. 383.Google Scholar
  753. J. Lee, J.H. Chou and S.L. Fu, New approach for the ordering of gate permutation in one-dimensional logic-arrays, IEE Proceedings — Circuits Devices and Systems 142 (1995) 90.CrossRefGoogle Scholar
  754. J.Y. Lee and M.Y. Choi, Optimization by multicanonical annealing and the traveling salesman problem, Physical Review E50 (1994) 651.Google Scholar
  755. S. Lee and H.P. Wang, Modified simulated annealing for multipleobjective engineering design optimization, Journal of Intelligent Manufacturing 3 (1992) 101.CrossRefGoogle Scholar
  756. Y.N. Lee, G.P. McKeown and V.J. Rayward-Smith, The convoy movement problem with initial delays, in:Modern Heuristic Search Methods, ed. V.J. Rayward-Smith, I.H. Osman, C.R. Reeves and G.D. Smith (Wiley, Chichester, 1996).Google Scholar
  757. V.J. Leon and R. Balakrishnan, Strength and adaptibility of problem-space based neighborhoods for resource constrained scheduling, OR Spektrum 17 (1995) 173.CrossRefGoogle Scholar
  758. C. LePape, Constraint-based programming for scheduling. An historical perspective, Working paper, ILOG, Gentilly, France (1994).Google Scholar
  759. C. LePape, Implementation of resource constraints in ILOG schedule. A library for the development of constraint based scheduling systems, Intelligent Systems Engineering 3 (1994) 55.Google Scholar
  760. Y.Y. Leu, L.A. Matheson and L.P. Rees, Assembly-line balancing using genetic algorithms with heuristic-generated initial populations and multiple evaluation criteria, Decision Sciences 25 (1994) 581.Google Scholar
  761. J. Lever, M. Wallace and B. Richards, Constraint logic programming for scheduling and planning, BT Technology Journal 13 (1995) 73.Google Scholar
  762. D.M. Levine, A parallel genetic algorithm for the set partitioning problem, in:Metaheuristics. Theory and Applications, ed. I.H. Osman and J.P. Kelly (Kluwer, Boston, 1996).Google Scholar
  763. D.M. Levine, PGAPack V0.2: A Data-Structure Neutral Parallel Genetic Algorithm Library, University of Chicago, Argonne National Laboratory, Illinois (1995) (ftp site address: info.mcs.anl.gov,files in: /pub/pgpack/pgpack.tar.Z).Google Scholar
  764. D.M. Levine, A parallel genetic algorithm for the set partitioning problem, Ph.D. Dissertation, Department of Computer Science, Illinois Institute of Technology, Chicago (1994).Google Scholar
  765. D.M. Levine, A genetic algorithm for the set partitioning problem, in:Proceedings of the 5th International Conference on Genetic Algorithms, ed. S. Forrest (Morgan Kaufmann, San Mateo, 1993) p. 481.Google Scholar
  766. J.H. Li and S. Nishihara, A constraint satisfaction algorithm using solution trees and its complexity, IFIP Transactions A — Computer Science and Technology 19 (1992) 229.Google Scholar
  767. Y. Li, P.M. Pardalos and M.G.C. Resende, A greedy randomized adaptive search procedure for the quadratic assignment problem, in:Quadratic Assignment and Related Problems, ed. P.M. Pardalos and H. Wolkowicz,DIMACS Series on Discrete Mathematics and Theoretical Computer Science 16 (1994).Google Scholar
  768. Y.H. Li and Y.J. Jiang, Localized simulated annealing in constraint satisfaction and optimization, in:Modern Heuristic Search Methods, ed. V.J. Rayward-Smith, I.H. Osman, C.R. Reeves and G.D. Smith (Wiley, Chichester, 1996).Google Scholar
  769. G.E. Liepins and S. Baluja, APGA. An adaptive parallel genetic algorithm, in:Computer Science and Operations Research New Development in their Interfaces, ed. O. Balci, R. Sharda and S.A. Zenios (Pergamon Press, Oxford, 1992).Google Scholar
  770. G.E. Liepins, M. Hilliard, J. Richardson and M. Palmer, Genetic algorithm applications to set covering and traveling salesman problems, in:Operations Research and Artificial Intelligence. The Integrations of Problem Solving Strategies, ed. E.D. Brown and White (Kluwer, Boston, 1990).Google Scholar
  771. G.E. Liepins G.E. Hilliard and M. Hilliard, Genetic algorithms. Foundations and applications, Annals of Operations Research 21 (1989) 31.CrossRefGoogle Scholar
  772. G.E. Liepins and M.D. Vose, Characterizing crossover in genetic algorithms, Annals of Mathematics and Artificial Intelligence 5 (1991) 27.CrossRefGoogle Scholar
  773. G.E. Liepins and M.D. Vose, Representational issues in genetic optimization, Journal of Experimental and Theoretical Artificial Intelligence 2 (1990) 101.Google Scholar
  774. W.E. Lillo, M.H. Lob, S. Hui and S.H. Zak, On solving constrained optimization problems with neural networks. A penalty method approach, IEEE Transactions on Neural Networks 4 (1993a) 931.CrossRefGoogle Scholar
  775. W.E. Lillo, S. Hui and S.H. Zak, Neural networks for constrained optimization problems, International Journal of Circuit Theory and Applications 21 (1993b) 385.Google Scholar
  776. C.K.Y. Lin, K.B. Haley and C. Sparks, A comparative study of both standard and adaptive versions of threshold accepting and simulated annealing algorithms in 3 scheduling problems, European Journal of Operational Research 83 (1995) 330.CrossRefGoogle Scholar
  777. C.T. Lin and C.S.G. Lee, A multivalued Boltzmann machine, IEEE Transactions on Systems, Man and Cybernetics 25 (1995) 660.Google Scholar
  778. F.T. Lin, C.Y. Kao and C.C. Hsu, Applying the genetic approach to simulated annealing in solving some NP-hard problems, IEEE Transactions on Systems, Man and Cybernetics 23 (1993) 1752.Google Scholar
  779. F.T. Lin, C.Y. Kao and C.C. Hsu, Incorporating genetic algorithms into simulated annealing, in:Proceedings of the 4th International Symposium on Artificial Intelligence (1991) p. 290.Google Scholar
  780. S.C. Lin and J.H.C. Hsueh, A new methodology of simulated annealing for the optimization problems, Physica A205 (1994a) 367.Google Scholar
  781. S.C. Lin and J.H.C. Hsueh, Nearest neighbor heuristics in accelerated algorithms of optimization problems, Physica A203 (1994b) 369.Google Scholar
  782. R.P. Lippmann, An introduction to computing with neural nets, IEEE ASSP Magazine 4 (1987) 4.Google Scholar
  783. Y. Lirov, Computer-aided neural network engineering, Neural Networks 5 (1992a) 711.Google Scholar
  784. Y. Lirov, Knowledge based approach to the cutting stock problem, Mathematical and Computer Modelling 16 (1992b) 107.CrossRefGoogle Scholar
  785. P.G.J. Lisboa,Neural Networks: Current Applications (Chapman and Hall, London, 1992).Google Scholar
  786. R. Lister, Multiprocessor rejectionless annealing, in:Proceedings of Parallel Computing and Transputers, PCAT'93, ed. D. Arnold, R. Christer, D. Day and P. Roe (ISO Press, Amsterdam, 1994) p. 199.Google Scholar
  787. J. Little and K. Darby-Dowman, The significance of constraint logic programming to operational research, in:Operational Research Tutorial Papers, ed. M. Lawrence and C. Wilsdon (Operational Research Society, Birmingham, 1995).Google Scholar
  788. C.M. Liu, R.L. Kao and A.H. Wang, Solving location-allocation problems with rectilinear distances by stimulated annealing, Journal of the Operational Research Society 45 (1994) 1304.Google Scholar
  789. C.M. Liu and J.K. Wu, Machine cell-formation using the simulated annealing algorithm, International Journal of Computer Integrated Manufacturing 6 (1993) 335.Google Scholar
  790. X.Z. Liu, A. Sakamoto and T. Shimamoto, Genetic channel router, IEIECE Transactions on Fundamentals of Electronics Communications and Computer Sciences E77A (1994) 492.Google Scholar
  791. X.Z. Liu, A Sakamoto and T. Shimamoto, Restrictive channel routing with evolution programs, IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences E76A (1993) 1738.Google Scholar
  792. Z.P. Lo and B. Bavarian, Multiple job scheduling with artificial neural networks, Computers and Electrical Engineering 19 (1993) 87.CrossRefGoogle Scholar
  793. Z.P. Lo and B. Bavarian, Optimization of job scheduling on parallel machines by simulated annealing algorithms, Expert Systems with Applications 4 (1992) 323.CrossRefGoogle Scholar
  794. C. Lockwood and T. Moore, Harvest scheduling with spatial constraints. A simulated annealing approach, Canadian Journal of Forest Research — Journal Canadien de la Recherche Forestière 23 (1993) 468.Google Scholar
  795. R. Logendran and P. Ramakrishna, Manufacturing cell formation in the presence of lot splitting and multiple units of the same machine, International Journal of Production Research 33 (1995) 675.Google Scholar
  796. R. Logendran, P. Ramakrishna and C. Sriskandarajah, Tabu search based heuristics for cellular manufacturing systems in the presence of alternative process plans, International Journal of Production Research 32 (1994) 273.Google Scholar
  797. A. Løkketangen, Tabu search. Using the search experience to guide the search process. An introduction with examples, AI Communications 8 (1995) 78.Google Scholar
  798. A. Løkketangen and F. Glover, Probabilistic move selection in tabu search for zero-one mixed integer programming problems, in:Metaheuristics. Theory and Applications, ed. I.H. Osman and J.P. Kelly (Kluwer, Boston, 1996).Google Scholar
  799. A. Løkketangen and F. Glover, Tabu search for zero-one mixed integer programming problems with advanced level strategies and learning, International Journal of Operations and Quantitative Management 1 (1995), forthcoming.Google Scholar
  800. A. Løkketangen, K. Jörnsten and S. Storoy, Tabu search with a pivot and complement framework, International Transactions in Operational Research 1 (1994) 305.CrossRefGoogle Scholar
  801. C.K. Looi, Neural network methods in combinatorial optimization, Computers and Operations Research 19 (1992) 191.CrossRefGoogle Scholar
  802. H.R. Lourenço, Job shop scheduling. Computational study of local search and large-step optimization methods, European Journal of Operational Research 83 (1995) 347.CrossRefGoogle Scholar
  803. H.R. Lourenço and M. Zwijnenburg, Combining the large-step optimization with tabu-search. Application to the job shop scheduling problem, in:Metaheuristics. Theory and Applications, ed. I.H. Osman and J.P. Kelly (Kluwer, Boston, 1996).Google Scholar
  804. C.B. Lucasius and G. Kateman, Understanding and using genetic algorithms 1. Concepts, properties and context, Chemometrics and Intelligent Laboratory Systems 19 (1993) 1.CrossRefGoogle Scholar
  805. C.B. Lucasius and G. Kateman, Understanding and using genetic algorithms 2. Representation, configuration and hybridization, Chemometrics and Intelligent Laboratory Systems 25 (1994a) 99.CrossRefGoogle Scholar
  806. C.B. Lucasius and G. Kateman, Gates towards evolutionary large-scale optimization. A software-oriented approach to genetic algorithms 1. General perspective, Computers and Chemistry 18 (1994b) 127.CrossRefGoogle Scholar
  807. C.B. Lucasius and G. Kateman, Gates towards evolutionary large-scale optimization. A software-oriented approach to genetic algorithms 2. Toolbox description, Computers and Chemistry 18 (1994c) 137.CrossRefGoogle Scholar
  808. S. Lundy and A. Mees, Convergence of an annealing algorithm, Mathematical Programming 34 (1986) 111.CrossRefGoogle Scholar
  809. H. Lutfiyya, B. McMillin, P. Poshyanonda and C. Dagli, Composite stock cutting through simulated annealing, Mathematical and Computer Modelling 16 (1992) 57.CrossRefGoogle Scholar
  810. J.-L. Lutton and E. Philippart, A simulated annealing algorithm for the computation of marginal costs of telecommunication links, in:Metaheuristics. Theory and Applications, ed. I.H. Osman and J.P. Kelly (Kluwer, Boston, 1996).Google Scholar
  811. J.-L. Lutton and E. Bonomi, Simulated annealing algorithm for the minimum weighted perfect Euclidean matching problem, RAIRO — Operations Research 20 (1986) 177.Google Scholar
  812. A.K. Mackworth and E.C. Freuder, The complexity of constraint satisfaction revisited, Artifical Intelligence 59 (1993) 57.CrossRefGoogle Scholar
  813. A.K. Mackworth, Constraint satisfaction, in:Encyclopedia of Artificial Intelligence, Vol. 1, ed. S.C. Shaprio (Wiley, Chichester, 1992a).Google Scholar
  814. A.K. Mackworth, The logic of constraint satisfaction, Artificial Intelligence 58 (1992b) 3.CrossRefMathSciNetGoogle Scholar
  815. S.W. Mahfoud, Finite Markov chain models of an alternative selection strategy for the genetic algorithm, Complex Systems 7 (1993) 493.Google Scholar
  816. S.W. Mahfoud and D.E. Goldberg, Parallel recombinative simulated annealing. A genetic algorithm, Parallel Computing 21 (1995) 1.CrossRefMathSciNetGoogle Scholar
  817. D. Maio, D. Maltoni and S. Rizzi, Topological clustering of maps using a genetic algorithm, Pattern Recognition Letters 16 (1995) 89.CrossRefGoogle Scholar
  818. A.K. Majhi, L.M. Patnaik and S. Raman, A genetic algorithm-based circuit partitioner for MCMS, Microprocessing and Microprogramming 41 (1995) 83.CrossRefGoogle Scholar
  819. E. Makinen and M. Sieranta, Genetic algorithms for drawing bipartite graphs, International Journal of Computer Mathematics 53 (1994) 157.Google Scholar
  820. B. Malakooti, J. Wang and E.C. Tandler, A sensor-based accelerated approach for multi-attribute machinability and tool life evaluation, International Journal of Production Research 28 (1990) 2373.Google Scholar
  821. B. Malakooti and Y.Q. Zhou, Feedforward artificial neural networks for solving discrete multiple criteria decision making problems, Management Science 40 (1994) 1542.Google Scholar
  822. M. Malek, M. Guruswamy, M. Pandya and H. Owens, Serial and parallel simulated annealing and tabu search algorithms for the traveling salesman problem, Annals of Operations Research 21 (1989) 59.CrossRefGoogle Scholar
  823. C.J. Malmborg, Optimization of cube-per-order index warehouse layouts with zoning constraints, International Journal of Production Research 33 (1995) 465.Google Scholar
  824. C.J. Malmborg, Heuristic, storage space minimisation methods for facility layouts served by looped AGV systems, International Journal of Production Research 32 (1994) 2695.Google Scholar
  825. R.J. Mammone and Y.Y. Zeevi,Neural Networks: Theory and Applications (Academic Press, London, 1991).Google Scholar
  826. J. Mandziuk, Solving then-queens problem with a binary Hopfield type network. Synchronous and asynchronous model, Biological Cybernetics 72 (1995) 439.CrossRefGoogle Scholar
  827. V. Maniezzo, Genetic evolution of the topology and weight distribution of neural networks, IEEE Transactions on Neural Networks 5 (1994) 39.CrossRefGoogle Scholar
  828. V. Maniezzo, M. Dorigo and A. Colorni, ALGODESK. An experimental comparison of eight evolutionary heuristics applied to the quadratic assignment problem, European Journal of Operational Research 81 (1995) 188.CrossRefGoogle Scholar
  829. J.W. Mann, A. Kapsalis and G.D. Smith, The GAmeter toolkit, in:Applications of Modern Heuristic Methods, ed. V.J. Rayward-Smith (Alfred Waller, Henley-on-Thames, 1995).Google Scholar
  830. J.W. Mann and G.D. Smith, A comparison of heuristics for telecommunications traffic routing, in:Modern Heuristic Search Methods, ed. V.J. Rayward-Smith, I.H. Osman, C.R. Reeves and G.D. Smith (Wiley, Chichester, 1996).Google Scholar
  831. N. Mansour, Parallel physical optimization algorithms for allocating data to multicomputer nodes, Journal of Supercomputing 8 (1994) 53.CrossRefGoogle Scholar
  832. N. Mansour and G.C. Fox, Allocating data to distributed memory multiprocessors by genetic algorithms, Concurrency — Practice and Experience 6 (1994) 485.Google Scholar
  833. N. Mansour and G.C. Fox, Allocating data to multicomputer nodes by physical optimization algorithms for loosely synchronous computations, Concurrency — Practice and Experience 4 (1992a) 557.Google Scholar
  834. N. Mansour and G.C. Fox, Parallel physical optimization algorithms for data mapping,Lecture Notes in Computer Science 634 (1992b) p. 91.Google Scholar
  835. R. Marett and M. Wright, A comparison of neighbourhood search techniques for multi-objective combinatorial problems, Working paper, Department of Management Science, University of Lancaster, England (1994).Google Scholar
  836. E. Marinari and G. Parisi, Simulated tempering. A new Monte Carlo scheme, Europhysics Letters 19 (1992) 451.Google Scholar
  837. S.J. Marshall and R.F. Harrison, Optimization and training of feed forward neural networks by genetic algorithms, in:Proceedings of the 2nd IEEE International Conference on Artificial Neural Networks (1991) p. 39.Google Scholar
  838. R. Martí, An aggressive search procedure for the bipartite drawing problem, in:Metaheuristics. Theory and Applications, ed. I.H. Osman and J.P. Kelly (Kluwer, Boston, 1996).Google Scholar
  839. O.C. Martin and S.W. Otto, Combining simulated annealing with local search heuristics, Annals of Operations Research 63 (1996) 57.Google Scholar
  840. O.C. Martin and S.W. Otto, Partitioning of unstructured meshes for load balancing, Concurrency — Practice and Experience 7 (1995) 303.Google Scholar
  841. O.C. Martin, S.W. Otto and E.W. Felten, Large-step Markov chains for the TSP, incorporating local search heuristics, Operations Research Letters 11 (1992) 219.CrossRefMathSciNetGoogle Scholar
  842. O.C. Martin, S.W. Otto and E.W. Felten, Large-step Markov chains for the TSP, Complex Systems 5 (1991) 299.MathSciNetGoogle Scholar
  843. F. Maruyama, Y. Minoda and S. Sawada, A logical framework for constraint programming, Fujitsu Scientific and Technical Journal 30 (1994) 69.Google Scholar
  844. R. Mason, R. Gunst and J. Hess,Statistical Design and Analysis of Experiments (Wiley, Chichester, 1989).Google Scholar
  845. R. Mathar and A. Zilinskas, On global optimization in 2-dimensional scaling, Acta Applicandae Mathematicae 33 (1993) 109.CrossRefMathSciNetGoogle Scholar
  846. R. Mathar and J. Mattfeldt, Channel assignment in cellular radio networks, IEEE Transactions on Vehicular Technology 42 (1993) 647.CrossRefGoogle Scholar
  847. R. Mathieu, L. Pittard and G. Anandalingam, Genetic algorithm based approach to bi-level linear programming, RAIRO — Operations Research 28 (1994) 1.Google Scholar
  848. Y. Matsuyama, Self-organization neural networks and various Euclidean travelling salesman problems, Systems and Computers in Japan 23 (1992) 101.Google Scholar
  849. Y. Matsuyama, Self-organization via competition, co-operation and categorization applied to extended vehicle routing problems, in:Proceedings of the International Joint Conference on Neural Networks, Seattle, WA (1991) p. I-385.Google Scholar
  850. M. Matysiak, Efficient optimization of large join queries using tabu search, Information Sciences 83 (1995) 77.CrossRefGoogle Scholar
  851. T. Mavridou, P.M. Pardalos, L.S. Pitsoulis and M.G.C. Resende, A GRASP for the biquadratic assignment problem, Working paper, AT&T Bell Laboratories, Murray Hill, New Jersey (1995).Google Scholar
  852. E. Mayrand, P. Lefrançois, O. Kettani and M.-H. Jobin, A genetic search algorithm to optimize job sequencing under a technological constraint in a rolling-mill facility, OR Spektrum 17 (1995) 183.CrossRefGoogle Scholar
  853. C. Mazza, Parallel simulated annealing, Random Structures and Algorithms 3 (1992) 139.Google Scholar
  854. S.I. McClean, D.A. Bell and F.J. McErlean, Heuristic methods for the data placement problem, Journal of the Operational Research Society 42 (1991) 767.Google Scholar
  855. S.I. McClean, D.A. Bell and F.J. McErlean, The use of simulated annealing for clustering data in databases, Information Systems 15 (1990) 233.CrossRefGoogle Scholar
  856. C.C. McGeoch, Experimental analysis of algorithms, Ph.D. Dissertation, CMU-CS-87-124, Computer Science Department, Carnegie Mellon University (1986).Google Scholar
  857. I.I. Melamed, Neural networks and combinatorial optimization, Automation and Remote Control 55 (1994) 1553.Google Scholar
  858. J.B.M. Melissen and P.C. Schuur, Packing 16, 17 or 18 circles in an equilateral triangle, Discrete Mathematics 145 (1995) 333.CrossRefGoogle Scholar
  859. F. Menczer and D. Parisi, Evidence of hyperplanes in the genetic learning of neural networks, Biological Cybernetics 66 (1992a) 283.CrossRefPubMedGoogle Scholar
  860. F. Menczer and D. Parisi, Recombination and unsupervised learning. Effects of crossover in the genetic optimization of neural networks, Network — Computation in Neural Systems 3 (1992b) 423.CrossRefGoogle Scholar
  861. F. Menezes and P. Barahona, Heuristics and look-ahead integration to solve constraint satisfaction problems efficiently, Annals of Operations Research 50 (1994) 411.CrossRefGoogle Scholar
  862. W. Mergenthaler, W. Stadler, H. Wilbertz and N. Zimmer, Optimizing automotive manufacturing sequences using simulated annealing and genetic algorithms, Control Engineering Practice 3 (1995) 569.CrossRefGoogle Scholar
  863. P. Meseguer, Constraint satisfaction problems. An overview, AI Communications 2 (1989) 3.Google Scholar
  864. Z. Michalewicz, Evolutionary computation and heuristics, in:Metaheuristics. Theory and Applications, ed. I.H. Osman and J.P. Kelly (Kluwer, Boston 1996).Google Scholar
  865. Z. Michalewicz, Evolutionary computation techniques for non-linear programming problems, International Transactions in Operational Research 1 (1994a) 223.CrossRefGoogle Scholar
  866. Z. Michalewicz, Nonstandard methods in evolutionary computation, Statistics and Computing 4 (1994b) 141.Google Scholar
  867. Z. Michalewicz, A hierarchy of evolution programs. An experimental study, Evolutionary Computation 1 (1993) 51.Google Scholar
  868. Z. Michalewicz,Genetic Algorithms + Data Structures = Evolution Programs (Springer, Berlin, 1992).Google Scholar
  869. Z. Michalewicz, G.A. Vignaux and M. Hobbs, A non-standard genetic algorithm for non-linear transportation problem, ORSA Journal on Computing 3 (1991) 307.Google Scholar
  870. Z. Michalewicz and C. Janikow, GENOCOP. A genetic algorithm for numerical optimization problems with linear constraints, Communications of the ACM (1995), forthcoming.Google Scholar
  871. Z. Michalewicz and C. Janikow, Genetic algorithms for numerical optimization, Statistics and Computing 1 (1993) 75.CrossRefGoogle Scholar
  872. Z. Michalewicz and C.Z. Janikow, Handling constraints in genetic algorithms, in:Proceedings of the 4th International Conference on Genetic Algorithms, ed. R.K. Belew and L.B. Booker (Morgan Kaufmann, San Mateo 1991) p. 151.Google Scholar
  873. P. Michelon, M.D. Cruz and V. Gascon, Using the tabu search for the distribution of supplies in a hospital, Annals of Operations Research 50 (1994) 427.CrossRefGoogle Scholar
  874. L. Miclo, Remarks on ergodicity of simulated annealing algorithms on a graph, Stochastic Processes and their Applications 58 (1995) 329.CrossRefGoogle Scholar
  875. G.F. Miller and P.M. Todd, The role of mate choice in biocomputation. Sexual selection as a process of search, optimization and diversification,Lecture Notes in Computer Science 899 (1995) p. 170.Google Scholar
  876. G.F. Miller, P.M. Todd and S.U. Hedge, Designing neural networks, Neural Networks 4 (1991) 53.CrossRefGoogle Scholar
  877. J.A. Miller, W.D. Potter, R.V. Gandham and C.N. Lapena, An evaluation of local improvement operators for genetic algorithms, IEEE Transactions on Systems, Man and Cybernetics 23 (1993) 1340.CrossRefGoogle Scholar
  878. M. Minagawa and Y. Kakazu, A genetic approach to the line balancing problem, IFIP Transactions B — Applications in Technology 3 (1992) 737.Google Scholar
  879. S. Minton, M.D. Johnston, A.B. Philips and P. Laird, Minimizing conflicts. A heuristic repair method for constraint satisfaction and scheduling problems, Artificial Intelligence 58 (1992) 161.CrossRefMathSciNetGoogle Scholar
  880. V. Miranda, J.V. Ranito and L.M. Proenca, Genetic algorithms in optimal multistage distribution network planning, IEEE Transactions on Power Systems 9 (1994) 1927.CrossRefGoogle Scholar
  881. G. Mirkin, K. Vasudevan, F.A. Cook, W.G. Laidlaw and W.G. Wilson, A comparison of several cooling schedules for simulated annealing implemented on a residual statics problem, Geophysical Research Letters 20 (1993) 77.Google Scholar
  882. M. Mitchell,An Introduction to Genetic Algorithms (The MIT Press, Cambridge, 1996).Google Scholar
  883. M. Mitchell, and J.H. Holland, When will a genetic algorithm outperform hill-climbing?, Working paper, Santa Fe Institute, Santa Fe, New Mexico (1993).Google Scholar
  884. D. Mitra, F. Romeo and A. Sangiovanni-Vincentelli, Convergence and finite-time behavior of simulated annealing, Advances in Applied Probability 18 (1986) 747.Google Scholar
  885. K. Mitsuo, T. Santoso, M. Mas and T. Takashi, An optimization technique with neural networks and its application to a ferry routing,Lecture Notes in Control and Information Sciences 143 (1990) p. 800.Google Scholar
  886. J. Mittenthal, M. Raghavachari and A.I. Rana, A hybrid simulated annealing approach for single machine scheduling problems with nonregular penalty functions, Computers and Operations Research 20 (1993) 103.CrossRefGoogle Scholar
  887. J.V. Moccellin, A new heuristic method for the permutation flow-shop scheduling problem, Journal of the Operational Research Society 46 (1995) 883.Google Scholar
  888. P. Molitor, Layer assignment by simulated annealing, Microprocessing and Microprogramming 16 (1985) 345.CrossRefGoogle Scholar
  889. Y.B. Moon and S.C. Chi, Generalized part family formation using neural network techniques, Journal of Manufacturing Systems 11 (1992) 149.Google Scholar
  890. E.L. Mooney and R.L. Rardin, Tabu search for a class of scheduling problems, Annals of Operations Research 41 (1993) 253.CrossRefGoogle Scholar
  891. L.B. Morales, R. Gardunojuarez and D. Romero, The multiple-minima problem in small peptides revisited. The threshold accepting approach, Journal of Biomolecular Structure and Dynamics 9 (1992) 951.PubMedGoogle Scholar
  892. K. Morizawa, H. Nagasawa and N. Nishiyama, Complex random sample scheduling and its application to anN/M/F/F-max problem, Computers and Industrial Engineering 27 (1994) 23.CrossRefGoogle Scholar
  893. T. Morton and P. Ramnath, Guided forward search in tardiness scheduling of large one machine problems, in:Intelligent Scheduling Systems, ed. D.E. Brown and W.T. Scherer,Operations Research/Computer Science Interfaces 3 (Kluwer, Boston, 1995).Google Scholar
  894. P. Moscato, An introduction to population approaches for optimization and hierarchical objective functions. A discussion on the role of tabu search, Annals of Operations Research 41 (1993) 85.CrossRefGoogle Scholar
  895. P. Moscato and J.F. Fontanari, Stochastic versus deterministic update in simulated annealing, Physics Letters A146 (1990) 204.Google Scholar
  896. H. Mühlenbein, Evolutionary algorithms. Theory and applications, in:Local Search in Combinatorial Optimization, ed. E.H.L. Aarts and J.K. Lenstra (Wiley, Chichester 1996).Google Scholar
  897. H. Mühlenbein, How genetic algorithms really work I. Mutation and hillclimbing, in:Parallel Problem Solving from Nature, PPSN II Proceedings, ed. R. Männer and B. Maderick (North-Holland, Amsterdam, 1992).Google Scholar
  898. H. Mühlenbein, Parallel genetic algorithms, population genetics and combinatorial optimization,Lecture Notes in Artificial Intelligence 565 (1991) p. 398.Google Scholar
  899. H. Mühlenbein, Parallel genetic algorithms, population genetics and combinatorial optimization in:Proceedings of the 3rd International Conference on Genetic Algorithms (Morgan Kaufmann, San Mateo 1989) p. 71.Google Scholar
  900. H. Mühlenbein, M. Gorges-Schleuter and O. Krämer, New solutions to the mapping problem of parallel systems. The evolution approach, Parallel Computing 4 (1987) 269.CrossRefGoogle Scholar
  901. H. Mühlenbein and D. Schlierkamp-Voosen, Analysis of selection, mutation and recombination in genetic algorithms,Lecture Notes in Computer Science 899 (1995) p. 142.Google Scholar
  902. H. Mühlenbein and D. Schlierkamp-Voosen, The science of breeding and its application to the breeder genetic algorithm, Evolutionary Computation 1 (1994) 335.Google Scholar
  903. H. Mühlenbein and D. Schlierkamp-Voosen, Predictive models for the breeder genetic algorithm I. Continuous parameter optimization, Evolutionary Computation 1 (1993) 25.Google Scholar
  904. H. Mühlenbein, M. Schomisch and J. Born, The parallel genetic algorithm as function optimizer, Parallel Computing 17 (1991) 619.CrossRefGoogle Scholar
  905. H. Mühlenbein and H.-M. Voigt, Gene pool recombination in genetic algorithms, in:Metaheuristics. Theory and Applications, ed. I.H. Osman and J.P. Kelly (Kluwer, Boston, 1996).Google Scholar
  906. H. Mulkens, Revisiting the Johnson algorithm for flowshop scheduling with genetic algorithms, IFIP Transactions B — Applications in Technology 15 (1994) 69.Google Scholar
  907. B. Muller and J. Reinhardt,Neural Networks: An Introduction (Springer, Berlin, 1991).Google Scholar
  908. A.T. Murray and R.L. Church, Heuristic solution approaches to operational forest planning problems, OR Spektrum 17 (1995) 193.CrossRefGoogle Scholar
  909. C.V.R. Murthy and G. Srinivasan, Fractional cell-formation in group technology, International Journal of Production Research 33 (1995) 1323.Google Scholar
  910. K.L. Musser, J.S. Dhingra and G.L. Blankenship, Optimization based job shop scheduling, IEEE Transactions on Automatic Control 38 (1993) 808.CrossRefGoogle Scholar
  911. P.M. Mutalik, L.R. Knight, J.L. Blanton and R.L. Wainwright, Solving combinatorial optimization problems using parallel simulated annealing and parallel genetic algorithms, in:Proceedings of the 1991 ACM/IEE Symposium on Applied Computing (1992) p. 1031.Google Scholar
  912. B.A. Nadel, Constraint satisfaction algorithms, Computational Intelligence 5 (1989) 188.Google Scholar
  913. A. Nagar, S.S. Heragu and J. Haddock, A combined branch-and-bound and genetic algorithm based approach for a flowshop scheduling problem, Annals of Operations Research 63 (1996) 397.Google Scholar
  914. R. Nakano and T. Yamada, Conventional genetic algorithms for job shop problems, in:Proceedings of the 4th International Conference on Genetic Algorithms, ed. S. Forrest (Morgan Kaufmann, San Mateo 1991) p. 474.Google Scholar
  915. K. Naphade, S.D. Wu and R.H. Storer, A problem space method for the resource constraint project scheduling problem, Working paper 94T-005, Department of Industrial Engineering, Lehigh University, Bethlehem, PA (1994).Google Scholar
  916. M.M. Nelson and W.T. Illingworth,A Practical Guide to Neural Nets (Addison-Wesley, Wokingham, England, 1991).Google Scholar
  917. G.L. Nemhauser and L.A. Wolsey,Integer and Combinatorial Optimization (Wiley, Chichester, 1988).Google Scholar
  918. J.A. Nestor and G. Krishnamoorthy, SALSA. A new approach to scheduling with timing constraints, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 12 (1993) 1107.CrossRefGoogle Scholar
  919. N.K. Nguyen, An algorithm for constructing optimal resolvable incomplete block designs, Communications in Statistics — Simulation and Computation 22 (1993) 911.Google Scholar
  920. Y. Nishibe, K. Kuwabara, M. Yokoo and T. Ishida, Speed-up and application distributed constraint satisfaction to communication network path assignments, Systems and Computers in Japan 25 (1994) 54.Google Scholar
  921. V. Nissen, Solving the quadratic assignment problem with clues from nature, IEEE Transactions on Neural Networks 5 (1994) 66.CrossRefGoogle Scholar
  922. V. Nissen, Evolutionary algorithms in mangement science. An overiew and list of references, Report No. 9303, Universität Göttingen, Germany (1993).Google Scholar
  923. V. Nissen and H. Paul, A modification of threshold accepting and its application to the quadratic assignment problem, OR Spektrum 17 (1995) 205.CrossRefGoogle Scholar
  924. A. Nix and M. Vose, Modelling genetic algorithms with Markov chains, Annals of Mathematics and Artificial Intelligence 5 (1992) 88.CrossRefGoogle Scholar
  925. S. Nolfi, D. Parisi and J.L. Elman, Learning and evolution in neural networks, Adaptive Behavior 3 (1994) 5.Google Scholar
  926. B.A. Norman and J.C. Bean, Random keys genetic algorithm for job shop scheduling, Working paper 94-5, Department of Industrial and Operations Engineering, The University of Michigan, Ann Arbor (1995).Google Scholar
  927. S. Norre, Task scheduling on a multiprocessor system. Deterministic models and stochastic models, RAIRO — Operations Research 28 (1994) 221.Google Scholar
  928. E. Nowicki and C. Smutnicki, A fast taboo search algorithm for the job shop problem, Working paper, No. 8/93, Institute of Engineering Cybernetics, Technical University of Wroclaw, Poland (1993).Google Scholar
  929. E. Nowicki and C. Smutnicki, A fast taboo search algorithm for the flow shop problem, Working paper, Institute of Engineering Cybernetics, Technical University of Wroclaw, Poland (1994).Google Scholar
  930. W.P.M. Nuijten, Time and resource constrained scheduling: A constraint satisfaction approach, Ph.D. Dissertation, Eindhoven University of Technology, Eindhoven, The Netherlands (1994).Google Scholar
  931. W.P.M. Nuijten and E.H.L. Aarts, A computational study of constraint satisfaction for multiple capacitated job shop scheduling, European Journal of Operational Research (1995), forthcoming.Google Scholar
  932. W.P.M. Nuijten and E.H.L. Aarts, Constraint satisfaction for multiple capacitated job shop scheduling, in:Proceedings of the 11th European Conference on Artificial Intelligence, ed. A. Cohn (Wiley, Chichester, 1994) p. 635Google Scholar
  933. W.P.M. Nuijten, E.H.L. Aarts, D.A.A. Van Erp, K.P. Taalman and K.M. Van Hee, Randomized constraint satisfaction for job scheduling, Working paper, Eindhoven University of Technology, Eindhoven, The Netherlands (1993).Google Scholar
  934. W.P.M. Nuijten, G.M. Kunnen, E.H.L. Aarts and F.P.M. Dignum, Examination timetabling. A case study for constraint satisfaction, in:Proceedings ECAI'94 Workshop on Constraint Satisfaction Issue Raised by Practical Applications (1994) p. 11.Google Scholar
  935. K. Nygard, R. Ficek and R. Sharda, Genetic algorithms, OR/MS Today 19 (1992) 28.Google Scholar
  936. K.E. Nygard, P. Juell and N. Kadaba, Neural networks for selecting vehicle routing heuristics, ORSA Journal on Computing 2 (1990) 353.Google Scholar
  937. K.E. Nygard and C.-H. Yang, Genetic algorithms for the traveling salesman problem with time windows, in:Computer Science and Operations Research, New Developments in their Interfaces, ed. O. Balci, R. Sharda and S.A. Zenios (Pergamon Press, Oxford, 1992).Google Scholar
  938. F.A. Ogbu and D.K. Smith, Simulated annealing for the permutation flowshop problem, Omega 19 (1991) 64.CrossRefGoogle Scholar
  939. F.A. Ogbu and D.K. Smith, The application of the simulated annealing algorithm to the solution of theN/M/CMAX flowshop problem, Computers and Operations Research 17 (1990) 243.CrossRefGoogle Scholar
  940. M. Ohlsson, C. Peterson and B. Soderberg, Neural networks for optimization problems with inequality constraints. The knapsack problem, Neural Computation 5 (1993) 331.Google Scholar
  941. J.C. Oliveira, J.S. Ferreira and R.V.V. Vidal, Solving real-life combinatorial optimization problems using simulated annealing, Belgian Journal of Operations Research, Statistics and Computer Science 33 (1993) 49.Google Scholar
  942. I.M. Oliver, D.J. Smith and J.R.C. Holland, A study of permulation crossover operators on the traveling salesman problem, in:Proceedings of the 2nd International Conference on Genetic Algorithms, ed. J.J. Grefenstette (Lawrence Erlbaum Associates, Pittsburgh, 1987) p. 224.Google Scholar
  943. S. Openshaw and L. Rao, Algorithms for reengineering 1991 census geography, Environment and Planning A 27 (1995) 425.PubMedGoogle Scholar
  944. D. Orvosh and L. Davis, Shall we repair? Genetic algorithms, combinatorial optimization and feasibility constraints, in:Proceedings of the 5th International Conference on Genetic Algorithms, ed. S. Forrest (Morgan Kaufmann, San Mateo, 1993) p. 650.Google Scholar
  945. I.H. Osman, An introduction to metaheuristics, in:Operational Research Tutorial Papers, ed. M. Lawrence and C. Wilson (Operational Research Society Press, Birmingham, 1995a).Google Scholar
  946. I.H. Osman, Heuristics for the generalized assignment problem. Simulated annealing and tabu search approaches, OR Spektrum 17 (1995b) 211.CrossRefGoogle Scholar
  947. I.H. Osman, Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problems, Annals of Operations Research 41 (1993a) 421.CrossRefGoogle Scholar
  948. I.H. Osman, Heuristics for combinatorial optimization problems. Development and new directions, in:Proceedings of the Second Conference on Information Technology and Applications, ed. K. Hafeez, M.A. Wani and K.S. Jomaa (AMR Publishing, Swansea, 1993b) p. 1.Google Scholar
  949. I.H. Osman, Metastrategy simulated annealing and tabu search algorithms for combinatorial optimization problems, Ph.D. Thesis, The Management School, Imperial College, London (1991).Google Scholar
  950. I.H. Osman and N. Christofides, Capacitated clustering problems by hybrid simulated annealing and tabu search, International Transactions in Operational Research 1 (1994) 317.CrossRefGoogle Scholar
  951. I.H. Osman and J.P. Kelly, Metaheuristics. An overview, in:Metaheuristics. Theory and Applications, ed. I.H. Osman and J.P. Kelly (Kluwer, Boston, 1996a).Google Scholar
  952. I.H. Osman and J.P. Kelly,Metaheuristics. Theory and Applications (Kluwer, Boston, 1996b).Google Scholar
  953. I.H. Osman and C.N. Potts, Simulated annealing for permutation flowshop scheduling, Omega 17 (1989) 551.CrossRefGoogle Scholar
  954. I.H. Osman and S. Salhi, Local search strategies for the mix fleet vehicle routing problem, in:Modern Heuristic Search Methods, ed. V.J. Rayward-Smith, I.H. Osman, C.R. Reeves and G.D. Smith (Wiley, Chichester, 1996).Google Scholar
  955. P.R.J. Ostergard, New upper bounds for the football pool problem for 11 and 12 matches, Journal of Combinatorial Theory Series A 67 (1994) 161.CrossRefGoogle Scholar
  956. A. Ostermeier, An evolutionary strategy with momentum adaptation of the random number distribution, in:Parallel Problem Solving from Nature, PPSN II Proceedings, ed. R. Männer and B. Manderick (North-Holland, Amsterdam, 1992).Google Scholar
  957. R.H.J.M. Otten and L.P.P.P. van Ginneken,The Annealing Algorithm (Kluwer, Boston, 1989).Google Scholar
  958. S. Ottner, Genetic algorithms at Channel-4, Expert Systems 11 (1994) 47.Google Scholar
  959. R. Padman, Choosing solvers in decision support systems. A neural network application in resource-constrained project scheduling, in:Recent Developments in Decision Support Systems (Springer, Berlin, 1993) p. 559.Google Scholar
  960. L. Painton and J. Campbell, Genetic algorithms in optimization of system reliability, IEEE Transactions on Reliability 44 (1995) 172.CrossRefGoogle Scholar
  961. L. Painton and U. Diwekar, Stochastic annealing for synthesis under uncertainty, European Journal of Operational Research 83 (1995) 489.CrossRefGoogle Scholar
  962. R. Pakath and J.S. Zaveri, Specifying critical inputs in a genetics driven decision support system: An automated facility, Working paper, Department of Decision Science and Information Systems, College of Business and Economics, University of Kentucky, Lexington (1993).Google Scholar
  963. K.F. Pal and D. Bhandari, Selection of optimal set of weights in a layered network using genetic algorithms, Information Sciences 80 (1994) 213.CrossRefGoogle Scholar
  964. K.F. Pal, Genetic algorithms for the traveling salesman problem based on a heuristic crossover operation, Biological Cybernetics 69 (1993) 539.CrossRefGoogle Scholar
  965. J. Pannetier, Simulated annealing. An introductory review, Institute of Physics Conference Series 107 (1990) 23.Google Scholar
  966. C.H. Papadimitriou, The complexity of the Lin-Kernighan heuristic for the traveling salesman problem, SIAM Journal on Computing 21 (1992) 450.CrossRefGoogle Scholar
  967. C.H. Papadimitriou and K. Steiglitz,Combinatorial Optimization. Algorithms and Complexity (Prentice-Hall, Englewood Cliffs, 1982).Google Scholar
  968. P.M. Pardalos, L. Pitsoulis, T. Mavridou and M.G.C. Resende, Parallel search for combinatorial optimization. Genetic algorithms, simulated annealing and GRASP,Lecture Notes in Computer Science 980 (1995) p. 317.Google Scholar
  969. P.M. Pardalos, L.S. Pitsoulis and M.G.C. Resende, A parallel GRASP implementation for the quadratic assignment problem, in:Parallel Algorithms for Irregularly Structured Problems, Irregular'94, ed. A. Ferreira and J. Rolim (Kluwer, Boston, 1995a).Google Scholar
  970. P.M. Pardalos, L.S. Pitsoulis and M.G.C. Resende,Fortran subroutines for approximate solution of sparse quadratic assignment problems using GRASP, Working paper, AT&T Bell Laboratories, Murray Hill, New Jersey (1995b).Google Scholar
  971. P.M. Pardalos and J. Xue, The maximum clique problem, Journal of Global Optimization 4 (1994) 301.CrossRefGoogle Scholar
  972. J. Paredis, Exploiting constraints as background knowledge for genetic algorithms. A case study, in:Parallel Problem Solving from Nature, PPSN II Proceedings, ed. R. Männer and B. Manderick (North-Holland, Amsterdam, 1992).Google Scholar
  973. K. Park and B. Carter, On the effectiveness of genetic search in combinatorial optimization, in:Proceedings of the 10th ACM Symposium on Applied Computing, GA and Optimization Track (1995) p. 329.Google Scholar
  974. V. Paschos, F. Pekergin and V. Zissimopoulos, Approximating the optimal solution of some hard graph problems by a Boltzmann machine, Belgian Journal of Operations Research, Statistics and Computer Science 33 (1993) 119.Google Scholar
  975. J. Paulli, A computational comparison of simulated annealing and tabu search applied to the quadratic assignment problem, Time-New York- 396 (1993) 85.Google Scholar
  976. J. Pearl,Heuristics: Intelligent Search Strategies for Computer Problem Solving (Addison-Wesley, Wokingham, England, 1984).Google Scholar
  977. J.F. Pekny and D.I. Miller, Exact solution of the no-wait flowshop scheduling problem with a comparison to heuristic methods, Computers and Chemical Engineering 15 (1991) 741.CrossRefGoogle Scholar
  978. M.P. Pensini, G. Mauri and F. Gardin, Flowshop and TSP,Lecture Notes in Artificial Intelligence 565 (1991) p. 157.Google Scholar
  979. S.J. Perantonis and D.A. Karras, An efficient constrained learning algorithm with momentum acceleration, Neural Networks 8 (1995) 237.CrossRefGoogle Scholar
  980. E. Pesch, Machine learning by schedule decomposition, Working Paper RM 93-045, Faculty of Economics and Business Administration, University of Limburg, The Netherlands (1993).Google Scholar
  981. E. Pesch and S. Voß, Applied local search. A prologue. Strategies with memories. Local search in application oriented environment, OR Spektrum 17 (1995) 55.CrossRefGoogle Scholar
  982. C. Peterson, Solving optimization problems with mean-field methods, Physica A200 (1993) 570.Google Scholar
  983. C. Peterson, Parallel distributed approaches to combinatorial optimization. Benchmark studies on travelling salesman problem, Neural Computation 2 (1990) 261.Google Scholar
  984. C. Peterson and B. Soderberg, A new method for mapping optimization problems onto neural networks, International Journal of Neural Systems 1 (1989) 3.CrossRefGoogle Scholar
  985. C. Peterson and J.R. Anderson, Neural network and NP-complete optimization problems. A performance study on the graph bisection problem, Complex Systems 2 (1988) 59.Google Scholar
  986. C.B. Petley and M.R. Lutze, A theoretical investigation of a parallel genetic algorithm, in:Proceedings of the 3rd International Conference on Genetic Algorithms, ed. J.D. Schaffer (Morgan Kaufmann, San Mateo, 1989) p. 398.Google Scholar
  987. C.B. Petley, M.R. Lutze and J.J. Grefenstette, A parallel genetic algorithm in:Proceedings of the 2nd International Conference on Genetic Algorithms, ed. J.J. Grefenstette (Lawrence Erlbaum Associates, Pittsburgh, 1987) p. 155.Google Scholar
  988. E. Peyrol, P. Floquet, L. Pibouleau and S. Domenech, Scheduling and simulated annealing application to a semiconductor circuit fabrication plant, Computers and Chemical Engineering 17 (1993) 39.CrossRefGoogle Scholar
  989. D.T. Pham and H.H. Onder, A knowledge-based system for optimizing workplace layouts using a genetic algorithm, Ergonomics 35 (1992) 1479.Google Scholar
  990. P.R. Philipoom, L.P. Pees and L. Wiegmann, Using neural networks to determine internally set due-date assignments for shop scheduling, Decision Sciences 26 (1995) 2.Google Scholar
  991. M. Piccioni, A combined multistart annealing algorithm for continuous global optimization, Computers and Mathematics with Applications 21 (1991) 173.CrossRefGoogle Scholar
  992. S. Pierre, M.A. Hyppolite, J.-M. Bourjolly and O. Dioume, Topological design of computer communication networks using simulated annealing, Engineering Applications of Artificial Intelligence 8 (1995) 61.CrossRefGoogle Scholar
  993. H. Pirkul and E. Rolland, New heuristic solution procedures for the uniform graph partitioning problem, in:Computer Science and Operations Research, New Developments in their Interfaces, ed. O. Balci, R. Sharda and S.A. Zenios (Pergamon Press, Oxford, 1992).Google Scholar
  994. M. Pirlot, General local search heuristics in combinatorial optimization. A tutorial, Belgian Journal of Operations Research, Statistics and Computer Science 32 (1993) 7.Google Scholar
  995. S. Poljak, Integer linear programs and local search for max-cut, SIAM Journal on Computing 24 (1995) 822.CrossRefGoogle Scholar
  996. J. Popovic, Vehicle routing in the case of uncertain demand. A Bayesian approach, Transportation Planning and Technology 19 (1995) 19.Google Scholar
  997. S.C.S. Porto and C.C. Ribeiro, A tabu search approach to task scheduling on heterogeneous processors under precedence constraints, The International Journal of High Speed Computing 7 (1995), forthcoming.Google Scholar
  998. C.N. Potts and L.N. van Wassenhove, Single machine tardiness sequencing heuristics, IIE Transactions 23 (1991) 346.Google Scholar
  999. J.-Y. Potvin, Genetic algorithms for the travelling salesman problem, Annals of Operations Research 63 (1996) 339.Google Scholar
  1000. J.-Y. Potvin, Neural networks state-of-the-art survey. The travelling salesman problem, ORSA Journal on Computing 5 (1993) 328.Google Scholar
  1001. J.-Y. Potvin and S. Bengio, A genetic approach to the vehicle routing problem with time windows, ORSA Journal on Computing (1996), forthcoming.Google Scholar
  1002. J.-Y. Potvin and F. Guertin, The clustered traveling salesman problem: A genetic approach, in:Metaheuristics. Theory and Applications, ed. I.H. Osman and J.P. Kelly (Kluwer, Boston, 1996).Google Scholar
  1003. J.-Y. Potvin, T. Kervahut, B.L. Garcia and J.-M. Rousseau, A tabu search heuristic for the vehicle routing problem with time windows, ORSA Journal on Computing (1996), forthcoming.Google Scholar
  1004. J.-Y. Potvin and C. Robillard, Clustering for vehicle routing with a competitive neural network, Neurocomputing 8 (1995) 125.CrossRefGoogle Scholar
  1005. J.-Y. Potvin and C. Robillard, Integrating operations research and neural networks for vehicle routing, in:The Impact of Emerging Technologies on Computer Science and Operations Research, ed. S.G. Nash and A. Sofer,Operations Research/Computer Science Interfaces 4 (Kluwer, Boston, 1995).Google Scholar
  1006. J.-Y. Potvin and J.-M. Rousseau, Constraint directed search for the advanced requesy dial-a-ride problem with service quality constraint, in:Computer Science and Operations Research, New Developments in their Interfaces, ed. O. Balci, R. Sharda and S.A. Zenios (Pergamon Press, Oxford, 1992).Google Scholar
  1007. M. Prakash and M.N. Murty, A genetic approach for selection of (near) optimal subsets of principal components for discrimination, Pattern Recognition Letters 16 (1995) 781.CrossRefGoogle Scholar
  1008. W.H. Press, S.A. Teukolsky, W.T. Vetterling and B.P. Flannery,Numerical Recipe in C (Fortran orPascal).The Art of Scientific Computing (Cambridge University Press, Cambridge, 1992).Google Scholar
  1009. C.C. Price and P.M. Shah, Optimization by simulated annealing. Experimental application to quadratic assignment problems, Texas Journal of Science 42 (1990) 215.Google Scholar
  1010. C. Prins, Two scheduling problems in satellite telecommunications, RAIRO — Operations Research 25 (1991) 341.Google Scholar
  1011. P. Prosser, Hybrid algorithms for the constraint satisfaction problem, Computational Intelligence 9 (1993) 268.Google Scholar
  1012. A. Prugelbennet and J.L. Shapiro, Analysis of genetic algorithms using statistical mechanics, Physical Review Letters 72 (1994) 1305.CrossRefPubMedGoogle Scholar
  1013. J.-F. Puget, On the satisfiability of symmetrical constrained satisfaction problems, Working paper, ILOG SA, Gentilly, France (1993)Google Scholar
  1014. J.-F. Puget, Object oriented constraint programming for transportation problems, Working paper, ILOG SA, Gentilly, France (1992).Google Scholar
  1015. A.P. Punnen and Y.P. Aneja, A tabu search algorithm for the resource constrained assignment problem, Journal of the Operational Research Society 46 (1995) 214.Google Scholar
  1016. A.P. Punnen and Y.P. Aneja, Categorized assignment scheduling. A tabu search approach, Journal of the Operational Research Society 44 (1993) 673.Google Scholar
  1017. B. Purohit, T. Clark and T. Richards, Techniques for routing and scheduling services on a transmission network, BT Technology Journal 13 (1995) 64.Google Scholar
  1018. X.F. Qi and F. Palmieri, Theoretical analysis of evolutionary algorithms with an infinite population size in continuous space 1. Basic properties of selection and mutation, IEEE Transactions on Neural Networks 5 (1994a) 102.CrossRefGoogle Scholar
  1019. X.F. Qi and F. Palmieri, Theoretical analysis of evolutionary algorithms with an infinite population size in continuous space 2. Analysis of the diversification role of crossover, IEEE Transactions on Neural Networks 5 (1994b) 120.CrossRefGoogle Scholar
  1020. F. Qian and H. Hirata, A parallel computation based on mean-field theory for combinatorial optimization and Boltzmann machines, Systems and Computers in Japan 24 (1994) 86.Google Scholar
  1021. T.S. Raghu and C. Rajendran, Due-date setting methodologies based on simulated annealing. An experimental study in a real-life job-shop, International Journal of Production Research, 33 (1995) 2535.Google Scholar
  1022. S. Rajasekaran and J.H. Reif, Nested annealing. A provable improvement to simulated annealing, Theoretical Computer Science 99 (1992) 157.CrossRefGoogle Scholar
  1023. J. Ramanujam and P. Sadayappan, Mapping combinatorial optimization problems onto neural networks, Information Sciences 82 (1995) 239.CrossRefGoogle Scholar
  1024. R.L. Rao and S.S. Iyengar, Bin packing by simulated annealing, Computers and Mathematics with Applications 27 (1994) 71.CrossRefMathSciNetGoogle Scholar
  1025. R.L. Rardin and M. Sudit, Paroid search. Generic local combinatorial optimization, Discrete Applied Mathematics 43 (1993) 155.CrossRefGoogle Scholar
  1026. C.P. Ravikumar, Parallel search-and-learn technique for solving large-scale traveling sales-person problems, Knowledge-Based Systems 7 (1994) 169.CrossRefGoogle Scholar
  1027. C.P. Ravikumar, Parallel techniques for solving large-scale traveling salesperson problems, Microprocessors and Microsystems 16 (1992) 149.CrossRefGoogle Scholar
  1028. C.P. Ravikumar and L.M. Patnaik, Performance improvement of simulated annealing algorithms, Computer Systems Science and Engineering 5 (1990) 111.Google Scholar
  1029. C.P. Ravikumar and N. Vedi, Heuristic and neural algorithms for mapping tasks to a reconfigurable array, Microprocessing and Microprogramming 41 (1995) 137.CrossRefGoogle Scholar
  1030. V.J. Rayward-Smith, I.H. Osman, C.R. Reeves and G.D. Smith,Modern Heuristic Search Methods (Wiley, Chichester, 1996).Google Scholar
  1031. V.J. Rayward-Smith,Applications of Modern Heuristic Methods (Alfred Waller, Henley-on-Thames, 1995a).Google Scholar
  1032. V.J. Rayward-Smith, A unified approach to tabu search, simulated annealing and genetic algorithms, in:Applications of Modern Heuristic Methods, ed. V.J. Rayward-Smith (Alfred Waller, Henley-on-Thames, 1995b).Google Scholar
  1033. S. Rees and R.C. Ball, Criteria for an optimum simulated annealing schedule for problems of the traveling salesman type, Journal of Physics A — Mathematical and General 20 (1987) 1239.CrossRefGoogle Scholar
  1034. C.R. Reeves, Hybrid genetic algorithms for bin-packing and related problems, Annals of Operations Research 63 (1996a) 371.Google Scholar
  1035. C.R. Reeves, Modern heuristic techniques, in:Modern Heuristic Search Methods, ed. V.J. Rayward-Smith, I.H. Osman, C.R. Reeves and G.D. Smith (Wiley, Chichester, 1996b).Google Scholar
  1036. C.R. Reeves, A genetic algorithm for flowshop sequencing, Computers and Operations Research 22 (1995a) 5.CrossRefGoogle Scholar
  1037. C.R. Reeves, Genetic algorithms and combinatorial optimization, in:Applications of Modern Heuristic Methods, ed. V.J. Rayward-Smith (Alfred Waller, Henley-on-Thames, 1995b).Google Scholar
  1038. C.R. Reeves, Heuristics for scheduling a single-machine subject to unequal job release times, European Journal of Operational Research 80 (1995c) 397.CrossRefGoogle Scholar
  1039. C.R. Reeves,Modern Heuristic Techniques for Combinatorial Problems (Blackwell, Oxford, 1993a).Google Scholar
  1040. C.R. Reeves, Improving the efficiency of tabu search for machine sequencing problems, Journal of the Operational Research Society 44 (1993b) 375.Google Scholar
  1041. C.R. Reeves and C. Höln, Integrating local search into genetic algorithms, in:Modern Heuristic Search Methods, ed. V.J. Rayward-Smith, I.H. Osman, C.R. Reeves and G.D. Smith (Wiley, Chichester, 1996).Google Scholar
  1042. C. Rego and C. Roucairol, A parallel tabu search algorithm using ejection chains for the vehicle routing problem, in:Metaheuristics. Theory and Applications, ed. I.H. Osman and J.P. Kelly (Kluwer, Boston, 1996).Google Scholar
  1043. C. Rego and C. Roucairol, Using tabu search for solving a dynamic multiterminal truck dispatching problem, European Journal of Operational Research 83 (1995) 411.CrossRefGoogle Scholar
  1044. R. Rego and C. Roucairol, An efficient implementation of ejection chain procedures for the vehicle routing problem, Working paper RR-94/44, Laboratoire PRiSM, Université de Versailles, France (1994).Google Scholar
  1045. J. Renaud, G. Laporte and F.F. Boctor, A tabu search for the multi-depot vehicle routing problem, Computers and Operations Research 23 (1996) 229.CrossRefGoogle Scholar
  1046. M.G.C. Resende and T.A. Feo, A GRASP for satisfiability, in:The Second DIMACS Implementation Challenge, ed. M.A. Trick,DIMACS Series on Discrete Mathematics and Theoretical Computer Science (American Mathematical Society, 1995).Google Scholar
  1047. M.G.C. Resende, P.M. Pardalos and Y. Li,Fortran subroutines for approximate solution of dense quadratic assignment problems using GRASP, ACM Transactions on Mathematical Software (1995), forthcoming.Google Scholar
  1048. M.G.C. Resende and C.C. Ribeiro, A GRASP for graph planarization, Working paper, AT&T Bell Laboratories, Murray Hill, New Jersey (1995).Google Scholar
  1049. R.G. Reynolds, Z. Michalewicz and M. Cavaretta, Using cultural algorithms for constraints handling in Genocop, in:Proceedings of the 4th Annual Conference on Evolutionary Programming (San Diego, CA, 1995).Google Scholar
  1050. T. Richards, Y. Jiang and B. Richards, NG-backmarking. An algorithm for constraint satisfaction, BT Technology Journal 13 (1995) 102.Google Scholar
  1051. J.T. Richardson, M.R. Palmer and G. Liepins, Some guidelines for genetic algorithms with penalty functions, in:Proceedings of the 3rd International Conference on Genetic Algorithms, ed. J.D. Shaffer (Morgan Kaufmann, San Mateo, 1989) p. 191.Google Scholar
  1052. B. Robic and J. Silc, Algorithm mapping with parallel simulated annealing, Computers and Artificial Intelligence 14 (1995) 339.Google Scholar
  1053. G. Robinson and P. McIlroy, Exploring some commercial applications of genetic programming,Lecture Notes in Computer Science 993 (1995), forthcoming.Google Scholar
  1054. F. Robuste and C.F. Daganzo, Centralized hub-terminal geometric concepts 2. Baggage and extensions, Journal of Transportation Engineering-ASCE 117 (1991) 159.Google Scholar
  1055. A.F. Rocha, Neural nets. A theory for brains and machines,Lecture Notes in Artificial Intelligence 638 (1992) p. 5.Google Scholar
  1056. Y. Rochat and E.D. Taillard, Probabilistic diversification and intensification in local search for vehicle routing, Journal of Heuristics 1 (1995) 147.Google Scholar
  1057. Y. Rochat and F. Semet, A tabu search approach for delivering pet food and flour in Switzerland, Journal of the Operational Research Society 45 (1994) 1233.Google Scholar
  1058. E. Rolland, Abstract heuristic search methods for graph partitioning, Ph.D. Dissertation, The Ohio State University, Columbus (1991).Google Scholar
  1059. E. Rolland, D.A. Schilling and J.R. Current, An efficient tabu search procedure for the P-median problem, Working paper, Graduate School of Management, University of California at Riverside, CA (1993).Google Scholar
  1060. E. Rolland, H. Pirkul and F. Glover, Tabu search for graph partitioning, Annals of Operations Research 63 (1996) 209.Google Scholar
  1061. H.E. Romelin and R.L. Smith, Simulated annealing for constrained global optimization, Journal of Global Optimization 5 (1994) 101.CrossRefGoogle Scholar
  1062. F. Romeo and A. Sangiovanni-Vincentelli, A theoretical framework for simulated annealing, Algorithmica 6 (1991) 302.CrossRefGoogle Scholar
  1063. J.S. Rose, W.M. Snelgrove and Z.G. Vranesic, Parallel standard cell placement algorithms with quality equivalent to simulated annealing, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 7 (1988) 387.CrossRefGoogle Scholar
  1064. K. Rose, E. Gurewitz and G.C. Fox, Constrained clustering as an optimization method, IEEE Transactions on Pattern Analysis and Machine Intelligence 15 (1993) 785.CrossRefGoogle Scholar
  1065. P. Ross and D. Corne, Comparing genetic algorithms, simulated annealing, and stochastic hillclimbing on timetabling problems,Lecture Notes in Computer Science 993 (1995), forthcoming.Google Scholar
  1066. P. Rousselragot, N. Kouicem and G. Dreyfus, Error-free parallel implementation of simulated annealing,Lecture Notes in Computer Science 496 (1991) p. 231.Google Scholar
  1067. P. Rousselragot and G. Dreyfus, A problem independent parallel implementation of simulated annealing. Models and experiments, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 9 (1990) 827.CrossRefGoogle Scholar
  1068. G. Rudolph, Convergence analysis of canonical genetic algorithms, IEEE Transactions on Neural Networks 5 (1994) 96.CrossRefGoogle Scholar
  1069. G. Ruppeiner, J.M. Pedersen and P. Salamon, Ensemble approach to simulated annealing, Journal de Physique I 1 (1991) 455.CrossRefGoogle Scholar
  1070. R.A. Russell, Hybrid heuristics for the vehicle routing problem with time windows, Transportation Science 29 (1995) 156.Google Scholar
  1071. R.A. Rutenbar, Simulated annealing algorithms. An overview, IEEE Circuits and Devices Magazine 5 (1989) 19.CrossRefGoogle Scholar
  1072. J. Ryan, The depth and width of local minima in discrete solution spaces, Discrete Applied Mathematics 56 (1995) 75.CrossRefGoogle Scholar
  1073. Y.G. Saab, A fast and robust network bisection algorithm, IEEE Transactions on Computers 44 (1995) 903.CrossRefGoogle Scholar
  1074. Y.G. Saab and V. Rao, Combinatorial optimization by stochastic evolution, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 10 (1991a) 525.CrossRefGoogle Scholar
  1075. Y.G. Saab and V. Rao, A stochastic algorithm for circuit bi-partitioning,Lecture Notes in Computer Science 507 (1991b) p. 313.Google Scholar
  1076. N.M. Sadeh and S.R. Thangiah, Learning to recognize (un)promising simulated annealing runs. Efficient search procedures for job shop scheduling and vehicle routing, in:Metaheuristics. Theory and Applications, ed. I.H. Osman and J.P. Kelly (Kluwer, Boston, 1996).Google Scholar
  1077. N.M. Sadeh and Y. Nakakuki, Focused simulated annealing search. An application to job shop scheduling, Annals of Operations Research 63 (1996) 77.Google Scholar
  1078. A. Sakamoto, X.Z. Liu and T. Shimamoto, A modified genetic channel router, IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences E77A (1994) 2076.Google Scholar
  1079. S. Salhi and M. Sari, A heuristic approcah for the multi-depot vehicle fleet mix problem, Working paper, School of Mathematics and Statistics, University of Birmingham, England (1995).Google Scholar
  1080. G.H. Sasaki and B. Hajek, The time complexity of maximum matching by simulated annealing, Journal of the Association for Computing Machinery 35 (1988) 387.Google Scholar
  1081. T. Satake, K. Morikawa and N. Nakamura, Neural network approach for minimizing the make-span of the general job shop, International Journal of Production Economics 33 (1994) 67.CrossRefGoogle Scholar
  1082. T. Satoh and K. Nara, Maintenance scheduling by using simulated annealing method, IEEE Transactions on Power Systems 6 (1991) 850.CrossRefGoogle Scholar
  1083. J.E. Savage and M.G. Wloka, Parallelism in graph partitioning, Journal of Parallel and Distributed Computing 13 (1991) 257.CrossRefGoogle Scholar
  1084. J.D. Schaffer,Proceedings of the Third International Conference on Genetic Algorithms (Morgan Kaufmann, San Mateo, 1989).Google Scholar
  1085. J.D. Schaffer, R.A. Carnana and L.J. Eshelman, Combinations of genetic algorithms and neural networks. A survey of the state of the art, in:Proceedings of the International Workshops on Combinations of Genetic Algorithms and Neural Networks, COGANN-92 (1992) p. 1.CrossRefGoogle Scholar
  1086. J.D. Schaffer and L.J. Eshelman, Combinatorial optimization by genetic algorithms: The value of the genotype/phenotype distinction, in:Modern Heuristic Search Methods, ed. V.J. Rayward-Smith, I.H. Osman, C.R. Reeves and G.D. Smith (Wiley, Chichester, 1996).Google Scholar
  1087. W.T. Scherer and F. Rotman, Combinatorial optimization techniques for spacecraft scheduling automation, Annals of Operations Research 50 (1994) 525.CrossRefGoogle Scholar
  1088. L.J. Schmitt, An empirical computational study of genetic algorithms to solve order based problems. An emphasis on TSP and VRPTC, Ph.D. Dissertation, Department of Management Information Systems and Decision Sciences, University of Memphis, Tennessee (1994).Google Scholar
  1089. L.J. Schmitt and M.M. Amini, Genetic algorithmic approaches to travelling salesman problem. Design and configuration issues, Working paper, Department of Information Technology Management, Christian Brothers University, Memphis, Tennessee (1995a).Google Scholar
  1090. L.J. Schmitt and M.M. Amini, Performance characteristics of alternative genetic algorithmic approaches to the travelling salesman problem: A rigorous empirical study, Working paper, Department of Information Technology Management, Christian Brothers University, Memphis, Tennessee (1995b).Google Scholar
  1091. A. Schober, M. Thuerk and M. Eigen, Optimization by hierarchical mutant production, Biological Cybernetics 69 (1993) 493.CrossRefPubMedGoogle Scholar
  1092. M. Schoenauer and S. Xanthakis, Constrained GA optimization, in:Proceedings of the 5th International Conference on Genetic Algorithms, ed. S. Forrest (Morgan Kaufmann, San Mateo, 1993) p. 573.Google Scholar
  1093. A.C. Schultz, J.J. Grefenstette and K.A. DeJong, Test and evaluation by genetic algorithms, IEEE Expert-Intelligent Systems and Their Applications 8 (1993) 9.Google Scholar
  1094. L.L. Schumaker, Computing optimal triangulations using simulated annealing, Computer-Aided Geometric Design 10 (1993) 329.CrossRefGoogle Scholar
  1095. H.-P. Schwefel,Numerical Optimization for Computer Models (Wiley, Chichester, 1981).Google Scholar
  1096. H.-P. Schwefel and R. Männer,Parallel Problem Solving From Nature, PPSN 1 Proceedings, Lecture Notes in Computer Science 496 (Springer, Berlin, 1991).Google Scholar
  1097. R.S. Segall, Some mathematical and computer modeling of neural networks, Applied Mathematical Modelling 19 (1995) 386.CrossRefGoogle Scholar
  1098. D.A. Sekharan and R.L. Wainwright, Manipulating subpopulations in genetic algorithms for solving theK-way graph partitioning problem, in:Proceedings of the 7th Oklahoma Symposium on Artificial Intelligence (Stillwater, 1993) p. 215.Google Scholar
  1099. D.A. Sekharan and R.L. Wainwright, Manipulating subpopulations of feasible and infeasiblesolutions in genetic algorithms, in: Proceedings of the ACM/SIGAPP Symposium on Applied Computing (Indianapolis, 1993) p. 118.Google Scholar
  1100. S.Z. Selim and K. Alsultan, A simulated annealing algorithm for the clustering problem, Pattern Recognition 24 (1991) 1003.CrossRefGoogle Scholar
  1101. S. Selvakumar and C.S.R. Murthy, An efficient heuristic algorithm for mapping parallel programs onto multicomputers, Microprocessing and Microprogramming 36 (1993) 83.CrossRefGoogle Scholar
  1102. F. Semet and E.D. Taillard, Solving real-life vehicle routing problems efficiently using tabu search, Annals of Operations Research 41 (1993) 469.CrossRefGoogle Scholar
  1103. K. Shahookar and P. Mazumder, VLSI cell placement techniques, Computing Surveys 23 (1991) 143.CrossRefGoogle Scholar
  1104. J.S. Shang, Multicriteria facility layout problem. An integrated approach, European Journal of Operational Research 66 (1993) 291.CrossRefGoogle Scholar
  1105. B.A. Shapiro and J. Navetta, A massively parallel genetic algorithm for RNA secondary structure prediction, Journal of Supercomputing 8 (1994) 195.CrossRefGoogle Scholar
  1106. J.A. Shapiro and A.S. Alfa, An experimental analysis of the simulated annealing algorithm for a single-machine scheduling problem, Engineering Optimization 24 (1995) 79.Google Scholar
  1107. Y.M. Sharaiha, M. Gendreau, G. Laporte and I.H. Osman, A tabu search algorithm for the capacitated minimum spanning tree problem, Working paper, CRT-95-79, Centre de recherche sur les transports, Montréal (1995).Google Scholar
  1108. R. Sharda, Neural networks for the MS/OR analyst. An application bibliography, Interfaces 24 (1994) 116.Google Scholar
  1109. R. Sharda, Statistical applications of neural networks, Intelligent Systems Report 8 (1991) 12.Google Scholar
  1110. R. Sharda, Neural nets for operations research, Intelligent Systems Report 9 (1992) 14.Google Scholar
  1111. R. Sharda and R. Patil, Connectionist approach to time series prediction. An empirical test, Journal of Intelligent Manufacturing 3 (1992) 317.CrossRefGoogle Scholar
  1112. P.K. Sharpe, A.G. Chalmers and A. Greenwood, Genetic algorithms for generating minimum path configurations, Microprocessors and Microsystems 19 (1995) 9.CrossRefGoogle Scholar
  1113. R. Sharpe and B.S. Marksjo, Solution of the facilities layout problem by simulated annealing, Computers Environment and Urban Systems 11 (1986) 147.CrossRefGoogle Scholar
  1114. G.B. Sheble and K. Brittig, Refined genetic algorithm. Economic dispatch example, IEEE Transactions on Power Systems 10 (1995) 117.CrossRefGoogle Scholar
  1115. S. Shekhar and M.B. Amin, Generalization by neural networks, IEEE Transactions on Knowledge and Data Engineering 4 (1992) 177.CrossRefGoogle Scholar
  1116. R.P. Sheridan and S.K. Kearsley, Using a genetic algorithm to suggest combinatorial libraries, Journal of Chemical Information and Computer Sciences 35 (1995) 310.CrossRefGoogle Scholar
  1117. P.H. Shih and W.S. Feng, An analog neural network approach to global routing problem, Cybernetics and Systems 22 (1991) 747.MathSciNetGoogle Scholar
  1118. F. Shiratani and K. Yamamoto, Combinatorial optimization by using a neural network operating in block-sequential mode, Systems and Computers in Japan 25 (1994) 103.Google Scholar
  1119. R. Sikora and M. Shaw, A double layered learning approach to acquiring rules for classification. Integrating genetic algorithms with similarity based learning, ORSA Journal on Computing 6 (1994) 174.Google Scholar
  1120. A. Silver, R.V.V. Vidal and D. de Werra, A tutorial on heuristic methods, European Journal of Operational Research 5 (1980) 153.CrossRefGoogle Scholar
  1121. P.D. Simic, Statistical mechanics as the underlying theory of the elastic and neural optimizations, IEEE Transactions on Neural Networks 1 (1990) 89.Google Scholar
  1122. M.W. Simmen, Parameter sensitivity of the elastic net approach to the travelling salesman problem, Neural Computation 3 (1991) 363.Google Scholar
  1123. A.R. Simpson, G.C. Dandy and L.J. Murphy, Genetic algorithms compared to other techniques for pipe optimization, Journal of Water Resources Planning and Management — ASCE 120 (1994) 423.Google Scholar
  1124. M. Sinclair, Comparison of the performance of modern heuristics for combinatorial optimization on real data, Computers and Operations Research 20 (1993) 687.CrossRefGoogle Scholar
  1125. G.S. Singh and K.R. Deshpande, On fast load partitioning by simulated annealing and heuristic algorithms for general-class of problems, Advances in Engineering Software 16 (1993) 23.CrossRefGoogle Scholar
  1126. D.J. Sirag and P.T. Weisser, Towards a unified thermodynamic genetic operator, in:Proceedings of the 2nd International Conference on Genetic Algorithms, ed. J.J. Grefenstette (Lawrence Erlbaum Associates, Pittsburgh 1987) p. 116.Google Scholar
  1127. A.J. Skinner and J.Q. Broughton, Neural networks in computational materials science. Training algorithms, Modelling and Simulation in Materials Science and Engineering 3 (1995) 371.CrossRefGoogle Scholar
  1128. J. Skorin-Kapov, Extensions of a tabu search adaptation to the quadratic assignment problem, Computers and Operations Research 21 (1994) 855.CrossRefMathSciNetGoogle Scholar
  1129. J. Skorin-Kapov, Tabu search applied to the quadratic assignment problem, ORSA Journal on Computing 2 (1990) 33.Google Scholar
  1130. J. Skorin-Kapov and J.-F. Labourdette, On minimum congestion routing in rearrangeable multi-hop lightwave networks, Journal of Heuristics 1 (1995) 129.Google Scholar
  1131. D. Skorin-Kapov and J. Skorin-Kapov, On tabu search for the location of interacting hub facilities, European Journal of Operational Research 73 (1994) 502.CrossRefGoogle Scholar
  1132. J. Skorin-Kapov and A.J. Vakharia, Scheduling a flow-line manufacturing cell. A tabu search approach, International Journal of Production Research 31 (1993) 1721.Google Scholar
  1133. R. Slowinski, B. Soniewicki and J. Weglarz, DSS for multiobjective project scheduling, European Journal of Operational Research 79 (1994) 220.CrossRefGoogle Scholar
  1134. B.M. Smith, S.C. Brailsford, P.M. Hubbard and H.P. Williams, The progressive party problem. Integer linear programming and constraint programming compared, Working paper, Division of Artificial Intelligence, School of Computer Studies, University of Leeds, UK (1995).Google Scholar
  1135. D. Smith, Bin packing with adaptive search, in:Proceedings of an International Conference on Genetic Algorithms, ed. J.J. Grefenstette (Lawrence Erlbaum Associates, Pittsburgh, 1985) p. 202.Google Scholar
  1136. J. Smith and T.C. Fogarty, An adaptive poly-parental recombination strategy,Lecture Notes in Computer Science 993 (1995), forthcoming.Google Scholar
  1137. K. Smith, M. Krishnamoorthy and M. Palaniswami, Traditional heuristic versus neural approaches to a car sequencing problem, Working paper, CSIRO Division of Mathematics and Statistics, Clayton, Australia (1994).Google Scholar
  1138. S. Smith and T.A. Feo, A GRASP for coloring sparse graphs, Working paper, Operations Research Group, Department of Mechanical Engineering, The University of Texas at Austin (1994).Google Scholar
  1139. D.G. So and K.A. Dowsland, Simulated annealing: An application to simulation optimisation, Working paper, University of Wales, Swansea, Statistics and Operational Research Group, European Business Management School, Swansea (1993).Google Scholar
  1140. S. Sofianopoulou, A queueing network application to a telecommunications distributed system, RAIRO — Operations Research 26 (1992a) 409.Google Scholar
  1141. S. Sofianopoulou, Simulated annealing applied to the process allocatio problem, European Journal of Operational Research 60 (1992b) 327.CrossRefGoogle Scholar
  1142. A. Sohn, Generalized speculative computation of parallel simulated annealing, Annals of Operations Research 63 (1996) 29.Google Scholar
  1143. A. Sohn, ParallelN-ary speculative computation of simulated annealing, IEEE Transactions on Parallel and Distributed Systems 6 (1995) 997.CrossRefGoogle Scholar
  1144. L. Sondergeld and S. Voß, A star-shaped diversification approach in tabu search, in:Metaheuristics. Theory and Applications, ed. I.H. Osman and J.P. Kelly (Kluwer, Boston, 1996).Google Scholar
  1145. L. Song and A. Vannelli, A VLSI placement method using tabu search, Microelectronics Journal 23 (1992) 167.CrossRefGoogle Scholar
  1146. P. Soriano and M. Gendreau, Diversification strategies in tabu search algorithm for the maximum clique problem, Annals of Operations Research 63 (1996) 189.Google Scholar
  1147. G.B. Sorkin, Efficient simulated annealing on fractal energy landscapes, Algorithmica 6 (1991) 367.CrossRefGoogle Scholar
  1148. A. Souilah, Simulated annealing for manufacturing systems layout design, European Journal of Operational Research 82 (1995) 592.CrossRefGoogle Scholar
  1149. S.B. Spalti and T.M. Liebling, Modeling the satellite placement problem as a network flow problem with one side constraint, OR Spektrum 13 (1991) 1.CrossRefGoogle Scholar
  1150. W.M. Spears and V. Anand, A study of crossover operators in genetic programming,Lecture Notes in Artificial Intelligence 542 (1991) p. 409.Google Scholar
  1151. R. Srichander, Efficient schedules for simulated annealing, Engineering Optimization 24 (1995) 161.Google Scholar
  1152. J. Sridhar and C. Rajendran, Scheduling in a cellular manufacturing system. A simulated annealing approach, International Journal of Production Research 31 (1993) 2927.Google Scholar
  1153. R. Srikanth, R. George, N. Warsi, D. Prabhu, F.E. Petry and B.P. Buckles, A variable length genetic algorithm for clustering and classification, Pattern Recognition Letters 16 (1995) 789.CrossRefGoogle Scholar
  1154. M. Srinivas and K. Deb, Multiobjective optimization using nondominated sorting in genetic algorithms, Evolutionary Computation 2 (1995) 221.Google Scholar
  1155. M. Srinivas and L.M. Patnaik, Adaptive probabilities of crossover and mutation in genetic algorithms, IEEE Transactions on Systems, Man and Cybernetics 24 (1994a) 656.Google Scholar
  1156. M. Srinivas and L.M. Patnaik, Genetic algorithms. A survey, Computer 27 (1994b) 17.CrossRefGoogle Scholar
  1157. B. Srivastava and W.H. Chen, Part type selection problem in flexible manufacturing systems: Tabu search algorithms, Annals of Operations Research 41 (1993) 279.CrossRefGoogle Scholar
  1158. P.F. Stadler, Correlation in landscapes of combinatorial optimization problems, Europhysics Letters 20 (1992) 479.Google Scholar
  1159. J. Stander and B.W. Silverman, Temperature schedules for simulated annealing, Statistics and Computing 4 (1994) 21.CrossRefGoogle Scholar
  1160. J.P.P. Starink and E. Backer, Finding point correspondences using simulated annealing, Pattern Recognition 28 (1995) 231.CrossRefGoogle Scholar
  1161. T. Starkweather, D. Whitley, K. Mathias and S. McDaniel, Sequence scheduling with genetic algorithms for the travelling salesman problem, in:New Directions for Operations Research in Manufacturing, ed. G. Fandel, T. Gulledge and A. Jones (Springer, Berlin, 1992).Google Scholar
  1162. T. Starkweather, D. Whitley and K. Mathias, Optimization using distributed genetic algorithms,Lecture Notes in Computer Science 496 (1991) p. 165.Google Scholar
  1163. J. Stender,Parallel Genetic Algorithms. Theory and Applications (ISO Press, Amsterdam, 1992).Google Scholar
  1164. B.S. Stewart, C.F. Liaw and C.C. White, A bibliography of heuristic search research through 1992, IEEE Transactions on Systems, Man and Cybernetics 24 (1994) 268.Google Scholar
  1165. W.R. Stewart, J.P. Kelly and M. Laguna, Solving vehicle routing problems using generalised assignments and tabu search, Working paper, Graduate School of Business, University of Colorado, Boulder (1994).Google Scholar
  1166. G.S. Stiles, The effect of numerical precision upon simulated annealing, Physics Letters A 185 (1994) 253.CrossRefGoogle Scholar
  1167. D.J. Stockton and L. Quinn, Aggregate production planning using genetic algorithms, Journal of Engineering Manufacture 209 (1995) 201.Google Scholar
  1168. R.H. Storer, S.W. Flanders and S.D. Wu, Problem space local search for number partitioning, Annals of Operations Research 63 (1996) 465.Google Scholar
  1169. R.H. Storer, S.D. Wu and R. Vaccari, Local search in problem and heuristic space for job shop scheduling, ORSA Journal on Computing 7 (1995) 453.Google Scholar
  1170. R.H. Storer, S.D. Wu and R. Vaccari, New search spaces for sequencing problems with application to job shop scheduling, Management Science 38 (1992) 1495.Google Scholar
  1171. P.N. Strenski and S. Kirkpatrick, Analysis of finite length annealing schedules, Algorithmica 6 (1991) 346.CrossRefGoogle Scholar
  1172. B.E. Stuckman and E.E. Easom, A comparison of Bayesian sampling global optimization techniques, IEEE Transactions on Systems, Man and Cybernetics 22 (1992) 1024.Google Scholar
  1173. Y. Sugai and H. Hirata, Hierarchical algorithm for a partition problem using simulated annealing. Application to placement in VLSI layout, International Journal of Systems Science 22 (1991) 2471.MathSciNetGoogle Scholar
  1174. P.N. Suganthan, E.K. Teoh and D.P. Mital, Self-organizing Hopfield network for attributed relational graph matching, Image and Vision Computing 13 (1995) 61.CrossRefGoogle Scholar
  1175. D.K. Sun, R. Batta and L. Lin, Effective job shop scheduling through active chain manipulation, Computers and Operations Research 22 (1995) 159.CrossRefGoogle Scholar
  1176. D.K. Sun, L. Lin and R. Batta, Cell-formation using tabu search, Computers and Industrial Engineering 28 (1995) 485.CrossRefGoogle Scholar
  1177. L.X. Sun, F. Xu, Y.Z. Liang, Y.L. Xie and R.Q. Yu, Cluster analysis by thek-means algorithm and simulated annealing, Chemometrics and Intelligent Laboratory Systems 25 (1994) 51.CrossRefGoogle Scholar
  1178. L.X. Sun, Y.I. Xie, X.H. Song, J.H. Wang and R.Q. Yu, Cluster-analysis by simulated annealing, Computers and Chemistry 18 (1994) 103.CrossRefGoogle Scholar
  1179. M. Sun and P.G. McKeown, Tabu search applied to the general fixed charge problem, Annals of Operations Research 41 (1993) 405.CrossRefGoogle Scholar
  1180. T. Sun, P. Meakin and T. Jossang, A fast optimization method based on a hierarchical strategy for the traveling salesman problem, Physica A 199 (1993) 232.Google Scholar
  1181. W.J. Sun and C. Sechen, Efficient and effective placement for very large circuits, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 14 (1995) 349.CrossRefGoogle Scholar
  1182. G. Suresh and S. Sahu, Stochastic assembly line balancing using simulated annealing, International Journal of Production Research 32 (1994) 2249.Google Scholar
  1183. G. Suresh and S. Sahu, Multiobjective facility layout using simulated annealing, International Journal of Production Economics 32 (1993) 239.CrossRefGoogle Scholar
  1184. P.D. Surry, N.J. Radcliffe and I.D. Boyd, A multi-objective approach to constrained optimisation of gas supply networks. The COMOGA method,Lecture Notes in Computer Science 993 (1995), forthcoming.Google Scholar
  1185. P. Sutton and S. Boyden, Genetic algorithms. A general search procedure, American Journal of Physics 62 (1994) 549.CrossRefGoogle Scholar
  1186. J. Suzuki, A Markov chain analysis on simple genetic algorithms, IEEE Transactions on Systems, Man and Cybernetics 25 (1995) 655.Google Scholar
  1187. G. Syswerda, Schedule optimization using genetic algorithms, in:Handbook of Genetic Algorithms, ed. L. Davis (Van Nostrand Reinhold, New York, 1991).Google Scholar
  1188. G. Syswerda, Uniform crossover genetic algorithms, in:Proceedings of the 3rd International Conference on Genetic Algorithms, ed. J.D. Schaffer (Morgan Kaufmann, San Mateo, 1989) p. 2.Google Scholar
  1189. H. Szu and S. Foo, Divide-and-conquer orthogonality principle for parallel optimizations in TSP, Neurocomputing 8 (1995) 249.CrossRef<