فهرست و منابع تحقیق مقاله شبیه سازی حرارتی Simulated Annealing
فهرست:
1- مقدمه. 3
2. SA چیست؟. 5
3- مقایسه SA با تپه‌نوردی.. 8
4- معیار پذیرش (یک حرکت) 9
5- رابطه‌ی بین SA و حرارت فیزیکی.. 11
6- اجرای SA.. 11
7- برنامه سرد کردن. 12
1-7. درجه حرارت آغازین.. 13
2-7. درجه حرارت پایانی.. 14
3-7. کاهش درجه حرارت در هر مرحله. 14
4-7. تکرار در هر دما 14
8- تابع هزینه. 14
9- همسایگی.. 15
10- روش حل TSP با SA.. 15
11- نتیجه‌گیری.. 19
منابع. 20
.
منبع:
Aarts, E.H.L., Korst, J.H.M. 1989. Simulated Annealing and Boltzmann Machines. Wiley, Chichester.
E.K. Burke and G. Kendall, "Evaluation of Two Dimensional Bin Packing Problem using the No Fit Polygon", Proceedings of the 26th International Conference on Computers and Industrial Engineering, Melbourne, Australia, 15-17 December 1999, pp 286-291
Cěrny, V. 1985. A Thermodynamical Approach to the Travelling Salesman Problem; An Efficient Simulation Algorithm. J. of Optimization Theory and Applic. 45, 41-55
Connolly, D.T. 1990. An Improved Annealing Scheme for the QAP. EJOR, 46, 93-100
Dowsland, K.A. 1995. Simulated Annealing. In Modern Heuristic Techniques for Combinatorial Problems (ed. Reeves, C.R.), McGraw-Hill, 1995
Hajek, B. 1988. Cooling Schedules for Optimal Annealing. Mathematics of Operations Research, vol 13, No. 2, pp311-329
Johnson, D.S., Aragon, C.R., McGeoch, L.A.M. and Schevon, C. 1991. Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning. Operations Research, 39, 378-406
Kirkpatrick, S , Gelatt, C.D., Vecchi, M.P. 1983. Optimization by Simulated Annealing. Science, vol 220, No. 4598, pp671-680
Lundy, M., Mees, A. 1986. Convergence of an Annealing Algorithm. Math. Prog., 34, 111-124
Metropolis, N., Rosenbluth, A.W., Rosenbluth, M.N., Teller, A.H., Teller, E. 1953. Equation of State Calculation by Fast Computing Machines. J. of Chem. Phys., 21, 1087-1091.
Mitra, D., Romeo, F., Sangiovanni-Vincentelli, A. 1986. Convergence and Finite Time Behavior of Simulated Annealing. Advances in Applied Probability, vol 18, pp 747-771
A. Rana, A.E. Howe, L.D. Whitley and K. Mathias. 1996. Comparing Heuristic, Evolutionary and Local Search Approaches to Scheduling. Third Artificial Intelligence Plannings Systems Conference (AIPS-96)
Rayward-Smith, V.J., Osman, I.H., Reeves, C.R., Smith, G.D. 1996. Modern Heuristic Search Methods. John Wiley & Sons.
P. Ross, D. Corne and F. Hsiao-Lan. 1994. Improving Evolutionary Timetabling with Delta Evaluation and Directed Mutation. In Y. Davidor, H-P Schwefel and R. Manner (eds) Parallel Problem Solving in Nature, Vol 3, Springer-Verlag, Berlin
Russell, S., Norvig, P. 1995. Artificial Intelligence A Modern Approach. Prentice-Hall
Rutenbar, R.A. 1989. Simulated Annealing Algorithms : An Overview. IEEE Circuits and Devices Magazine, Vol 5, No. 1, pp 19-26
Van Laarhoven, P.J.M, Aarts, E.H.L. 1987. Simulated Annealing: Theory and Applications. D. Reidel Publishing
White, S.R. 1984. Concepts of Scale in Simulated Annealing. Proceedings International Conference on Computers in Design, pp 646-665
19. Andrew W. Moore _ Professor_ School of Computer ScienCarnegiemellon University_www.cs.cmu.edu/~awm
.