On the possibility to design evolutionary algorithms with optimal equilibrium distribution : The case of simulated annealing

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...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autor principal: Segura, Enrique Carlos
Formato: Objeto de conferencia
Lenguaje:Inglés
Publicado: 2005
Materias:
Ciencias Informáticas
Simulated annealing
evolutionary computation
thermodynamics of equilibrium
ergodicity
detailed balance
Acceso en línea:http://sedici.unlp.edu.ar/handle/10915/22922
Aporte de:
SEDICI (UNLP) de Universidad Nacional de La Plata
id I19-R120-10915-22922
record_format dspace
spelling I19-R120-10915-229222024-05-14T17:56:01Z http://sedici.unlp.edu.ar/handle/10915/22922 On the possibility to design evolutionary algorithms with optimal equilibrium distribution : The case of simulated annealing Segura, Enrique Carlos 2005-10 2005-10 2012-10-25T11:55:15Z en Ciencias Informáticas Simulated annealing evolutionary computation thermodynamics of equilibrium ergodicity detailed balance 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. Eje: VI Workshop de Agentes y Sistemas Inteligentes (WASI) Red de Universidades con Carreras en Informática Objeto de conferencia Objeto de conferencia http://creativecommons.org/licenses/by-nc-sa/2.5/ar/ Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5) application/pdf
institution Universidad Nacional de La Plata
institution_str I-19
repository_str R-120
collection SEDICI (UNLP)
language Inglés
topic Ciencias Informáticas
Simulated annealing
evolutionary computation
thermodynamics of equilibrium
ergodicity
detailed balance
spellingShingle Ciencias Informáticas
Simulated annealing
evolutionary computation
thermodynamics of equilibrium
ergodicity
detailed balance
Segura, Enrique Carlos
On the possibility to design evolutionary algorithms with optimal equilibrium distribution : The case of simulated annealing
topic_facet Ciencias Informáticas
Simulated annealing
evolutionary computation
thermodynamics of equilibrium
ergodicity
detailed balance
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.
format Objeto de conferencia
Objeto de conferencia
author Segura, Enrique Carlos
author_facet Segura, Enrique Carlos
author_sort Segura, Enrique Carlos
title On the possibility to design evolutionary algorithms with optimal equilibrium distribution : The case of simulated annealing
title_short On the possibility to design evolutionary algorithms with optimal equilibrium distribution : The case of simulated annealing
title_full On the possibility to design evolutionary algorithms with optimal equilibrium distribution : The case of simulated annealing
title_fullStr On the possibility to design evolutionary algorithms with optimal equilibrium distribution : The case of simulated annealing
title_full_unstemmed On the possibility to design evolutionary algorithms with optimal equilibrium distribution : The case of simulated annealing
title_sort on the possibility to design evolutionary algorithms with optimal equilibrium distribution : the case of simulated annealing
publishDate 2005
url http://sedici.unlp.edu.ar/handle/10915/22922
work_keys_str_mv AT seguraenriquecarlos onthepossibilitytodesignevolutionaryalgorithmswithoptimalequilibriumdistributionthecaseofsimulatedannealing
_version_ 1807220261667209216

Ejemplares similares