LoCost: a Spatial Social Network Algorithm for Multi-Objective Optimisation
View/ Open
Author(s)
Lewis, Andrew
Griffith University Author(s)
Year published
2009
Metadata
Show full item recordAbstract
Particle Swarm Optimisation (PSO) is increasingly being applied to optimisation of problems in engineering design and scientific investigation. While readily adapted to singleobjective problems, its use on multi-objective problems is hampered by the difficulty of finding effective means of guiding the swarm in the presence of multiple, competing objectives. This paper suggests a novel approach to this problem, based on an extension of the concepts of spatial social networks using a model of the behaviour of locusts and crickets. Comparison is made between neighbouring particles based on Pareto dominance, and a ...
View more >Particle Swarm Optimisation (PSO) is increasingly being applied to optimisation of problems in engineering design and scientific investigation. While readily adapted to singleobjective problems, its use on multi-objective problems is hampered by the difficulty of finding effective means of guiding the swarm in the presence of multiple, competing objectives. This paper suggests a novel approach to this problem, based on an extension of the concepts of spatial social networks using a model of the behaviour of locusts and crickets. Comparison is made between neighbouring particles based on Pareto dominance, and a corresponding repulsion between particles added to previously suggested attractive forces. Computational experiments demonstrate that the new, spatial, social network optimisation algorithm can provide results comparable to a conventional MOPSO algorithm, and improved coverage of the Pareto-front.
View less >
View more >Particle Swarm Optimisation (PSO) is increasingly being applied to optimisation of problems in engineering design and scientific investigation. While readily adapted to singleobjective problems, its use on multi-objective problems is hampered by the difficulty of finding effective means of guiding the swarm in the presence of multiple, competing objectives. This paper suggests a novel approach to this problem, based on an extension of the concepts of spatial social networks using a model of the behaviour of locusts and crickets. Comparison is made between neighbouring particles based on Pareto dominance, and a corresponding repulsion between particles added to previously suggested attractive forces. Computational experiments demonstrate that the new, spatial, social network optimisation algorithm can provide results comparable to a conventional MOPSO algorithm, and improved coverage of the Pareto-front.
View less >
Conference Title
2009 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1-5
Copyright Statement
© 2009 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. This paper was first published in the Proceedings of IEEE Congress on Evolutionary Computation, 2009.
Subject
Optimisation