Remember Me
Or use your Academic/Social account:


Or use your Academic/Social account:


You have just completed your registration at OpenAire.

Before you can login to the site, you will need to activate your account. An e-mail will be sent to you with the proper instructions.


Please note that this site is currently undergoing Beta testing.
Any new content you create is not guaranteed to be present to the final version of the site upon release.

Thank you for your patience,
OpenAire Dev Team.

Close This Message


Verify Password:
Verify E-mail:
*All Fields Are Required.
Please Verify You Are Human:
fbtwitterlinkedinvimeoflicker grey 14rssslideshare1
Publisher: Institute of Electrical and Electronics Engineers
Languages: English
Types: Article
Subjects: Q1, T1
This paper proposes a novel bi-velocity discrete particle swarm optimization (BVDPSO) approach and extends its application to the NP-complete multicast routing problem (MRP). The main contribution is the extension of PSO from continuous domain to the binary or discrete domain. Firstly, a novel bi-velocity strategy is developed to represent possibilities of each dimension being 1 and 0. This strategy is suitable to describe the binary characteristic of the MRP where 1 stands for a node being selected to construct the multicast tree while 0 stands for being otherwise. Secondly, BVDPSO updates the velocity and position according to the learning mechanism of the original PSO in continuous domain. This maintains the fast convergence speed and global search ability of the original PSO. Experiments are comprehensively conducted on all of the 58 instances with small, medium, and large scales in the OR-library (Operation Research Library). The results confirm that BVDPSO can obtain optimal or near-optimal solutions rapidly as it only needs to generate a few multicast trees. BVDPSO outperforms not only several state-of-the-art and recent heuristic algorithms for the MRP problems, but also algorithms based on GA, ACO, and PSO.
  • The results below are discovered through our pilot algorithms. Let us know how we are doing!

    • [1] A. Sabbah, A. EI-Mougy, and M. Ibnkahla, “A survey of networking challenges and routing protocols in smart grids,” IEEE Trans. Ind. Informt., vol. 10, no. 1, pp. 210-221, Feb. 2014.
    • [2] G. Kandavanam, D. Botvich, S. Balasubramaniam, and C. Kulatunga, “PaCRAm: Path aware content replication approach with multicast for IPTV networks,” in Proc. IEEE Globecom, 2010, pp. 1-6.
    • [3] G. Kandavanam, D. Botvich, S. Balasubramaniam, and B. Jennings, “A hybrid genetic algorithm/variable neighborhood search approach to maximizing residual bandwidth of links for route planning,” in Proc. 9th Int. Conf. Artif. Evol., 2009, pp. 49-60.
    • [4] K. Han, Y. Liu, and J. Luo, “Duty-cycle-aware minimum-energy multicasting in wireless sensor networks,” IEEE/ACM Trans. Netw., vol. 21, no. 3, pp. 910-923, Jun. 2013.
    • [5] Y. Leung, G. Li, and Z. B. Xu, “A genetic algorithm for the multiple destination routing problems,” IEEE Trans. Evol. Comput., vol. 2, no. 4, pp. 150-161, Nov. 1998.
    • [6] C. Shampa, B. Arvind, and R. Aman, “Directed convergence heuristic: A fast & novel approach to Steiner tree construction,” in Proc. Int. Conf. Very Large Scale Integr., 2006, pp. 255-260.
    • [7] N. Skorin-Kapov and M. Kos, “A GRASP heuristic for the delayconstrained multicast routing problem,” Telecommun. Syst., vol. 32, no. 1, pp. 55-69, May 2006.
    • [8] Y. H. Du, J. Fang, and C. Miao, “Frequency-domain system identification of an unmanned helicopter based on an adaptive genetic algorithm,” IEEE Trans. Ind. Electron., vol. 61, no. 2, pp. 870-881, Feb. 2014.
    • [9] S. H. Chung and H. K. Chan, “A two-level genetic algorithm to determine production frequencies for economic lot scheduling problem,” IEEE Trans. Ind. Electron., vol. 59, no. 1, pp. 611-619, Jan. 2012.
    • [10] Z. H. Zhan et al., “An efficient ant colony system based on receding horizon control for the aircraft arrival sequencing and scheduling problem,” IEEE Trans. Intell. Transp. Syst., vol. 11, no. 2, pp. 399-412, Jun. 2010.
    • [11] Y. J. Gong et al., “Optimizing RFID network planning by using a particle swarm optimization algorithm with redundant reader elimination,” IEEE Trans. Ind. Informat., vol. 8, no. 4, pp. 900-912, Nov. 2012.
    • [12] K. Ishaque and Z. Salam, “A deterministic particle swarm optimization maximum power point tracker for photovoltaic system under partial shading condition,” IEEE Trans. Ind. Electron., vol. 60, no. 8, pp. 3195-3206, Aug. 2013.
    • [13] K. Shen et al., “Elimination of harmonics in a modular multilevel converter using particle swarm optimization-based staircase modulation strategy,” IEEE Trans. Ind. Electron., vol. 61, no. 10, pp. 5311-5322, Oct. 2014.
    • [14] R. B. Godoy, J. Pinto, C. A. Canesin, E. Alves Coelho, and A. Pinto, “Differential-evolution-based optimization of the dynamic response for parallel operation of inverters with no controller interconnection,” IEEE Trans. Ind. Electron., vol. 59, no. 7, pp. 2859-2866, Jul. 2012.
    • [15] Y. D. Hong, C. S. Park, and J. H. Kim, “Stable bipedal walking with a vertical center-of-mass motion by an evolutionary optimized central pattern generator,” IEEE Trans. Ind. Electron., vol. 61, no. 5, pp. 2346- 2355, May 2014.
    • [16] G. Singh, S. Das, S. Gosavi, and S. Pujar, “Ant colony algorithms for Steiner trees: An application to routing in sensor networks,” in Recent Developments in Biologically Inspired Computing. Hershey, PA, USA: IGI Global, 2005, pp. 181-206.
    • [17] R. J. Wai, J. D. Lee, and K. L. Chuang, “Real-time PID control strategy for maglev transportation system via particle swarm optimization,” IEEE Trans. Ind. Electron., vol. 58, no. 2, pp. 629-646, Feb. 2011.
    • [18] Z. H. Zhan, J. Zhang, Y. Li, and H. Chung, “Adaptive particle swarm optimization,” IEEE Trans. Syst., Man, Cybern. B, vol. 39, no. 6, pp. 1362- 1381, Dec. 2009.
    • [19] H. Wang, X. X. Meng, S. Li, and H. Xu, “A tree-based particle swarm optimization for multicast routing,” Comput. Netw., vol. 54, no. 15, pp. 2775- 2786, Oct. 2010.
    • [20] R. Qu, Y. Xu, J. P. Castro, and D. Landa-Silva, “Particle swarm optimization for the Steiner tree in graph and delay-constrained multicast routing problems,” J. Heuristics, vol. 19, no. 2, pp. 317-342, Apr. 2013.
    • [21] J. Kennedy and R. C. Eberhart, “A discrete binary version of the particle swarm algorithm,” in Proc. IEEE Int. Conf. Syst., Man, Cybern., 1997, pp. 4104-4109.
    • [22] W. N. Chen et al., “A novel set-based particle swarm optimization method for discrete optimization problems,” IEEE Trans. Evol. Comput., vol. 14, no. 2, pp. 278-300, Apr. 2010.
    • [23] W. L. Zhong, J. Huang, and J. Zhang, “A novel particle swarm optimization for the Steiner tree problem in graphs,” in Proc. IEEE Congr. Evol. Comput., 2008, pp. 2465-2472.
    • [24] Z. H. Zhan and J. Zhang, “Discrete particle swarm optimization for multiple destination routing problems,” in Proc. EvoWorkshops, 2009, pp. 117-122.
    • [25] J. E. Beasley, “OR-library: Distributing test problems by electronic mail,” J. Oper. Res. Soc., vol. 41, no. 11, pp. 1069-1072, Nov. 1990.
    • [26] J. Kennedy and R. Mendes, “Population structure and particle swarm performance,” in Proc. IEEE Congr. Evol. Comput., 2002, pp. 1671-1676.
    • [27] Z. H. Zhan, J. Zhang, Y. Li, and Y. H. Shi, “Orthogonal learning particle swarm optimization,” IEEE Trans. Evol. Comput., vol. 15, no. 6, pp. 832- 847, Dec. 2011.
    • [28] W. N. Chen, J. Zhang, Y. Lin, N. Chen, Z. H. Zhan, H. Chung, Y. Li, and Y. H. Shi, “Particle swarm optimization with an aging leader and challengers,” IEEE Trans. Evol. Comput., vol. 17, no. 2, pp. 241-258, Apr. 2013.
    • [29] K. Chan, T. Dillon, and E. Chang, “An intelligent particle swarm optimization for short-term traffic flow forecasting using on-road sensor systems,” IEEE Trans. Ind. Electron., vol. 60, no. 10, pp. 4714-4725, Oct. 2013.
    • [30] L. Han, J. Wang, X. Wang, and C. Wang, “Bypass flow-splitting forwarding in FISH networks,” IEEE Trans. Ind. Electron., vol. 58, no. 6, pp. 2197-2204, Jun. 2011.
    • [31] H. P. Li and Y. Shi, “Network-based predictive control for constrained nonlinear systems with two-channel packet dropouts,” IEEE Trans. Ind. Electron., vol. 61, no. 3, pp. 1574-1582, Mar. 2014.
    • [32] A. F. Zobaa, “Optimal multiobjective design of hybrid active power filters considering a distorted environment,” IEEE Trans. Ind. Electron., vol. 61, no. 1, pp. 107-114, Jan. 2014.
    • [33] Y. Gong et al., “An efficient resource allocation scheme using particle swarm optimization,” IEEE Trans. Evol. Comput., vol. 16, no. 6, pp. 801- 816, Dec. 2012.
    • [34] Z. H. Zhan et al., “Multiple populations for multiple objectives: A coevolutionary technique for solving multiobjective optimization problems,” IEEE Trans. Cybern., vol. 43, no. 2, pp. 445-463, Apr. 2013.
    • [35] M. Kodialam and T. Lakshman, “Dynamic routing of restorable bandwidth guaranteed tunnels using aggregated network resource usage information,” IEEE/ACM Trans. Netw., vol. 11, no. 3, pp. 399-410, Jun. 2003.
    • Meie Shen received the B.S. degree in industrial automation from the Huazhong University of Science and Technology, Wuhan, China, in 1986, and the M.S. degree in automatic control from the Shenyang Institute of Automation, Chinese Academy of Sciences, Shenyang, China, in 1989. She is currently an Associate Professor with the School of Computer Science, Beijing Information Science and Technology University, Beijing, China. Her research interests include intelligent algorithms, and automatic control theory and application.
    • tion in 2013. Wei-Neng Chen (S'07-M'12) received the B.S. and Ph.D. degrees in computer science from Sun Yat-Sen University, Guangzhou, China, in 2006 and 2012, respectively. He is currently an Associate Professor with the School of Advanced Computing, Sun Yat-Sen University. He has published more than 30 papers in international journals and conferences. His research interests include swarm intelligence algorithms and their applications in real-world applications. Dr. Chen's doctoral dissertation was awarded the China Computer Federation Outstanding Dissertation in 2012.
  • No related research data.
  • No similar publications.

Share - Bookmark

Cite this article