Abstract
In extending the Particle Swarm Optimisation methodology to multi-objective problems it is unclear how global guides for particles should be selected. Previous work has relied on metric information in objective space, although this is at variance with the notion of dominance which is used to assess the quality of solutions. Here we propose methods based exclusively on dominance for selecting guides from a non-dominated archive. The methods are evaluated on standard test problems and we find that probabilistic selection favouring archival particles that dominate few particles provides good convergence towards and coverage of the Pareto front. We demonstrate that the scheme is robust to changes in objective scaling. We propose and evaluate methods for confining particles to the feasible region, and find that allowing particles to explore regions close to the constraint boundaries is important to ensure convergence to the Pareto front.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Srinivas, N., Deb, K.: Multiobjective Optimization Using Nondominated Sorting in Genetic Algorithms. IEEE Transactions on Evolutionary Computation 2(3), 221–248 (1995)
Zitzler, E., Thiele, L.: Multiobjective Evolutionary Algorithms: A Comparative Case Study and the Strength Pareto Approach. IEEE Transactions on Evolutionary Computation 3(4), 257–271 (1999)
Laumanns, M., Zitzler, E., Thiele, L.: A Unified Model for Multi-Objective Evolutionary Algorithms with Elitism. In: Proceedings of the 2000 Congress on Evolutionary Computation, pp. 46–53 (2000)
Kennedy, J., Eberhart, R.: Particle Swarm Optimization. In: Proceedings of the Fourth IEEE International Conference on Neural Networks, pp. 1942–1948 (1995)
Hu, X., Eberhart, R.: Multiobjective Optimization Using Dynamic Neighborhood Particle Swarm Optimization. In: Proceedings of the 2002 Congess on Evolutionary Computation. IEEE Press, Los Alamitos (2002)
Parsopoulos, K., Vrahatis, M.: Particle Swarm Optimization Method in Multiobjective Problems. In: Nyberg, K., Heys, H.M. (eds.) SAC 2002. LNCS, vol. 2595, pp. 603–607. Springer, Heidelberg (2003)
Coello, C., Lechunga, M.: MOPSO: A Proposal for Multiple Objective Particle Swarm Optimization. In: Proceedings of the 2002 Congress on Evolutionary Computation, pp. 1051–1056. IEEE Press, Los Alamitos (2002)
Fieldsend, J., Singh, S.: A Multi-Objective Algorithm based upon Particle Swarm Optimisation, an Efficient Data Structure and Turbulence. In: Proceedings of UK Workshop on Computational Intelligence (UKCI 2002), pp. 37–44 (2002)
Mostaghim, S., Teich, J.: Strategies for Finding Good Local Guides in MultiObjective Particle Swarm Optimization (MOPSO). In: IEEE 2003 Swarm Intelligence Symposium, pp. 26–33 (2003)
Coello, C., Pulido, G., Lechunga, M.: Handling Multiple Objectives with Particle Swarm Optimization. IEEE Transactions on Evolutionary Computation 8(3), 256–279 (2004)
Hanne, T.: On the convergence of multiobjective evolutionary algorithms. European Journal of Operational Research 117, 553–564 (1999)
Fieldsend, J., Everson, R., Singh, S.: Using Unconstrained Elite Archives for Multi–Objective Optimisation. IEEE Transactions on Evolutionary Computation 7, 305–323 (2003)
Deb, K., Thiele, L., Laumanns, M., Zitzler, E.: Scalable Multi–Objective Optimization Test Problems. In: Congress on Evolutionary Computation (CEC 2002), vol. 1, pp. 825–830 (2002)
Veldhuizen, D.V., Lamont, G.: Multiobjective Evolutionary Algorithms Research: A History and Analysis. Technical Report TR-98-03, Dept. Elect. Comput. Eng., Graduate School of Eng., Air Force Institute Technol., Wright-Patterson AFB, OH (1998)
Fieldsend, J.: Multi–Objective Particle Swarm Optimization Methods. Technical Report No. 419, Department of Computer Science, University of Exeter (2004)
van den Bergh, F.: An Analysis of Particle Swarm Optimizers. PhD thesis, Faculty of Natural and Agricultural Science, University of Pretoria (2001)
Clerc, M.: The Swarm and the Queen: Towards a Deterministic and Adaptative Particle Swarm Optimization. In: Proceedings of the Congress on Evolutionary Computation, pp. 1951–1957. IEEE Press, Los Alamitos (1999)
Mostaghim, S., Teich, J.: Personal communication (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Alvarez-Benitez, J.E., Everson, R.M., Fieldsend, J.E. (2005). A MOPSO Algorithm Based Exclusively on Pareto Dominance Concepts. In: Coello Coello, C.A., Hernández Aguirre, A., Zitzler, E. (eds) Evolutionary Multi-Criterion Optimization. EMO 2005. Lecture Notes in Computer Science, vol 3410. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31880-4_32
Download citation
DOI: https://doi.org/10.1007/978-3-540-31880-4_32
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24983-2
Online ISBN: 978-3-540-31880-4
eBook Packages: Computer ScienceComputer Science (R0)