Comparing genetic algorithms and particle swarm optimisation for an inverse problem exercise

C. R. Mouser, S. A. Dunn

Abstract


We describe the performance of two population based search algorithms (genetic algorithms and particle swarm optimisation) when applied to the optimisation of a structural dynamics model. A significant difficulty arises when trying to compare the performance of such algorithms. For the two algorithms to perform at their best, several properties (for example, population size and mutation rate) need to be set. The performance of the algorithms can be highly sensitive to the choice of these parameters, and the optimisation of these leads to a search in a multi-dimensional space. This work describes how a genetic algorithm optimises the properties of a genetic algorithm and a particle swarm optimisation in order to produce algorithms that are optimally tuned to the particular problem being solved. The two methods are rigorously compared. This problem is implemented on a distributed computing facility spread across the Defence Science and Technology Organisation's network across four cities in south-east Australia.

Full Text:

PDF BibTeX


DOI: http://dx.doi.org/10.21914/anziamj.v46i0.949



Remember, for most actions you have to record/upload into this online system
and then inform the editor/author via clicking on an email icon or Completion button.
ANZIAM Journal, ISSN 1446-8735, copyright Australian Mathematical Society.