{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T02:51:10Z","timestamp":1761706270141},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2010,10,21]],"date-time":"2010-10-21T00:00:00Z","timestamp":1287619200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2012,1]]},"DOI":"10.1007\/s10489-010-0256-x","type":"journal-article","created":{"date-parts":[[2010,10,20]],"date-time":"2010-10-20T07:42:01Z","timestamp":1287560521000},"page":"229-241","source":"Crossref","is-referenced-by-count":29,"title":["A hybrid scatter search meta-heuristic for delay-constrained multicast routing problems"],"prefix":"10.1007","volume":"36","author":[{"given":"Ying","family":"Xu","sequence":"first","affiliation":[]},{"given":"Rong","family":"Qu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,10,21]]},"reference":[{"key":"256_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-0255-1","volume-title":"Steiner trees in industry","author":"X Cheng","year":"2001","unstructured":"Cheng X, Du DZ (2001) Steiner trees in industry. Kluwer Academic, Dordrecht"},{"key":"256_CR2","volume-title":"Computers and intractability: a\u00a0guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability: a\u00a0guide to the theory of NP-completeness. Freeman, New York"},{"key":"256_CR3","unstructured":"Guo L, Matta I (1999) QDMR: An efficient QoS dependent multicast routing algorithm. In: Proceedings of the 5th IEEE real time technology and applications symposium, pp 213\u2013222"},{"key":"256_CR4","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1109\/49.564132","volume":"15","author":"HF Salama","year":"1997","unstructured":"Salama HF, Reeves DS, Viniotis Y (1997) Evaluation of multicast routing algorithms for real-time communication on high-speed networks. IEEE J Sel Areas Commun 15:332\u2013345","journal-title":"IEEE J Sel Areas Commun"},{"key":"256_CR5","doi-asserted-by":"crossref","first-page":"1547","DOI":"10.1016\/j.comcom.2004.04.003","volume":"27","author":"CK Yeo","year":"2004","unstructured":"Yeo CK, Lee BS, Er MH (2004) A survey of application level multicast techniques. Comput Commun 27:1547\u20131568","journal-title":"Comput Commun"},{"key":"256_CR6","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1016\/j.comcom.2005.06.008","volume":"29","author":"X Masip-Bruin","year":"2006","unstructured":"Masip-Bruin X, Yannuzzi M, Domingo-Pascual J, Fonte A, Curado M, Monteiro E, Kuipers F, Van Mieghem P, Avallone S, Ventre G, Aranda-Gutierrez P, Hollick M, Steinmetz R, Iannone L, Salamatian K (2006) Research challenges in QoS routing. Comput Commun 29:563\u2013581","journal-title":"Comput Commun"},{"key":"256_CR7","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1109\/49.564128","volume":"15","author":"C Diot","year":"1997","unstructured":"Diot C, Dabbous W, Crowcroft J (1997) Multipoint communication: a survey of protocols, functions, and mechanisms. IEEE J Sel Areas Commun 15:277\u2013290","journal-title":"IEEE J Sel Areas Commun"},{"issue":"8","key":"256_CR8","doi-asserted-by":"crossref","first-page":"1953","DOI":"10.1016\/j.cor.2003.12.007","volume":"32","author":"CAS Oliveira","year":"2005","unstructured":"Oliveira CAS, Pardalos PM (2005) A survey of combinatorial optimization problems in multicast routing. Comput Oper Res 32(8):1953\u20131981","journal-title":"Comput Oper Res"},{"issue":"11","key":"256_CR9","doi-asserted-by":"crossref","first-page":"1069","DOI":"10.1057\/jors.1990.166","volume":"41","author":"JE Beasley","year":"1990","unstructured":"Beasley JE (1990) OR-Library: distributing test problems by electronic mail. J Oper Res Soc 41(11):1069\u20131072. http:\/\/people.brunel.ac.uk\/~mastjjb\/jeb\/orlib\/steininfo.html","journal-title":"J Oper Res Soc"},{"key":"256_CR10","doi-asserted-by":"crossref","first-page":"286","DOI":"10.1109\/90.234851","volume":"1","author":"VP Kompella","year":"1993","unstructured":"Kompella VP, Pasquale JC, Polyzos GC (1993) Multicast routing for multimedia communication. IEEE\/ACM Trans Netw 1:286\u2013292","journal-title":"IEEE\/ACM Trans Netw"},{"key":"256_CR11","unstructured":"Widyono R (1994) The design and evaluation of routing algorithms for realtime channels. Technical Report, ICSI TR-94-024, International Computer Science Institute, UC Berkeley"},{"key":"256_CR12","unstructured":"Sun Q, Langendoerfer H (1995) Efficient multicast routing for delay-sensitive applications. In: Proceedings of the 2nd workshop on protocols for multimedia systems, pp 452\u2013458"},{"key":"256_CR13","doi-asserted-by":"crossref","unstructured":"Sun Q, Langendoerfer H (1997) An efficient delay-constrained multicast routing algorithm. Technical Report, Internal Report, Institute of Operating Systems and Computer Networks, TU Braunschweig, Germany","DOI":"10.1007\/BFb0000343"},{"key":"256_CR14","first-page":"377","volume-title":"Proceedings of the 14th annual joint conference of the IEEE computer and communication (INFOCOM\u201995)","author":"Q Zhu","year":"1995","unstructured":"Zhu Q, Parsa M, Garcia-Luna-Aceves JJ (1995) A source-based algorithm for delay-constrained minimum-cost multicasting. In: Proceedings of the 14th annual joint conference of the IEEE computer and communication (INFOCOM\u201995). IEEE Comput Soc, Boston, pp 377\u2013385"},{"key":"256_CR15","unstructured":"Kompella VP, Pasquale JC, Polyzos GC (1993) Two distributed algorithms for the constrained Steiner tree problem. In: Proceedings of the 2nd international conference on computer communications and networking, pp 343\u2013349"},{"key":"256_CR16","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1109\/49.564135","volume":"15","author":"A Shaikh","year":"1997","unstructured":"Shaikh A, Shin K (1997) Destination-driven routing for low-cost multicast. IEEE J Sel Areas Commun 15:373\u2013381","journal-title":"IEEE J Sel Areas Commun"},{"key":"256_CR17","doi-asserted-by":"crossref","first-page":"828","DOI":"10.1109\/90.748092","volume":"6","author":"X Jia","year":"1998","unstructured":"Jia X (1998) A distributed algorithm of delay-bounded multicast routing for multimedia applications in wide area networks. IEEE\/ACM Trans Netw 6:828\u2013837","journal-title":"IEEE\/ACM Trans Netw"},{"key":"256_CR18","unstructured":"Wang XL, Jiang Z (2004) QoS multicast routing based on simulated annealing algorithm. In: Proceedings international and applications, pp 511\u2013516"},{"key":"256_CR19","doi-asserted-by":"crossref","first-page":"1356","DOI":"10.1016\/j.comcom.2004.12.003","volume":"28","author":"Z Kun","year":"2005","unstructured":"Kun Z, Heng W, Feng-Yu L (2005) Distributed multicast routing for delay variation-bounded Steiner tree using simulated annealing. Comput Commun 28:1356\u20131370","journal-title":"Comput Commun"},{"key":"256_CR20","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 (2001) Bandwidth-delay-constrained least-cost multicast routing based on heuristic genetic algorithm. Comput Commun 24:685\u2013692","journal-title":"Comput Commun"},{"key":"256_CR21","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/S0140-3664(03)00185-3","volume":"27","author":"AT Haghighat","year":"2004","unstructured":"Haghighat AT, Faez K, Dehghan M, Mowlaei A, Ghahremani Y (2004) GA-based heuristic algorithms for bandwidth-delay-constrained least-cost multicast routing. Comput Commun 27:111\u2013127","journal-title":"Comput Commun"},{"key":"256_CR22","doi-asserted-by":"crossref","first-page":"2049","DOI":"10.1016\/j.cor.2006.10.001","volume":"35","author":"MS Zahrani","year":"2008","unstructured":"Zahrani MS, Loomes MJ, JA Malcolm, Dayem Ullah AZM, Steinhofel K, Albrecht AA (2008) Genetic local search for multicast routing with pre-processing by logarithmic simulated annealing. Comput Oper Res 35:2049\u20132070","journal-title":"Comput Oper Res"},{"issue":"3","key":"256_CR23","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1007\/s10489-006-0014-2","volume":"26","author":"SJ Kim","year":"2007","unstructured":"Kim SJ, Choi MK (2007) Evolutionary Algorithms for route selection and rate allocation in multirate multicast networks. Appl Intell 26(3):197\u2013215","journal-title":"Appl Intell"},{"issue":"11\u201312","key":"256_CR24","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 SM, MA Tahir (2002) QoS-driven multicast tree generation using tabu search. Comput Commun 25(11\u201312):1140\u20131149","journal-title":"Comput Commun"},{"key":"256_CR25","doi-asserted-by":"crossref","unstructured":"Skorin-Kapov N, Kos M (2003) The application of Steiner trees to delay constrained multicast routing: a tabu search approach. In: Proceedings of the seventh international conference on telecommunications, Zagreb, Croatia","DOI":"10.1109\/CONTEL.2003.176945"},{"key":"256_CR26","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 YM (2004) TSDLMRA: an efficient multicast routing algorithm based on tabu search. J Netw Comput Appl 27:77\u201390","journal-title":"J Netw Comput Appl"},{"key":"256_CR27","doi-asserted-by":"crossref","unstructured":"Ghaboosi N, Haghighat AT (2006) A tabu search based algorithm for multicast routing with QoS constraints. In: 9th international conference on information technology, pp 18\u201321","DOI":"10.1109\/ICIT.2006.22"},{"key":"256_CR28","doi-asserted-by":"crossref","unstructured":"Ghaboosi N, Haghighat AT (2007) A path relinking approach for delay-constrained least-cost multicast routing problem. In: 19th international conference on tools with artificial intelligence, pp\u00a0383\u2013390","DOI":"10.1109\/ICTAI.2007.17"},{"issue":"1","key":"256_CR29","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 (2006) A GRASP heuristic for the delay-constrained multicast routing problem. Telecommun Syst 32(1):55\u201369","journal-title":"Telecommun Syst"},{"key":"256_CR30","unstructured":"Xu Y, Qu R (2009) A GRASP approach for the delay-constrained multicast routing problem. In: Proceedings of the 4th multidisciplinary international scheduling conference (MISTA4). Dublin, Ireland"},{"key":"256_CR31","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/978-3-642-11169-3_2","volume-title":"Proceedings of learning and intelligent optimization (LION3)","author":"R Qu","year":"2009","unstructured":"Qu R, Xu Y, Kendall G (2009) A variable neighborhood descent search algorithm for delay-constrained least-cost multicast routing. In: St\u00fctzle T (ed) Proceedings of learning and intelligent optimization (LION3). LNCS, vol 5851. Springer, Berlin, pp 15\u201329"},{"key":"256_CR32","volume-title":"Data networks","author":"D Betsekas","year":"1992","unstructured":"Betsekas D, Gallager R (1992) Data networks, 2nd edn. Englewood Cliffs, Prentice-Hall","edition":"2"},{"key":"256_CR33","volume-title":"Introduction to algorithms","author":"TH Cormen","year":"1997","unstructured":"Cormen TH, Leiserson CE, Revest RL (1997) Introduction to algorithms. MIT Press, Cambridge"},{"issue":"2","key":"256_CR34","doi-asserted-by":"crossref","first-page":"652","DOI":"10.1137\/S0097539795290477","volume":"28","author":"D Eppstein","year":"1998","unstructured":"Eppstein D (1998) Finding the k shortest paths. SIAM J Comput 28(2):652\u2013673","journal-title":"SIAM J Comput"},{"key":"256_CR35","series-title":"LNCS","first-page":"3","volume-title":"Artificial Evolution","author":"F Glover","year":"1998","unstructured":"Glover F (1998) A template for scatter search and path relinking. In: Hao JK, Lutton E, Ronald E, Schoenauer M, Snyers D (eds) Artificial Evolution. LNCS, vol 1363. Springer, Berlin, pp 3\u201351"},{"issue":"3","key":"256_CR36","first-page":"653","volume":"29","author":"F Glover","year":"2000","unstructured":"Glover F, Laguna M, Mart\u00ed R (2000) Fundamentals of scatter search and path relinking. Control Cybern 29(3):653\u2013684","journal-title":"Control Cybern"},{"key":"256_CR37","doi-asserted-by":"crossref","unstructured":"Glover F, L\u00f8kketangen A, Woodruff DL (2000) Scatter search to generate diverse MIP solutions. In: Laguna M, Gonz\u00e1lez-Velarde JL (eds) OR computing tools for modeling, optimization and simulation: interfaces in computer science and operations research, pp\u00a0299\u2013317","DOI":"10.1007\/978-1-4615-4567-5_17"},{"key":"256_CR38","volume-title":"LNCS","author":"H Drias","year":"2001","unstructured":"Drias H, Khabzaoui M (2001) Scatter search with random walk strategy for SAT and MAX-W-SAT problems. In: LNCS, vol 2070. Springer, Berlin, pp 35-44"},{"key":"256_CR39","series-title":"LNCS","volume-title":"Scatter search for graph coloring","author":"JP Hamiez","year":"2002","unstructured":"Hamiez JP, Hao JK (2002) Scatter search for graph coloring. In: LNCS, vol 2310. Springer, Berlin, pp 168\u2013179"},{"issue":"6","key":"256_CR40","doi-asserted-by":"crossref","first-page":"4073","DOI":"10.1016\/j.eswa.2009.11.027","volume":"37","author":"J Tang","year":"2010","unstructured":"Tang J, Zhang J, Pan Z (2010) A Scatter search for solving vehicle routing problem with loading cost. Expert Syst Appl 37(6):4073\u20134083","journal-title":"Expert Syst Appl"},{"key":"256_CR41","unstructured":"Bastos MP Ribeiro CC (1999) Reactive tabu search with path relinking for the Steiner problem in graphs. In: Proceedings of the third metaheuristics international conference, Angra dos Reis, Brazil"},{"key":"256_CR42","doi-asserted-by":"crossref","first-page":"1617","DOI":"10.1109\/49.12889","volume":"6","author":"BM Waxman","year":"1988","unstructured":"Waxman BM (1988) Routing of multipoint connections. IEEE J Sel Areas Commun 6:1617\u20131622","journal-title":"IEEE J Sel Areas Commun"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-010-0256-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10489-010-0256-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-010-0256-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,3]],"date-time":"2023-06-03T21:56:08Z","timestamp":1685829368000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10489-010-0256-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,10,21]]},"references-count":42,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,1]]}},"alternative-id":["256"],"URL":"https:\/\/doi.org\/10.1007\/s10489-010-0256-x","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,10,21]]}}}