Simple population replacement strategies for a steady-state multi-objective evolutionary algorithm

Mumford, Christine Lesley ORCID: https://orcid.org/0000-0002-4514-0272 2004. Simple population replacement strategies for a steady-state multi-objective evolutionary algorithm. Presented at: Genetic and Evolutionary Computation Conference (GECCO) 2004, Seattle, WA, USA, 26-30 June 2004. Genetic and Evolutionary Computation – GECCO 2004. GENETIC AND EVOLUTIONARY COMPUTATION - GECCO 2004, PT 1, PROCEEDINGS. Lecture Notes in Computer Science (3102) Springer, pp. 1389-1400. 10.1007/978-3-540-24854-5_132

Preview

HTML Download (278kB) | Preview

Abstract

This paper explores some simple evolutionary strategies for an elitist, steady-state Pareto-based multi-objective evolutionary algorithm. The experimental framework is based on the SEAMO algorithm which differs from other approaches in its reliance on simple population replacement strategies, rather than sophisticated selection mechanisms. The paper demonstrates that excellent results can be obtained without the need for dominance rankings or global fitness calculations. Furthermore, the experimental results clearly indicate which of the population replacement techniques are the most effective, and these are then combined to produce an improved version of the SEAMO algorithm. Further experiments indicate the approach is competitive with other state-of-the-art multi-objective evolutionary algorithms.

Item Type:	Conference or Workshop Item (Paper)
Date Type:	Publication
Status:	Published
Schools:	Computer Science & Informatics
Subjects:	Q Science > QA Mathematics > QA75 Electronic computers. Computer science Q Science > QA Mathematics > QA76 Computer software
Publisher:	Springer
Last Modified:	20 Oct 2022 08:44
URI:	https://orca.cardiff.ac.uk/id/eprint/29460

Citation Data

Cited 26 times in Scopus. View in Scopus. Powered By Scopus® Data

Actions (repository staff only)

Edit Item