Characterising continuous optimisation problems for particle swarm optimisation performance prediction
Real-world optimisation problems are often very complex. Population-based metaheuristics, such as evolutionary algorithms and particle swarm optimisation (PSO) algorithms, have been successful in solving many of these problems, but it is well known that they sometimes fail. Over the last few decade...
Main Author: | |
---|---|
Other Authors: | |
Language: | en |
Published: |
2014
|
Subjects: | |
Online Access: | http://hdl.handle.net/2263/37128 Malan, KM 2014, Characterising continuous optimisation problems for particle swarm optimisation performance prediction, PhD thesis, University of Pretoria, Pretoria, viewed yymmdd<http://hdl.handle.net/2263/37128> |
id |
ndltd-netd.ac.za-oai-union.ndltd.org-up-oai-repository.up.ac.za-2263-37128 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-netd.ac.za-oai-union.ndltd.org-up-oai-repository.up.ac.za-2263-371282017-07-20T04:12:00Z Characterising continuous optimisation problems for particle swarm optimisation performance prediction Malan, Katherine Mary Engelbrecht, Andries P. kmalan@cs.up.ac.za Particle swarm optimisation (PSO) UCTD Fitness landscape analysis Problem hardness measures Real-world optimisation problems are often very complex. Population-based metaheuristics, such as evolutionary algorithms and particle swarm optimisation (PSO) algorithms, have been successful in solving many of these problems, but it is well known that they sometimes fail. Over the last few decades the focus of research in the field has been largely on the algorithmic side with relatively little attention being paid to the study of the problems. Questions such as ‘Which algorithm will most accurately solve my problem?’ or ‘Which algorithm will most quickly produce a reasonable answer to my problem?’ remain unanswered. This thesis contributes to the understanding of optimisation problems and what makes them hard for algorithms, in particular PSO algorithms. Fitness landscape analysis techniques are developed to characterise continuous optimisation problems and it is shown that this characterisation can be used to predict PSO failure. An essential feature of this approach is that multiple problem characteristics are analysed together, moving away from the idea of a single measure of problem hardness. The resulting prediction models not only lead to a better understanding of the algorithms themselves, but also takes the field a step closer towards the goal of informed decision-making where the most appropriate algorithm is chosen to solve any new complex problem. Thesis (PhD)--University of Pretoria, 2014. Computer Science unrestricted 2014-03-19T07:18:58Z 2014-03-19T07:18:58Z 2014 2014 Thesis http://hdl.handle.net/2263/37128 Malan, KM 2014, Characterising continuous optimisation problems for particle swarm optimisation performance prediction, PhD thesis, University of Pretoria, Pretoria, viewed yymmdd<http://hdl.handle.net/2263/37128> B14/4/56/gm en © 2014 University of Pretoria. All rights reserved. The copyright in this work vests in the University of Pretoria. No part of this work may be reproduced or transmitted in any form or by any means, without the prior written permission of the University of Pretoria. |
collection |
NDLTD |
language |
en |
sources |
NDLTD |
topic |
Particle swarm optimisation (PSO) UCTD Fitness landscape analysis Problem hardness measures |
spellingShingle |
Particle swarm optimisation (PSO) UCTD Fitness landscape analysis Problem hardness measures Malan, Katherine Mary Characterising continuous optimisation problems for particle swarm optimisation performance prediction |
description |
Real-world optimisation problems are often very complex. Population-based metaheuristics, such as evolutionary algorithms and particle swarm optimisation (PSO) algorithms, have been successful in solving many of these problems, but it is well known that they sometimes fail. Over the last few decades the focus of research in the field has been largely on the algorithmic side with relatively little attention being paid to the study of the problems. Questions such as ‘Which algorithm will most accurately solve my problem?’ or ‘Which algorithm will most quickly produce a reasonable answer to my problem?’ remain unanswered.
This thesis contributes to the understanding of optimisation problems and what makes them hard for algorithms, in particular PSO algorithms. Fitness landscape analysis techniques are developed to characterise continuous optimisation problems and it is shown that this characterisation can be used to predict PSO failure. An essential feature of this approach is that multiple problem characteristics are analysed together, moving away from the idea of a single measure of problem hardness. The resulting prediction models not only lead to a better understanding of the algorithms themselves, but also takes the field a step closer towards the goal of informed decision-making where the most appropriate algorithm is chosen to solve any new complex problem. === Thesis (PhD)--University of Pretoria, 2014. === Computer Science === unrestricted |
author2 |
Engelbrecht, Andries P. |
author_facet |
Engelbrecht, Andries P. Malan, Katherine Mary |
author |
Malan, Katherine Mary |
author_sort |
Malan, Katherine Mary |
title |
Characterising continuous optimisation problems for particle swarm optimisation performance prediction |
title_short |
Characterising continuous optimisation problems for particle swarm optimisation performance prediction |
title_full |
Characterising continuous optimisation problems for particle swarm optimisation performance prediction |
title_fullStr |
Characterising continuous optimisation problems for particle swarm optimisation performance prediction |
title_full_unstemmed |
Characterising continuous optimisation problems for particle swarm optimisation performance prediction |
title_sort |
characterising continuous optimisation problems for particle swarm optimisation performance prediction |
publishDate |
2014 |
url |
http://hdl.handle.net/2263/37128 Malan, KM 2014, Characterising continuous optimisation problems for particle swarm optimisation performance prediction, PhD thesis, University of Pretoria, Pretoria, viewed yymmdd<http://hdl.handle.net/2263/37128> |
work_keys_str_mv |
AT malankatherinemary characterisingcontinuousoptimisationproblemsforparticleswarmoptimisationperformanceprediction |
_version_ |
1718499811877978112 |