The application of a simulated annealing algorithm to the solution of combinatorial optimization problems

The application of a simulated annealing algorithm to the solution of combinatorial optimization problems

0.00 Avg rating0 Votes
Article ID: iaor1998375
Country: Cuba
Volume: 17
Issue: 1/3
Start Page Number: 19
End Page Number: 27
Publication Date: Jan 1996
Journal: Revista de Investigacin Operacional
Authors: ,
Keywords: combinatorial optimization
Abstract:

A variant of Simulated Annealing is selected and developed. It is applied to a classic NP-hard problem. An algorithm is designed for randomly generating problems of this type, of any dimension and with known solution. Numerical experiments are developed for fixing the influence of the algorithm's parameters, as well as its efficiency in problems of different dimension.

Reviews

Required fields are marked *. Your email address will not be published.