Selected Topics in Simulated Annealing

  • Emile Aarts
  • Jan Korst
Part of the Operations Research/Computer Science Interfaces Series book series (ORCS, volume 15)


We review a number of selected topics that were published in the simulated annealing literature during the past decade. The emphasis of the presentation is on theoretical and general results. The presentation of the novel features include generalized convergence results, new performance properties, improved variants, genetic hybrids, and approaches to general mathematical programming models.


Markov Chain Simulated Annealing Travel Salesman Problem Combinatorial Optimization Problem Simulated Annealing Algorithm 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    E.H.L Aarts and J.H.M. Korst. Simulated Annealing and Boltzmann Machines. Wiley, 1989.MATHGoogle Scholar
  2. [2]
    E.H.L. Aarts and J.H.M. Korst. Boltzmann Machines as a Model for Massively Parallel Annealing. Algorithmica, 6:437–465, 1991.MathSciNetMATHCrossRefGoogle Scholar
  3. [3]
    E.H.L.Aarts and P.J.M. van Laarhoven. Statistical Cooling: A General Approach to Combinatorial Optimization Problems. Philips Journal of Research, 40:193–226, 1985.MathSciNetGoogle Scholar
  4. [4]
    D.H. Ackley, G.E. Hinton, and T.J. Sejnowski. A Learning Algorithm for Boltzmann Machines. Cognitive Science, 9:147–169, 1985.CrossRefGoogle Scholar
  5. [5]
    T.M. Alkhamis, M.A. Ahmed, and V.K. Tuan. Simulated Annealing for Discrete Optimization with Estimation. European Journal of Operational Research, 116:530–544, 1999.MATHCrossRefGoogle Scholar
  6. [6]
    M.H. Alrefaei and S. Andradottir. A Simulated Annealing Algorithm with Constant Temperature for Discrete Stochastic Optimization. Management Science, 45:748–764, 1999.MATHCrossRefGoogle Scholar
  7. [7]
    I. Althöfer and K.U. Koschnick. On the Convergence of “Threshold Accepting”. Applied Mathematics and Optimization, 24:183–195, 1991.MathSciNetMATHCrossRefGoogle Scholar
  8. [8]
    S. Amin. Simulated Jumping. Annals of Operations Research, 86:23–38, 1999.MathSciNetMATHCrossRefGoogle Scholar
  9. [9]
    D.J. Amit, H. Gutfreund, and H. Sompolinsky. Spin-Glass Models of Neural Networks. Physical Review A, 32:1007–1018, 1985.MathSciNetCrossRefGoogle Scholar
  10. [10]
    D.J. Amit, H. Gutfreund, and H. Sompolinsky. Statistical Mechanics of Neural Networks near Saturation. Annals of Physics, 173:30–67, 1987.CrossRefGoogle Scholar
  11. [11]
    B. Andersen. Finite-Time Thermodynamics and Simulated Annealing. In: Entropy and Entropy Generation, J.S. Shiner, editor, pages 111–127, Kluwer, 1996.Google Scholar
  12. [12]
    I. Andricioaei and J.E. Straub. Generalized Simulated Annealing Algorithms using Tsallis Statistics: Application to Conformational Optimization of a Tetrapeptide. Physical Review E, 53:3055–3058, 1996.CrossRefGoogle Scholar
  13. [13]
    S. Anily and A. Federgruen. Ergodicity in Parametric Nonstationary Markov Chains: An Application to Simulated Annealing Methods. Operations Research, 35:867–874, 1987.MathSciNetMATHCrossRefGoogle Scholar
  14. [14]
    S. Anily and A. Federgruen. Simulated Annealing Methods with General Acceptance Probabilities. Journal of Applied Probability, 24:657–667, 1987.MathSciNetMATHCrossRefGoogle Scholar
  15. [15]
    R. Azencott (editor). Simulated Annealing: Parallelization Techniques. Wiley, 1992.MATHGoogle Scholar
  16. [16]
    G. Barbarosoglu and L. Özdamar. Analysis of Solution Space-Dependent Performance of Simulated Annealing: The Case of the Multi-Level Capacitated Lot Sizing Problem. Computers and Operations Research, 27:895–903, 2000.MATHCrossRefGoogle Scholar
  17. [17]
    R. Battitti and G. Tecchiollo. Simulated Annealing and Tabu Search in the Long Run: A Comparison on QAP Tasks. Computers and Mathematics with Applications, 28:1–8, 1994.CrossRefGoogle Scholar
  18. [18]
    E. Bernstein and U. Vazirani. Quantum Complexity Theory. In: Proceedings of the 25th ACM Symposium on Theory of Computation, pages 11–20, San Diego, 1993.Google Scholar
  19. [19]
    K. Binder. Monte Carlo Methods in Statistical Physics. Springer-Verlag, 1978.Google Scholar
  20. [20]
    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:71–78, 1994.MathSciNetMATHCrossRefGoogle Scholar
  21. [21]
    S. Boettcher and A.G. Percus. Combining Local Search with Co-volution in a Remarkably Simple Way. In: Proceedings of the 2000 Congress on Evolutionary Computation, pages 1578–1584, 2000.Google Scholar
  22. [22]
    N. Boisson and J.-L. Lutton. A Parallel Simulated Annealing Algorithm. Parallel Computing, 19:859–872, 1993.MathSciNetCrossRefGoogle Scholar
  23. [23]
    G. Castagnoli. Merging Quantum Annealing Computation and Particle Statistics: A Prospect in the Search of Efficient Solutions to Intractable Problems. International Journal of Theoretical Physics, 37:457–462, 1998.MathSciNetMATHCrossRefGoogle Scholar
  24. [24]
    G. Castagnoli, A. Ekert, and C. Macchiavello. Quantum Computation: From Sequential Approach to Simulated Annealing. International Journal of Theoretical Physics, 37:463–469, 1998.MathSciNetMATHCrossRefGoogle Scholar
  25. [25]
    V. Černý. Thermodynamical Approach to the Traveling Salesman Problem: An Efficient Simulation Algorithm. Journal of Optimization Theory and Applications, 45:41–51, 1985.MathSciNetMATHCrossRefGoogle Scholar
  26. [26]
    L. Chen and K. Aihara. Chaotic Simulated Annealing by a Neural Network Model with Transient Chaos. Neural Networks, 8:915–930, 1995.CrossRefGoogle Scholar
  27. [27]
    M. Christoph and K.H. Hoffmann. Scaling Behaviour of Optimal Simulated Annealing Schedules. Journal of Physics A, 26:3267–3277, 1993.CrossRefGoogle Scholar
  28. [28]
    H. Cohn and M. Fielding. Simulated Annealing: Searching for an Optimal Temperature Schedule. SIAM Journal on Optimization, 9:779–802, 1999.MathSciNetMATHCrossRefGoogle Scholar
  29. [29]
    N.E. Collins, R.W. Eglese, and B.L. Golden. Simulated Annealing — An Annotated Bibliography. American Journal of Mathematical and Management Sciences, 8:209–307, 1988.MathSciNetMATHGoogle Scholar
  30. [30]
    D.P. Connors, and P.R. Kumar. Simulated Annealing and Balance of Recurrence Order in Time-Inhomogeneous Markov Chains. In: Proceedings of the 26th IEEE Conference on Decision and Control, pages 2261–2263, 1987.CrossRefGoogle Scholar
  31. [31]
    J.R. Cruz and C.C.Y. Dorea. Simple Conditions for the Convergence of Simulated Annealing Type Algorithms. Journal on Applied Probability, 35:885–892, 1998.MathSciNetMATHCrossRefGoogle Scholar
  32. [32]
    P. Del Moral and L. Miclo. On the Convergence and Applications of Generalized Simulated Annealing. SIAM Journal on Control and Optimization, 37:1222–1250, 1999.MathSciNetMATHCrossRefGoogle Scholar
  33. [33]
    D. Deutch. Quantum Theory, the Church-Turing Principle and the Universal Quantum Computer. In: Proceedings of the Royal Society of London A, 400:97–117, 1985.Google Scholar
  34. [34]
    K.A. Dowsland. Simulated Annealing. In: Modern Heuristic Techniques for Combinatorial Problems, C.R. Reeves, editor, pages 20–69, Blackwell, 1993.Google Scholar
  35. [35]
    G. Dueck and T. Scheuer. Threshold Accepting: A General Purpose Optimization Algorithm. Journal of Computational Physics, 90:161–175, 1990.MathSciNetMATHCrossRefGoogle Scholar
  36. [36]
    R.W. Eglese. Simulated Annealing: A Tool for Operational Research. European Journal of Operational Research, 46:271–281, 1990.MathSciNetMATHCrossRefGoogle Scholar
  37. [37]
    A.E. Eiben, E.H.L. Aarts, and K.M. van Hee. Global Convergence of Genetic Algorithms. Springer Lecture Notes in Computer Science, 496: 4–13, 1991.Google Scholar
  38. [38]
    A. Ekert and R. Josza. Quantum Computation and Shor’s Factoring Algorithm. Reviews of Modern Physics, 68:733–753, 1996.MathSciNetCrossRefGoogle Scholar
  39. [39]
    W. Feller. An Introduction to Probability Theory and Its Applications. vol. 1, Wiley, 1950.MATHGoogle Scholar
  40. [40]
    A.G. Ferreira and J. Žerovnik. Bounding the Probability of Success on Stochastic Methods for Global Optimization. Computers and Mathematics with Applications, 25:1–8, 1993.MathSciNetMATHCrossRefGoogle Scholar
  41. [41]
    M. Fielding. Simulated Annealing with an Optimal Fixed Temperature. SIAM Journal on Optimization, 11:289–307, 2000.MathSciNetMATHCrossRefGoogle Scholar
  42. [42]
    B.L. Fox. Integrating and Accelerating Tabu Search, Simulated Annealing, and Genetic Algorithms. In: Tabu Search, F. Glover, E. Taillard, M. Laguna, and D. de Werra, editors, Baltzer, Annals of Operations Research, 41:47–67, 1993.Google Scholar
  43. [43]
    B.L. Fox. Random Restart versus Simulated Annealing. Computers and Mathematics with Applications, 27:33–35, 1994.MATHCrossRefGoogle Scholar
  44. [44]
    S.B. Gelfand and S.K. Mitter. Recursive Stochastic Algorithms for Global Optimization in IRn. SIAM Journal on Control and Optimization, 29:999–1018, 1991.MathSciNetMATHCrossRefGoogle Scholar
  45. [45]
    S. Geman and D. Geman. Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images. IEEE Transactions on Pattern Analysis and Machine Intelligence, 6:721–741, 1984.MATHCrossRefGoogle Scholar
  46. [46]
    S. Geman and C.R. Huang. Diffusions for Global Optimization. SIAM Journal on Control and Optimization, 24:1031–1043, 1986.MathSciNetMATHCrossRefGoogle Scholar
  47. [47]
    B. Gidas. Nonstationary Markov Chains and Convergence of the Annealing Algorithm, Journal of Statistical Physics, 39:73–131, 1985.MathSciNetMATHCrossRefGoogle Scholar
  48. [48]
    J.W. Greene and K.J. Supowit. Simulated Annealing without Rejected Moves. IEEE Transactions on Computer-Aided Design, 5:221–228, 1986.CrossRefGoogle Scholar
  49. [49]
    D.R. Greening. Parallel Simulated Annealing Techniques. Physica D, 42:293–306, 1990.CrossRefGoogle Scholar
  50. [50]
    B. Hajek. Cooling Schedules for Optimal Annealing. Mathematics of Operations Research, 13:311–329, 1988.MathSciNetMATHCrossRefGoogle Scholar
  51. [51]
    B. Hajek and G. Sasaki. Simulated Annealing: To Cool it or Not. Systems Control Letters, 12:443–447, 1989.MathSciNetMATHCrossRefGoogle Scholar
  52. [52]
    W.E. Hart. A Theoretical Comparison of Evolutionary Algorithms and Simulated Annealing. In: Proceedings of the 5th Annual Conference on Evolutionary Programming, pages 147–154, San Diego, 1996.Google Scholar
  53. [53]
    L. Herault. Rescaled Simulated Annealing — Accelerating Convergence of Simulated Annealing by Rescaling the State Energies. Journal of Heuristics, 6:215–252, 2000.MATHCrossRefGoogle Scholar
  54. [54]
    J.A. Herz, A. Krogh, and P.G. Palmer. Introduction to the Theory of Neural Computation. Addison Wesley, 1991.Google Scholar
  55. [55]
    J. Hopfield and D. Tank. Neural Computation of Decisions in Optimization Problems. Biological Cybernetics, 52:141–152, 1985.MathSciNetMATHGoogle Scholar
  56. [56]
    M.D. Huang, F. Romeo, and A. Sangiovanni-Vincentelli. An Efficient General Cooling Schedule for Simulated Annealing. In: Proceedings of the IEEE International Conference on Computer-Aided Design, pages 381–384, 1986.Google Scholar
  57. [57]
    L. Ingber. Very Fast Simulated Re-Annealing. Mathematical and Computer Modelling, 12:967–973, 1989.MathSciNetMATHCrossRefGoogle Scholar
  58. [58]
    L. Ingber. Simulated Annealing: Practice versus Theory. Journal of Mathematical Computer Modelling, 18:29–57, 1993.MathSciNetMATHCrossRefGoogle Scholar
  59. [59]
    D. Isaacson and R. Madsen. Markov Chains. Wiley, 1976.MATHGoogle Scholar
  60. [60]
    A. Jagota, M. Pelillo and A. Rangarajan. A New Deterministic Annealing Algorithm for Maximum Clique. In: Proceedings of the IEEE International Joint Conference on Neural Networks, vol. VI, pages 505–508, 2000.Google Scholar
  61. [61]
    D.S. Johnson, C.R. Aragon, L.A. McGeoch, and C. Schevon. Optimization by Simulated Annealing: An Experimental Evaluation, Part I Graph Partitioning. Operations Research, 37:865–892, 1989.MATHCrossRefGoogle Scholar
  62. [62]
    D.S. Johnson, C.R. Aragon, L.A. McGeoch, and C. Schevon. Optimization by Simulated Annealing: An Experimental Evaluation, Part II Graph Colouring and Number Partitioning. Operations Research, 39:378–406, 1991.MATHCrossRefGoogle Scholar
  63. [63]
    D.S. Johnson and L.A. McGeoch. The Traveling Salesman Problem: A Case Study. In: Local Search in Combinatorial Optimization, E. Aarts and J.K. Lenstra, editors, Wiley, 1997.Google Scholar
  64. [64]
    W. Kern. On the Depth of Combinatorial Optimization Problems. Technical Report 86.33., Universität zu Köln, Köln, 1986.Google Scholar
  65. [65]
    G. Kesidis and E. Wong. Optimal Acceptance Probability for Simulated Annealing. Stochastics and Stochastics Reports,29:221–226, 1990.MathSciNetMATHGoogle Scholar
  66. [66]
    S. Kirkpatrick, C.D. Gelatt Jr., and M.P. Vecchi. Optimization by Simulated Annealing. Science, 220:671–680, 1983.MathSciNetMATHCrossRefGoogle Scholar
  67. [67]
    G. Kliewer. A General Software Library for Parallel Simulated Annealing. In: Proceedings of the XVIII EURO Winter Institute on Metaheuristics in Combinatorial Optimisation, Lac Noir, Switzerland, 2000.Google Scholar
  68. [68]
    E. Köktener Karasakal and M. Köksalan. A Simulated Annealing Approach to Bicriteria Scheduling Problems on a Single Machine. Journal of Heuristics, 6:311–327, 2000.MATHCrossRefGoogle Scholar
  69. [69]
    M. Kolonko. Some Results on Simulated Annealing Applied to the Job Shop Scheduling Problem. European Journal of Operational Research,113:123–136, 1999.MATHCrossRefGoogle Scholar
  70. [70]
    C. Koulamas, S.R. Antony, and R. Jaen. A Survey of Simulated Annealing Applications to Operations Research Problems. Omega, 22:41–56, 1994.CrossRefGoogle Scholar
  71. [71]
    S.A. Kravitz and R. Rutenbar. Placement by Simulated Annealing on a Multiprocessor. IEEE Transactions on Computer-Aided Design, 6:534–549, 1987.CrossRefGoogle Scholar
  72. [72]
    K. Kurbel, B. Schneider, and K. Singh. Solving Optimization Problems by Parallel Recombinative Simulated Annealing on a Parallel Computer — An Application to Standard Cell Placement in VLSI Design. IEEE Transactions on Systems, Man, and Cybernetics, Part B,28:454–461, 1998.CrossRefGoogle Scholar
  73. [73]
    T. Kwok and K.A. Smith. A Unified Framework for Chaotic Neural-Network Approaches to Combinatorial Optimization. IEEE Transactions on Neural Networks, 10:978–981, 1999.CrossRefGoogle Scholar
  74. [74]
    P.J.M. van Laarhoven and E.H.L. Aarts. Simulated Annealing: Theory and Applications, Reidel, 1987.MATHGoogle Scholar
  75. [75]
    P.J.M. van Laarhoven, E.H.L. Aarts, and J.K. Lenstra. Job Shop Scheduling by Simulated Annealing. Operations Research, 40:185–201, 1992.Google Scholar
  76. [76]
    P. Lalanne, J.C. Rodier, E. Belhaire, and P.F. Garda. Optoelectronic Devices for Boltzmann Machines and Simulated Annealing. Optical Engineering, 32:1904–1914, 1993.CrossRefGoogle Scholar
  77. [77]
    J. Lam and J.-M. Delosme. Logic Minimization using Simulated Annealing, In: Proceedings of the IEEE International Conference on Computer-Aided Design, pages 348–351, 1986.Google Scholar
  78. [78]
    B.W. Lee and B.J. Sheu. Hardware Annealing in Electronic Neural Networks, IEEE Transactions on Circuits and Systems, 38:134–141, 1991.CrossRefGoogle Scholar
  79. [79]
    B. Li and W. Jiang. A Novel Stochastic Optimization Algorithm. IEEE Transactions on Systems, Man, and Cybernetics, Part B,30:193–198, 2000.CrossRefGoogle Scholar
  80. [80]
    L.W. Light and P. Anderson. Designing Better Keyboards via Simulated Annealing. AI Expert, 9:20–27, 1993.Google Scholar
  81. [81]
    F.-T. Lin, C.-Y. Kao, and C.-C. Hsu. Applying the Genetic Approach to Simulated Annealing in Solving some NP-Hard Problems. IEEE Transaction on Systems, Man, and Cybernetics, 23:1752–1767, 1994.Google Scholar
  82. [82]
    J. Liu. The Impact of Neighbourhood Size on the Process of Simulated Annealing: Computational Experiments on the Flowshop Scheduling Problem. Computers and Industrial Engineering,37:285–288, 1999.CrossRefGoogle Scholar
  83. [83]
    M. Locatelli. Simulated Annealing Algorithms for Continuous Global Optimization: Convergence Conditions. Journal of Optimization Theory and Applications, 104:121–133, 2000.MathSciNetMATHCrossRefGoogle Scholar
  84. [84]
    M. Lundy and A. Mees. Convergence of an Annealing Algorithm. Mathematical Programming, 34:111–124, 1986.MathSciNetMATHCrossRefGoogle Scholar
  85. [85]
    O. Martin, S.W. Otto, and E.W. Felten. Large Step Markov Chains for the Traveling Salesman Problem. Complex Systems, 5:299–326, 1991.MathSciNetMATHGoogle Scholar
  86. [86]
    M. Metropolis, A. Rosenbluth, M. Rosenbluth, A. Teller, and E. Teller. Equation of State Calculations by Fast Computing Machines. Journal of Chemical Physics,21:1087–1092, 1953.CrossRefGoogle Scholar
  87. [87]
    D. Mitra, F. Romeo, and A.L. Sangiovanni-Vincentelli. Convergence and Finite-Time Behavior of Simulated Annealing. Advances in Applied Probability,18:747–771, 1986.MathSciNetMATHCrossRefGoogle Scholar
  88. [88]
    D. Müller. Simulated Annealing without a Cooling Schedule. International Journal of Computer Mathematics,66:9–20, 1998.MathSciNetCrossRefGoogle Scholar
  89. [89]
    H. Nishimori and J.-I. Inoue. Convergence of Simulated Annealing using Generalized Transition Probability. Journal of Physics, A, 31:5661–5672, 1998.MathSciNetMATHCrossRefGoogle Scholar
  90. [90]
    A. Nolte and R. Schrader. Simulated Annealing and its Problems to Color Graphs. Lecture Notes in Computer Science,1136:138–152, 1996.MathSciNetCrossRefGoogle Scholar
  91. [91]
    A. Nolte and R. Schrader. Coloring in Sublinear Time. Lecture Notes in Computer Science, 1284:388–401, 1997.MathSciNetCrossRefGoogle Scholar
  92. [92]
    Y. Nourani and B. Andresen. A Comparison of Simulated Annealing Cooling Strategies. Journal of Physics A, 31:8373–8385, 1998.MATHCrossRefGoogle Scholar
  93. [93]
    P.M. Pardalos, K.A. Murty, and T.P. Harrison. A Computational Comparison of Local Search Heuristics for Solving Quadratic Assignment Problems. Informatica, 4:172–187, 1993.MathSciNetMATHGoogle Scholar
  94. [94]
    M.-W. Park and Y.-D. Kim. A Systematic Procedure for Setting Parameters in Simulated Annealing Algorithms. Computers and Operations Research, 25:207–217, 1998.MATHCrossRefGoogle Scholar
  95. [95]
    C. Peterson and J.R. Anderson. A Mean Field Thery Algorithm for Neural Networks. Complex Systems, 1:995–1019, 1987.MATHGoogle Scholar
  96. [96]
    C. Peterson and B. Söderberg. A New Method for Mapping Optimization Problems onto Neural Networks. International Journal of Neural Systems, 1:3–22, 1989.CrossRefGoogle Scholar
  97. [97]
    E. Poupaert and Y. Deville. Simulated Annealing with Estimated Temperature. AI Communications, 13:19–26, 2000.Google Scholar
  98. [98]
    S. Rajasekaran and J.H. Reif. Nested Annealing: A Provable Improvement to Simulated Annealing. Theoretical Computer Science, 99:157–176, 1992.MathSciNetMATHCrossRefGoogle Scholar
  99. [99]
    H.E. Romeijn and R.L. Smith. Simulated Annealing for Global Constrained Optimization. Journal of Global Optimization, 5:101–126, 1994.MathSciNetMATHCrossRefGoogle Scholar
  100. [100]
    H.E. Romeijn, Z.B. Zabinsky, D.L. Graesser, and S. Neogi. New Reflection Generator for Simulated Annealing in Mixed-Integer/Continuous Global Optimization. Journal of Optimization Theory and Applications, 101:403–427, 1999.MathSciNetMATHCrossRefGoogle Scholar
  101. [101]
    F. Romeo and A. Sangiovanni-Vincentelli. A Theoretical Framework for Simulated Annealing. Algorithmica, 6:302–345, 1991.MathSciNetMATHCrossRefGoogle Scholar
  102. [102]
    P.C. Schuur. Classification of Acceptance Criteria for the Simulated Annealing Algorithm. Memorandum COSOR 89–29, Eindhoven University of Technology, Eindhoven, 1989.Google Scholar
  103. [103]
    C. Sechen and A.L. Sangiovanni-Vincentelli. The Timber Wolf Placement and Routing Package. IEEE Journal on Solid State Circuits, 30:510–522, 1985.CrossRefGoogle Scholar
  104. [104]
    E. Seneta. Non-Negative Matrices and Markov Chains. Springer Verlag, 1981.MATHGoogle Scholar
  105. [105]
    K. Shahookar and P. Mazumder. VLSI Cell Placement Techniques. Computing Surveys, 23:143–220, 1991.CrossRefGoogle Scholar
  106. [106]
    G.B. Sorkin. Efficient Simulated Annealing on Fractal Energy Landscapes. Algorithmica, 6:367–418, 1991.MathSciNetMATHCrossRefGoogle Scholar
  107. [107]
    J. Stander and B.W. Silverman. Temperature Schedules for Simulated Annealing. Statistics and Computing, 4:21–32, 1994.CrossRefGoogle Scholar
  108. [108]
    K. Steinhöfel, A. Albrecht, and C.K. Wong. On Various Cooling Schedules for Simulated Annealing Applied to the Job Shop Problem. Lecture Notes in Computer Science, 1518:260–279, 1998.CrossRefGoogle Scholar
  109. [109]
    P.N. Strenski and S. Kirkpatrick. Analysis of Finite Length Annealing Schedules. Algorithmica, 6:346–366, 1991.MathSciNetMATHCrossRefGoogle Scholar
  110. [110]
    H. Szu and R. Hartley. Fast Simulated Annealing. Physics Letters A, 122:157–162, 1987.CrossRefGoogle Scholar
  111. [111]
    C. Tsallis and D.A. Stariolo. Generalized Simulated Annealing. Physica A, 233:395–406, 1996.CrossRefGoogle Scholar
  112. [112]
    K. Tsuchiya, T. Nishiyama, and K. Tsujita. A Deterministic Annealing Algorithm for a Combinatorial Optimization Problem by the Use of Replicator Equations. In: Proceedings of the IEEE International Conference on Systems, Man, and Cybernetics, vol. 1, pages 256–261, 1999.Google Scholar
  113. [113]
    D. Tuyttens, J. Teghem, Ph. Fortemps, and K. van Niuewenhuyze. Performance of the MOSA Method for the Bicriteria Assignment Problem. Journal of Heuristics 6:295–310, 2000.MATHCrossRefGoogle Scholar
  114. [114]
    R.J.M. Vaessens, E.H.L. Aarts, and J.K. Lenstra. A Local Search Template. In: Parallel Problem Solving from Nature 2, R. Männer and B. Manderick, editors, pages 65–74, North-Holland, 1992.Google Scholar
  115. [115]
    R.J.M. Vaessens, E.H.L. Aarts, and J.K. Lenstra. Job Shop Scheduling by Local Search. INFORMS Journal on Computing, 8:302–317, 1996.MATHCrossRefGoogle Scholar
  116. [116]
    M.G.A. Verhoeven and E.H.L. Aarts. Parallel Local Search Techniques. Journal of Heuristics, 1:43–65, 1996.CrossRefGoogle Scholar
  117. [117]
    R.V.V. Vidal. Applied Simulated Annealing. Lecture Notes in Economics and Mathematical Systems, 396:276–290, 1993.CrossRefGoogle Scholar
  118. [118]
    B.W. Wah and T. Wang. Simulated Annealing with Asymptotic Convergence for Nonlinear Constrained Global Optimization. Lecture Notes in Computer Science, 1713:461–475, 1999.CrossRefGoogle Scholar
  119. [119]
    L. Wang and K. Smith. On Chaotic Simulated Annealing. IEEE Transactions on Neural Networks, 9:716–718, 1998.CrossRefGoogle Scholar
  120. [120]
    T.-Y. Wang and K.-B. Wu. A Parameter Set Design Procedure for the Simulated Annealing Algorithm under the Computational Time Constraint. Computers and Operations Research, 26:665–678, 1999.MATHCrossRefGoogle Scholar
  121. [121]
    R.J. Willis and B.J. Terrill. Scheduling the Australian State Cricket Season using Simulated Annealing. Journal of the Operational Research Society, 45:276–280, 1994.MATHGoogle Scholar
  122. [122]
    D.F. Wong, H.W. Leong, and C.L. Liu. Simulated Annealing for VLSI Design. Kluwer, 1988.MATHCrossRefGoogle Scholar
  123. [123]
    Y. Xiang and X.G. Gong. Efficiency of Generalized Simulated Annealing. Physical Review E, 62:4473–4476, 2000.CrossRefGoogle Scholar
  124. [124]
    R.L. Yang. Convergence of the Simulated Annealing Algorithm for Continuous Global Optimization. Journal of Optimization Theory and Application, 104:691–716, 2000.MATHCrossRefGoogle Scholar
  125. [125]
    X. Yao. Simulated Annealing with Extended Neighbourhood. International Journal of Computer Mathematics, 40:169–189, 1991.MATHCrossRefGoogle Scholar
  126. [126]
    X. Yao. Optimization by Genetic Annealing. In: Proceedings of the 2nd Australian Conference on Neural Networks, pages 94–97, Sydney, 1991.Google Scholar
  127. [127]
    X. Yao. A New Simulated Annealing Algorithm. International Journal of Computer Mathematics, 56:161–168, 1995.MATHCrossRefGoogle Scholar
  128. [128]
    G. Yin. Convergence of a Global Stochastic Optimization Algorithm with Partial Step Size Restarting. Advances in Applied Probability, 32:480–498, 2000.MathSciNetMATHCrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2002

Authors and Affiliations

  • Emile Aarts
    • 1
    • 2
  • Jan Korst
    • 1
  1. 1.Philips Research LaboratoriesEindhovenThe Netherlands
  2. 2.Eindhoven University of TechnologyEindhovenThe Netherlands

Personalised recommendations