×

A diversity enhanced multiobjective particle swarm optimization. (English) Zbl 1440.68255

Summary: Multiobjective particle swarm optimizations (MOPSOs) are confronted with convergence difficulty as well as diversity deviation, due to combined learning orientations and premature phenomenons. Numerous adaptations of MOPSO have been introduced around the elite definition and leader selection in previous studies. Meanwhile the unique leader-oriented updating which reflects some properties of evolving, may provide control assistance under particular conditions. However, repetition and inefficient works on leader determination exist, and seldomly have studies taken PSO’s evolve rhythms into consideration to adjust the optimize strategy adaptively. In view of the above problems, and aim to balance the convergence and diversity during searching procedure, a novel diversity enhanced multiobjective particle swarm optimization (DEMPSO) is proposed in this paper. The novel method mainly focuses on the following innovations. First, a simplified leader-oriented formulation in PSO updating is introduced. Second, through taking full advantages of the PSO learning mechanism and extracting particles velocity information, novel intersection measurement for elite definition and novel decision variable analysis method for diversity enhancement are proposed. Third, an adaptive two-fold leader selection strategy is presented. The experimental results on benchmark test instances illustrate that DEMPSO outperforms other PSO-cored algorithms, and greatly improves the diversity maintain ability in high-dimensional objective spaces in comparison with some state-of-the-art decomposition-based and dominated-based evolutionary algorithms.

MSC:

68T20 Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
90C29 Multi-objective and goal programming
90C59 Approximation methods and heuristics in mathematical programming

Software:

NBI; MOEA/D; PlatEMO; SMPSO
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] N. Al Moubayed, A. Petrovski, J. McCall, A novel smart multi-objective particle swarm optimisation using decomposition, in: Proceedings of the Parallel Problem Solving from Nature, PPSN XI 6239 (2010) 1-10.; N. Al Moubayed, A. Petrovski, J. McCall, A novel smart multi-objective particle swarm optimisation using decomposition, in: Proceedings of the Parallel Problem Solving from Nature, PPSN XI 6239 (2010) 1-10.
[2] Al Moubayed, N.; Petrovski, A.; McCall, J., (dmopso)-m-2: mopso based on decomposition and dominance with archiving using crowding distance in objective and solution spaces, Evolut. Comput., 22, 1, 47-77 (2014)
[3] Carvalho, A. B.D.; Pozo, A., The control of dominance area in particle swarm optimization algorithms for many-objective problems, Proceedings of the Eleventh Brazilian Symposium on Neural Networks, 140-145 (2010)
[4] Chakraborty, P.; Das, S.; Roy, G. G.; Abraham, A., On convergence of the multi-objective particle swarm optimizers, Inf. Sci., 181, 8, 1411-1425 (2011) · Zbl 1222.90051
[5] Chen, R.; Li, K.; Yao, X., Dynamic multi-objectives optimization with a changing number of objectives, IEEE Trans. Evolut. Comput., PP, 99, 1 (2017)
[6] Cheng, J.; Yen, G. G.; Zhang, G., A many-objective evolutionary algorithm with enhanced mating and environmental selections, IEEE Trans. Evolut. Compu., 19, 4, 592-605 (2015)
[7] Cheng, R.; Jin, Y.; Olhofer, M.; Sendhoff, B., A reference vector guided evolutionary algorithm for many-objective optimization, IEEE Trans. Evolut. Comput., 20, 5, 773-791 (2016)
[8] Coello, C. A.C.; Pulido, G. T.; Lechuga, M. S., Handling multiple objectives with particle swarm optimization, IEEE Trans. Evolut. Comput., 8, 3, 256-279 (2004)
[9] Dai, C.; Wang, Y.; Ye, M., A new multi-objective particle swarm optimization algorithm based on decomposition, Inf. Sci., 325, 541-557 (2015)
[10] Daneshyari, M.; Yen, G. G., Cultural-based multiobjective particle swarm optimization, IEEE Trans. Syst. Man Cybern. Part B Cybern., 41, 2, 553-567 (2011)
[11] Das, I.; Dennis, J. E., Normal-boundary intersection: a new method for generating the pareto surface in nonlinear multicriteria optimization problems, SIAM J. Optim., 8, 3, 631-657 (1998) · Zbl 0911.90287
[12] Deb, K.; Jain, H., An evolutionary many-objective optimization algorithm using reference-point-based nondominated sorting approach, part I: solving problems with box constraints, IEEE Trans. Evolut. Comput., 18, 4, 577-601 (2014)
[13] Derrac, J.; Garca, S.; Molina, D.; Herrera, F., A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms, Swarm Evolut. Comput., 1, 1, 3-18 (2011)
[14] Farina, M.; Amato, P., A fuzzy definition of optimality for many-criteria optimization problems, IEEE Trans. Syst. Man Cybern. Part A Syst. Hum., 34, 3, 315-326 (2004)
[15] Figueiredo, E. M.N.; Ludermir, T. B.; Bastos-Filho, C. J.A., Many objective particle swarm optimization, Inf. Sci., 374, 115-134 (2016)
[16] Hu, W.; Yen, G. G., Adaptive multiobjective particle swarm optimization based on parallel cell coordinate system, IEEE Trans. Evolut. Comput., 19, 1, 1-18 (2015)
[17] Huang, P.; Jin-Yang, Y. U.; Yuan, Y. Q., Improved niching multi-objective particle swarm optimization algorithm, Comput. Eng., 37, 18, 1-3 (2011)
[18] Huband, S.; Hingston, P.; Barone, L.; While, L., A review of multiobjective test problems and a scalable test problem toolkit, IEEE Trans. Evolut. Comput., 10, 5, 477-506 (2006)
[19] Kamalapur, S. M.; Patil, V. H., Analysis of particle trajectories and monitoring velocity behavior in particle swarm optimization, Proceedings of the 12th International Conference on Hybrid Intelligent Systems, 149-154 (2012)
[20] Li, F.; Liu, J.; Tan, S.; Yu, X., R2-mopso: a multi-objective particle swarm optimizer based on R2-indicator and decomposition, Proceedings of the IEEE Congress on Evolutionary Computation, CEC, 3148-3155 (2015)
[21] Li, J. Z.; Chen, W. N.; Zhang, J.; Zhan, Z. H., A parallel implementation of multiobjective particle swarm optimization algorithm based on decomposition, Proceedings of the IEEE Symposium Computational Intelligence, 1310-1317 (2015)
[22] Li, K.; Kwong, S.; Cao, J.; Li, M.; Zheng, J.; Shen, R., Achieving balance between proximity and diversity in multi-objective evolutionary algorithm, Inf. Sci., 182, 1, 220-242 (2012)
[23] Li, L.; Wang, W.; Xu, X., Multi-objective particle swarm optimization based on global margin ranking, Inf. Sci., 375, 30-47 (2016)
[24] Lin, Q.; Li, J.; Du, Z.; Chen, J.; Ming, Z., A novel multi-objective particle swarm optimization with multiple search strategies, Eur. J. Oper. Res., 247, 3, 732-744 (2015) · Zbl 1346.90742
[25] Ma, X.; Liu, F.; Qi, Y.; Wang, X., A multiobjective evolutionary algorithm based on decision variable analyses for multiobjective optimization problems with large-scale variables, IEEE Trans. Evolut. Comput., 20, 2, 1 (2015)
[26] Martinez, Z.; Coello Coello, C. A., A multi-objective particle swarm optimizer based on decomposition, Proceedings of the Conference on Genetic and Evolutionary Computation, 162, 69-76 (2011)
[27] Meza, J.; Espitia, H.; Montenegro, C.; Gimnez, E.; Gonzlez-Crespo, R., Movpso: vortex multi-objective particle swarm optimization, Appl. Soft Comput., 52, 1042-1057 (2017)
[28] Nebro, A. J.; Durillo, J. J.; Garcia-Nieto, J.; Coello, C. A.C.; Luna, F.; Alba, E., Smpso: a new pso-based metaheuristic for multi-objective optimization, Proceedings of the Computational Intelligence in Miulti-Criteria Decision-Making, 66-73 (2009)
[29] Pan, A.; Tian, H.; Wang, L.; Wu, Q., A decomposition-based unified evolutionary algorithm for many-objective problems using particle swarm optimization, Math. Probl. Eng., 2016, 12, 1-15 (2016)
[30] Peng, G.; Fang, Y.-W.; Peng, W.-S.; Chai, D.; Xu, Y., Multi-objective particle optimization algorithm based on sharing learning and dynamic crowding distance, Opt. Int. J. Light Electron Opt., 127, 12, 5013-5020 (2016)
[31] Peng, W.; Zhang, Q., A decomposition-based multi-objective particle swarm optimization algorithm for continuous optimization problems, Proceedings of the IEEE International Conference on Granular Computing, vol 1,2, 534-537 (2008)
[32] Sato, H.; Aguirre, H. E.; Tanaka, K., Controlling Dominance Area of Solutions and its Impact on the Performance of MOEAs, 76, 690-702 (2007), Springer: Springer Berlin Heidelberg
[33] Sun, X.; Chen, Y.; Liu, Y.; Gong, D., Indicator-based set evolution particle swarm optimization for many-objective problems, Soft Comput., 20, 6, 2219-2232 (2016)
[34] Tang, B.; Zhu, Z.; Shin, H.-S.; Tsourdos, A.; Luo, J., A framework for multi-objective optimisation based on a new self-adaptive particle swarm optimisation algorithm, Inf. Sci., 420, Supplement C, 364-385 (2017)
[35] Tian, Y.; Cheng, R.; Zhang, X.; Jin, Y., PlatEMO: A MATLAB platform for evolutionary multi-objective optimization, IEEE Computational Intelligence Magazine, 12, 4, 73-87 (2017)
[36] Tripathi, P. K.; Bandyopadhyay, S.; Pal, S. K., Multi-objective particle swarm optimization with time variant inertia and acceleration coefficients, Inf. Sci., 177, 22, 5033-5049 (2007) · Zbl 1121.90130
[37] Wang, H.; Jin, Y.; Yao, X., Diversity assessment in many-objective optimization, IEEE Trans. Cybern., 47, 6, 1510-1522 (2017)
[38] Wang, Y.; Yang, Y., Particle swarm optimization with preference order ranking for multi-objective optimization, Int. J. Inf. Sci., 179, 12, 1944-1959 (2009)
[39] Woolard, M. M.; Fieldsend, J. E., On the effect of selection and archiving operators in many-objective particle swarm optimisation, Proceedings of the Genetic and Evolutionary Computation Conference, 129-136 (2013)
[40] Xu, G.; Yang, Y.-q.; Liu, B.-B.; Xu, Y.-h.; Wu, A.-j., An efficient hybrid multi-objective particle swarm optimization with a multi-objective dichotomy line search, J. Comput. Appl. Math., 280, 310-326 (2015) · Zbl 1309.90128
[41] Yang, S.; Li, M.; Liu, X.; Zheng, J., A grid-based evolutionary algorithm for many-objective optimization, IEEE Trans. Evolut. Comput., 17, 5, 721-736 (2013)
[42] Yue, X.; Guo, Z.; Yin, Y.; Liu, X., Many-objective e-dominance dynamical evolutionary algorithm based on adaptive grid, Soft Comput., 22, 1, 137-146 (2016)
[43] Zhang, Q.; Li, H., Moea/d: a multiobjective evolutionary algorithm based on decomposition, IEEE Trans. Evolut. Comput., 11, 6, 712-731 (2007)
[44] Zhang, X.; Tian, Y.; Cheng, R.; Jin, Y., A decision variable clustering-based evolutionary algorithm for large-scale many-objective optimization, IEEE Trans. Evolut. Comput., 1 (2016)
[45] Zhao, S. Z.; Suganthan, P. N., Two-lbests based multi-objective particle swarm optimizer, Eng. Optim., 43, 1, 1-17 (2011)
[46] Zhu, Q.; Lin, Q.; Chen, W.; Wong, K.-C.; Coello Coello, C. A.; Li, J.; Chen, J.; Zhang, J., An external archive-guided multiobjective particle swarm optimization algorithm, IEEE Trans. Cybern. (2017)
[47] Zhu, Q.; Lin, Q.; Du, Z.; Liang, Z.; Wang, W.; Zhu, Z.; Chen, J.; Huang, P.; Ming, Z., A novel adaptive hybrid crossover operator for multiobjective evolutionary algorithm, Inf. Sci., 345, 177-198 (2016)
[48] Zuo, X.; Su, S., Particle swarm optimization algorithm with swarm activity feedback, Comput. Eng., 38, 13, 182-184 (2012)
[49] repinek, M.; Liu, S.-H.; Mernik, M., Exploration and exploitation in evolutionary algorithms: a survey, ACM Comput. Surv. CSUR, 45, 3, 35 (2013) · Zbl 1293.68251
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.