{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,11]],"date-time":"2026-07-11T23:53:58Z","timestamp":1783814038515,"version":"3.55.0"},"reference-count":49,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2012,3,2]],"date-time":"2012-03-02T00:00:00Z","timestamp":1330646400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2013,4]]},"DOI":"10.1007\/s10732-012-9198-2","type":"journal-article","created":{"date-parts":[[2012,3,1]],"date-time":"2012-03-01T22:58:31Z","timestamp":1330642711000},"page":"317-342","source":"Crossref","is-referenced-by-count":30,"title":["Particle swarm optimization for the Steiner tree in graph and delay-constrained multicast routing problems"],"prefix":"10.1007","volume":"19","author":[{"given":"Rong","family":"Qu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ying","family":"Xu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Juan P.","family":"Castro","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dario","family":"Landa-Silva","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2012,3,2]]},"reference":[{"issue":"4","key":"9198_CR1","doi-asserted-by":"crossref","first-page":"1056","DOI":"10.1016\/j.cor.2004.09.002","volume":"33","author":"A. Allahverdi","year":"2006","unstructured":"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\u20131080 (2006)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"9198_CR2","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/j.ejor.2007.10.044","volume":"193","author":"D. Anghinolfi","year":"2009","unstructured":"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\u201385 (2009)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"9198_CR3","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1051\/ro:2006010","volume":"40","author":"F. Barahona","year":"2006","unstructured":"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\u201373 (2006)","journal-title":"RAIRO Oper. Res."},{"issue":"11","key":"9198_CR4","doi-asserted-by":"crossref","first-page":"1069","DOI":"10.1057\/jors.1990.166","volume":"41","author":"J.E. Beasley","year":"1990","unstructured":"Beasley, J.E.: OR-Library: distributing test problems by electronic mail. J. Oper. Res. Soc. 41(11), 1069\u20131072 (1990)","journal-title":"J. Oper. Res. Soc."},{"key":"9198_CR5","volume-title":"Data Networks","author":"D. Betsekas","year":"1992","unstructured":"Betsekas, D., Gallager, R.: Data Networks, 2nd edn. Prentice-Hall, Englewood Cliffs (1992)","edition":"2"},{"key":"9198_CR6","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780195131581.001.0001","volume-title":"Swarm Intelligence: From Natural To Artificial Systems","author":"E. Bonabeau","year":"1999","unstructured":"Bonabeau, E., Theraulaz, G., Dorigo, M.: Swarm Intelligence: From Natural To Artificial Systems. Oxford University Press, London (1999)"},{"key":"9198_CR7","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/978-3-642-03211-0_9","volume":"236","author":"J.P. Castro","year":"2009","unstructured":"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\u2013114 (2009)","journal-title":"Stud. Comput. Intell."},{"issue":"1","key":"9198_CR8","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/s11047-009-9137-9","volume":"9","author":"S. Consoli","year":"2010","unstructured":"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\u201346 (2010)","journal-title":"Nat. Comput."},{"key":"9198_CR9","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"2001","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press, Cambridge (2001)","edition":"2"},{"key":"9198_CR10","volume-title":"4th US-European Workshop on Logistics and Supply Chain Management","author":"A.M. Costa","year":"2006","unstructured":"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)"},{"key":"9198_CR11","volume-title":"Swarm Intelligence","author":"R.C. Eberhart","year":"2001","unstructured":"Eberhart, R.C., Shi, Y., Kennedy, J.: Swarm Intelligence. Morgan Kaufmann, San Mateo (2001)"},{"issue":"2","key":"9198_CR12","doi-asserted-by":"crossref","first-page":"652","DOI":"10.1137\/S0097539795290477","volume":"28","author":"D. Eppstein","year":"1998","unstructured":"Eppstein, D.: Finding the k shortest paths. SIAM J. Comput. 28(2), 652\u2013673 (1998)","journal-title":"SIAM J. Comput."},{"key":"9198_CR13","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF01096763","volume":"6","author":"T.A. Feo","year":"1995","unstructured":"Feo, T.A., Resende, M.G.: Greedy randomised adaptive search procedures. J. Glob. Optim. 6, 109\u2013133 (1995)","journal-title":"J. Glob. Optim."},{"issue":"6","key":"9198_CR14","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1145\/367766.368168","volume":"5","author":"R.W. Floyd","year":"1962","unstructured":"Floyd, R.W.: Algorithm 97: shortest path. Commun. ACM 5(6), 345 (1962)","journal-title":"Commun. ACM"},{"key":"9198_CR15","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, New York (1979)"},{"issue":"3\u20134","key":"9198_CR16","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/s11235-007-9031-7","volume":"34","author":"N. Ghaboosi","year":"2007","unstructured":"Ghaboosi, N., Haghighat, A.T.: Tabu search based algorithms for bandwidth-delay-constrained least-cost multicast routing. Telecommun. Syst. 34(3\u20134), 147\u2013166 (2007a)","journal-title":"Telecommun. Syst."},{"key":"9198_CR17","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1109\/ICTAI.2007.17","volume-title":"19th IEEE International Conference on Tools with Artificial Intelligence","author":"N. Ghaboosi","year":"2007","unstructured":"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\u2013390. IEEE Computer Society, Washington (2007b)"},{"issue":"2","key":"9198_CR18","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1109\/JCN.2000.6596737","volume":"2","author":"L. Guo","year":"2000","unstructured":"Guo, L.: Matta, I.: QDMR: An efficient QoS dependent multicast routing algorithm. J. Commun. Netw. 2(2), 168\u2013176 (2000)","journal-title":"J. Commun. Netw."},{"key":"9198_CR19","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/S0140-3664(03)00185-3","volume":"27","author":"A.T. Haghighat","year":"2004","unstructured":"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\u2013127 (2004)","journal-title":"Comput. Commun."},{"key":"9198_CR20","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1002\/net.3230220105","volume":"22","author":"F.K. Hwang","year":"1992","unstructured":"Hwang, F.K., Richards, D.S.: Steiner tree problems. Networks 22, 55\u201389 (1992)","journal-title":"Networks"},{"key":"9198_CR21","doi-asserted-by":"crossref","first-page":"1942","DOI":"10.1109\/ICNN.1995.488968","volume-title":"Proceedings of IEEE International Conference on Neural Networks","author":"J. Kennedy","year":"1995","unstructured":"Kennedy, J., Eberhart, R.C.: Particle swarm optimization. In: Proceedings of IEEE International Conference on Neural Networks, Piscataway, NJ, pp.\u00a01942\u20131948 (1995)"},{"key":"9198_CR22","first-page":"4104","volume-title":"Proceedings of the World Multiconference on Systemics, Cybernetics and Informatics 1997","author":"J. Kennedy","year":"1997","unstructured":"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.\u00a04104\u20134109 (1997)"},{"key":"9198_CR23","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1002\/(SICI)1097-0037(199810)32:3<207::AID-NET5>3.0.CO;2-O","volume":"32","author":"T. Koch","year":"1998","unstructured":"Koch, T., Martin, A.: Solving Steiner tree problems in graphs to optimality. Networks 32, 207\u2013232 (1998)","journal-title":"Networks"},{"key":"9198_CR24","first-page":"285","volume-title":"Steiner Trees in Industries","author":"T. Koch","year":"2002","unstructured":"Koch, T., Martin, A., Vo\u00df, S.: SteinLib: an updated library on Steiner tree problems in graphs. In: Du, D.-Z., Cheng, X. (eds.) Steiner Trees in Industries, pp.\u00a0285\u2013325. Springer, Berlin (2002)"},{"key":"9198_CR25","doi-asserted-by":"crossref","first-page":"286","DOI":"10.1109\/90.234851","volume":"1","author":"V.P. Kompella","year":"1993","unstructured":"Kompella, V.P., Pasquale, J.C., Polyzos, G.C.: Multicast routing for multimedia communication. IEEE\/ACM Trans. Netw. 1, 286\u2013292 (1993)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"9198_CR26","first-page":"2355","volume-title":"The 6th IEEE International Conference on Control and Automation","author":"C. Li","year":"2007","unstructured":"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.\u00a02355\u20132359 (2007)"},{"key":"9198_CR27","volume-title":"Design and Analysis of Experiments","author":"D.C. Montgomery","year":"2005","unstructured":"Montgomery, D.C.: Design and Analysis of Experiments, 6th edn. Wiley, New York (2005)","edition":"6"},{"key":"9198_CR28","volume-title":"Proceedings of the 7th Metaheuristics International Conference","author":"J.A. Moreno-Perez","year":"2007","unstructured":"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)"},{"issue":"8","key":"9198_CR29","doi-asserted-by":"crossref","first-page":"1953","DOI":"10.1016\/j.cor.2003.12.007","volume":"32","author":"C.A.S. Oliveira","year":"2005","unstructured":"Oliveira, C.A.S., Pardalos, P.M.: A survey of combinatorial optimization problems in multicast routing. Comput. Oper. Res. 32(8), 1953\u20131981 (2005)","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"9198_CR30","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1080\/00207540310001614150","volume":"42","author":"G.C. Onwubolu","year":"2004","unstructured":"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\u2013491 (2004)","journal-title":"Int. J. Prod. Res."},{"key":"9198_CR31","doi-asserted-by":"crossref","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","volume":"36","author":"R.C. Prim","year":"1957","unstructured":"Prim, R.C.: Shortest connection networks and some generalizations. Bell Syst. Tech. J. 36, 1389\u20131401 (1957)","journal-title":"Bell Syst. Tech. J."},{"key":"9198_CR32","volume-title":"Proceedings of Learning and Intelligent OptimizatioN (LION 3)","author":"R. Qu","year":"2009","unstructured":"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\u201318, 2009"},{"issue":"3","key":"9198_CR33","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1109\/49.564132","volume":"15","author":"H.F. Salama","year":"1997","unstructured":"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\u2013345 (1997)","journal-title":"IEEE J. Sel. Areas Commun."},{"issue":"4","key":"9198_CR34","doi-asserted-by":"crossref","first-page":"791","DOI":"10.1016\/j.cie.2006.09.002","volume":"51","author":"D.Y. Sha","year":"2006","unstructured":"Sha, D.Y., Hsu, C.: A hybrid particle swarm optimization for job shop scheduling problem. Comput. Ind. Eng. 51(4), 791\u2013808 (2006)","journal-title":"Comput. Ind. Eng."},{"key":"9198_CR35","first-page":"443","volume-title":"Proceedings of the 7th international Conference on Telecommunications","author":"N. Skorin-Kapov","year":"2003","unstructured":"Skorin-Kapov, N., Kos, M.: The application of Steiner trees to delay constrained multicast routing: a\u00a0tabu search approach. In: Proceedings of the 7th international Conference on Telecommunications, pp.\u00a0443\u2013448 (2003)"},{"issue":"1","key":"9198_CR36","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/s11235-006-8202-2","volume":"32","author":"N. Skorin-Kapov","year":"2006","unstructured":"Skorin-Kapov, N., Kos, M.: A GRASP heuristic for the delay-constrained multicast routing problem. Telecommun. Syst. 32(1), 55\u201369 (2006)","journal-title":"Telecommun. Syst."},{"key":"9198_CR37","first-page":"261","volume-title":"Lecture Notes in Computer Science","author":"J. Sun","year":"2006","unstructured":"Sun, J., Liu, J., Xu, W.: QPSO-based QoS multicast routing algorithm book series. In: Lecture Notes in Computer Science, vol.\u00a04247, pp.\u00a0261\u2013268. Springer, Berlin (2006)"},{"issue":"3","key":"9198_CR38","doi-asserted-by":"crossref","first-page":"1930","DOI":"10.1016\/j.ejor.2005.12.024","volume":"177","author":"M.F. Tasgetiren","year":"2007","unstructured":"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\u20131947 (2007)","journal-title":"Eur. J. Oper. Res."},{"key":"9198_CR39","doi-asserted-by":"crossref","first-page":"685","DOI":"10.1016\/S0140-3664(00)00273-5","volume":"24","author":"Z. Wang","year":"2001","unstructured":"Wang, Z., Shi, B., Zhao, E.: Bandwidth-delay-constrained least-cost multicast routing based on heuristic genetic algorithm. Comput. Commun. 24, 685\u2013692 (2001)","journal-title":"Comput. Commun."},{"issue":"2","key":"9198_CR40","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/j.jnca.2003.10.001","volume":"27","author":"H. Wang","year":"2004","unstructured":"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\u201390 (2004)","journal-title":"J. Netw. Comput. Appl."},{"key":"9198_CR41","first-page":"723","volume-title":"Proceedings of the Sixth International Conference on Parallel and Distributed Computing Applications and Technologies","author":"J. Wang","year":"2005","unstructured":"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.\u00a0723\u2013727 (2005)"},{"issue":"9","key":"9198_CR42","doi-asserted-by":"crossref","first-page":"1617","DOI":"10.1109\/49.12889","volume":"6","author":"B.M. Waxman","year":"1988","unstructured":"Waxman, B.M.: Routing of multipoint connections. IEEE J. Sel. Areas Commun. 6(9), 1617\u20131622 (1988)","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"9198_CR43","doi-asserted-by":"crossref","first-page":"352","DOI":"10.1016\/j.comcom.2011.10.011","volume":"35","author":"Y. Xu","year":"2012","unstructured":"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\u2013365 (2012)","journal-title":"Comput. Commun."},{"issue":"11\u201312","key":"9198_CR44","doi-asserted-by":"crossref","first-page":"1140","DOI":"10.1016\/S0140-3664(02)00029-4","volume":"25","author":"H. Youssef","year":"2002","unstructured":"Youssef, H., Al-Mulhem, A., Sait, S.M., Tahir, M.A.: QoS-driven multicast tree generation using tabu search. Comput. Commun. 25(11\u201312), 1140\u20131149 (2002)","journal-title":"Comput. Commun."},{"key":"9198_CR45","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1109\/ICNSC.2004.1297464","volume-title":"IEEE International Conference on Networking, Sensing and Control","author":"P. Yuan","year":"2004","unstructured":"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\u2013371 (2004)"},{"key":"9198_CR46","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1016\/S0377-2217(99)00131-9","volume":"119","author":"M. Zachariasen","year":"1999","unstructured":"Zachariasen, M.: Local search for the Steiner tree problem in the Euclidean plane. Eur. J. Oper. Res. 119, 282\u2013300 (1999)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"9198_CR47","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1061\/(ASCE)0887-3801(2006)20:2(141)","volume":"20","author":"H. Zhang","year":"2006","unstructured":"Zhang, H., Li, H., Tam, C.M.: Permutation-based particle swarm optimization for resource-constrained project scheduling. J. Comput. Civ. Eng. 20(2), 141\u2013149 (2006)","journal-title":"J. Comput. Civ. Eng."},{"key":"9198_CR48","first-page":"2460","volume-title":"IEEE World Congress on Evolutionary Computation","author":"W.L. Zhong","year":"2008","unstructured":"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.\u00a02460\u20132467 (2008)"},{"key":"9198_CR49","first-page":"377","volume-title":"Proceedings of the 14th Annual Joint Conference of the IEEE Computer and Communication","author":"Q. Zhu","year":"1995","unstructured":"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.\u00a0377\u2013385. IEEE Computer Society Press, Boston (1995)"}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-012-9198-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-012-9198-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-012-9198-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T01:27:09Z","timestamp":1641000429000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-012-9198-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,3,2]]},"references-count":49,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,4]]}},"alternative-id":["9198"],"URL":"https:\/\/doi.org\/10.1007\/s10732-012-9198-2","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,3,2]]}}}