Partnering Strategies for Fitness Evaluation in a Pyramidal Evolutionary Algorithm

Tools

Aickelin, Uwe and Bull, L (2002) Partnering Strategies for Fitness Evaluation in a Pyramidal Evolutionary Algorithm. In: Genetic and Evolutionary Computation Conference, 2002, New York, USA.

Warning
There is a more recent version of this item available.
[thumbnail of 02gecco_partner.pdf] PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
Download (51kB)

Abstract

This paper combines the idea of a hierarchical distributed genetic algorithm with different inter-agent partnering strategies. Cascading clusters of sub-populations are built from bottom up, with higher-level sub-populations optimising larger parts of the problem. Hence higher-level sub-populations search a larger search space with a lower resolution whilst lower-level sub-populations search a smaller search space with a higher resolution. The effects of different partner selection schemes for (sub-)fitness evaluation purposes are examined for two multiple-choice optimisation problems. It is shown that random partnering strategies perform best by providing better sampling and more diversity.

Item Type: Conference or Workshop Item (Paper)
Schools/Departments: University of Nottingham, UK > Faculty of Science > School of Computer Science
Depositing User: Aickelin, Professor Uwe
Date Deposited: 03 Nov 2005
Last Modified: 31 May 2021 14:47
URI: https://eprints.nottingham.ac.uk/id/eprint/255

Available Versions of this Item

Actions (Archive Staff Only)

Edit View Edit View