Title page for ETD etd-09242012-211127


Document Type Doctoral Thesis
Author Helbig, Marde
URN etd-09242012-211127
Document Title Solving dynamic multi-objective optimisation problems using vector evaluated particle swarm optimisation
Degree PhD
Department Computer Science
Supervisor
Advisor Name Title
Prof S P Engelbrecht Supervisor
Keywords
  • management of boundary constraint violations
  • performance measures
  • guide updates
  • benchmark functions
  • dynamic multi-objective optimisation
  • particle swarm optimisation
  • vector evaluated particle swarm optimisation
Date 2012-09-06
Availability unrestricted
Abstract
Most optimisation problems in everyday life are not static in nature, have multiple objectives and at least two of the objectives are in conflict with one another. However, most research focusses on either static multi-objective optimisation (MOO) or dynamic singleobjective optimisation (DSOO). Furthermore, most research on dynamic multi-objective optimisation (DMOO) focusses on evolutionary algorithms (EAs) and only a few particle swarm optimisation (PSO) algorithms exist. This thesis proposes a multi-swarm PSO algorithm, dynamic Vector Evaluated Particle Swarm Optimisation (DVEPSO), to solve dynamic multi-objective optimisation problems (DMOOPs). In order to determine whether an algorithm solves DMOO efficiently, functions are required that resembles real world DMOOPs, called benchmark functions, as well as functions that quantify the performance of the algorithm, called performance measures. However, one major problem in the field of DMOO is a lack of standard benchmark functions and performance measures. To address this problem, an overview is provided from the current literature and shortcomings of current DMOO benchmark functions and performance measures are discussed. In addition, new DMOOPs are introduced to address the identified shortcomings of current benchmark functions. Guides guide the optimisation process of DVEPSO. Therefore, various guide update approaches are investigated. Furthermore, a sensitivity analysis of DVEPSO is conducted to determine the influence of various parameters on the performance of DVEPSO. The investigated parameters include approaches to manage boundary constraint violations, approaches to share knowledge between the sub-swarms and responses to changes in the environment that are applied to either the particles of the sub-swarms or the non-dominated solutions stored in the archive. From these experiments the best DVEPSO configuration is determined and compared against four state-of-the-art DMOO algorithms.

2012 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.

Please cite as follows:

Helbig, M 2012, Solving dynamic multi-objective optimisation problems using vector evaluated particle swarm optimisation, PhD thesis, University of Pretoria, Pretoria, viewed yymmdd < http://upetd.up.ac.za/thesis/available/etd-09242012-211127/ >

D12/9/257/ag

Files
  Filename       Size       Approximate Download Time (Hours:Minutes:Seconds) 
 
 28.8 Modem   56K Modem   ISDN (64 Kb)   ISDN (128 Kb)   Higher-speed Access 
  00front.pdf 141.41 Kb 00:00:39 00:00:20 00:00:17 00:00:08 < 00:00:01
  01chapter1.pdf 94.69 Kb 00:00:26 00:00:13 00:00:11 00:00:05 < 00:00:01
  02part-I.pdf 1.43 Mb 00:06:36 00:03:23 00:02:58 00:01:29 00:00:07
  03part-II.pdf 651.45 Kb 00:03:00 00:01:33 00:01:21 00:00:40 00:00:03
  04part-III-chapter10.pdf 4.40 Mb 00:20:22 00:10:28 00:09:10 00:04:35 00:00:23
  04part-III-chapter11.pdf 863.95 Kb 00:03:59 00:02:03 00:01:47 00:00:53 00:00:04
  04part-III.pdf 5.41 Mb 00:25:03 00:12:53 00:11:16 00:05:38 00:00:28
  05chapter12.pdf 76.97 Kb 00:00:21 00:00:10 00:00:09 00:00:04 < 00:00:01
  06back.pdf 260.02 Kb 00:01:12 00:00:37 00:00:32 00:00:16 00:00:01

Browse All Available ETDs by ( Author | Department )

If you have more questions or technical problems, please Contact UPeTD.