Skip to main content

Particle swarm optimization for the Steiner tree in graph and delay-constrained multicast routing problems

Journal of Heuristics volume 19, pages 317–342 (2013)Cite this article

Abstract

This paper presents the first investigation on applying a particle swarm optimization (PSO) algorithm to both the Steiner tree problem and the delay constrained multicast routing problem. Steiner tree problems, being the underlining models of many applications, have received significant research attention within the meta-heuristics community. The literature on the application of meta-heuristics to multicast routing problems is less extensive but includes several promising approaches. Many interesting research issues still remain to be investigated, for example, the inclusion of different constraints, such as delay bounds, when finding multicast trees with minimum cost. In this paper, we develop a novel PSO algorithm based on the jumping PSO (JPSO) algorithm recently developed by Moreno-Perez et al. (Proc. of the 7th Metaheuristics International Conference, 2007), and also propose two novel local search heuristics within our JPSO framework. A path replacement operator has been used in particle moves to improve the positions of the particle with regard to the structure of the tree. We test the performance of our JPSO algorithm, and the effect of the integrated local search heuristics by an extensive set of experiments on multicast routing benchmark problems and Steiner tree problems from the OR library. The experimental results show the superior performance of the proposed JPSO algorithm over a number of other state-of-the-art approaches.

This is a preview of subscription content, access via your institution.

Access options

Buy single article

Instant access to the full article PDF.

USD 39.95

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7

References

  • Allahverdi, A., Al-Anzi, F.S.: A PSO and a tabu search heuristics for the assembly scheduling problem of the two-stage distributed database application. Comput. Oper. Res. 33(4), 1056–1080 (2006)

    Article  MATH  Google Scholar 

  • Anghinolfi, D., Paolucci, M.: A new discrete particle swarm optimization approach for the single-machine total weighted tardiness scheduling problem with sequence-dependent setup times. Eur. J. Oper. Res. 193(1), 73–85 (2009)

    Article  MATH  Google Scholar 

  • Barahona, F., Ladanyi, L.: Branch and cut based on the volume algorithm: Steiner trees in graphs and max-Cut. RAIRO Oper. Res. 40(1), 53–73 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  • Beasley, J.E.: OR-Library: distributing test problems by electronic mail. J. Oper. Res. Soc. 41(11), 1069–1072 (1990)

    Google Scholar 

  • Betsekas, D., Gallager, R.: Data Networks, 2nd edn. Prentice-Hall, Englewood Cliffs (1992)

    Google Scholar 

  • Bonabeau, E., Theraulaz, G., Dorigo, M.: Swarm Intelligence: From Natural To Artificial Systems. Oxford University Press, London (1999)

    MATH  Google Scholar 

  • Castro, J.P., Landa-Silva, D., Moreno-Perez, J.A.: Exploring feasible and infeasible regions in the vehicle routing problem with time windows using a multi-objective particle swarm optimization approach. Stud. Comput. Intell. 236, 103–114 (2009)

    Article  Google Scholar 

  • Consoli, S., Moreno-Perez, J.A., Darby-Dowman, K., Mladenovic, N.: Discrete particle swarm optimization for the minimum labelling Steiner tree problem. Nat. Comput. 9(1), 29–46 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  • Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press, Cambridge (2001)

    MATH  Google Scholar 

  • Costa, A.M., Cordeau, J.F., Laporte, G.: Exact and approximate algorithms for a class of Steiner tree problems arising in network design and lot sizing. In: 4th US-European Workshop on Logistics and Supply Chain Management, Hamburg (2006)

    Google Scholar 

  • Eberhart, R.C., Shi, Y., Kennedy, J.: Swarm Intelligence. Morgan Kaufmann, San Mateo (2001)

    Google Scholar 

  • Eppstein, D.: Finding the k shortest paths. SIAM J. Comput. 28(2), 652–673 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  • Feo, T.A., Resende, M.G.: Greedy randomised adaptive search procedures. J. Glob. Optim. 6, 109–133 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  • Floyd, R.W.: Algorithm 97: shortest path. Commun. ACM 5(6), 345 (1962)

    Article  Google Scholar 

  • Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, New York (1979)

    MATH  Google Scholar 

  • Ghaboosi, N., Haghighat, A.T.: Tabu search based algorithms for bandwidth-delay-constrained least-cost multicast routing. Telecommun. Syst. 34(3–4), 147–166 (2007a)

    Article  Google Scholar 

  • Ghaboosi, N., Haghighat, A.T.: A path relinking approach for delay-constrained least-cost multicast routing problem. In: 19th IEEE International Conference on Tools with Artificial Intelligence, p. 383–390. IEEE Computer Society, Washington (2007b)

    Chapter  Google Scholar 

  • Guo, L.: Matta, I.: QDMR: An efficient QoS dependent multicast routing algorithm. J. Commun. Netw. 2(2), 168–176 (2000)

    Google Scholar 

  • Haghighat, A.T., Faez, K., Dehghan, M., Mowlaei, A., Ghahremani, Y.: GA-based heuristic algorithms for bandwidth-delay-constrained least-cost multicast routing. Comput. Commun. 27, 111–127 (2004)

    Article  Google Scholar 

  • Hwang, F.K., Richards, D.S.: Steiner tree problems. Networks 22, 55–89 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  • Kennedy, J., Eberhart, R.C.: Particle swarm optimization. In: Proceedings of IEEE International Conference on Neural Networks, Piscataway, NJ, pp. 1942–1948 (1995)

    Chapter  Google Scholar 

  • Kennedy, J., Eberhart, R.C.: A discrete binary version of the particle swarm algorithm. In: Proceedings of the World Multiconference on Systemics, Cybernetics and Informatics 1997, Piscataway, NJ, pp. 4104–4109 (1997)

    Google Scholar 

  • Koch, T., Martin, A.: Solving Steiner tree problems in graphs to optimality. Networks 32, 207–232 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  • Koch, T., Martin, A., Voß, S.: SteinLib: an updated library on Steiner tree problems in graphs. In: Du, D.-Z., Cheng, X. (eds.) Steiner Trees in Industries, pp. 285–325. Springer, Berlin (2002)

    Google Scholar 

  • Kompella, V.P., Pasquale, J.C., Polyzos, G.C.: Multicast routing for multimedia communication. IEEE/ACM Trans. Netw. 1, 286–292 (1993)

    Article  Google Scholar 

  • Li, C., Cao, C., Li, Y., Yu, Y.: Hybrid of genetic algorithm and particle swarm optimization for multicast QoS routing. In: The 6th IEEE International Conference on Control and Automation, pp. 2355–2359 (2007)

    Google Scholar 

  • Montgomery, D.C.: Design and Analysis of Experiments, 6th edn. Wiley, New York (2005)

    MATH  Google Scholar 

  • Moreno-Perez, J.A., Castro-Gutierrez, J.P., Martinez-Garcia, F.J., Melian, B., Moreno-Vega, J.M., Ramos, J.: Discrete particle swarm optimization for the p-median problem. In: Proceedings of the 7th Metaheuristics International Conference, Montreal, Canada (2007)

    Google Scholar 

  • Oliveira, C.A.S., Pardalos, P.M.: A survey of combinatorial optimization problems in multicast routing. Comput. Oper. Res. 32(8), 1953–1981 (2005)

    Article  MATH  Google Scholar 

  • Onwubolu, G.C., Clerc, M.: Optimal path for automated drilling operations by a new heuristic approach using particle swarm optimization. Int. J. Prod. Res. 42(3), 473–491 (2004)

    Article  MATH  Google Scholar 

  • Prim, R.C.: Shortest connection networks and some generalizations. Bell Syst. Tech. J. 36, 1389–1401 (1957)

    Google Scholar 

  • Qu, R., Xu, Y., Kendall, G.: A variable neighborhood search algorithm for delay-constrained least-cost multicast routing. In: Proceedings of Learning and Intelligent OptimizatioN (LION 3), Trento, Italy, Jan. 14–18, 2009

    Google Scholar 

  • Salama, H.F., Reeves, D.S., Viniotis, Y.: Evaluation of multicast routing algorithms for real-time communication on high-speed networks. IEEE J. Sel. Areas Commun. 15(3), 332–345 (1997)

    Article  Google Scholar 

  • Sha, D.Y., Hsu, C.: A hybrid particle swarm optimization for job shop scheduling problem. Comput. Ind. Eng. 51(4), 791–808 (2006)

    Article  Google Scholar 

  • Skorin-Kapov, N., Kos, M.: The application of Steiner trees to delay constrained multicast routing: a tabu search approach. In: Proceedings of the 7th international Conference on Telecommunications, pp. 443–448 (2003)

    Google Scholar 

  • Skorin-Kapov, N., Kos, M.: A GRASP heuristic for the delay-constrained multicast routing problem. Telecommun. Syst. 32(1), 55–69 (2006)

    Article  Google Scholar 

  • Sun, J., Liu, J., Xu, W.: QPSO-based QoS multicast routing algorithm book series. In: Lecture Notes in Computer Science, vol. 4247, pp. 261–268. Springer, Berlin (2006)

    Google Scholar 

  • Tasgetiren, M.F., Liang, Y.C., Sevkli, M., Gencyilmaz, G.: A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem. Eur. J. Oper. Res. 177(3), 1930–1947 (2007)

    Article  MATH  Google Scholar 

  • Wang, Z., Shi, B., Zhao, E.: Bandwidth-delay-constrained least-cost multicast routing based on heuristic genetic algorithm. Comput. Commun. 24, 685–692 (2001)

    Article  Google Scholar 

  • Wang, H., Fang, J., Wang, H., Sun, Y.M.: TSDLMRA: an efficient multicast routing algorithm based on tabu search. J. Netw. Comput. Appl. 27(2), 77–90 (2004)

    Article  Google Scholar 

  • Wang, J., Wang, X., Huang, M.: A hybrid intelligent QoS multicast routing algorithm in NGI. In: Proceedings of the Sixth International Conference on Parallel and Distributed Computing Applications and Technologies, pp. 723–727 (2005)

    Google Scholar 

  • Waxman, B.M.: Routing of multipoint connections. IEEE J. Sel. Areas Commun. 6(9), 1617–1622 (1988)

    Article  Google Scholar 

  • Xu, Y., Qu, R.: An iterative local search approach based on fitness landscapes analysis for the delay-constrained multicast routing problem. Comput. Commun. 35, 352–365 (2012)

    Article  Google Scholar 

  • Youssef, H., Al-Mulhem, A., Sait, S.M., Tahir, M.A.: QoS-driven multicast tree generation using tabu search. Comput. Commun. 25(11–12), 1140–1149 (2002)

    Article  Google Scholar 

  • Yuan, P., Ji, C., Zhang, Y., Wang, Y.: Optimal multicast routing in wireless ad hoc sensor networks. In: IEEE International Conference on Networking, Sensing and Control, p. 367–371 (2004)

    Chapter  Google Scholar 

  • Zachariasen, M.: Local search for the Steiner tree problem in the Euclidean plane. Eur. J. Oper. Res. 119, 282–300 (1999)

    Article  MATH  Google Scholar 

  • Zhang, H., Li, H., Tam, C.M.: Permutation-based particle swarm optimization for resource-constrained project scheduling. J. Comput. Civ. Eng. 20(2), 141–149 (2006)

    Article  Google Scholar 

  • Zhong, W.L., Huang, J., Zhang, J.: A novel particle swarm optimisation for the Steiner tree problem in graphs. In: IEEE World Congress on Evolutionary Computation, pp. 2460–2467 (2008)

    Google Scholar 

  • Zhu, Q., Parsa, M., Garcia-Luna-Aceves, J.J.: A source-based algorithm for delay-constrained minimum-cost multicasting. In: Proceedings of the 14th Annual Joint Conference of the IEEE Computer and Communication, pp. 377–385. IEEE Computer Society Press, Boston (1995)

    Google Scholar 

Download references

Acknowledgements

This research is supported by Hunan University, China, and the School of Computer Science at The University of Nottingham, UK.

Author information

Authors and Affiliations

  1. School of Computer Science, The University of Nottingham, Nottingham, NG8 1BB, UK

    Rong Qu, Ying Xu, Juan P. Castro & Dario Landa-Silva

  2. School of Computer and Communication, Hunan University, Changsha, 410082, China

    Ying Xu

Authors
  1. Rong Qu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ying Xu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Juan P. Castro
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Dario Landa-Silva
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Rong Qu.

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Qu, R., Xu, Y., Castro, J.P. et al. Particle swarm optimization for the Steiner tree in graph and delay-constrained multicast routing problems. J Heuristics 19, 317–342 (2013). https://doi.org/10.1007/s10732-012-9198-2

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10732-012-9198-2

Keywords

  • Delay constrained multicast routing
  • Steiner tree problems
  • Particle swarm optimization