DocumentCode
239091
Title
Elitism-based immigrants for ant colony optimization in dynamic environments: Adapting the replacement rate
Author
Mavrovouniotis, Michalis ; Shengxiang Yang
Author_Institution
Centre for Comput. Intell. (CCI), De Montfort Univ., Leicester, UK
fYear
2014
fDate
6-11 July 2014
Firstpage
1752
Lastpage
1759
Abstract
The integration of immigrants schemes with ant colony optimization (ACO) algorithms showed promising results on different dynamic optimization problems (DOPs). The principle of integrating immigrants schemes within ACO is to introduce newly generated ants that will replace other ants in the current population. One of the most advanced immigrants schemes is the elitism-based immigrants scheme, where the best ant from the previous environment is used as the base to generate immigrants. So far, the replacement rate used for elitism-based immigrants in ACO remained fixed during the execution of the algorithm. In this paper the impact of the replacement rate on the performance of ACO algorithms with elitism-based immigrants is examined. In addition, an adaptive replacement rate is proposed and compared with fixed and optimized replacement rates based on a series of DOPs. The experiments show that the adaptive scheme provides an automatic way to set a good value, although not the optimal one, for the replacement rate within ACO with elitism-based immigrants for DOPs.
Keywords
ant colony optimisation; dynamic programming; ACO algorithm; DOP; adaptive replacement rate; ant colony optimization; dynamic environments; dynamic optimization problems; elitism-based immigrants; fixed replacement rates; optimized replacement rates; Benchmark testing; Cities and towns; Heuristic algorithms; Optimization; Sociology; Statistics; Vehicle dynamics;
fLanguage
English
Publisher
ieee
Conference_Titel
Evolutionary Computation (CEC), 2014 IEEE Congress on
Conference_Location
Beijing
Print_ISBN
978-1-4799-6626-4
Type
conf
DOI
10.1109/CEC.2014.6900482
Filename
6900482
Link To Document