A novel multi-objective particle swarm optimization with multiple search strategies.

*(English)*Zbl 1346.90742Summary: Recently, multi-objective particle swarm optimization (MOPSO) has shown the effectiveness in solving multi-objective optimization problems (MOPs). However, most MOPSO algorithms only adopt a single search strategy to update the velocity of each particle, which may cause some difficulties when tackling complex MOPs. This paper proposes a novel MOPSO algorithm using multiple search strategies (MMOPSO), where decomposition approach is exploited for transforming MOPs into a set of aggregation problems and then each particle is assigned accordingly to optimize each aggregation problem. Two search strategies are designed to update the velocity of each particle, which is respectively beneficial for the acceleration of convergence speed and the keeping of population diversity. After that, all the non-dominated solutions visited by the particles are preserved in an external archive, where evolutionary search strategy is further performed to exchange useful information among them. These multiple search strategies enable MMOPSO to handle various kinds of MOPs very well. When compared with some MOPSO algorithms and two state-of-the-art evolutionary algorithms, simulation results show that MMOPSO performs better on most of test problems.

##### MSC:

90C29 | Multi-objective and goal programming |

90C59 | Approximation methods and heuristics in mathematical programming |

##### Keywords:

multiple objective programming; particle swarm optimization; evolutionary computation; multiple search strategies
PDF
BibTeX
XML
Cite

\textit{Q. Lin} et al., Eur. J. Oper. Res. 247, No. 3, 732--744 (2015; Zbl 1346.90742)

Full Text:
DOI

##### References:

[1] | Moubayed, N. AI; Pertovski, A.; McCall, J., A novel smart multi-objective particle swarm optimisation using decomposition, Parallel Problem Solving from Nature-PPSN XI, PT II, Lecture Notes in Computer Science, 6239, 1-10, (2010) |

[2] | Moubayed, N. AI; Pertovski, A.; McCall, J., D^{2}mopso: multi-objective particle swarm optimizer based on decomposition and dominance, Evolutionary Computation in Combinatorial Optimization, Notes in Computer Science, 7245, 75-86, (2012) · Zbl 1292.90322 |

[3] | Moubayed, N. AI; Pertovski, A.; McCall, J., D^{2}MOPSO: MOPSO based on decomposition and dominance with archiving using crowding distance in objective and solution spaces, Evolutionary Computation, 22, 47-77, (2014) |

[4] | Bosman, P. A.N.; Thierens, D., The balance between proximity and diversity in multiobjective evolutionary algorithms, IEEE Transactions on Evolutionary Computation, 7, 174-188, (2003) |

[5] | Chen, J. Y.; Lin, Q. Z.; Ji, Z., A hybrid immune multiobjective optimization algorithm, European Journal of Operational Research, 204, 294-302, (2010) · Zbl 1178.90302 |

[6] | Clerc, M.; Kennedy, J., The particle swarm-explosion, stability, and convergence in a multidimensional complex space, IEEE Transactions on Evolutionary Computation, 6, 58-73, (2002) |

[7] | Coello Coello, C. A.; Pulido, G. T.; Lechuga, M. S., Handling multiple objectives with particle swarm optimization, IEEE Transactions on Evolutionary Computation, 8, 256-279, (2004) |

[8] | Dang, D. C.; Guibadj, R. N.; Moukrim, A., An effective PSO-inspired algorithm for the team orienteering problem, European Journal of Operational Research, 229, 332-344, (2013) · Zbl 1317.90114 |

[9] | Deb, K.; Pratap, A.; Agarwal, S.; Meyarivan, T., A fast and elitist multi-objective genetic algorithm: NSGA-II, IEEE Transactions on Evolutionary Computation, 6, 182-197, (2002) |

[10] | Deb, K.; Thiele, L.; Laumanns, M.; Zitzler, E., Scalable test problems for evolutionary multi-objective optimization, Evolutionary multiobjective optimization, advanced information and knowledge processing, 105-145, (2005), Springer London · Zbl 1078.90567 |

[11] | Durillo, J. J.; Nebro, A. J., Jmetal: A Java framework for multi-objective optimization, Advances in Engineering Software, 42, 760-771, (2011) |

[12] | Fonseca, C. M.; Flemming, P. J., Multiobjective optimization and multiple constraint handling with evolutionary algorithms part II: application example, IEEE Transactions on Systems, Man, and Cybernetics-Part A: Systems and Humans, 28, 38-47, (1998) |

[13] | Goh, C. K.; Tan, K. C.; Liu, D. S.; Chiam, S. C., A competitive and cooperative co-evolutionary approach to multi-objective particle swarm optimization algorithm design, European Journal of Operational Research, 202, 42-54, (2010) · Zbl 1175.90352 |

[14] | Gong, M. G.; Jiao, L. C.; Du, H. F.; Bo, L. F., Multi-objective immune algorithm with nondominated neighbor-based selection, Evolutionary Computation, 16, 225-255, (2008) |

[15] | Gong, M. G.; Cai, Q.; Chen, X. W.; Ma, L. J., Complex network clustering by multiobjective discrete particle swarm optimization based on decomposition, IEEE Transactions on Evolutionary Computation, 18, 82-97, (2014) |

[16] | Hu, M. Q.; Wu, T.; Weir, J. D., An adaptive particle swarm optimization with multiple adaptive methods, IEEE Transactions on Evolutionary Computation, 17, 705-720, (2013) |

[17] | Huband, S.; Barone, L.; While, L.; Hingston, P., A scalable multi-objective test problem toolkit, Evolutionary Multi-Criterion Optimization, Lecture Notes in Computer Science, 3410, 280-295, (2005) · Zbl 1109.68603 |

[18] | Ishibuchi, H.; Murata, T., A multi-objective genetic local search algorithm and its application to flowshop scheduling, IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews, 28, 392-403, (1998) |

[19] | Jones, D. F.; Mirrazavi, S. K.; Tamiz, M., Multi-objective meta-heuristics: an overview of the current state-of-the-art, European Journal of Operational Research, 137, 1-9, (2002) · Zbl 1002.90060 |

[20] | Kennedy, J.; Eberhart, R., Particle swarm optimization, Proceedings of IEEE International Conference on Neural Networks, 4, 1942-1948, (1995) |

[21] | Kursawe, F., A variant of evolution strategies for vector optimization, Parallel Problem Solving from Nature 1st Workshop, PPSN I, Lecture Notes in Computer Science, 496, 193-197, (1990) |

[22] | Li, C. H.; Yang, S. X.; Nguyen, T. T., A self-learning particle swarm optimizer for global optimization problems, IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics, 42, 627-646, (2012) |

[23] | Li, H.; Zhang, Q. F., Multiobjective optimization problems with complicated Pareto sets, MOEA/D and NSGA-II, IEEE Transactions on Evolutionary Computation, 13, 284-302, (2009) |

[24] | Lin, Q. Z.; Chen, J. Y., A novel micro-population immune multiobjective optimization algorithm, Computers & Operations Research, 40, 1590-1601, (2013) · Zbl 1348.90638 |

[25] | Liu, H. L.; Gu, F. Q.; Zhang, Q. F., Decomposition of a multiobjective optimization problem into a number of simple multiobjective subproblems, IEEE Transactions on Evolutionary Computation, 18, 450-455, (2014) |

[26] | Martinez, S. Z.; Coello Coello, C. A., A multi-objective particle swarm optimizer based on decomposition, (Proceedings of the 13th annual genetic and evolutionary computation conference, (2011)), 69-76 |

[27] | Nayeri, P.; Yang, F.; Elsherbeni, A. Z., Design of single-feed reflectarray antennas with asymmetric multiple beams using the particle swarm optimization method, IEEE Transactions on Antennas and Propagation, 61, 4598-4605, (2013) |

[28] | Nebro, A. J.; Durillo, J. J.; Garcia-Nieto, J.; Coello Coello, C. A.; Luna, F.; Alba, E., SMPSO: A new PSO-based metaheuristic for multi-objective optimization, (Proceedings of IEEE symposium on computational intelligence in multi-criteria decision-making, (2009)), 66-73 |

[29] | Peng, W.; Zhang, Q. F., A decomposition-based multi-objective particle swarm optimization algorithm for continuous optimization problems, (Proceedings of IEEE international conference on granular computing, (2008)), 534-537 |

[30] | Samanlioglu, F., A multi-objective mathematical model for the industrial hazardous waste location-routing problem, European Journal of Operational Research, 226, 332-340, (2013) · Zbl 1292.90190 |

[31] | Schaffer, J. D., Multiple objective optimization with vector evaluated genetic algorithms, (Proceedings of the first international conference on genetic algorithms, (1985)), 93-100 |

[32] | Sierra, M. R.; Coello Coello, C. A., Improving PSO-based multi-objective optimization using crowding, mutation and epsilon-dominance, Evolutionary Multi-criterion Optimization, Lecture Notes in Computer Science, 3410, 505-519, (2005) · Zbl 1109.68631 |

[33] | Sindhya, K.; Miettinen, K.; Deb, K., A hybrid framework for evolutionary multi-objective optimization, IEEE Transactions on Evolutionary Computation, 17, 495-511, (2013) |

[34] | Tang, L. X.; Wang, X. P., A hybrid multiobjective evolutionary algorithm for multiobjective optimization problems, IEEE Transactions on Evolutionary Computation, 17, 20-46, (2013) |

[35] | Unler, A.; Murat, A., A discrete particle swarm optimization method for feature selection in binary classification problems, European Journal of Operational Research, 206, 528-539, (2010) · Zbl 1188.90280 |

[36] | Wang, Y. J.; Yang, Y. P., Particle swarm with equilibrium strategy of selection for multi-objective optimization, European Journal of Operational Research, 200, 187-197, (2010) · Zbl 1187.90263 |

[37] | Zhan, Z. H.; Li, J. J.; Cao, J. N.; Zhang, J.; Chung, H. S.H.; Shi, Y. H., Multiple populations for multiple objectives: A coevolutionary technique for solving multiobjective optimization problems, IEEE Transactions on Cybernetics, 43, 445-463, (2013) |

[38] | Zhang, Q. F.; Li, H., MOEA/D: A multiobjective evolutionary algorithm based on decomposition, IEEE Transactions on Evolutionary Computation, 11, 712-731, (2007) |

[39] | Zitzler, E.; Deb, K.; Thiele, L., Comparison of multiobjective evolutionary algorithms: empirical results, Evolutionary Computation, 8, 173-195, (2000) |

[40] | Zuo, X. Q.; Zhang, G. X.; Tan, W., Self-adaptive learning PSO-based deadline constrained task scheduling for hybrid iaas cloud, IEEE Transactions on Automation Science and Engineering, 11, 564-573, (2014) |

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. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.