Derating NichePSO

Show simple item record

dc.contributor.advisor Engelbrecht, Andries P.
dc.contributor.postgraduate Naicker, Clive en
dc.date.accessioned 2013-09-07T14:12:35Z
dc.date.available 2007-11-08 en
dc.date.available 2013-09-07T14:12:35Z
dc.date.created 2007-04-29 en
dc.date.issued 2007-11-08 en
dc.date.submitted 2007-10-17 en
dc.description Dissertation (MSc)--University of Pretoria, 2007. en
dc.description.abstract The search for multiple solutions is applicable to many fields (Engineering [54][67], Science [75][80][79][84][86], Economics [13][59], and others [51]). Multiple solutions allow for human judgement to select the best solution from a group of solutions that best match the search criteria. Finding multiple solutions to an optimisation problem has shown to be difficult to solve. Evolutionary computation (EC) and more recently Particle Swarm Optimisation (PSO) algorithms have been used in this field to locate and maintain multiple solutions with fair success. This thesis develops and empirically analyses a new method to find multiple solutions within a convoluted search space. The method is a hybrid of the NichePSO [14] and the sequential niche technique (SNT)[8]. The original SNT was developed using a Genetic Algorithm (GA). It included restrictions such as knowing or approximating the number of solutions that exist. A further pitfall of the SNT is that it introduces false optima after modifying the search space, thereby reducing the accuracy of the solutions. However, this can be resolved with a local search in the unmodified search space. Other sequential niching algorithms require that the search be repeated sequentially until all solutions are found without considering what was learned in previous iterations, resulting in a blind and wasteful search. The NichePSO has shown to be more accurate than GA based algorithms [14][15]. It does not require knowledge of the number of solutions in the search space prior to the search process. However, the NichePSO does not scale well for problems with many optima [16]. The method developed in this thesis, referred to as the derating NichePSO, combines SNT with the NichePSO. The main objective of the derating NichePSO is to eliminate the inaccuracy of SNT and to improve the scalability of the NichePSO. The derating NichePSO is compared to the NichePSO, deterministic crowding [23] and the original SNT using various multimodal functions. The performance of the derating NichePSO is analysed and it is shown that the derating NichePSO is more accurate than SNT and more scalable than the NichePSO. en
dc.description.availability Unrestricted en
dc.description.degree MSc
dc.description.department Computer Science en
dc.identifier.citation Naicker, C 2007, Derating NichePSO, MSc Dissertation, University of Pretoria, Pretoria, viewed yymmdd <http://hdl.handle.net/2263/28766>
dc.identifier.other Pretoria en
dc.identifier.upetdurl http://upetd.up.ac.za/thesis/available/etd-10172007-151316/ en
dc.identifier.uri http://hdl.handle.net/2263/28766
dc.language.iso en
dc.publisher University of Pretoria en_ZA
dc.rights © University of Pretor en
dc.subject Multimodal en
dc.subject Parallel en
dc.subject Sequential en
dc.subject Derating function en
dc.subject Multiple en
dc.subject UCTD en_US
dc.title Derating NichePSO en
dc.type Dissertation en


Files in this item

This item appears in the following Collection(s)

Show simple item record