DocumentCode
418998
Title
Cauchy annealing schedule: an annealing schedule for Boltzmann selection scheme in evolutionary algorithms
Author
Dukkipati, Ambedkar ; Murty, M. Narasimha ; Bhatnagar, Shalabh
Author_Institution
Dept. of Comput. Sci. & Autom., Indian Inst. of Sci., Bangalore, India
Volume
1
fYear
2004
fDate
19-23 June 2004
Firstpage
55
Abstract
Boltzmann selection is an important selection mechanism in evolutionary algorithms as it has theoretical properties which help in theoretical analysis. However, Boltzmann selection is not used in practice because a good annealing schedule for the inverse temperature parameter is lacking. In this paper, we propose a Cauchy annealing schedule for Boltzmann selection scheme based on a hypothesis that selection-strength should increase as evolutionary process goes on and distance between two selection strengths should decrease for the process to converge. To formalize these aspects, we develop formalism for selection mechanisms using fitness distributions and give an appropriate measure for selection strength. In this paper, we prove an important result, by which we derive an annealing schedule called Cauchy annealing schedule. We demonstrate the novelty of proposed annealing schedule using simulations in the framework of genetic algorithms.
Keywords
Boltzmann equation; convergence; genetic algorithms; simulated annealing; statistical analysis; Boltzmann selection; Cauchy annealing schedule; evolutionary algorithms; evolutionary process; fitness distributions; genetic algorithms; inverse temperature parameter; selection strength; theoretical analysis; Algorithm design and analysis; Automation; Computer science; Evolutionary computation; Genetic algorithms; Mechanical factors; Pressure control; Processor scheduling; Simulated annealing; Temperature;
fLanguage
English
Publisher
ieee
Conference_Titel
Evolutionary Computation, 2004. CEC2004. Congress on
Print_ISBN
0-7803-8515-2
Type
conf
DOI
10.1109/CEC.2004.1330837
Filename
1330837
Link To Document