DocumentCode :
2689887
Title :
A new local search algorithm for continuous spaces based on army ant swarm raids
Author :
Greenwood, Garrison W. ; Abbass, Hussein
Author_Institution :
Portland State Univ. Portland, Portland
fYear :
2007
fDate :
25-28 Sept. 2007
Firstpage :
1097
Lastpage :
1102
Abstract :
It is well known that evolutionary algorithms often perform much better when augmented with a local search mechanism. While many local search methods exist for combinatorial optimization problems, there are relatively few methods designed to work over continuous fitness landscapes. This paper describes a novel continuous space local search algorithm for evolutionary algorithms that emulates army ant swarm raids. Our preliminary results show the method is remarkably effective.
Keywords :
evolutionary computation; search problems; army ant swarm raids; combinatorial optimization problems; continuous spaces; evolutionary algorithms; local search algorithm; Australia; Chemicals; Design methodology; Design optimization; Evolutionary computation; Military computing; Potential energy; Proteins; Search methods; Simulated annealing;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Evolutionary Computation, 2007. CEC 2007. IEEE Congress on
Conference_Location :
Singapore
Print_ISBN :
978-1-4244-1339-3
Electronic_ISBN :
978-1-4244-1340-9
Type :
conf
DOI :
10.1109/CEC.2007.4424592
Filename :
4424592
Link To Document :
بازگشت