An Analysis of Locust Swarms on Large Scale Global Optimization Problems

  • Authors:
  • Stephen Chen

  • Affiliations:
  • School of Information Technology, York University, Toronto M3J 1P3

  • Venue:
  • ACAL '09 Proceedings of the 4th Australian Conference on Artificial Life: Borrowing from Biology
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

Locust Swarms are a recently-developed multi-optima particle swarm. To test the potential of the new technique, they have been applied to the 1000-dimension optimization problems used in the recent CEC2008 Large Scale Global Optimization competition. The results for Locust Swarms are competitive on these problems, and in particular, much better than other particle swarm-based techniques. An analysis of these results leads to a simple guideline for parameter selection in Locust Swarms that has a broad range of effective performance. Further analysis also demonstrates that "dimension reductions" during the search process are the single largest factor in the performance of Locust Swarms and potentially a key factor in the performance of other search techniques.