By Topic

A new local search algorithm for continuous spaces based on army ant swarm raids

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Greenwood, G.W. ; Portland State Univ. Portland, Portland ; Abbass, H.

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.

Published in:

Evolutionary Computation, 2007. CEC 2007. IEEE Congress on

Date of Conference:

25-28 Sept. 2007