| dc.creator | Segura, Enrique Carlos | |
| dc.date | 2005-10 | |
| dc.date | 2005-10 | |
| dc.date | 2012-10-25T11:55:15Z | |
| dc.identifier | http://sedici.unlp.edu.ar/handle/10915/22922 | |
| dc.description | 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. | |
| dc.description | Eje: VI Workshop de Agentes y Sistemas Inteligentes (WASI) | |
| dc.description | Red de Universidades con Carreras en Informática | |
| dc.format | application/pdf | |
| dc.language | en | |
| dc.rights | http://creativecommons.org/licenses/by-nc-sa/2.5/ar/ | |
| dc.rights | Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5) | |
| dc.subject | Ciencias Informáticas | |
| dc.subject | Simulated annealing | |
| dc.subject | evolutionary computation | |
| dc.subject | thermodynamics of equilibrium | |
| dc.subject | ergodicity | |
| dc.subject | detailed balance | |
| dc.title | On the possibility to design evolutionary algorithms with optimal equilibrium distribution : The case of simulated annealing | |
| dc.type | Objeto de conferencia | |
| dc.type | Objeto de conferencia | |
