Selected topics in simulated annealing

Operations Research/ Computer Science Interfaces Series

Volumn 15, Issue , 2002, Pages 1-37

  Aarts, Emile ^a,b   Korst, Jan ^a  

^a PHILIPS RESEARCH LABORATORIES   (Netherlands)

^b EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84888775914     PISSN: 1387666X     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-1-4615-1507-4     Document Type: Article

References (128)

1. E.H.L Aarts and J.H.M. Korst. Simulated Annealing and Boltzmann Machines.Wiley, 1989.
2. E.H.L. Aarts and J.H.M. Korst. Boltzmann Machines as a Model forMassively Parallel Annealing. Algorithmica, 6:437-465, 1991.
3. E.H.L. Aarts and P.J.M. van Laarhoven. Statistical Cooling: A GeneralApproach to Combinatorial Optimization Problems. Philips Journal ofResearch, 40:193-226, 1985.
4. D.H. Ackley, G.E. Hinton, and T.J. Sejnowski. A Learning Algorithm forBoltzmann Machines. Cognitive Science, 9:147-169, 1985.
5. T.M. Alkhamis, M.A. Ahmed, and V.K. Tuan. Simulated Annealing forDiscrete Optimization with Estimation. European Journal of OperationalResearch, 116:530-544, 1999.
6. M.H. Alrefaei and S. Andradottir. A Simulated Annealing Algorithmwith Constant Temperature for Discrete Stochastic Optimization. ManagementScience, 45:748-764, 1999.
7. I. Althöfer and K.U. Koschnick. On the Convergence of Threshold Accepting. Applied Mathematics and Optimization, 24:183-195, 1991.
8. S. Amin. Simulated Jumping. Annals of Operations Research, 86:23-38,1999.
9. D.J. Amit, H. Gutfreund, and H. Sompolinsky. Spin-Glass Models of NeuralNetworks. Physical Review A, 32:1007-1018, 1985.
10. D.J. Amit, H. Gutfreund, and H. Sompolinsky. Statistical Mechanics ofNeural Networks near Saturation. Annals of Physics, 173:30-67, 1987.
11. B. Andersen. Finite-Time Thermodynamics and Simulated Annealing.In: Entropy and Entropy Generation, J.S. Shiner, editor, pages 111-127,Kluwer, 1996.
12. I. Andricioaei and J.E. Straub. Generalized Simulated Annealing Algorithmsusing Tsallis Statistics: Application to Conformational Optimizationof a Tetrapeptide. Physical Review E, 53:3055-3058, 1996.
13. S. Anily and A. Federgruen. Ergodicity in Parametric NonstationaryMarkov Chains: An Application to Simulated Annealing Methods. OperationsResearch, 35:867-874, 1987.
14. S. Anily and A. Federgruen. Simulated Annealing Methods with GeneralAcceptance Probabilities. Journal of Applied Probability, 24:657-667,1987.
15. R. Azencott (editor). Simulated Annealing: Parallelization Techniques. Wiley, 1992.
16. G. Barbarosoglu and L. Ozdamar. Analysis of Solution Space-DependentPerformance of Simulated Annealing: The Case of the Multi-Level CapacitatedLot Sizing Problem. Computers and Operations Research, 27:895-903,2000.
17. R. Battitti and G. Tecchiollo. Simulated Annealing and Tabu Search inthe Long Run: A Comparison on QAP Tasks. Computers and Mathematicswith Applications, 28:1-8, 1994.
18. E. Bernstein and U. Vazirani. Quantum Complexity Theory. In: Proceedingsof the 25th ACM Symposium on Theory of Computation, pages 11-20, San Diego, 1993.
19. K. Binder. Monte Carlo Methods in Statistical Physics. Springer-Verlag,1978.
20. K.D. Boese and A.B. Kahng. Best-so-Far vs. Where-you-Are: Implicationsfor Optimal Finite-Time Annealing. Systems and Control Letters,22:71-78, 1994.
21. S. Boettcher and A.G. Percus. Combining Local Search with CoEvolutionin a Remarkably Simple Way. In: Proceedings of the 2000Congress on Evolutionary Computation, pages 1578-1584,2000.
22. N. Boisson and J.-L. Lutton. A Parallel Simulated Annealing Algorithm. Parallel Computing, 19:859-872, 1993.
23. G. Castagnoli. Merging Quantum Annealing Computation and ParticleStatistics: A Prospect in the Search of Efficient Solutions to IntractableProblems. International Journal of Theoretical Physics, 37:457-462, 1998.
24. G. Castagnoli, A. Ekert, and C. Macchiavello. Quantum Computation:From Sequential Approach to Simulated Annealing. International Journalof Theoretical Physics, 37:463-469, 1998.
25. V. Cerny. Thermodynamical Approach to the Traveling Salesman Problem:An Efficient Simulation Algorithm. Journal of Optimization Theoryand Applications, 45:41-51, 1985.
26. L. Chen and K. Aihara. Chaotic Simulated Annealing by a Neural NetworkModel with Transient Chaos. Neural Networks, 8:915-930, 1995.
27. M. Christoph and K.H. Hoffmann. Scaling Behaviour of Optimal SimulatedAnnealing Schedules. Journal of Physics A, 26:3267-3277, 1993.
28. H. Cohn and M. Fielding. Simulated Annealing: Searching for an OptimalTemperature Schedule. SIAM Journal on Optimization, 9:779-802, 1999.
29. N.E. Collins, R.W. Eglese, and B.L. Golden. Simulated Annealing-AnAnnotated Bibliography. American Journal of Mathematical and ManagementSciences, 8:209-307, 1988.
30. D.P. Connors, and P.R. Kumar. Simulated Annealing and Balance of RecurrenceOrder in Time-Inhomogeneous Markov Chains. In: Proceedingsof the 26th IEEE Conference on Decision and Control, pages 2261-2263,1987.
31. J.R. Cruz and C.C.Y. Dorea. Simple Conditions for the Convergence ofSimulated Annealing Type Algorithms. Journal on Applied Probability,35:885-892, 1998.
32. P. Del Moral and L. Miclo. On the Convergence and Applications ofGeneralized Simulated Annealing. SIAM Journal on Control and Optimization,37:1222-1250, 1999.
33. D. Deutch. Quantum Theory, the Church-Thring Principle and the UniversalQuantum Computer. In: Proceedings of the Royal Society of LondonA, 400:97-117, 1985.
34. K.A. Dowsland. Simulated Annealing. In: Modern Heuristic Techniquesfor Combinatorial Problems, C.R. Reeves, editor, pages 20-69, Blackwell,1993.
35. G. Dueck and T. Scheuer. Threshold Accepting: A General Purpose OptimizationAlgorithm. Journal of Computational Physics, 90:161-175, 1990.
36. R.W. Eglese. Simulated Annealing: A Tool for Operational Research. European Journal of Operational Research, 46:271-281, 1990.
37. A.E. Eiben, E.H.L. Aarts, and K.M. van Hee. Global Convergence ofGenetic Algorithms. Springer Lecture Notes in Computer Science, 496:4-13, 1991.
38. A. Ekert and R. Josza. Quantum Computation and Shor's Factoring Algorithm. Reviews of Modern Physics, 68:733-753, 1996.
39. W. Feller. An Introduction to Probability Theory and Its Applications.vol. 1, Wiley, 1950.
40. A.G. Ferreira and J. Zerovnik. Bounding the Probability of Success onStochastic Methods for Global Optimization. Computers and Mathematicswith Applications, 25:1-8, 1993.
41. M. Fielding. Simulated Annealing with an Optimal Fixed Temperature. SIAM Journal on Optimization, 11:289-307,2000.
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.
43. B.L. Fox. Random Restart versus Simulated Annealing. Computers andMathematics with Applications, 27:33-35, 1994.
44. S.B. Gelfand and S.K. Mitter. Recursive Stochastic Algorithms for GlobalOptimization in lRn. SIAM Journal on Control and Optimization, 29:999-1018, 1991.
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.
46. S. Geman and C.R. Huang. Diffusions for Global Optimization. SIAM Journal on Control and Optimization, 24:1031-1043,1986.
47. B. Gidas. Nonstationary Markov Chains and Convergence of the Annealing Algorithm, Journal of Statistical Physics, 39:73-131, 1985.
48. J.W. Greene and K.J. Supowit. Simulated Annealing without Rejected Moves. IEEE Transactions on Computer-Aided Design, 5:221-228, 1986.
49. D.R. Greening. Parallel Simulated Annealing Techniques. Physica D, 42:293-306, 1990.
50. B. Hajek. Cooling Schedules for Optimal Annealing. Mathematics of Operations Research, 13:311-329, 1988.
51. B. Hajek and G. Sasaki. Simulated Annealing: To Cool it or Not. Systems Control Letters, 12:443-447, 1989.
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.
53. L. Herault. Rescaled Simulated Annealing - Accelerating Convergence of Simulated Annealing by Rescaling the State Energies. Journal of Heuristics, 6:215-252, 2000.
54. J.A. Herz, A. Krogh, and P.G. Palmer. Introduction to the Theory of Neural Computation. Addison Wesley, 1991.
55. J. Hopfield and D. Tank. Neural Computation of Decisions in Optimization Problems. Biological Cybernetics, 52:141-152, 1985.
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.
57. L. Ingber. Very Fast Simulated Re-Annealing. Mathematical and Computer Modelling, 12:967-973, 1989.
58. L. Ingber. Simulated Annealing: Practice versus Theory. Journal of Mathematical Computer Modelling, 18:29-57, 1993.
59. D. Isaacson and R. Madsen. Markov Chains. Wiley, 1976.
60. A. Jagota, M. Pelillo and A. Rangarajan. A New Deterministic AnnealingAlgorithm for Maximum Clique. In: Proceedings of the IEEE InternationalJoint Conference on Neural Networks, vol. 6, pages 505-508,2000.
61. D.S. Johnson, C.R. Aragon, L.A. McGeoch, and C. Schevon. Optimizationby Simulated Annealing: An Experimental Evaluation, Part IGraph Partitioning. Operations Research, 37:865-892, 1989.
62. D.S. Johnson, C.R. Aragon, L.A. McGeoch, and C. Schevon. Optimizationby Simulated Annealing: An Experimental Evaluation, Part IIGraph Colouring and Number Partitioning. Operations Research, 39:378-406, 1991.
63. D.S. Johnson and L.A. McGeoch. The Traveling Salesman Problem: ACase Study. In: Local Search in Combinatorial Optimization, E. Aartsand J.K. Lenstra, editors, Wiley, 1997.
64. W. Kern. On the Depth of Combinatorial Optimization Problems. TechnicalReport 86.33., Universitat zu Kaln, Kaln, 1986.
65. G. Kesidis and E. Wong. Optimal Acceptance Probability for SimulatedAnnealing. Stochastics and Stochastics Reports, 29:221-226, 1990.
66. S. Kirkpatrick, C.D. Gelatt Jr., and M.P. Vecchio Optimization by SimulatedAnnealing. Science, 220:671-680, 1983.
67. G. Kliewer. A General Software Library for Parallel Simulated Annealing.In: Proceedings of the XVIII EURO Winter Institute on Metaheuristicsin Combinatorial Optimisation, Lac Noir, Switzerland, 2000.
68. E. Kaktener Karasakal and M. Kaksalan. A Simulated Annealing Approachto Bicriteria Scheduling Problems on a Single Machine. Journalof Heuristics, 6:311-327, 2000.
69. M. Kolonko. Some Results on Simulated Annealing Applied to the JobShop Scheduling Problem. European Journal of Operational Research,113:123-136,1999.
70. C. Koulamas, S.R. Antony, and R. Jaen. A Survey of Simulated AnnealingApplications to Operations Research Problems. Omega, 22:41-56, 1994.
71. S.A. Kravitz and R. Rutenbar. Placement by Simulated Annealing on aMultiprocessor. IEEE Transactions on Computer-Aided Design, 6:534-549,1987.
72. K. Kurbel, B. Schneider, and K. Singh. Solving Optimization Problemsby Parallel Recombinative Simulated Annealing on a Parallel Computer-An Application to Standard Cell Placement in VLSI Design. IEEETransactions on Systems, Man, and Cybernetics, Part B, 28:454-461,1998.
73. T. Kwok and K.A. Smith. A Unified Framework for Chaotic NeuralNetworkApproaches to Combinatorial Optimization. IEEE Transactionson Neural Networks, 10:978-981, 1999.
74. P.J.M. van Laarhoven and E.H.L. Aarts. Simulated Annealing: Theoryand Applications, Reidel, 1987.
75. P.J.M. van Laarhoven, E.H.L. Aarts, and J.K. Lenstra. Job Shop Schedulingby Simulated Annealing. Operations Research, 40:185-201, 1992.
76. P. Lalanne, J.C. Rodier, E. Belhaire, and P.F. Garda. OptoelectronicDevices for Boltzmann Machines and Simulated Annealing. Optical Engineering,32:1904-1914, 1993.
77. J. Lam and J.-M. Delosme. Logic Minimization using Simulated Annealing,In: Proceedings of the IEEE International Conference on ComputerAidedDesign, pages 348-351, 1986.
78. B.W. Lee and B.J. Sheu. Hardware Annealing in Electronic Neural Networks, IEEE Transactions on Circuits and Systems, 38:134-141, 1991.
79. B. Li and W. Jiang. A Novel Stochastic Optimization Algorithm. IEEETransactions on Systems, Man, and Cybernetics, Part B, 30:193-198,2000.
80. L.W. Light and P. Anderson. Designing Better Keyboards via SimulatedAnnealing. AI Expert, 9:20-27, 1993.
81. F.-T. Lin, C.-Y. Kao, and C.-C. Hsu. Applying the Genetic Approach toSimulated Annealing in Solving some NP-Hard Problems. IEEE Transactionon Systems, Man, and Cybernetics, 23:1752-1767, 1994.
82. J. Liu. The Impact of Neighbourhood Size on the Process of SimulatedAnnealing: Computational Experiments on the Flowshop SchedulingProblem. Computers and Industrial Engineering, 37:285-288, 1999.
83. M. Locatelli. Simulated Annealing Algorithms for Continuous Global Optimization:Convergence Conditions. Journal of Optimization Theory andApplications, 104:121-133,2000.
84. M. Lundy and A. Mees. Convergence of an Annealing Algorithm. MathematicalProgramming, 34:111-124, 1986.
85. O. Martin, S.W. Otto, and E.W. Felten. Large Step Markov Chains forthe Traveling Salesman Problem. Complex Systems, 5:299-326, 1991.
86. M. Metropolis, A. Rosenbluth, M. Rosenbluth, A. Teller, and E. Teller. Equation of State Calculations by Fast Computing Machines. Journal ofChemical Physics, 21:1087-1092, 1953.
87. D. Mitra, F. Romeo, and A.L. Sangiovanni-Vincentelli. Convergence andFinite-Time Behavior of Simulated Annealing. Advances in Applied Probability,18:747-771, 1986.
88. D. Muller. Simulated Annealing without a Cooling Schedule. InternationalJournal of Computer Mathematics, 66:9-20, 1998.
89. H. Nishimori and J.-I. Inoue. Convergence of Simulated Annealing usingGeneralized Transition Probability. Journal of Physics, A, 31:5661-5672,1998.
90. A. Nolte and R. Schrader. Simulated Annealing and its Problems to ColorGraphs. Lecture Notes in Computer Science, 1136:138-152, 1996.
91. A. Nolte and R. Schrader. Coloring in Sublinear Time. Lecture Notes inComputer Science, 1284:388-401, 1997.
92. Y. Nourani and B. Andresen. A Comparison of Simulated AnnealingCooling Strategies. Journal of Physics A, 31:8373-8385, 1998.
93. P.M. Pardalos, K.A. Murty, and T.P. Harrison. A Computational Comparisonof Local Search Heuristics for Solving Quadratic AssignmentProblems. Informatica, 4:172-187, 1993.
94. M.-W. Park and Y.-D. Kim. A Systematic Procedure for Setting Parametersin Simulated Annealing Algorithms. Computers and OperationsResearch, 25:207-217, 1998.
95. C. Peterson and J.R. Anderson. A Mean Field Thery Algorithm for NeuralNetworks. Complex Systems, 1:995-1019, 1987.
96. C. Peterson and B. Soderberg. A New Method for Mapping OptimizationProblems onto Neural Networks. International Journal of NeuralSystems, 1:3-22, 1989.
97. E. Poupaert and Y. Deville. Simulated Annealing with Estimated Temperature. AI Communications, 13:19-26,2000.
98. S. Rajasekaran and J.H. Reif. Nested Annealing: A Provable Improvementto Simulated Annealing. Theoretical Computer Science, 99:157-176, 1992.
99. H.E. Romeijn and R.L. Smith. Simulated Annealing for Global ConstrainedOptimization. Journal of Global Optimization, 5:101-126, 1994.
100. H.E. Romeijn, Z.B. Zabinsky, D.L. Graesser, and S. Neogi. New ReflectionGenerator for Simulated Annealing in Mixed-Integer/ContinuousGlobal Optimization. Journal of Optimization Theory and Applications,101:403-427, 1999.
101. F. Romeo and A. Sangiovanni-Vincentelli. A Theoretical Framework forSimulated Annealing. Algorithmica, 6:302-345, 1991.
102. P.C. Schuur. Classification of Acceptance Criteria for the Simulated AnnealingAlgorithm. Memorandum COSOR 89-99, Eindhoven Universityof Technology, Eindhoven, 1989.
103. C. Sechen and A.L. Sangiovanni-Vincentelli. The TimberWolf Placementand Routing Package. IEEE Journal on Solid State Circuits, 30:510-522,1985.
104. E. Seneta. Non-Negative Matrices and Markov Chains. Springer Verlag,1981.
105. K. Shahookar and P. Mazumder. VLSI Cell Placement Techniques. ComputingSurveys, 23:143-220, 1991.
106. G.B. Sorkin. Efficient Simulated Annealing on Fractal Energy Landscapes. Algorithmica, 6:367-418, 1991.
107. J. Stander and B.W. Silverman. Temperature Schedules for SimulatedAnnealing. Statistics and Computing, 4:21-32, 1994.
108. K. Steinh6fel, A. Albrecht, and C.K. Wong. On Various Cooling Schedulesfor Simulated Annealing Applied to the Job Shop Problem. Lecture Notesin Computer Science, 1518:260-279, 1998.
109. P.N. Strenski and S. Kirkpatrick. Analysis of Finite Length AnnealingSchedules. Algorithmica, 6:346-366, 1991.
110. H. Szu and R. Hartley. Fast Simulated Annealing. Physics Letters A,122:157-162,1987.
111. C. Tsallis and D.A. Stariolo. Generalized Simulated Annealing. PhysicaA, 233:395-406, 1996.
112. K. Tsuchiya, T. Nishiyama, and K. Tsujita. A Deterministic AnnealingAlgorithm for a Combinatorial Optimization Problem by the Use of ReplicatorEquations. In: Proceedings of the IEEE International Conference onSystems, Man, and Cybernetics, vol. 1, pages 256-261, 1999.
113. D. Thyttens, J. Teghem, Ph. Fortemps, and K. van Niuewenhuyze. Performanceof the MOSA Method for the Bicriteria Assignment Problem. Journal of Heuristics 6:295-310, 2000.
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. Manner and B.Manderick, editors, pages 65-74, North-Holland, 1992.
115. R.J .M. Vaessens, E.H.L. Aarts, and J.K. Lenstra. Job Shop Schedulingby Local Search. INFORMS Journal on Computing, 8:302-317, 1996.
116. M.G.A. Verhoeven and E.H.L. Aarts. Parallel Local Search Techniques. Journal of Heuristics, 1:43-65, 1996.
117. R.V.V. Vidal. Applied Simulated Annealing. Lecture Notes in Economicsand Mathematical Systems, 396:276-290, 1993.
118. B.W. Wah and T. Wang. Simulated Annealing with Asymptotic Convergencefor Nonlinear Constrained Global Optimization. Lecture Notes inComputer Science, 1713:461-475,1999.
119. L. Wang and K. Smith. On Chaotic Simulated Annealing. IEEE Transactionson Neural Networks, 9:716-718, 1998.
120. T.-Y. Wang and K.-B. Wu. A Parameter Set Design Procedure for theSimulated Annealing Algorithm under the Computational Time Constraint. Computers and Operations Research, 26:665-678, 1999.
121. R.J. Willis and B.J. Terrill. Scheduling the Australian State Cricket Seasonusing Simulated Annealing. Journal of the Operational Research Society,45:276-280, 1994.
122. D.F. Wong, H.W. Leong, and C.L. Liu. Simulated Annealing for VLSIDesign. Kluwer, 1988.
123. Y. Xiang and X.G. Gong. Efficiency of Generalized Simulated Annealing. Physical Review E, 62:4473-4476,2000.
124. R.L. Yang. Convergence of the Simulated Annealing Algorithm for ContinuousGlobal Optimization. Journal of Optimization Theory and Application,104:691-716,2000.
125. X. Yao. Simulated Annealing with Extended Neighbourhood. InternationalJournal of Computer Mathematics, 40:169-189, 1991.
126. X. Yao. Optimization by Genetic Annealing. In: Proceedings of the 2ndAustralian Conference on Neural Networks, pages 94-97, Sydney, 1991.
127. X. Yao. A New Simulated Annealing Algorithm. International Journal ofComputer Mathematics, 56:161-168, 1995.
128. G. Yin. Convergence of a Global Stochastic Optimization Algorithm withPartial Step Size Restarting. Advances in Applied Probability, 32:480-498,2000.