|
|
Article: Evolutionary computation with simulated annealing: conditions for optimal equilibrium distribution.
- Article from:
- Journal of Computer Science & Technology
- Article date:
- December 1, 2005
- Author:
CopyrightCOPYRIGHT 2005 Graduate Network of Argentine Universities with Computer Science Schools (RedUNCI). This material is published under license from the publisher through the Gale Group, Farmington Hills, Michigan. All inquiries regarding rights should be directed to the Gale Group. (Hide copyright information)
|
ABSTRACT
In this paper a thermodynamic approach is presented to the problem of convergence of evolutionary algorithms. The case of the Simulated Annealing algorithm for optimisation is considered as a simple evolution strategy with a control parameter allowing balance between the probability of obtaining an optimal or near-optimal solution and the time that the algorithm will take to reach equilibrium. This capacity is analysed and a theoretical frame is presented, stating a general condition to be fulfilled by an evolutionary algorithm in order to ensure its convergence to a global maximum of the fitness function.
Keywords: evolutionary computation, ...