A Multi-objective Jumping Particle Swarm Optimization Algorithm for the Multicast Routing

This paper presents a new multi-objective jumping particle swarm optimization (MOJPSO) algorithm to solve the multi-objective multicast routing problem, which is a well-known NP-hard problem in communication networks. Each particle in the proposed MOJPSO algorithm performs four jumps, i.e. the inertial, cognitive, social and global jumps, in such a way, particles in the swarm follow a guiding particle to move to better positions in the search space. In order to rank the non-dominated solutions obtained to select the best guider of the particle, three different ranking methods, i.e. the random ranking, an entropy-based density ranking, and a fuzzy cardinal priority ranking are investigated in the paper. Experimental results show that MOJPSO is more flexible and effective for exploring the search space to find more non-dominated solutions in the Pareto Front. It has better performance compared with the conventional multi-objective evolutionary algorithm in the literature.

[1]  Massimo Paolucci,et al.  A new discrete particle swarm optimization approach for the single-machine total weighted tardiness scheduling problem with sequence-dependent setup times , 2009, Eur. J. Oper. Res..

[2]  Bu-Sung Lee,et al.  A survey of application level multicast techniques , 2004, Comput. Commun..

[3]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

[4]  Sergio Consoli,et al.  Discrete Particle Swarm Optimization for the minimum labelling Steiner tree problem , 2010, Natural Computing.

[5]  Dana S. Richards,et al.  Steiner tree problems , 1992, Networks.

[6]  Soniya Lalwani,et al.  A comprehensive survey: Applications of multi-objective particle swarm optimization (MOPSO) algorithm , 2013 .

[7]  Qingfu Zhang,et al.  MOEA/D: A Multiobjective Evolutionary Algorithm Based on Decomposition , 2007, IEEE Transactions on Evolutionary Computation.

[8]  J. N. Kapur,et al.  Entropy Optimization Principles and Their Applications , 1992 .

[9]  Panos M. Pardalos,et al.  A survey of combinatorial optimization problems in multicast routing , 2005, Comput. Oper. Res..

[10]  David Eppstein,et al.  Finding the k shortest paths , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[11]  Yinguo Li,et al.  Hybrid of Genetic Algorithm and Particle Swarm Optimization for Multicast QoS Routing , 2007, 2007 IEEE International Conference on Control and Automation.

[12]  Graham Kendall,et al.  A Variable Neighborhood Descent Search Algorithm for Delay-Constrained Least-Cost Multicast Routing , 2009, LION.

[13]  Kalyanmoy Deb,et al.  An Investigation of Niche and Species Formation in Genetic Function Optimization , 1989, ICGA.

[14]  David W. Coit,et al.  Multi-objective optimization using genetic algorithms: A tutorial , 2006, Reliab. Eng. Syst. Saf..

[15]  Xiaohui Lei,et al.  Multi-objective optimization of reservoir flood dispatch based on MOPSO algorithm , 2012, 2012 8th International Conference on Natural Computation.

[16]  J. N. Kapur,et al.  Entropy optimization principles with applications , 1992 .

[17]  Dimitri P. Bertsekas,et al.  Data networks (2nd ed.) , 1992 .

[18]  Stefan Hougardy,et al.  On approximation algorithms for the terminal Steiner tree problem , 2004, Inf. Process. Lett..

[19]  Walid Dabbous,et al.  Multipoint Communication: A Survey of Protocols, Functions, and Mechanisms , 1997, IEEE J. Sel. Areas Commun..

[20]  Pascal Lorenz,et al.  Telecommunications and Networking - ICT 2004 , 2004, Lecture Notes in Computer Science.

[21]  Mehmet Fatih Tasgetiren,et al.  A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem , 2007, Eur. J. Oper. Res..

[22]  José A. Moreno-Pérez,et al.  Exploring Feasible and Infeasible Regions in the Vehicle Routing Problem with Time Windows Using a Multi-objective Particle Swarm Optimization Approach , 2008, NICSO.

[23]  Ya-Chin Chang.  Multi-Objective Optimal SVC Installation for Power System Loading Margin Improvement , 2012, IEEE Transactions on Power Systems.

[24]  Xiaojun Wu,et al.  QoS multicast routing using a quantum-behaved particle swarm optimization algorithm , 2011, Eng. Appl. Artif. Intell..

[25]  Rong Qu,et al.  Solving multi-objective multicast routing problems by evolutionary multi-objective simulated annealing algorithms with variable neighbourhoods , 2011, J. Oper. Res. Soc..

[26]  Russell C. Eberhart,et al.  A discrete binary version of the particle swarm algorithm , 1997, 1997 IEEE International Conference on Systems, Man, and Cybernetics. Computational Cybernetics and Simulation.

[27]  Dario Landa Silva,et al.  Particle swarm optimization for the Steiner tree in graph and delay-constrained multicast routing problems , 2013, J. Heuristics.

[28]  Renfa Li,et al.  A simulated annealing based genetic local search algorithm for multi-objective multicast routing problems , 2013, Annals of Operations Research.

[29]  Sushma Jain.  Tree structured encoding based multi-objective multicast routing algorithm , 2012 .

[30]  Jorge Crichigno,et al.  Multiobjective Multicast Routing Algorithm , 2004, ICT.