The IRMA Community
Newsletters
Research IRM
Click a keyword to search titles using our InfoSci-OnDemand powered search:
|
A Comparison of Cooling Schedules for Simulated Annealing
Abstract
Simulated annealing is one of the most important metaheuristics or general-purpose algorithms of combinatorial optimization, whose properties of convergence towards high quality solutions are well known, although with a high computational cost. Due to that, it has been produced a quite number of research works on the convergence speed of the algorithm, especially on the treatment of the temperature parameter, which is known as cooling schedule or strategy. In this article we make a comparative study of the performance of simulated annealing using the most important cooling strategies (Kirkpatrick, S., Gelatt, C.D. & Vecchi, M.P., 1983), (Dowsland, K.A., 2001), (Luke, B.T., 1995), (Locatelli, M., 2000). Two classical problems of combinatorial optimization are used in the practical analysis of the algorithm: the travelling salesman problem and the quadratic assignment problem.
Related Content
|
Frederic Andres.
© 2027.
14 pages.
|
|
Kalsoom Safdar, Khairul Najmy Abdul Rani, Mohd Aminudin Jamlos, Siti Julia Rosli, Muhammad Usman Younus, Zanab Safdar.
© 2027.
27 pages.
|
|
Bani Adam, Binastya Anggara Sekti, Muhammad Adi Zacky Zahran.
© 2027.
24 pages.
|
|
Swetha Margaret T. A., Renuka Devi D..
© 2027.
31 pages.
|
|
Maurice Saluschke, Michael Schulz.
© 2027.
30 pages.
|
|
Mirjam Sepesy Maučec, Gregor Donaj.
© 2027.
16 pages.
|
|
Jorge A. Ruiz-Vanoye, Ocotlan Diaz-Parra, Ricardo A. Barrera-Cámara, Alejandro Fuentes-Penna, Francisco R. Trejo-Macotela, Jaime Aguilar-Ortiz, Eric Simancas-Acevedo.
© 2027.
21 pages.
|
|
|