{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,30]],"date-time":"2026-01-30T23:05:21Z","timestamp":1769814321343,"version":"3.49.0"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2017,10,30]],"date-time":"2017-10-30T00:00:00Z","timestamp":1509321600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Comput & Applic"],"published-print":{"date-parts":[[2019,7]]},"DOI":"10.1007\/s00521-017-3252-9","type":"journal-article","created":{"date-parts":[[2017,10,30]],"date-time":"2017-10-30T07:19:11Z","timestamp":1509347951000},"page":"3057-3073","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":19,"title":["QoS multicast routing for wireless mesh network based on a modified binary bat algorithm"],"prefix":"10.1007","volume":"31","author":[{"given":"Yassine","family":"Meraihi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dalila","family":"Acheli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amar","family":"Ramdane-Cherif","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,10,30]]},"reference":[{"issue":"7","key":"3252_CR1","doi-asserted-by":"publisher","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":"6","key":"3252_CR2","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":"5","key":"3252_CR3","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/S0950-7051(03)00032-7","volume":"16","author":"AT Haghighat","year":"2003","unstructured":"Haghighat AT, Faez K, Dehghan M, Mowlaei A, Ghahremani Y (2003) GA-based heuristic algorithms for QoS based multicast routing. Knowl-Based Syst 16(5):305\u2013312","journal-title":"Knowl-Based Syst"},{"issue":"3","key":"3252_CR4","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1016\/j.pnsc.2007.11.006","volume":"18","author":"B Sun","year":"2008","unstructured":"Sun B, Pi S, Gui C, Zeng Y, Yan B, Wang W, Qin Q (2008) Multiple constraints QoS multicast routing optimization algorithm in MANET based on GA. Prog Nat Sci 18(3):331\u2013336","journal-title":"Prog Nat Sci"},{"issue":"11","key":"3252_CR5","doi-asserted-by":"publisher","first-page":"2238","DOI":"10.1016\/j.mcm.2010.10.008","volume":"53","author":"YS Yen","year":"2011","unstructured":"Yen YS, Chao HC, Chang RS, Vasilakos A (2011) Flooding-limited and multi-constrained QoS multicast routing based on the genetic algorithm for MANETs. Math Comput Modell 53(11):2238\u20132250","journal-title":"Math Comput Modell"},{"issue":"3","key":"3252_CR6","doi-asserted-by":"publisher","first-page":"1473","DOI":"10.1016\/j.eswa.2007.08.018","volume":"35","author":"SY Tseng","year":"2008","unstructured":"Tseng SY, Lin CC, Huang YM (2008) Ant colony-based algorithm for constructing broadcasting tree with degree and delay constraints. Expert Syst Appl 35(3):1473\u20131481","journal-title":"Expert Syst Appl"},{"issue":"9","key":"3252_CR7","doi-asserted-by":"publisher","first-page":"11787","DOI":"10.1016\/j.eswa.2011.03.065","volume":"38","author":"H Wang","year":"2011","unstructured":"Wang H, Xu H, Yi S, Shi Z (2011) A tree-growth based ant colony algorithm for QoS multicast routing problem. Expert Syst Appl 38(9):11787\u201311795","journal-title":"Expert Syst Appl"},{"issue":"3\u20134","key":"3252_CR8","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/s11235-007-9031-7","volume":"34","author":"N Ghaboosi","year":"2007","unstructured":"Ghaboosi N, Haghighat AT (2007) Tabu search based algorithms for bandwidth-delay-constrained least-cost multicast routing. Telecommun Syst 34(3\u20134):147\u2013166","journal-title":"Telecommun Syst"},{"issue":"1","key":"3252_CR9","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/j.comcom.2009.07.015","volume":"33","author":"H Wang","year":"2010","unstructured":"Wang H, Meng X, Zhang M, Li Y (2010) Tabu search algorithm for RP selection in PIM-SM multicast routing. Comput Commun 33(1):35\u201342","journal-title":"Comput Commun"},{"key":"3252_CR10","doi-asserted-by":"crossref","unstructured":"Liu J, Sun J, Xu W-B (2006) QoS multicast routing based on particle swarm optimization. In: Corchado E, Yin H, Botti V, Fyfe C (eds) IDEAL 2006. LNCS, vol 4224, Springer, Heidelberg, pp 936\u2013943","DOI":"10.1007\/11875581_112"},{"issue":"15","key":"3252_CR11","doi-asserted-by":"publisher","first-page":"2775","DOI":"10.1016\/j.comnet.2010.05.006","volume":"54","author":"H Wang","year":"2010","unstructured":"Wang H, Meng X, Li S, Xu H (2010) A tree-based particle swarm optimization for multicast routing. Comput Netw 54(15):2775\u20132786","journal-title":"Comput Netw"},{"issue":"1","key":"3252_CR12","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/j.engappai.2010.08.001","volume":"24","author":"J Sun","year":"2011","unstructured":"Sun J, Fang W, Wu X, Xie Z, Xu W (2011) QoS multicast routing using a quantum-behaved particle swarm optimization algorithm. Eng Appl Artif Intell 24(1):123\u2013131","journal-title":"Eng Appl Artif Intell"},{"key":"3252_CR13","doi-asserted-by":"crossref","unstructured":"Pradhan R, Kabat M-R, Sahoo S-P (2013) A bacteria foraging-particle swarm optimization algorithm for QoS multicast routing. In: Panigrahi BK et al (eds) SEMCCO 2013. LNCS. vol 8297, Springer, Berlin, pp 590-600","DOI":"10.1007\/978-3-319-03753-0_53"},{"issue":"12","key":"3252_CR14","doi-asserted-by":"publisher","first-page":"7141","DOI":"10.1109\/TIE.2014.2314075","volume":"61","author":"M Shen","year":"2014","unstructured":"Shen M, Zhan ZH, Chen WN, Gong YJ, Zhang J, Li Y (2014) Bi-velocity discrete particle swarm optimization and its application to multicast routing problem in communication networks. IEEE Trans Ind Electr 61(12):7141\u20137151","journal-title":"IEEE Trans Ind Electr"},{"issue":"2","key":"3252_CR15","first-page":"23","volume":"4","author":"RF Abdel-Kader","year":"2011","unstructured":"Abdel-Kader RF (2011) An improved discrete PSO with GA operators for efficient QoS-multicast routing. Int J Hybrid Inf Technol 4(2):23\u201338","journal-title":"Int J Hybrid Inf Technol"},{"key":"3252_CR16","unstructured":"Yang X-S (2010). A new metaheuristic bat-inspired algorithm. In: Gonzalez JR et al (eds) Nature inspired cooperative strategies for optimization (NICSO 2010). SCI vol 284, Springer, Berlin, pp. 65\u201374"},{"key":"3252_CR17","doi-asserted-by":"crossref","unstructured":"Nakamura RY, Pereira LA, Costa KA, Rodrigues D, Papa JP, Yang XS (2012). BBA: a binary bat algorithm for feature selection. In: 2012 25th SIBGRAPI conference on graphics, patterns and images, IEEE, pp 291\u2013297","DOI":"10.1109\/SIBGRAPI.2012.47"},{"issue":"3","key":"3252_CR18","doi-asserted-by":"publisher","first-page":"279","DOI":"10.7763\/LNSE.2013.V1.61","volume":"1","author":"S Yilmaz","year":"2013","unstructured":"Yilmaz S, Kucuksille EU (2013) Improved bat algorithm (IBA) on continuous optimization problems. Lect Notes Softw Eng 1(3):279","journal-title":"Lect Notes Softw Eng"},{"issue":"6","key":"3252_CR19","doi-asserted-by":"publisher","first-page":"1239","DOI":"10.1007\/s00521-012-1028-9","volume":"22","author":"AH Gandomi","year":"2013","unstructured":"Gandomi AH, Yang XS, Alavi AH, Talatahari S (2013) Bat algorithm for constrained optimization tasks. Neural Comput Appl 22(6):1239\u20131255","journal-title":"Neural Comput Appl"},{"key":"3252_CR20","unstructured":"Tamiru AL, Hashim FM (2013) Application of bat algorithm and fuzzy systems to model exergy changes in a gas turbine. In: Artificial intelligence, evolutionary computing and metaheuristics, Springer, Berlin Heidelberg, pp 685\u2013719"},{"issue":"3","key":"3252_CR21","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1504\/IJBIC.2014.062637","volume":"6","author":"X Cai","year":"2014","unstructured":"Cai X, Wang L, Kang Q, Wu Q (2014) Bat algorithm with Gaussian walk. Int J Bio-Inspir Comput 6(3):166\u2013174","journal-title":"Int J Bio-Inspir Comput"},{"issue":"2","key":"3252_CR22","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1504\/IJBIC.2014.060598","volume":"6","author":"S Sabba","year":"2014","unstructured":"Sabba S, Chikhi S (2014) A discrete binary version of bat algorithm for multidimensional knapsack problem. Int J Bio-Inspir Comput 6(2):140\u2013152","journal-title":"Int J Bio-Inspir Comput"},{"issue":"8","key":"3252_CR23","doi-asserted-by":"publisher","first-page":"18","DOI":"10.5815\/ijmecs.2014.08.03","volume":"6","author":"O Abdel-Raouf","year":"2014","unstructured":"Abdel-Raouf O, Abdel-Baset M, El-Henawy I (2014) An improved chaotic bat algorithm for solving integer programming problems. Int J Mod Educ Comput Sci 6(8):18","journal-title":"Int J Mod Educ Comput Sci"},{"key":"3252_CR24","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/j.asoc.2014.11.029","volume":"28","author":"S Yilmaz","year":"2015","unstructured":"Yilmaz S, Kucuksille EU (2015) A new modification approach on bat algorithm for solving optimization problems. Appl Soft Comput 28:259\u2013275","journal-title":"Appl Soft Comput"},{"key":"3252_CR25","unstructured":"Byksaat S (2015) Bat algorithm application for the single row facility layout problem. In: Recent advances in swarm intelligence and evolutionary computation, Springer International Publishing, Berlin, pp 101\u2013120"},{"key":"3252_CR26","doi-asserted-by":"publisher","first-page":"993","DOI":"10.1016\/j.neucom.2014.07.034","volume":"149","author":"I Fister","year":"2015","unstructured":"Fister I, Rauter S, Yang XS, Ljubi K (2015) Planning the sports training sessions with the bat algorithm. Neurocomputing 149:993\u20131002","journal-title":"Neurocomputing"},{"issue":"7","key":"3252_CR27","doi-asserted-by":"publisher","first-page":"1853","DOI":"10.1007\/s00521-015-1978-9","volume":"27","author":"Y Saji","year":"2016","unstructured":"Saji Y, Riffi ME (2016) A novel discrete bat algorithm for solving the travelling salesman problem. Neural Comput Appl 27(7):1853\u20131866","journal-title":"Neural Comput Appl"},{"issue":"4","key":"3252_CR28","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1007\/s00521-015-2091-9","volume":"28","author":"AS Oshaba","year":"2017","unstructured":"Oshaba AS, Ali ES, Elazim SA (2017) PI controller design for MPPT of photovoltaic system supplying SRM via BAT search algorithm. Neural Comput Appl 28(4):651\u2013667","journal-title":"Neural Comput Appl"},{"issue":"2","key":"3252_CR29","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s10470-015-0548-5","volume":"84","author":"D Zhao","year":"2015","unstructured":"Zhao D, He Y (2015) Chaotic binary bat algorithm for analog test point selection. Analog Integr Circ Sig Process 84(2):201\u2013214","journal-title":"Analog Integr Circ Sig Process"},{"issue":"3\u20134","key":"3252_CR30","doi-asserted-by":"publisher","first-page":"663","DOI":"10.1007\/s00521-013-1525-5","volume":"25","author":"S Mirjalili","year":"2014","unstructured":"Mirjalili S, Mirjalili SM, Yang X-S (2014) Binary bat algorithm. Neural Comput Appl 25(3\u20134):663\u2013681","journal-title":"Neural Comput Appl"},{"key":"3252_CR31","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.swevo.2012.09.002","volume":"9","author":"S Mirjalili","year":"2013","unstructured":"Mirjalili S, Lewis A (2013) S-shaped versus V-shaped transfer functions for binary particle swarm optimization. Swarm Evolut Comput 9:1\u201314","journal-title":"Swarm Evolut Comput"},{"issue":"3","key":"3252_CR32","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1007\/s00521-014-1743-5","volume":"26","author":"S Saremi","year":"2014","unstructured":"Saremi S, Mirjalili S, Lewis A (2014) How important is a transfer function in discrete heuristic algorithms. Neural Comput Appl 26(3):625\u2013640","journal-title":"Neural Comput Appl"},{"issue":"3","key":"3252_CR33","doi-asserted-by":"publisher","first-page":"727","DOI":"10.1007\/s11047-009-9175-3","volume":"9","author":"E Rashedi","year":"2010","unstructured":"Rashedi E, Nezamabadi-Pour H, Saryazdi S (2010) BGSA: binary gravitational search algorithm. Nat Comput 9(3):727\u2013745","journal-title":"Nat Comput"},{"key":"3252_CR34","doi-asserted-by":"crossref","unstructured":"Kennedy J, Eberhart RC (1997) A discrete binary version of the particle swarm algorithm. In: IEEE international conference on computational cybernetics and simulation, pp 4104\u20134108","DOI":"10.1109\/ICSMC.1997.637339"},{"key":"3252_CR35","doi-asserted-by":"crossref","unstructured":"Shi Y, Eberhart RC (1999) Empirical study of particle swarm optimization. In: Proceedings of the congress on evolutionary computation (CEC), pp 1945\u20131950","DOI":"10.1109\/CEC.1999.785511"},{"issue":"3","key":"3252_CR36","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1109\/TEVC.2003.810069","volume":"7","author":"R Caponetto","year":"2003","unstructured":"Caponetto R, Fortuna L, Fazzino S, Xibilia MG (2003) Chaotic sequences to improve the performance of evolutionary algorithms. IEEE Trans Evolut Comput 7(3):289\u2013304","journal-title":"IEEE Trans Evolut Comput"},{"issue":"1","key":"3252_CR37","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/j.asoc.2009.11.014","volume":"11","author":"LY Chuang","year":"2011","unstructured":"Chuang LY, Yang CH, Li JC (2011) Chaotic maps based on binary particle swarm optimization for feature selection. Appl Soft Comput 11(1):239\u2013248","journal-title":"Appl Soft Comput"},{"key":"3252_CR38","unstructured":"Heidari AA, Abbaspour RA, Jordehi AR (2015) An efficient chaotic water cycle algorithm for optimization tasks. Neural Comput Appl 1\u201329"},{"issue":"5","key":"3252_CR39","doi-asserted-by":"publisher","first-page":"1077","DOI":"10.1007\/s00521-014-1597-x","volume":"25","author":"S Saremi","year":"2014","unstructured":"Saremi S, Mirjalili S, Lewis A (2014) Biogeography-based optimisation with chaos. Neural Comput Appl 25(5):1077\u20131097","journal-title":"Neural Comput Appl"},{"key":"3252_CR40","doi-asserted-by":"crossref","unstructured":"Lei X, Du M, Xu J, Tan Y (2014) Chaotic Fruit Fly Optimization Algorithm. In : Tan, Y. et al. (eds) ICSI 2014. LNCS vol 8794, Springer Switzerland, pp 74\u201385","DOI":"10.1007\/978-3-319-11857-4_9"},{"issue":"5","key":"3252_CR41","doi-asserted-by":"publisher","first-page":"2557","DOI":"10.1016\/j.chaos.2007.10.049","volume":"40","author":"A Kanso","year":"2009","unstructured":"Kanso A, Smaoui N (2009) Logistic chaotic maps for binary numbers generations. Chaos, Solitons Fractals 40(5):2557\u20132568","journal-title":"Chaos, Solitons Fractals"},{"issue":"1","key":"3252_CR42","doi-asserted-by":"publisher","first-page":"522","DOI":"10.1016\/j.chaos.2009.01.012","volume":"42","author":"L Santos Coelho dos","year":"2009","unstructured":"dos Santos Coelho L, Sauer JG, Rudek M (2009) Differential evolution optimization combined with chaotic sequences for image contrast enhancement. Chaos, Solitons Fractals 42(1):522\u2013529","journal-title":"Chaos, Solitons Fractals"},{"issue":"9","key":"3252_CR43","doi-asserted-by":"publisher","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(9):1617\u20131622","journal-title":"IEEE J Sel Areas Commun"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-017-3252-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00521-017-3252-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-017-3252-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,19]],"date-time":"2020-01-19T05:24:46Z","timestamp":1579411486000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00521-017-3252-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10,30]]},"references-count":43,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2019,7]]}},"alternative-id":["3252"],"URL":"https:\/\/doi.org\/10.1007\/s00521-017-3252-9","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"value":"0941-0643","type":"print"},{"value":"1433-3058","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,10,30]]},"assertion":[{"value":"21 December 2015","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 October 2017","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 October 2017","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}