Real-world optimisation problems often are of a dynamic nature. Recently, much research has been done to apply particle swarm optimisation (PSO) to dynamic environments (DE). However, these research efforts generally focused on optimising one variation of the PSO algorithm for one type of DE. The aim of this work is to develop a more comprehensive view of PSO for DEs. This thesis studies different schemes of characterising and taxonomising DEs, performance measures used to quantify the performance of optimisation algorithms applied to DEs, various adaptations of PSO to apply PSO to DEs, and the effectiveness of these approaches on different DE types. The standard PSO algorithm has shown limitations when applied to DEs. To overcome these limitations, the standard PSO can be modi ed using personal best reevaluation, change detection and response, diversity maintenance, or swarm sub-division and parallel tracking of optima. To investigate the strengths and weaknesses of these approaches, a representative sample of algorithms, namely, the standard PSO, re-evaluating PSO, reinitialising PSO, atomic PSO (APSO), quantum swarm optimisation (QSO), multi-swarm, and self-adapting multi-swarm (SAMS), are empirically analysed. These algorithms are analysed on a range of DE test cases, and their ability to detect and track optima are evaluated using performance measures designed for DEs. The experiments show that QSO, multi-swarm and reinitialising PSO provide the best results. However, the most effective approach to use depends on the dimensionality, modality and type of the DEs, as well as on the objective of the algorithm. A number of observations are also made regarding the behaviour of the swarms, and the influence of certain control parameters of the algorithms evaluated. Copyright
Harrison, Kyle Robert; Ombuki-Berman, Beatrice M.; Engelbrecht, Andries P.(Springer, 2018-10)
This paper examines the position update equation of the particle swarm optimization (PSO) algorithm, leading to the proposal of a simplified position update based upon a Gaussian distribution. The proposed algorithm, ...
Scheepers, Christiaan(University of Pretoria, 2018)
An exploratory analysis in low-dimensional objective space of the vector evaluated particle swarm optimization (VEPSO) algorithm is presented. A novel visualization technique is presented and applied to perform the exploratory ...
Mohiuddin, Mohammad A.; Khan, Salman Ahmad; Engelbrecht, Andries P.(Springer, 2016-10)
The open shortest path first (OSPF) routing protocol
is a well-known approach for routing packets from
a source node to a destination node. The protocol assigns
weights (or costs) to the links of a network. These ...