GENERAL ENQUIRIES: Tel: + 27 12 841 2911 | Email:

Show simple item record Greeff, M Engelbrecht, AP 2009-01-23T10:37:35Z 2009-01-23T10:37:35Z 2008-06
dc.identifier.citation Greeff, M and Engelbrecht, AP. 2008. Solving dynamic multi-objective problems with vector evaluated particle swarm optimisation. IEEE World Congress on Computational Intelligence (WCCI): IEEE Congress on Evolutionary Computation (CEC), Hong-Kong, 1-7 June 2008, pp 2922-2929 en
dc.identifier.isbn 978-1-4244-1823-7
dc.description Copyright: 2008 IEEE Congress on Evolutionary Computation (CEC 2008) en
dc.description.abstract Many optimisation problems are multi-objective and change dynamically. Many methods use a weighted average approach to the multiple objectives. This paper introduces the usage of the vector evaluated particle swarm optimiser (VEPSO) to solve dynamic multi-objective optimisation problems. Every objective is solved by one swarm and the swarms share knowledge amongst each other about the objective that it is solving. Not much work has been done on using this approach in dynamic environments. This paper discusses this approach as well as the effect of the population size and the response methods to a detected change on the performance of the algorithm. The results showed that more non-dominated solutions, as well as more uniformly distributed solutions, are found when all swarms are re-initialised when a change is detected, instead of only the swarm(s) optimising the specific objective function(s) that has changed. Furthermore, an increase in population size results in a higher number of non-dominated solutions found, but can lead to solutions that are less uniformly distributed. en
dc.language.iso en en
dc.publisher IEEE Congress on Evolutionary Computation (CEC 2008) en
dc.subject Vector evaluated particle swarm optimiser (VEPSO) en
dc.subject Multi-objective problems en
dc.subject IEEE en
dc.title Solving dynamic multi-objective problems with vector evaluated particle swarm optimisation en
dc.type Presentation en

Files in this item

This item appears in the following Collection(s)

Show simple item record

Search ResearchSpace

Advanced Search


My Account