{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,20]],"date-time":"2026-04-20T04:04:15Z","timestamp":1776657855217,"version":"3.51.2"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2016,3,29]],"date-time":"2016-03-29T00:00:00Z","timestamp":1459209600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"National High Technology Research and De-velopment Program of China","award":["2013AA013801"],"award-info":[{"award-number":["2013AA013801"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61402379"],"award-info":[{"award-number":["61402379"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61403315"],"award-info":[{"award-number":["61403315"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Natural Science Founda-tion of Chongqing","award":["cstc2013jcyjA40022"],"award-info":[{"award-number":["cstc2013jcyjA40022"]}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"crossref","award":["XDJK2016A008"],"award-info":[{"award-number":["XDJK2016A008"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Nat Comput"],"published-print":{"date-parts":[[2017,3]]},"DOI":"10.1007\/s11047-016-9545-6","type":"journal-article","created":{"date-parts":[[2016,3,29]],"date-time":"2016-03-29T08:30:33Z","timestamp":1459240233000},"page":"85-98","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["A new genetic algorithm based on modified Physarum network model for bandwidth-delay constrained least-cost multicast routing"],"prefix":"10.1007","volume":"16","author":[{"given":"Mingxin","family":"Liang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chao","family":"Gao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zili","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,3,29]]},"reference":[{"key":"9545_CR1","unstructured":"Abbass HA (2001) A single queen single worker honey-bees approach to 3-SAT. In: The genetic and evolutionary computation conference, pp 807\u2013814"},{"issue":"1","key":"9545_CR2","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1142\/S0129626409000109","volume":"19","author":"A Adamatzky","year":"2009","unstructured":"Adamatzky A (2009) Developing proximity graphs by Physarum polycephalum: does the plasmodium follow the Toussaint hierarchy? Parallel Process Lett 19(1):105\u2013127","journal-title":"Parallel Process Lett"},{"key":"9545_CR3","doi-asserted-by":"crossref","unstructured":"Chow CH (1991) On multicast path finding algorithms. In: 10th Annual joint conference of the IEEE computer and communications societies, pp 1274\u20131283","DOI":"10.1109\/INFCOM.1991.147651"},{"issue":"5","key":"9545_CR4","doi-asserted-by":"crossref","first-page":"516","DOI":"10.1016\/j.jpdc.2007.01.007","volume":"67","author":"TL Huang","year":"2007","unstructured":"Huang TL, Lee DT (2007) A distributed multicast routing algorithm for real-time applications in wide area networks. J Parallel Distrib Comput 67(5):516\u2013530","journal-title":"J Parallel Distrib Comput"},{"issue":"6","key":"9545_CR5","first-page":"885","volume":"16","author":"RH Hwang","year":"2000","unstructured":"Hwang RH, Do WY, Yang SC (2000) Multicast routing based on genetic algorithms. J Inf Sci Eng 16(6):885\u2013901","journal-title":"J Inf Sci Eng"},{"issue":"2","key":"9545_CR6","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1007\/s00500-014-1269-x","volume":"19","author":"P Karthikeyan","year":"2015","unstructured":"Karthikeyan P, Baskar S (2015) Genetic algorithm with ensemble of immigrant strategies for multicast routing in ad hoc networks. Soft Comput 19(2):489\u2013498","journal-title":"Soft Comput"},{"key":"9545_CR7","doi-asserted-by":"crossref","unstructured":"Liu YX, Gao C, Wu YH, Tao L, Lu YX, Zhang ZL (2014) A Physarum-inspired multi-agent system to solve maze. In: The fifth international conference on Swarm intelligence, pp 424\u2013430","DOI":"10.1007\/978-3-319-11857-4_48"},{"key":"9545_CR8","doi-asserted-by":"crossref","unstructured":"Liu YX, Zhang ZL, Gao C, Wu YH, Qian T (2013) A Physarum network evolution model based on IBTM. In: The fourth international conference on Swarm intelligence, pp 19\u201326","DOI":"10.1007\/978-3-642-38715-9_3"},{"issue":"3","key":"9545_CR9","first-page":"819","volume":"64","author":"L Liu","year":"2015","unstructured":"Liu L, Song Y, Ma H, Zhang X (2015) Physarum optimization: a biology-inspired algorithm for minimal exposure path problem in wireless sensor networks. IEEE Trans Comput 64(3):819\u2013832","journal-title":"IEEE Trans Comput"},{"issue":"1","key":"9545_CR10","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1109\/LCOMM.2012.112012.121467","volume":"17","author":"T Lu","year":"2013","unstructured":"Lu T, Zhu J (2013) Genetic algorithm for energy-efficient QoS multicast routing. Commun Lett 17(1):31\u201334","journal-title":"Commun Lett"},{"issue":"3","key":"9545_CR11","first-page":"83","volume":"11","author":"TM Mahmoud","year":"2014","unstructured":"Mahmoud TM, El Nashar AI, Eman M (2014) An efficient genetic algorithm based clonal selection and hill climbing for solving QoS multicast routing problem. Int J Comput Sci Issues. 11(3):83\u201388","journal-title":"Int J Comput Sci Issues."},{"issue":"6803","key":"9545_CR12","doi-asserted-by":"crossref","first-page":"470","DOI":"10.1038\/35035159","volume":"407","author":"T Nakagaki","year":"2000","unstructured":"Nakagaki T, Yamada H, T\u00f3th \u00c1 (2000) Intelligence: Maze-solving by an amoeboid organism. Nature 407(6803):470\u2013470","journal-title":"Nature"},{"issue":"8","key":"9545_CR13","doi-asserted-by":"crossref","first-page":"1953","DOI":"10.1016\/j.cor.2003.12.007","volume":"32","author":"CA Oliveira","year":"2005","unstructured":"Oliveira CA, Pardalos PM (2005) A survey of combinatorial optimization problems in multicast routing. Comput Oper Res 32(8):1953\u20131981","journal-title":"Comput Oper Res"},{"key":"9545_CR14","unstructured":"Peng B, Li L (2013) Combination of genetic algorithm and ant colony optimization for QoS multicast routing. In: 14th International symposium on advanced intelligent systems, pp 49\u201356"},{"key":"9545_CR15","doi-asserted-by":"crossref","unstructured":"Pham DT, Kog E, Ghanbarzadeh A, Otri S, Rahim S, Zaidi M (2006) The bees algorithm\u2014a novel tool for complex optimisation problems. In: The 2nd international virtual conference on intelligent production machines and systems, p 454","DOI":"10.1016\/B978-008045157-2\/50081-X"},{"issue":"4","key":"9545_CR16","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1145\/1151659.1159917","volume":"36","author":"S Ratnasamy","year":"2006","unstructured":"Ratnasamy S, Ermolinskiy A, Shenker S (2006) Revisiting IP multicast. ACM SIGCOMM Comput Commun Rev 36(4):15\u201316","journal-title":"ACM SIGCOMM Comput Commun Rev"},{"key":"9545_CR17","doi-asserted-by":"crossref","unstructured":"Salama HF (1996) Multicast routing for real-time communication of high-speed networks. Ph.D. Thesis. North Carolina State University","DOI":"10.1007\/978-0-387-34949-7_3"},{"issue":"3","key":"9545_CR18","doi-asserted-by":"crossref","first-page":"32","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(3):32\u201345","journal-title":"IEEE J Sel Areas Commun"},{"issue":"3","key":"9545_CR19","doi-asserted-by":"crossref","first-page":"981","DOI":"10.1016\/j.jnca.2012.01.023","volume":"36","author":"B Salim","year":"2013","unstructured":"Salim B, Abdelhamid M (2013) Bee life-based multi constraints multicast routing optimization for vehicular ad hoc networks. J Netw Comput Appl 36(3):981\u2013991","journal-title":"J Netw Comput Appl"},{"issue":"2","key":"9545_CR20","doi-asserted-by":"crossref","first-page":"168","DOI":"10.3923\/itj.2004.168.175","volume":"3","author":"S Sesay","year":"2004","unstructured":"Sesay S, Yang ZK, He JH (2004) A survey on mobile ad hoc wireless network. Inf Technol J 3(2):168\u2013175","journal-title":"Inf Technol J"},{"issue":"4","key":"9545_CR21","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1016\/j.jtbi.2006.07.015","volume":"244","author":"A Tero","year":"2007","unstructured":"Tero A, Kobayashi R, Nakagaki T (2007) A mathematical model for adaptive transport network in path finding by true slime mold. J Theor Biol 244(4):553\u2013564","journal-title":"J Theor Biol"},{"issue":"5964","key":"9545_CR22","first-page":"439","volume":"327","author":"A Tero","year":"2010","unstructured":"Tero A, Takagi S, Saigusa T, Ito K, Bebber DP, Fricker MD, Yumiki K, Kobayashi R, Nakagaki T (2010) Rules for biologically inspired adaptive network design. Sci Signal 327(5964):439","journal-title":"Sci Signal"},{"issue":"7","key":"9545_CR23","first-page":"685","volume":"24","author":"ZY Wang","year":"2001","unstructured":"Wang ZY, Shi BX, Zhao E (2001) Bandwidth-delay-constrained least-cost multicast routing based on heuristic genetic algorithm. Comput Commun 24(7):685\u2013692","journal-title":"Comput Commun"},{"key":"9545_CR24","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1038\/srep00369","volume":"2","author":"Z Wang","year":"2012","unstructured":"Wang Z, Szolnoki A, Perc M (2012) If players are sparse social dilemmas are too: importance of percolation for evolution of cooperation. Sci Rep 2:369","journal-title":"Sci Rep"},{"issue":"7","key":"9545_CR25","doi-asserted-by":"crossref","first-page":"1228","DOI":"10.1109\/49.536364","volume":"14","author":"Z Wang","year":"1996","unstructured":"Wang Z, Crowcroft J (1996) Quality-of-service routing for supporting multimedia applications. IEEE J Sel Areas Commun 14(7):1228\u20131234","journal-title":"IEEE J Sel Areas Commun"},{"issue":"3","key":"9545_CR26","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/j.biosystems.2011.05.001","volume":"105","author":"S Watanabe","year":"2011","unstructured":"Watanabe S, Tero A, Takamatsu A, Nakagaki T (2011) Traffic optimization in railroad networks using an algorithm mimicking an amoeba-like organism. Physarum plasmodium. Biosystems 105(3):225\u2013232","journal-title":"Biosystems"},{"issue":"11","key":"9545_CR27","doi-asserted-by":"crossref","first-page":"2238","DOI":"10.1016\/j.mcm.2010.10.008","volume":"53","author":"Y Yen","year":"2011","unstructured":"Yen Y, Chao H, Chang R, Vasilakos A (2011) Flooding-limited and multi-constrained QoS multicast routing based on the genetic algroithms. Math Comput Model 53(11):2238\u20132250","journal-title":"Math Comput Model"},{"key":"9545_CR28","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/j.jnca.2013.08.003","volume":"40","author":"P Yin","year":"2014","unstructured":"Yin P, Chang R, Chao C, Chu Y (2014) Niched ant colony optimization with colony guides for QoS multicast routing. J Netw Comput Appl 40:61\u201372","journal-title":"J Netw Comput Appl"},{"issue":"6","key":"9545_CR29","doi-asserted-by":"crossref","first-page":"812","DOI":"10.1109\/TEVC.2010.2051444","volume":"15","author":"Z Yu","year":"2011","unstructured":"Yu Z, Wong H, Wang D, Wei M (2011) Neighborhood knowledge-based evolutionary algorithm for multiobjective optimization problems. IEEE Trans Evol Comput 15(6):812\u2013831","journal-title":"IEEE Trans Evol Comput"},{"issue":"4","key":"9545_CR30","doi-asserted-by":"crossref","first-page":"727","DOI":"10.1109\/TCBB.2014.2315996","volume":"11","author":"Z Yu","year":"2014","unstructured":"Yu Z, Chen H, You J, Wong H, Liu J, Li L, Han G (2014) Double selection based semi-supervised clustering ensemble for tumor clustering from gene expression profiles. IEEE\/ACM Trans Comput Biol Bioinfor 11(4):727\u2013740","journal-title":"IEEE\/ACM Trans Comput Biol Bioinfor"},{"issue":"3","key":"9545_CR31","doi-asserted-by":"crossref","first-page":"568","DOI":"10.1109\/TCBB.2014.2368981","volume":"12","author":"Z Yu","year":"2015","unstructured":"Yu Z, Chen H, You J, Wong H, Liu J, Han G, Li L (2015) Adaptive fuzzy consensus clustering framework for clustering analysis of cancer data. IEEE\/ACM Trans Comput Biol Bioinform 12(3):568\u2013582","journal-title":"IEEE\/ACM Trans Comput Biol Bioinform"},{"issue":"1","key":"9545_CR32","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/j.comcom.2008.09.023","volume":"32","author":"L Zhang","year":"2009","unstructured":"Zhang L, Cai L, Li M, Wang F (2009) A method for least-cost QoS multicast routing based on genetic simulated annealing algorithm. Comput Commun 32(1):105\u2013110","journal-title":"Comput Commun"},{"issue":"3","key":"9545_CR33","doi-asserted-by":"crossref","first-page":"036006","DOI":"10.1088\/1748-3182\/9\/3\/036006","volume":"9","author":"ZL Zhang","year":"2014","unstructured":"Zhang ZL, Gao C, Liu YX, Qian T (2014) A universal optimization strategy for ant colony optimization algorithms based on the Physarum-inspired mathematical model. Bioinspir Biomim 9(3):036006","journal-title":"Bioinspir Biomim"}],"container-title":["Natural Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-016-9545-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11047-016-9545-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-016-9545-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-016-9545-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,16]],"date-time":"2020-05-16T17:20:12Z","timestamp":1589649612000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11047-016-9545-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,3,29]]},"references-count":33,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,3]]}},"alternative-id":["9545"],"URL":"https:\/\/doi.org\/10.1007\/s11047-016-9545-6","relation":{},"ISSN":["1567-7818","1572-9796"],"issn-type":[{"value":"1567-7818","type":"print"},{"value":"1572-9796","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,3,29]]}}}