Locust Swarms
Locust Swarms are a multi-optima particle swarm that involve two phases: Scouts (for coarse search) and Locusts (for greedy search). Early results include best-known results on the "FastFractal" problem used in the CEC2008 Large Scale Global Optimization Competition. Current research is focusing on the role of "dimension reductions" on non-decomposable problems -- e.g. BBOB.
Peer-Reviewed Conference Proceedings
S. Chen and V. Lupien. (2009) “Optimization in Fractal and Fractured Landscapes using Locust Swarms.” In Lecture Notes in Computer Science, Vol. TBA : Proceedings of Fourth Australian Conference on Artificial Life, Melbourne, Australia Dec. 1-4, 2009. Springer.
S. Chen. (2009) “An Analysis of Locust Swarms on Large Scale Global Optimization Problems.” In Lecture Notes in Computer Science, Vol. TBA : Proceedings of Fourth Australian Conference on Artificial Life, Melbourne, Australia Dec. 1-4, 2009. Springer.
S. Chen. (2009) “Locust Swarms – A New Multi-Optima Search Technique.” In Proceedings of the 2009 IEEE Congress on Evolutionary Computation, pp 1745-1752. IEEE.
S. Chen, K. Miura, and S. Razzaqi. (2007) “Analyzing the Role of "Smart" Start Points in Coarse Search-Greedy Search.” In Lecture Notes in Computer Science, Vol. 4828 : Proceedings of Third Australian Conference on Artificial Life, pp 13-24. Springer.
Other Information
This research has been funded in part by the Natural Sciences and Engineering Research Council of Canada.
