The University of Southampton
University of Southampton Institutional Repository

Do general Genetic Algorithms provide benefits when solving real problems?

Do general Genetic Algorithms provide benefits when solving real problems?
Do general Genetic Algorithms provide benefits when solving real problems?

There is a vibrant community devoted to developing novel Genetic Algorithms each year. The effectiveness of these algorithms is normally evaluated based upon a selected set of artificial functions self-selected by the same community. These sets are generated to reduce the complexity seen in real applications so they can be run in a computationally short period of time, so that the final answer is known and so that certain characteristics can be isolated, giving more information about the strengths and weaknesses of a given methodology. In particular, the literature is dominated by a wide range of continuous and unconstrained problems, which are dominated by only one characteristic. This leads to a bias in the current Genetic Algorithms towards a set of specialist solvers for these problems, dominated by convergence enhancing mechanisms, as the success of the current state-of-the-art is directly linked to them. In this paper, the success of these specialist solvers is determined on two different engineering problems to verify the performance of a number of specialist and general genetic algorithms. The results show that the general-solvers exhibit better performance on the engineering problems with and without constraints. It is concluded that more emphasis should be given to general solvers development and the development of new benchmarking problems should be broader in scope and contain problems with many different characteristics.

Competitive benchmark, engineering applications, genetic algorithms.
1822-1829
Institute of Electrical and Electronics Engineers Inc.
Grudniewski, Przemyslaw A.
31ca5517-c2c8-49dd-9536-6af3aefd8d33
Sobey, Adam J.
e850606f-aa79-4c99-8682-2cfffda3cd28
Grudniewski, Przemyslaw A.
31ca5517-c2c8-49dd-9536-6af3aefd8d33
Sobey, Adam J.
e850606f-aa79-4c99-8682-2cfffda3cd28

Grudniewski, Przemyslaw A. and Sobey, Adam J. (2019) Do general Genetic Algorithms provide benefits when solving real problems? In 2019 IEEE Congress on Evolutionary Computation, CEC 2019 - Proceedings. Institute of Electrical and Electronics Engineers Inc. pp. 1822-1829 . (doi:10.1109/CEC.2019.8789997).

Record type: Conference or Workshop Item (Paper)

Abstract

There is a vibrant community devoted to developing novel Genetic Algorithms each year. The effectiveness of these algorithms is normally evaluated based upon a selected set of artificial functions self-selected by the same community. These sets are generated to reduce the complexity seen in real applications so they can be run in a computationally short period of time, so that the final answer is known and so that certain characteristics can be isolated, giving more information about the strengths and weaknesses of a given methodology. In particular, the literature is dominated by a wide range of continuous and unconstrained problems, which are dominated by only one characteristic. This leads to a bias in the current Genetic Algorithms towards a set of specialist solvers for these problems, dominated by convergence enhancing mechanisms, as the success of the current state-of-the-art is directly linked to them. In this paper, the success of these specialist solvers is determined on two different engineering problems to verify the performance of a number of specialist and general genetic algorithms. The results show that the general-solvers exhibit better performance on the engineering problems with and without constraints. It is concluded that more emphasis should be given to general solvers development and the development of new benchmarking problems should be broader in scope and contain problems with many different characteristics.

Full text not available from this repository.

More information

Published date: 1 June 2019
Venue - Dates: 2019 IEEE Congress on Evolutionary Computation, CEC 2019, Wellington, New Zealand, 2019-06-10 - 2019-06-13
Keywords: Competitive benchmark, engineering applications, genetic algorithms.

Identifiers

Local EPrints ID: 434203
URI: http://eprints.soton.ac.uk/id/eprint/434203
PURE UUID: 25641379-d8ec-40d5-8891-79bae1a69a5f
ORCID for Przemyslaw A. Grudniewski: ORCID iD orcid.org/0000-0003-0635-3125
ORCID for Adam J. Sobey: ORCID iD orcid.org/0000-0001-6880-8338

Catalogue record

Date deposited: 16 Sep 2019 16:30
Last modified: 08 Oct 2019 00:44

Export record

Altmetrics

Contributors

Author: Przemyslaw A. Grudniewski ORCID iD
Author: Adam J. Sobey ORCID iD

University divisions

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×