{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,2]],"date-time":"2025-06-02T04:05:57Z","timestamp":1748837157736,"version":"3.41.0"},"publisher-location":"Cham","reference-count":46,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319312033"},{"type":"electronic","value":"9783319312040"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-31204-0_14","type":"book-chapter","created":{"date-parts":[[2016,3,22]],"date-time":"2016-03-22T11:24:40Z","timestamp":1458645880000},"page":"203-218","source":"Crossref","is-referenced-by-count":5,"title":["A Hybrid Discrete Artificial Bee Colony Algorithm for the Multicast Routing Problem"],"prefix":"10.1007","author":[{"given":"Yannis","family":"Marinakis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Magdalene","family":"Marinaki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Athanasios","family":"Migdalas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,3,15]]},"reference":[{"key":"14_CR1","first-page":"113","volume-title":"Swarm Intelligence, Focus on Ant and Particle Swarm Optimization","author":"A Baykasoglu","year":"2007","unstructured":"Baykasoglu, A., Ozbakir, L., Tapkan, P.: Artificial bee colony algorithm and its application to generalized assignment problem. In: Chan, F.T.S., Tiwari, M.K. (eds.) Swarm Intelligence, Focus on Ant and Particle Swarm Optimization, pp. 113\u2013144. I-Tech Education and Publishing, Vienna (2007)"},{"key":"14_CR2","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/s10462-009-9127-4","volume":"31","author":"D Karaboga","year":"2009","unstructured":"Karaboga, D., Akay, B.: A survey: algorithms simulating bee swarm intelligence. Artif. Intell. Rev. 31, 61\u201385 (2009)","journal-title":"Artif. Intell. Rev."},{"key":"14_CR3","series-title":"Intelligent Systems Reference Library","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-03404-1","volume-title":"Innovative Computational Intelligence: A Rough Guide to 134 Clever Algorithms","author":"B Xing","year":"2014","unstructured":"Xing, B., Gao, W.J.: Innovative Computational Intelligence: A Rough Guide to 134 Clever Algorithms. Intelligent Systems Reference Library, vol. 62. Springer International Publishing, Cham (2014)"},{"key":"14_CR4","unstructured":"Abbass, H.A.: A monogenous mbo approach to satisfiability. In: International Conference on Computational Intelligence for Modeling, Control and Automation, CIMCA 2001, Las Vegas, NV, USA (2001)"},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"Abbass, H.A.: Marriage in honey-bee optimization (MBO): a haplometrosis polygynous swarming approach. In: The Congress on Evolutionary Computation (CEC 2001), Seoul, Korea, pp. 207\u2013214 (2001)","DOI":"10.1109\/CEC.2001.934391"},{"key":"14_CR6","series-title":"Studies in Computational Intelligence","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/978-3-540-78987-1_13","volume-title":"Nature Inspired Cooperative Strategies for Optimization - NICSO 2007","author":"Y Marinakis","year":"2008","unstructured":"Marinakis, Y., Marinaki, M., Dounias, G.: Honey bees mating optimization algorithm for the vehicle routing problem. In: Krasnogor, N., Nicosia, G., Pavone, M., Pelta, D. (eds.) NICSO 2007. SIC, vol. 129, pp. 139\u2013148. Springer, Heidelberg (2008)"},{"key":"14_CR7","series-title":"Adaptation, learning, and optimization","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/978-3-642-17390-5_15","volume-title":"Handbook of Swarm Intelligence - Concepts, Principles and Applications","author":"Y Marinakis","year":"2011","unstructured":"Marinakis, Y., Marinaki, M.: Bumble bees mating optimization algorithm for the vehicle routing problem. In: Panigrahi, B.K., Shi, Y., Lim, M.-H. (eds.) Handbook of Swarm Intelligence. ALO, vol. 8, pp. 347\u2013369. Springer, Heidelberg (2011)"},{"key":"14_CR8","doi-asserted-by":"publisher","first-page":"981","DOI":"10.1016\/j.jnca.2012.01.023","volume":"36","author":"S Bitam","year":"2013","unstructured":"Bitam, S., Mellouk, A.: Bee life-based multi constraints multicast routing optimization for vehicular ad hoc networks. J. Netw. Comput. Appl. 36, 981\u2013991 (2013)","journal-title":"J. Netw. Comput. Appl."},{"key":"14_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/11499305_33","volume-title":"Artificial Intelligence and Knowledge Engineering Applications: A Bioinspired Approach","author":"X-S Yang","year":"2005","unstructured":"Yang, X.-S.: Engineering optimizations via nature-inspired virtual bee algorithms. In: Mira, J., \u00c1lvarez, J.R. (eds.) IWINAC 2005. LNCS, vol. 3562, pp. 317\u2013323. Springer, Heidelberg (2005)"},{"key":"14_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/978-3-540-28646-2_8","volume-title":"Ant Colony Optimization and Swarm Intelligence","author":"HF Wedde","year":"2004","unstructured":"Wedde, H.F., Farooq, M., Zhang, Y.: Beehive: an efficient fault-tolerant routing algorithm inspired by honey bee behavior. In: Dorigo, M., Birattari, M., Blum, C., Gambardella, L.M., Mondada, F., St\u00fctzle, T. (eds.) ANTS 2004. LNCS, vol. 3172, pp. 83\u201394. Springer, Heidelberg (2004)"},{"key":"14_CR11","doi-asserted-by":"publisher","first-page":"1080","DOI":"10.1002\/int.20376","volume":"24","author":"MA Munoz","year":"2009","unstructured":"Munoz, M.A., Lopez, J.A., Caicedo, E.: An artificial beehive algorithm for continuous optimization. Int. J. Intell. Syst. 24, 1080\u20131093 (2009)","journal-title":"Int. J. Intell. Syst."},{"key":"14_CR12","doi-asserted-by":"crossref","first-page":"454","DOI":"10.1016\/B978-008045157-2\/50081-X","volume-title":"Intelligent Production Machines and Systems","author":"D.T. Pham","year":"2006","unstructured":"Pham, D.T., Ghanbarzadeh, A., Koc, E., Otri, S., Rahim, S., Zaidi, M.: The bees algorithm - a novel tool for complex optimization problems. In: IPROMS 2006 Proceeding 2nd International Virtual Conference on Intelligent Production Machines and Systems. Elsevier, Oxford (2006)"},{"key":"14_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1007\/11494669_39","volume-title":"Computational Intelligence and Bioinspired Systems","author":"H Drias","year":"2005","unstructured":"Drias, H., Sadeg, S., Yahi, S.: Cooperative bees swarm for solving the maximum weighted satisfiability problem. In: Cabestany, J., Prieto, A.G., Sandoval, F. (eds.) IWANN 2005. LNCS, vol. 3512, pp. 318\u2013325. Springer, Heidelberg (2005)"},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"Comellas, F., Martinez-Navarro, J.: Bumblebees: a multiagent combinatorial optimization algorithm inspired by social insect behavior. In: Proceedings of First ACM\/ SIGEVO Summit on Genetic and Evolutionary Computation (GECCO), pp. 811\u2013814 (2009)","DOI":"10.1145\/1543834.1543949"},{"key":"14_CR15","unstructured":"Teodorovic, D., Dell\u2019Orco, M.: Bee colony optimization - a cooperative learning approach to complex transportation problems. In: Advanced OR and AI Methods in Transportation, Proceedings of the 16th Mini - EURO Conference and 10th Meeting of EWGT, pp. 51\u201360 (2005)"},{"key":"14_CR16","doi-asserted-by":"crossref","unstructured":"Hackel, S., Dippold, P.: The bee colony-inspired algorithm (BCiA)-a two stage approach for solving the vehicle routing problem with time windows. In: Proceedings of GECCO 2009, Montreal, Quebec, Canada, pp. 25\u201332 (2009)","DOI":"10.1145\/1569901.1569906"},{"key":"14_CR17","doi-asserted-by":"crossref","unstructured":"Sato, T., Hagiwara, M.: Bee system: finding solution by a concentrated search. In: IEEE International Conference on Systems, Man, and Cybernetics (SMC), pp. 3954\u20133959 (1997)","DOI":"10.1109\/ICSMC.1997.633289"},{"key":"14_CR18","doi-asserted-by":"publisher","first-page":"845","DOI":"10.1016\/j.engappai.2010.05.004","volume":"23","author":"N Quijano","year":"2010","unstructured":"Quijano, N., Passino, K.M.: Honey bee social foraging algorithms for resource allocation: theory and application. Eng. Appl. Artif. Intell. 23, 845\u2013861 (2010)","journal-title":"Eng. Appl. Artif. Intell."},{"key":"14_CR19","doi-asserted-by":"crossref","unstructured":"Maia, R.D., Castro, L.N.D., Caminhas, W.M.: Bee colonies as model for multimodal continuous optimization: the optbees algorithm. In: IEEE World Congress on Computational Intelligence (WCCI), Brisbane, Australia, pp. 1\u20138 (2012)","DOI":"10.1109\/CEC.2012.6252975"},{"key":"14_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1007\/978-3-642-04985-9_18","volume-title":"Rule Interchange and Applications","author":"JD McCaffrey","year":"2009","unstructured":"McCaffrey, J.D., Dierking, H.: An empirical study of unsupervised rule set extraction of clustered categorical data using a simulated bee colony algorithm. In: Governatori, G., Hall, J., Paschke, A. (eds.) RuleML 2009. LNCS, vol. 5858, pp. 182\u2013192. Springer, Heidelberg (2009)"},{"key":"14_CR21","first-page":"1037","volume":"8","author":"H Fan","year":"2012","unstructured":"Fan, H., Zhong, Y.: A rough set approach to feature selection based on wasp swarm optimization. J. Comput. Inf. Syst. 8, 1037\u20131045 (2012)","journal-title":"J. Comput. Inf. Syst."},{"key":"14_CR22","doi-asserted-by":"crossref","unstructured":"Theraulaz, G., Goss, S., Gervet, J., Deneubourg, J.L.: Task differentiation in polistes wasps colonies: a model for self-organizing groups of robots. In: First International Conference on Simulation of Adaptive Behavior, pp. 346\u2013355. MIT Press, Cambridge (1991)","DOI":"10.7551\/mitpress\/3115.003.0047"},{"key":"14_CR23","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/s10898-007-9149-x","volume":"39","author":"D Karaboga","year":"2007","unstructured":"Karaboga, D., Basturk, B.: A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm. J. Global Optim. 39, 459\u2013471 (2007)","journal-title":"J. Global Optim."},{"key":"14_CR24","doi-asserted-by":"publisher","first-page":"687","DOI":"10.1016\/j.asoc.2007.05.007","volume":"8","author":"D Karaboga","year":"2008","unstructured":"Karaboga, D., Basturk, B.: On the performance of artificial bee colony (ABC) algorithm. Appl. Soft Comput. 8, 687\u2013697 (2008)","journal-title":"Appl. Soft Comput."},{"key":"14_CR25","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s10462-012-9328-0","volume":"42","author":"D Karaboga","year":"2014","unstructured":"Karaboga, D., Gorkemli, B., Ozturk, C., Karaboga, N.: A comprehensive survey: artificial bee colony (ABC) algorithm and applications. Artif. Intell. Rev. 42, 21\u201357 (2014)","journal-title":"Artif. Intell. Rev."},{"key":"14_CR26","series-title":"Springer Proceedings in Mathematics & Statistics","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/978-3-319-09758-9_7","volume-title":"Models, Algorithms and Technologies for Network Analysis: Third International Conference on Network Analysis","author":"Y Marinakis","year":"2014","unstructured":"Marinakis, Y., Migdalas, A.: A particle swarm optimization algorithm for the multicast routing problem. In: Batsyn, M.V., Kalyagin, V.A., Pardalos, P.M. (eds.) Models, Algorithms and Technologies for Network Analysis: Third International Conference on Network Analysis. Springer Proceedings in Mathematics & Statistics, vol. 104, pp. 69\u201391. Springer International Publishing, Switzerland (2014)"},{"key":"14_CR27","doi-asserted-by":"publisher","first-page":"1953","DOI":"10.1016\/j.cor.2003.12.007","volume":"32","author":"CAS Oliveira","year":"2005","unstructured":"Oliveira, C.A.S., Pardalos, P.M.: A survey of combinatorial optimization problems in multicast routing. Comput. Oper. Res. 32, 1953\u20131981 (2005)","journal-title":"Comput. Oper. Res."},{"key":"14_CR28","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1007\/978-0-387-30165-5_25","volume-title":"Handbook of Optimization in Telecommunications","author":"CAS Oliveira","year":"2006","unstructured":"Oliveira, C.A.S., Pardalos, P.M., Resende, M.G.C.: Optimization problems in multicast tree construction. In: Resende, M.G.C., Pardalos, P.M. (eds.) Handbook of Optimization in Telecommunications, pp. 701\u2013731. Springer, New York (2006)"},{"key":"14_CR29","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York (1979)"},{"key":"14_CR30","doi-asserted-by":"crossref","unstructured":"Chow, C.H.: On multicast path finding algorithms. In: IEEE INFOCOM 1991, pp. 1974\u20131283. IEEE (1991)","DOI":"10.1109\/INFCOM.1991.147651"},{"key":"14_CR31","first-page":"573","volume":"6","author":"H Takahashi","year":"1980","unstructured":"Takahashi, H., Mutsuyama, A.: An approximate solution for the steiner problem in graphs. Math. Jpn. 6, 573\u2013577 (1980)","journal-title":"Math. Jpn."},{"key":"14_CR32","first-page":"286","volume":"1","author":"BM Waxman","year":"1988","unstructured":"Waxman, B.M.: Routing of multipoint connections. IEEE J. Sel. Areas Commun. 1, 286\u2013292 (1988)","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"14_CR33","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1109\/90.234851","volume":"1","author":"VP Kompleea","year":"1993","unstructured":"Kompleea, V.P., Pasquale, J.C., Polyzos, G.C.: Multicast routing for multimedia communication. IEEE\/ACM Trans. Networking 1, 286\u2013292 (1993)","journal-title":"IEEE\/ACM Trans. Networking"},{"key":"14_CR34","doi-asserted-by":"crossref","unstructured":"Tode, H., Sakai, Y., Yamamoto, M., Okada, H., Tezuka, Y.: Multicast routing algorithm for nodal load balancing. In: IEEE INFOCOM 1992, pp. 2086\u20132095. IEEE (1992)","DOI":"10.1109\/INFCOM.1992.263481"},{"key":"14_CR35","unstructured":"Hwang, R.H., Do, W.Y., Yang, S.C.: Multicast routing based on genetic algorithms. In: WiOpt 2003: Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks. INRIA Sophia-Antipolis, France (2003)"},{"key":"14_CR36","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/S0020-0255(99)00102-4","volume":"124","author":"JJ Wu","year":"2000","unstructured":"Wu, J.J., Hwang, R.H.: Multicast routing with multiple constraints. Inf. Sci. 124, 29\u201357 (2000)","journal-title":"Inf. Sci."},{"key":"14_CR37","doi-asserted-by":"publisher","first-page":"971","DOI":"10.1016\/j.asoc.2015.04.037","volume":"37","author":"F D\u2019Andreagiovanni","year":"2015","unstructured":"D\u2019Andreagiovanni, F., Nardin, A.: Towards the fast and robust optimal design of wireless body area networks. Appl. Soft Comput. 37, 971\u2013982 (2015)","journal-title":"Appl. Soft Comput."},{"key":"14_CR38","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1016\/j.asoc.2014.10.016","volume":"26","author":"F D\u2019Andreagiovanni","year":"2015","unstructured":"D\u2019Andreagiovanni, F., Krolikowski, J., Pulaj, J.: A fast hybrid primal heuristic for multiband robust capacitated network design with multiple time periods. Appl. Soft Comput. 26, 497\u2013507 (2015)","journal-title":"Appl. Soft Comput."},{"key":"14_CR39","doi-asserted-by":"crossref","unstructured":"Doar, M., Leslie, I.: How bad is naive multicast routing. In: Twelfth Annual Joint Conference of the IEEE Computer and Communications Societies. Networking: Foundation for the Future, INFOCOM 1993, Proceedings, pp. 82\u201389. IEEE (1993)","DOI":"10.1109\/INFCOM.1993.253246"},{"key":"14_CR40","unstructured":"Oh, J., Pyo, I., Pedram, M.: Constructing minimal spanning\/steiner trees with bounded path length. In: European Design and Test Conference, pp. 244\u2013249 (1996)"},{"key":"14_CR41","doi-asserted-by":"crossref","unstructured":"Marinakis, Y., Marinaki, M., Matsatsinis, M.: A hybrid discrete artificial bee colony - grasp algorithm for clustering. In: 39th International Conference on Computers and Industrial Engineering, Troyes, France (2009)","DOI":"10.1109\/ICCIE.2009.5223810"},{"key":"14_CR42","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/BF01096763","volume":"6","author":"TA Feo","year":"1995","unstructured":"Feo, T.A., Resende, M.G.C.: Greedy randomized adaptive search procedure. J. Global Optim. 6, 109\u2013133 (1995)","journal-title":"J. Global Optim."},{"key":"14_CR43","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1016\/S0377-2217(00)00100-4","volume":"130","author":"P Hansen","year":"2001","unstructured":"Hansen, P., Mladenovic, N.: Variable neighborhood search: principles and applications. Eu. J. Oper. Res. 130, 449\u2013467 (2001)","journal-title":"Eu. J. Oper. Res."},{"key":"14_CR44","doi-asserted-by":"publisher","first-page":"4135","DOI":"10.1016\/j.asoc.2011.02.032","volume":"11","author":"C Blum","year":"2011","unstructured":"Blum, C., Puchinger, J., Raidl, G.R., Roli, A.: Hybrid metaheuristics in combinatorial optimization: a survey. Appl. Soft Comput. 11, 4135\u20134151 (2011)","journal-title":"Appl. Soft Comput."},{"key":"14_CR45","unstructured":"Shi, Y., Eberhart, R.: A modified particle swarm optimizer. In: Proceedings of 1998 IEEE World Congress on Computational Intelligence, pp. 69\u201373 (1998)"},{"key":"14_CR46","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/s10479-009-0657-6","volume":"175","author":"P Hansen","year":"2010","unstructured":"Hansen, P., Mladenovi\u0107, N., Moreno-P\u00e9rez, J.A.: Variable neighborhood search: methods and applications. Ann. Oper. Res. 175, 367\u2013407 (2010)","journal-title":"Ann. Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Applications of Evolutionary Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-31204-0_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T22:16:23Z","timestamp":1748816183000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-31204-0_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319312033","9783319312040"],"references-count":46,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-31204-0_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}