The University of Southampton
University of Southampton Institutional Repository

A brief comparison of some evolutionary optimization methods

A brief comparison of some evolutionary optimization methods
A brief comparison of some evolutionary optimization methods
The subject of evolutionary computing is a rapidly developing one where many new search methods are being proposed all the time. Inevitably, some of these new methods will not still be in current use in a few years as a small subset becomes the preferred choice of the optimization community. A key part in this process is the back-to-back testing of competing methods on test problems that simulate real problems. This brief paper presents results for such a test, focusing on the robustness of four methods when applied to a pair of high dimensional test functions. The work presented shows that some modern search methods can be highly sensitive to mistuning of their control parameters and, moreover, that different problems may well require radically different settings of such parameters if the searches are to be effective.
0471962805
255-272
John Wiley & Sons
Keane, A.J.
26d7fa33-5415-4910-89d8-fb3620413def
Rayward-Smith, V.J.
Osman, I.H.
Reeves, C.R.
Smith, G.D.
Keane, A.J.
26d7fa33-5415-4910-89d8-fb3620413def
Rayward-Smith, V.J.
Osman, I.H.
Reeves, C.R.
Smith, G.D.

Keane, A.J. (1996) A brief comparison of some evolutionary optimization methods. In, Rayward-Smith, V.J., Osman, I.H., Reeves, C.R. and Smith, G.D. (eds.) Modern Heuristic Search Methods. Chichester, UK. John Wiley & Sons, pp. 255-272.

Record type: Book Section

Abstract

The subject of evolutionary computing is a rapidly developing one where many new search methods are being proposed all the time. Inevitably, some of these new methods will not still be in current use in a few years as a small subset becomes the preferred choice of the optimization community. A key part in this process is the back-to-back testing of competing methods on test problems that simulate real problems. This brief paper presents results for such a test, focusing on the robustness of four methods when applied to a pair of high dimensional test functions. The work presented shows that some modern search methods can be highly sensitive to mistuning of their control parameters and, moreover, that different problems may well require radically different settings of such parameters if the searches are to be effective.

Text
kean_96.pdf - Accepted Manuscript
Download (2MB)

More information

Published date: 1996

Identifiers

Local EPrints ID: 21162
URI: http://eprints.soton.ac.uk/id/eprint/21162
ISBN: 0471962805
PURE UUID: a0366e46-2f7a-489d-a5e9-e603dfc6e171
ORCID for A.J. Keane: ORCID iD orcid.org/0000-0001-7993-1569

Catalogue record

Date deposited: 07 Nov 2006
Last modified: 16 Mar 2024 02:53

Export record

Contributors

Author: A.J. Keane ORCID iD
Editor: V.J. Rayward-Smith
Editor: I.H. Osman
Editor: C.R. Reeves
Editor: G.D. Smith

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.

×