{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T13:25:03Z","timestamp":1776950703034,"version":"3.51.4"},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2019,9,6]],"date-time":"2019-09-06T00:00:00Z","timestamp":1567728000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,9,6]],"date-time":"2019-09-06T00:00:00Z","timestamp":1567728000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61502385"],"award-info":[{"award-number":["61502385"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Shaanxi Provincial Special Support Program for Science and Technology Innovation Leader","award":["None"],"award-info":[{"award-number":["None"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2020,3]]},"DOI":"10.1007\/s10489-019-01547-9","type":"journal-article","created":{"date-parts":[[2019,9,6]],"date-time":"2019-09-06T16:43:34Z","timestamp":1567788214000},"page":"759-777","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Optimizing multicast routing tree on application layer via an encoding-free non-dominated sorting genetic algorithm"],"prefix":"10.1007","volume":"50","author":[{"given":"Qing","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rongjun","family":"Tang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haipeng","family":"Ren","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yan","family":"Pei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,9,6]]},"reference":[{"key":"1547_CR1","doi-asserted-by":"crossref","unstructured":"Deering SE (Aug. 1988) Multicast routing in internetworks and extended LANs. ACM Symposium proceedings on Communications architectures and protocols:55\u201364","DOI":"10.1145\/52325.52331"},{"key":"1547_CR2","doi-asserted-by":"crossref","unstructured":"Deering SE (1989) Host extensions for IP multicast. Ietf Rfc Sri Network Information","DOI":"10.17487\/rfc1112"},{"key":"1547_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.comcom.2015.05.016","volume":"70","author":"JH Wang","year":"2015","unstructured":"Wang JH, Cai J, Lu J, Yin K, Yang J (Oct. 2015) Solving multicast problem in cloud networks using overlay routing. Comput Commun 70:1\u201314","journal-title":"Comput Commun"},{"key":"1547_CR4","doi-asserted-by":"crossref","unstructured":"Qing Liu, Tomohiro Odaka, Jousuke Kuroiwa, et al., \u201cAn artificial fish swarm algorithm for the multicast routing problem,\u201d IEICE Trans Commun, vol.E97-B, no.5, pp.996\u20131011, May. 2014, E97.B","DOI":"10.1587\/transcom.E97.B.996"},{"key":"1547_CR5","doi-asserted-by":"crossref","unstructured":"Matsuura H (Nov. 2016) Multi-agent Steiner tree algorithm based on branch-based multicast. IEICE Trans Inf Syst, vol.E99-D E99.D(11):2745\u20132758","DOI":"10.1587\/transinf.2015EDP7417"},{"key":"1547_CR6","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/j.comcom.2017.01.018","volume":"103","author":"D-R Din","year":"2017","unstructured":"Din D-R, Lien C-Y (May. 2017) Delay-constrained survivable multicast routing problem on WDM networks for node failure case. Comput Commun 103:165\u2013192","journal-title":"Comput Commun"},{"key":"1547_CR7","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1016\/j.ins.2013.03.006","volume":"238","author":"M Kim","year":"2013","unstructured":"Kim M, Choo H, Mutka MW, Lim H-J, Park K (Jul. 2013) On QoS multicast routing algorithms using k-minimum Steiner trees. Inf Sci 238:190\u2013204","journal-title":"Inf Sci"},{"issue":"1","key":"1547_CR8","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1109\/65.819174","volume":"14","author":"C. Diot","year":"2000","unstructured":"C. Diot, B.N. Levine, B. Lyles, H. Kassan, D. Balensiefen, \u201cDeployment issues for the IP multicast service and architecture,\u201d IEEE networks spec. Issue multicasting, vol.14, issue.1, pp.78\u201388, Jan.\/Feb. 2000, 14","journal-title":"IEEE Network"},{"key":"1547_CR9","doi-asserted-by":"crossref","unstructured":"C.K. Yeo, B.S. Lee, M.H. Er, \u201cA survey of application level multicast techniques,\u201d Comput Commun, vol.27, pp.1547\u20131568, Sept. 2004","DOI":"10.1016\/j.comcom.2004.04.003"},{"issue":"9","key":"1547_CR10","doi-asserted-by":"publisher","first-page":"1480","DOI":"10.1016\/j.comcom.2005.09.015","volume":"29","author":"H Song","year":"2006","unstructured":"Song H, Lee DS, Oh HR (May. 2006) Application layer multicast tree for real-time media delivery. Comput Commun 29(9):1480\u20131491","journal-title":"Comput Commun"},{"key":"1547_CR11","doi-asserted-by":"crossref","unstructured":"Y. Chu, S.G. Rao, S. Seshan, H. Zhang, \u201cA case for end system multicast,\u201d IEEE J Selected Areas in Communications, vol.20, no.8, pp. 1456\u20131471, Sept. 2006","DOI":"10.1109\/JSAC.2002.803066"},{"key":"1547_CR12","unstructured":"D. Pendarakis, S. Shi, D. Verma, M. Waldvogel, \u201cALMI: an application level multicast infrastructure,\u201d in Proc. 3rd Usenix symposium on internet technologies and systems, San Francisco, USA, Mar. 2001"},{"key":"1547_CR13","doi-asserted-by":"crossref","unstructured":"K. Sripanidkulchai, A. Ganjam, B. Maggs, H. Zhang, \u201cThe feasibility of supporting large-scale live streaming applications with dynamic application end-points,\u201d in Proc ACM SIGCOMM Conf Applications, Technologies, Architectures and Protocols for Computer Communication, Portland, USA, Aug 2004, pp.107\u2013120","DOI":"10.1145\/1030194.1015480"},{"key":"1547_CR14","doi-asserted-by":"crossref","unstructured":"Chawathe Y, McCanne S, Brewer EA (2000) RMX: reliable multicast for heterogeneous networks. Proc IEEE INFOCOM, Tel Aviv, Israel, Mar:795\u2013804","DOI":"10.1109\/INFCOM.2000.832254"},{"key":"1547_CR15","unstructured":"S. Shi, J.S. Turner, \u201cRouting in overlay multicast networks,\u201d in Proc. IEEE INFORCOM, New York, USA, Jun. 2001, pp.1200\u20131208"},{"key":"1547_CR16","unstructured":"J. Jannotti, D.K. Gifford, K.L. Johnson, M.F. Kaashoek, et al., \u201cOvercast: reliable multicasting with an overlay network,\u201d in Proc. 4th Conf. Symposium on operating systems design and implementation, San Diego, USA, Oct. 2000"},{"key":"1547_CR17","doi-asserted-by":"crossref","unstructured":"Li Lao, Jun-Hong Cui, Mario Gerla, Dario Maggiorini, \u201cA comparative study of multicast protocols: top, bottom, or in the middle?\u201d in Proc. IEEE INFOCOM, Miami USA, Mar. 2005, pp.2809\u20132814","DOI":"10.1109\/INFOCOM.2006.344"},{"key":"1547_CR18","unstructured":"Su J, Cao J, Zhang B (Mar. 2009) A survey of the research on ALM stability enhancement. Chinese J Computers 32(3):576\u2013590 (in Chinese)"},{"key":"1547_CR19","doi-asserted-by":"crossref","unstructured":"Castro M, Druschel P, Kermarrec A M, et al., \u201cSplitStream: high-bandwidth multicast in cooperative environments,\u201d in Proc. 19th ACM symposium on operating systems principles, New York, USA, Oct. 2003, pp.298\u2013313","DOI":"10.1145\/1165389.945474"},{"key":"1547_CR20","doi-asserted-by":"crossref","unstructured":"Kostic D, Rodriguez A, Albrecht J, Vahdat A, \u201cBullet: high bandwidth data dissemination using an overlay mesh,\u201d in Proc. 19th ACM symposium on operating system principles, New York, USA, Oct. 2003, pp.282\u2013297","DOI":"10.1145\/1165389.945473"},{"key":"1547_CR21","doi-asserted-by":"crossref","unstructured":"Padmanabhan VN, Wang H J, Chou P A, Sripandidkulchai, \u201cdistributing streaming media content using cooperative networking,\u201d in Proc. 12th ACM NOSSDAV, Miami, USA, May. 2002, pp. 177\u2013186","DOI":"10.1145\/507670.507695"},{"key":"1547_CR22","doi-asserted-by":"crossref","unstructured":"Cao J, Su J, Wu C (2008) Modeling and analyzing the instantaneous stability for application layer multicast. Proc IEEE Asia-Pacific Services Computing Conference, Yilan, Taiwan, Dec:217\u2013224","DOI":"10.1109\/APSCC.2008.22"},{"issue":"12","key":"1547_CR23","doi-asserted-by":"publisher","first-page":"3151","DOI":"10.3724\/SP.J.1001.2010.03650","volume":"21","author":"Ji-Jun CAO","year":"2011","unstructured":"Cao J, Su J (Dec. 2010) Delay-bounded and high stability spanning tree algorithm for application layer multicast. J Software 21(12):3151\u20133164 (in Chinese)","journal-title":"Journal of Software"},{"issue":"12","key":"1547_CR24","first-page":"2559","volume":"49","author":"H Lin","year":"2012","unstructured":"Lin H, Deshun L, Yinglu T (2012) Algorithms of spanning tree based on the stability and contribution link of nodes for application layer multicast. J Computer Research and Development 49(12):2559\u20132567 (in Chinese)","journal-title":"J Computer Research and Development"},{"issue":"3","key":"1547_CR25","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1109\/JCN.2016.000060","volume":"18","author":"S Mercan","year":"2016","unstructured":"Mercan S, Yuksel M (2016) Virtual direction multicast: an efficient overlay tree construction algorithm. J Commun Netw 18(3):446\u2013459","journal-title":"J Commun Netw"},{"issue":"2","key":"1547_CR26","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb K, Pratap A, Agarwal S, Meyarivan T (Apr. 2002) A fast and elitist multi-objective genetic algorithm: NSGA-II. IEEE Trans on Evolutionary Computation 6(2):182\u2013197","journal-title":"IEEE Trans on Evolutionary Computation"},{"key":"1547_CR27","doi-asserted-by":"crossref","unstructured":"E.W. Dijkstra. \u201cA note on two problems in connexion with graphs,\u201d Numer Math, vol.1, no.1, pp.269\u2013271, Dec. 1959","DOI":"10.1007\/BF01386390"},{"key":"1547_CR28","unstructured":"S. Kunwadee, B. Maggs, H. Zhang, \u201cAn analysis of live streaming workloads on the internet,\u201d in Proc. the 4th ACM SIGCOMM Conf. On internet measurement, Taormina, Italy, Oct. 2004, vol.282, pp.41\u201354"},{"issue":"1","key":"1547_CR29","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1109\/TNET.2005.863709","volume":"14","author":"E Veloso","year":"2006","unstructured":"Veloso E, Almeida V, Meira W, Bestavros JA, Jin S (Feb. 2006) A hierarchical characterization of a live streaming media workload. IEEE\/ACM Trans on Networking 14(1):133\u2013146","journal-title":"IEEE\/ACM Trans on Networking"},{"issue":"3","key":"1547_CR30","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1002\/net.3230010302","volume":"1","author":"SE Drefus","year":"1971","unstructured":"Drefus SE, Wagner RA (1971) The Steiner problem in graphs. Networks 1(3):195\u2013207","journal-title":"Networks"},{"key":"1547_CR31","unstructured":"M.R. Garey, D.S. Johnson, Computer and intractability: A guide to the theory of NP-completeness. W.H. Freeman & Co. New York, NY, USA\u00a9 1990. ISBN:0716710455"},{"key":"1547_CR32","unstructured":"Plesn\u00edk J (1991) Worst-case relative performances of heuristics for the Steiner problem in graphs. Acta Math Univ Comenianae, vol. LX (2):269\u2013284"},{"issue":"2","key":"1547_CR33","doi-asserted-by":"publisher","first-page":"271","DOI":"10.3724\/SP.J.1001.2009.00271","volume":"20","author":"Mao-Guo GONG","year":"2009","unstructured":"Gong MG, Jiao LC, Yang DD, Ma WP, \u201cResearch on evolutionary multi-objective optimization algorithms,\u201d J Software, vol.20, no.2, pp.271\u2013289, Feb. 2009. (in Chinese)","journal-title":"Journal of Software"},{"issue":"4","key":"1547_CR34","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1109\/4235.738982","volume":"2","author":"Y Leung","year":"1998","unstructured":"Leung Y, Li G, Xu ZB (Nov. 1998) A genetic algorithm for multiple destination routing problems. IEEE Trans on Evolutionary Computation 2(4):150\u2013161","journal-title":"IEEE Trans on Evolutionary Computation"},{"key":"1547_CR35","unstructured":"Zhong WL, Huang J, Zhang J (2008) A novel particle swarm optimization for the Steiner tree problem in graphs. IEEE World Congress on Evolutionary Computation, Hong Kong, China, Jun:2460\u20132467"},{"key":"1547_CR36","doi-asserted-by":"crossref","unstructured":"R.C. Prim, \u201cShortest connection networks and some generalizations,\u201d Bell Labs Technical J, vol.36, no.6, pp.1389\u20131401, Nov. 1957","DOI":"10.1002\/j.1538-7305.1957.tb01515.x"},{"key":"1547_CR37","unstructured":"Douglas B. West. Introduction to graph theory. 2nd ed. Longman, 2001"},{"issue":"1","key":"1547_CR38","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1090\/S0002-9939-1956-0078686-7","volume":"7","author":"JB Kruskal","year":"1956","unstructured":"Kruskal JB (1956) On the shortest spanning subtree of a graph and the traveling salesman problem. Proc Am Math Soc 7(1):48\u201350","journal-title":"Proc Am Math Soc"},{"key":"1547_CR39","unstructured":"Xuan Ma, Rongjun Tang, Jingyan Kang, etc., \u201cOptimizing application layer multicast routing via artificial fish swarm algorithm.\u201d International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery (ICNC-FSKD), 2016"},{"key":"1547_CR40","doi-asserted-by":"crossref","unstructured":"Coello C.A.C., Sierra M.R., \u201cA study of the parallelization of a coevolutionary multiobjective evolutionary algorithm,\u201d in proc. 3rd Mexican international conference on artificial intelligence, LNCS vol. 2972, pp 688\u2013697, Apr. 2004","DOI":"10.1007\/978-3-540-24694-7_71"},{"issue":"2","key":"1547_CR41","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1109\/TEVC.2013.2258025","volume":"18","author":"Z He","year":"2014","unstructured":"He Z, Yen GG, Zhang J (Apr. 2014) Fuzzy-based Pareto optimality for many-objective evolutionary algorithms. IEEE Trans on Evolutionary Computation 18(2):269\u2013285","journal-title":"IEEE Trans on Evolutionary Computation"},{"key":"1547_CR42","unstructured":"D. Pendarakis, S. Shi, D. Verma, M. Waldvogel, \u201cALMI: an application level multicast infrastructure,\u201d in Proc. 3rd Conf. USENIX symposium on internet technologies and systems, San Francisco, USA, Mar. 2001"},{"key":"1547_CR43","doi-asserted-by":"publisher","first-page":"610","DOI":"10.1007\/3-540-47728-4_60","volume-title":"Networking \u2014 ICN 2001","author":"Vincent Roca","year":"2001","unstructured":"Vincent Roca, Ayman El-Sayed, \u201cA host-based multicast (HBM) solution for group communications,\u201d in Proc 1st Int Conf Networking-Part 1, Colmar, France, Jul. 2001, pp. 610\u2013619"},{"key":"1547_CR44","unstructured":"John Koza, \u201cGenetic programming: on the programming of computers by means of natural selection.\u201d, MIT Press, 1992"},{"key":"1547_CR45","unstructured":"Kennedy J, Eberhart R. \u201cParticle swarm optimization.\u201d processing of the 1995 IEEE international conference on neural networks. Piscataway: IEEE, pp. 1942\u20131948, 1995"},{"key":"1547_CR46","unstructured":"Deb K, \u201cMulti-objective optimization using evolutionary algorithms,\u201d Chichester: John Wiley & Sons, 2001"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-019-01547-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10489-019-01547-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-019-01547-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,4]],"date-time":"2020-09-04T23:20:14Z","timestamp":1599261614000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10489-019-01547-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9,6]]},"references-count":46,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,3]]}},"alternative-id":["1547"],"URL":"https:\/\/doi.org\/10.1007\/s10489-019-01547-9","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,9,6]]},"assertion":[{"value":"6 September 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}