{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,30]],"date-time":"2026-01-30T14:57:31Z","timestamp":1769785051208,"version":"3.49.0"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2011,5,17]],"date-time":"2011-05-17T00:00:00Z","timestamp":1305590400000},"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,6]]},"DOI":"10.1007\/s10489-011-0298-8","type":"journal-article","created":{"date-parts":[[2011,5,16]],"date-time":"2011-05-16T00:12:13Z","timestamp":1305504733000},"page":"809-823","source":"Crossref","is-referenced-by-count":29,"title":["A compact genetic algorithm for the network coding based resource minimization problem"],"prefix":"10.1007","volume":"36","author":[{"given":"Huanlai","family":"Xing","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rong","family":"Qu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,5,17]]},"reference":[{"issue":"4","key":"298_CR1","doi-asserted-by":"crossref","first-page":"1204","DOI":"10.1109\/18.850663","volume":"46","author":"R Ahlswede","year":"2000","unstructured":"Ahlswede R, Cai N, Li SYR, Yeung RW (2000) Network information flow. IEEE Trans Inf Theory 46(4):1204\u20131216","journal-title":"IEEE Trans Inf Theory"},{"issue":"2","key":"298_CR2","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1109\/TIT.2002.807285","volume":"49","author":"SYR Li","year":"2003","unstructured":"Li SYR, Yeung RW, Cai N (2003) Linear network coding. IEEE Trans Inf Theory 49(2):371\u2013381","journal-title":"IEEE Trans Inf Theory"},{"issue":"5","key":"298_CR3","doi-asserted-by":"crossref","first-page":"782","DOI":"10.1109\/TNET.2003.818197","volume":"11","author":"R Koetter","year":"2003","unstructured":"Koetter R, M\u00e9dard M (2003) An algebraic approach to network coding. IEEE\/ACM Trans Netw 11(5):782\u2013795","journal-title":"IEEE\/ACM Trans Netw"},{"issue":"11","key":"298_CR4","doi-asserted-by":"crossref","first-page":"1906","DOI":"10.1109\/TCOMM.2005.857148","volume":"53","author":"Y Wu","year":"2005","unstructured":"Wu Y, Chou PA, Kung SY (2005) Minimum-energy multicast in mobile ad hoc networks using network coding. IEEE Trans Commun 53(11):1906\u20131918","journal-title":"IEEE Trans Commun"},{"issue":"5","key":"298_CR5","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1109\/MSP.2007.904818","volume":"24","author":"PA Chou","year":"2007","unstructured":"Chou PA, Wu Y (2007) Network coding for the internet and wireless networks. IEEE Signal Process Mag 24(5):77\u201385","journal-title":"IEEE Signal Process Mag"},{"key":"298_CR6","volume-title":"Proceedings of IEEE international symposium on information theory (ISIT\u201902)","author":"N Cai","year":"2002","unstructured":"Cai N, Yeung RW (2002) Secure network coding. In: Proceedings of IEEE international symposium on information theory (ISIT\u201902)"},{"key":"298_CR7","volume-title":"Proceedings of IEEE globecom","author":"AE Kamal","year":"2006","unstructured":"Kamal AE (2006) 1+N protection in optical mesh networks using network coding on p-cycles. In: Proceedings of IEEE globecom, San Francisco"},{"issue":"12","key":"298_CR8","doi-asserted-by":"crossref","first-page":"1105","DOI":"10.1016\/j.aeue.2009.11.012","volume":"64","author":"H Xing","year":"2010","unstructured":"Xing H, Ji Y, Bai L, Sun Y (2010) An improved quantum-inspired evolutionary algorithm for coding resource optimization based network coding multicast scheme. AE\u00dc, Int J Electron Commun 64(12):1105\u20131113","journal-title":"AE\u00dc, Int J Electron Commun"},{"key":"298_CR9","volume-title":"Proceedings of second workshop on network coding, theory, and applications (NetCod2006)","author":"M Kim","year":"2006","unstructured":"Kim M, Ahn CW, M\u00e9dard M, Effros M (2006) On minimizing network coding resources: An evolutionary approach. In: Proceedings of second workshop on network coding, theory, and applications (NetCod2006), Boston"},{"key":"298_CR10","doi-asserted-by":"crossref","first-page":"1991","DOI":"10.1109\/INFCOM.2007.231","volume-title":"Proceedings of 26th IEEE international conference on computer communications (INFOCOM2007)","author":"M Kim","year":"2007","unstructured":"Kim M, M\u00e9dard M, Aggarwal V, Reilly VO, Kim W, Ahn CW, Effros M (2007) Evolutionary approaches to minimizing network coding resources. In: Proceedings of 26th IEEE international conference on computer communications (INFOCOM2007), Anchorage, pp 1991\u20131999"},{"key":"298_CR11","series-title":"LNCS","first-page":"21","volume-title":"Proceedings of evoworkshops 2007","author":"M Kim","year":"2007","unstructured":"Kim M, Aggarwal V, Reilly VO, M\u00e9dard M, Kim W (2007) Genetic representations for evolutionary optimization of network coding. In: Proceedings of evoworkshops 2007. LNCS, Valencia, vol 448, pp 21\u201331"},{"issue":"6","key":"298_CR12","doi-asserted-by":"crossref","first-page":"2386","DOI":"10.1109\/TIT.2006.874434","volume":"52","author":"M Langberg","year":"2006","unstructured":"Langberg M, Sprintson A, Bruck J (2006) The encoding complexity of network coding. IEEE Trans Inf Theory 52(6):2386\u20132397","journal-title":"IEEE Trans Inf Theory"},{"issue":"8","key":"298_CR13","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"},{"key":"298_CR14","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":"298_CR15","doi-asserted-by":"crossref","unstructured":"Xu Y, Qu R (2010) A hybrid scatter search meta-heuristic for delay-constrained multicast routing problems. Appl Intell. doi: 10.1007\/s10489-010-0256-x","DOI":"10.1007\/s10489-010-0256-x"},{"key":"298_CR16","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1007\/s10489-008-0148-5","volume":"32","author":"AFR Ara\u00fajo","year":"2010","unstructured":"Ara\u00fajo AFR, Garrozi C (2010) MulRoGA: a multicast routing genetic algorithm approach considering multiple objectives. Appl Intell 32:330\u2013345. doi: 10.1007\/s10489-008-0148-5","journal-title":"Appl Intell"},{"key":"298_CR17","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1007\/s10489-006-0014-2","volume":"27","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 27:197\u2013215 doi: 10.1007\/s10489-006-0014-2","journal-title":"Appl Intell"},{"issue":"3","key":"298_CR18","doi-asserted-by":"crossref","first-page":"829","DOI":"10.1109\/TIT.2005.864435","volume":"52","author":"C Fragouli","year":"2006","unstructured":"Fragouli C, Soljanin E (2006) Information flow decomposition for network coding. IEEE Trans Inf Theory 52(3):829\u2013848","journal-title":"IEEE Trans Inf Theory"},{"key":"298_CR19","first-page":"51","volume-title":"Proceedings of evoapplications 2011","author":"H Xing","year":"2011","unstructured":"Xing H, Qu R (2011) A population based incremental learning for delay constrained network coding resource minimization. In: Proceedings of evoapplications 2011, Torino, Italy, pp 51\u201360"},{"key":"298_CR20","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1023\/A:1013500812258","volume":"21","author":"M Pelikan","year":"2002","unstructured":"Pelikan M, Goldberg DE, Lobo FG (2002) A survey of optimization by building and using probabilistic models. Comput Optim Appl 21:5\u201320","journal-title":"Comput Optim Appl"},{"key":"298_CR21","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1023\/A:1008230929638","volume":"8","author":"S Baluja","year":"1998","unstructured":"Baluja S, Simon D (1998) Evolution-based methods for selecting point data for object localization: applications to computer-assisted surgery. Appl Intell 8:7\u201319","journal-title":"Appl Intell"},{"key":"298_CR22","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1023\/A:1008243013521","volume":"9","author":"R Sukthankar","year":"1998","unstructured":"Sukthankar R, Baluja S, Hancock J (1998) Multiple adaptive agents for tactical driving. Appl Intell 9:7\u201323","journal-title":"Appl Intell"},{"issue":"4","key":"298_CR23","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1109\/4235.797971","volume":"3","author":"GR Harik","year":"1999","unstructured":"Harik GR, Lobo FG, Goldberg DE (1999) The compact genetic algorithm. IEEE Trans Evol Comput 3(4):287\u2013297","journal-title":"IEEE Trans Evol Comput"},{"issue":"2","key":"298_CR24","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1109\/TEVC.2003.820662","volume":"8","author":"JC Gallagher","year":"2004","unstructured":"Gallagher JC, Vigraham S, Kramer G (2004) A family of compact genetic algorithms for intrinsic evolvable hardware. IEEE Trans Evol Comput 8(2):111\u2013126","journal-title":"IEEE Trans Evol Comput"},{"key":"298_CR25","first-page":"624","volume-title":"Proceedings of IEEE congress evolutionary computation","author":"C Aporntewan","year":"2001","unstructured":"Aporntewan C, Chongstitvatana P (2001) A hardware implementation of the compact genetic algorithm. In: Proceedings of IEEE congress evolutionary computation. pp 624\u2013629"},{"key":"298_CR26","first-page":"113","volume-title":"Proceedings of the 9th workshop on parallel and distributed processing, Mantova","author":"Hidalgo JI","year":"2001","unstructured":"JI Hidalgo, Baraglia R, Perego R, Lanchares J, Tirado F (2001) A parallel compact genetic algorithm for multi-FPGA partitioning. In: Proceedings of the 9th workshop on parallel and distributed processing, Mantova. pp 113\u2013120"},{"key":"298_CR27","first-page":"1109","volume-title":"Proceedings of the 4th international conference on intelligent computing (ICIC\u201908)","author":"RR Silva","year":"2008","unstructured":"Silva RR, Lopes HS, Erig Lima CR (2008) A compact genetic algorithm with elitism and mutation applied to image recognition. In: Proceedings of the 4th international conference on intelligent computing (ICIC\u201908). pp 1109\u20131116"},{"key":"298_CR28","doi-asserted-by":"crossref","unstructured":"Lin SF, Chang JW, Hsu YC (2010) A self-organization mining based hybrid evolution learning for TSK-type fuzzy model design. Appl Intell. doi: 10.1007\/s10489-010-0271-y","DOI":"10.1007\/s10489-010-0271-y"},{"issue":"4","key":"298_CR29","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1109\/TEVC.2003.814633","volume":"7","author":"CW Ahn","year":"2003","unstructured":"Ahn CW, Ramakrishna RS (2003) Elitism-based compact genetic algorithm. IEEE Trans Evol Comput 7(4):367\u2013385","journal-title":"IEEE Trans Evol Comput"},{"key":"298_CR30","unstructured":"Goldberg AV (1985) A new max-flow algorithm. MIT Technical report MIT\/LCS\/TM-291, Laboratory for Computer Science"},{"issue":"5","key":"298_CR31","doi-asserted-by":"crossref","first-page":"542","DOI":"10.1109\/TEVC.2007.913070","volume":"12","author":"S Yang","year":"2008","unstructured":"Yang S, Yao X (2008) Population-based incremental learning with associative memory for dynamic environments. IEEE Trans Evol Comput 12(5):542\u2013561","journal-title":"IEEE Trans Evol Comput"},{"issue":"11","key":"298_CR32","doi-asserted-by":"crossref","first-page":"815","DOI":"10.1007\/s00500-004-0422-3","volume":"9","author":"S Yang","year":"2005","unstructured":"Yang S, Yao X (2005) Experimental study on population-based incremental learning algorithms for dynamic optimization problems. Soft Comput 9(11):815\u2013834","journal-title":"Soft Comput"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-011-0298-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10489-011-0298-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-011-0298-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,10]],"date-time":"2019-06-10T16:12:08Z","timestamp":1560183128000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10489-011-0298-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,5,17]]},"references-count":32,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2012,6]]}},"alternative-id":["298"],"URL":"https:\/\/doi.org\/10.1007\/s10489-011-0298-8","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,5,17]]}}}