Abstract
This paper proposes a dynamic sub-swarms multi-objective particle swarm optimization algorithm (DSMOPSO). Based on solution distribution of multi-objective optimization problems, it separates particles into multi subswarms, each of which adopts an improved clustering archiving technique, and operates PSO in a comparably independent way. Clustering eventually enhances the distribution quality of solutions. The selection of the closest particle to the gbest from archiving set and the developed pbest select mechanism increase the choice pressure. In the meantime, the dynamic set particle inertial weight, namely, particle inertial weight being relevant to the number of dominating particles, effectively keeps the balance between the global search in the preliminary stage and the local search in the later stage. Experiments show that this strategy yields good convergence and strong capacity to conserve the distribution of solutions, specially for the problems with non-continuous Pareto-optimal front.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Parsopoulos, K.E., Vrahatis, M.N.: 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)
Deb, K.: A fast and elitist multiobjective genetic algorithm:NSGA-II. IEEE Transactions on Evolutionary Computation, 182–197 (2002)
Li, X.: A Non-dominated Sorting Particle Swarm Optimizer for Multiobject Optimization. In: Cantú-Paz, E., Foster, J.A., Deb, K., Davis, L., Roy, R., O’Reilly, U.-M., Beyer, H.-G., Kendall, G., Wilson, S.W., Harman, M., Wegener, J., Dasgupta, D., Potter, M.A., Schultz, A., Dowsland, K.A., Jonoska, N., Miller, J., Standish, R.K. (eds.) GECCO 2003. LNCS, vol. 2723, Springer, Heidelberg (2003)
Coello Coello, C.A., Lechunga, M.S., MOPSO,: A Proposal for Multiple Objective Particle Swarm Optimization. In: Proceedings of the 2002 Congess on Evolutionary Computation, pp. 1051–1056 (2002)
Fieldsend, J.E., Singh, S., Multi-Objective, A.: Algorithm based upon Particle Swarm Optimisation, an effcient Data Structure and Turbulence. In: UKCI 2002. Proceedings of UK Workshop on Computational Intelligence, Birmingham, UK, pp. 37–44 (2002)
Bartz-Beielstein, T., Limbourg, P., Konstantinos, E., et al.: Particle Swarm Optimizers for Pareto Optimization with Enhanced Archiving Techniques. In: CEC 2003. Proceedings of the 2003 Congress on Evolutionary Computation, Canberra, Australia, vol. 3, pp. 1780–1787 (2003)
Mostaghim, S., Teich, J.: Strategies for Finding Good Local Guides in Multi-objective Particle Swarm Optimization (MOPSO). In: 2003 IEEE Swarm Intelligence Symposium Proceedings, Indiana, USA, pp. 26–33 (2003)
Toscano, G., Coello, C.: Using Clustering Techniques to Improve the Performance of a Multi-Objective Particle Swarm Optimizer. In: Deb, K., et al. (eds.) GECCO 2004. LNCS, vol. 3102, pp. 225–237. Springer, Heidelberg (2004)
Mostaghim, S., Teich, J.: Covering Pareto-optimal Fronts by Subswarms in Multi-objective Particle Swarm Optimization. In: CEC 2004. Congress on Evolutionary Computation, Oregon, USA, vol. 2, pp. 1404–1411 (2004)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhang, Q., Xue, S. (2007). An Improved Multi-Objective Particle Swarm Optimization Algorithm. In: Kang, L., Liu, Y., Zeng, S. (eds) Advances in Computation and Intelligence. ISICA 2007. Lecture Notes in Computer Science, vol 4683. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74581-5_41
Download citation
DOI: https://doi.org/10.1007/978-3-540-74581-5_41
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74580-8
Online ISBN: 978-3-540-74581-5
eBook Packages: Computer ScienceComputer Science (R0)