{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T16:30:52Z","timestamp":1743006652139,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319202938"},{"type":"electronic","value":"9783319202945"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-20294-5_12","type":"book-chapter","created":{"date-parts":[[2015,7,15]],"date-time":"2015-07-15T13:54:03Z","timestamp":1436968443000},"page":"134-144","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Hybrid Artificial Bee Colony Algorithm for the Terminal Assignment Problem"],"prefix":"10.1007","author":[{"given":"Jayalakshmi","family":"Banda","sequence":"first","affiliation":[]},{"given":"Alok","family":"Singh","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,7,16]]},"reference":[{"key":"12_CR1","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, K.: On the performance of artificial bee colony (ABC) algorithm. Appl. Soft Comput. 8, 687\u2013697 (2008)","journal-title":"Appl. Soft Comput."},{"key":"12_CR2","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1016\/j.asoc.2008.09.001","volume":"9","author":"A Singh","year":"2009","unstructured":"Singh, A.: An artificial bee colony algorithm for the leaf constrained minimum spanning tree problem. Appl. Soft Comput. 9, 625\u2013631 (2009)","journal-title":"Appl. Soft Comput."},{"key":"12_CR3","unstructured":"Bernardino, E., Bernardino, A., Sanchez- Perez, J., Vega-Rodriguez, M., Gomez-Pulido, J.: Tabu search vs hybrid genetic algorithm to solve the terminal assignment problem. In: International Conference on Applied Computing, pp. 404\u2013409 (2008)"},{"key":"12_CR4","first-page":"2302","volume":"2","author":"Y Xu","year":"2004","unstructured":"Xu, Y., Salcedo-Sanz, S., Yao, X.: Non-standard cost terminal assignment problems using tabu search approach. IEEE Conf. Evol. Comput. 2, 2302\u20132306 (2004)","journal-title":"IEEE Conf. Evol. Comput."},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Bernardino, E., Bernardino, A., Sanchez-Perez, J., Vega-Rodriguez, M., Gomez-Pulido, J.: Solving the terminal assignment problem using a local search genetic algorithm. In: International Symposium on Distributed Computing and Artificial Intelligence, pp. 225\u2013234, Springer, Heidelberg (2008)","DOI":"10.1007\/978-3-540-85863-8_27"},{"key":"12_CR6","unstructured":"Bernardino, E., Bernardino, A., Sanchez-Perez, J., Vega-Rodriguez, M., Gomez-Pulido, J.: A hybrid differential evolution algorithm with a multiple strategy for solving the terminal assignment problem. In: 6th Hellenic Conference on Artificial Intelligence. Springer, Heidelberg (2010)"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"Khuri, S., Chiu, T.: Heuristic algorithms for the terminal assignment problem. In: Proceedings of the ACM Symposium on Applied Computing, pp. 247\u2013251 (1997)","DOI":"10.1145\/331697.331748"},{"issue":"6","key":"12_CR8","doi-asserted-by":"publisher","first-page":"2343","DOI":"10.1109\/TSMCB.2004.836471","volume":"34","author":"S Salcedo-Sanz","year":"2004","unstructured":"Salcedo-Sanz, S., Yao, X.: A hybrid Hopfield network genetic algorithm approach for the terminal assignment problem. IEEE Trans. Syst. Man Cybern. 34(6), 2343\u20132353 (2004)","journal-title":"IEEE Trans. Syst. Man Cybern."},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"Abuali, F., Schoenefeld, D., Wainwright, R.: Terminal assignment in a communications network using genetic algorithms. In: Proceedings of the 22nd Annual ACM Computer Science Conference, pp. 74\u201381. ACM press, Newyork (1994)","DOI":"10.1145\/197530.197559"},{"key":"12_CR10","doi-asserted-by":"publisher","first-page":"2489","DOI":"10.1007\/s00500-011-0711-6","volume":"15","author":"A Singh","year":"2011","unstructured":"Singh, A., Sunder, S.: An artificial bee colony algorithm for the minimum routing cost spanning tree problem. Soft Comput. 15, 2489\u20132499 (2011)","journal-title":"Soft Comput."},{"key":"12_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/978-3-642-15871-1_24","volume-title":"Parallel Problem Solving from Nature, PPSN XI","author":"EM Bernardino","year":"2010","unstructured":"Bernardino, E.M., Bernardino, A.M., S\u00e1nchez-P\u00e9rez, J.M., G\u00f3mez-Pulido, J.A., Vega-Rodr\u00edguez, M.A.: Discrete differential evolution algorithm for solving the terminal assignment problem. In: Schaefer, R., Cotta, C., Ko\u0142odziej, J., Rudolph, G. (eds.) PPSN XI. LNCS, vol. 6239, pp. 229\u2013239. Springer, Heidelberg (2010)"},{"key":"12_CR12","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":"12_CR13","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":"12_CR14","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"789","DOI":"10.1007\/978-3-540-72950-1_77","volume-title":"Foundations of Fuzzy Logic and Soft Computing","author":"D Karaboga","year":"2007","unstructured":"Karaboga, D., Basturk, B.: Artificial bee colony (ABC) optimization algorithm for solving constrained optimization problems. In: Melin, P., Castillo, O., Aguilar, L.T., Kacprzyk, J., Pedrycz, W. (eds.) IFSA 2007. LNCS (LNAI), vol. 4529, pp. 789\u2013798. Springer, Heidelberg (2007)"},{"key":"12_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/978-3-642-13025-0_29","volume-title":"Trends in Applied Intelligent Systems","author":"EM Bernardino","year":"2010","unstructured":"Bernardino, E.M., Bernardino, A.M., S\u00e1nchez-P\u00e9rez, J.M., G\u00f3mez-Pulido, J.A., Vega-Rodr\u00edguez, M.A.: Using the bees algorithm to assign terminals to concentrators. In: Garc\u00eda-Pedrajas, N., Herrera, F., Fyfe, C., Ben\u00edtez, J.M., Ali, M. (eds.) IEA\/AIE 2010, Part II. LNCS, vol. 6097, pp. 267\u2013276. Springer, Heidelberg (2010)"},{"key":"12_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/978-3-642-02481-8_25","volume-title":"Distributed Computing, Artificial Intelligence, Bioinformatics, Soft Computing, and Ambient Assisted Living","author":"EM Bernardino","year":"2009","unstructured":"Bernardino, E.M., Bernardino, A.M., S\u00e1nchez-P\u00e9rez, J.M., G\u00f3mez-Pulido, J.A., Vega-Rodr\u00edguez, M.A.: A Hybrid differential evolution algorithm for solving the terminal assignment problem. In: Omatu, S., Rocha, M.P., Bravo, J., Fern\u00e1ndez, F., Corchado, E., Bustillo, A., Corchado, J.M. (eds.) IWANN 2009, Part II. LNCS, vol. 5518, pp. 179\u2013186. Springer, Heidelberg (2009)"},{"key":"12_CR17","doi-asserted-by":"crossref","unstructured":"Pan, Q.-K., Tasgetiren, M. F., Liang, Y.C.: A discrete differential evolution algorithm for the permutation flowshop scheduling problem. In: Proceedings of the 9th Annual Conference on Genetic and Evolutionary Computation, pp. 126\u2013133 (2007)","DOI":"10.1145\/1276958.1276976"},{"key":"12_CR18","doi-asserted-by":"publisher","first-page":"3459","DOI":"10.1016\/j.ins.2011.04.018","volume":"181","author":"Q-K Pan","year":"2011","unstructured":"Pan, Q.-K., Tasgetiren, M.F., Suganthan, P.N., Chen, A.H.-L.: A discrete artificial bee colony algorithm for the total flowtime minimization in permutation flow shops. Inf. Sci. 181, 3459\u20133475 (2011)","journal-title":"Inf. Sci."},{"key":"12_CR19","volume-title":"Telecommunications Network Design Algorithms","author":"A Kershenbaum","year":"1993","unstructured":"Kershenbaum, A.: Telecommunications Network Design Algorithms. McGraw-Hill, New York (1993)"},{"key":"12_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/978-3-642-35380-2_54","volume-title":"Swarm, Evolutionary, and Memetic Computing","author":"D Bose","year":"2012","unstructured":"Bose, D., Kundu, S., Biswas, S., Das, S.: Circular antenna array design using novel perturbation based artificial bee colony algorithm. In: Panigrahi, B.K., Das, S., Suganthan, P.N., Nanda, P.K. (eds.) SEMCCO 2012. LNCS, vol. 7677, pp. 459\u2013466. Springer, Heidelberg (2012)"},{"key":"12_CR21","doi-asserted-by":"crossref","unstructured":"Biswas, S., Kundu, S., Bose, D., Das, S., Suganthan, P.N., Panigrahi, B.K.: Migrating forager population in a multi-population artificial bee colony algorithm with modified perturbation schemes. In: 2013 IEEE Symposium on Swarm Intelligence (SIS 2013), pp. 248\u2013255 (2013)","DOI":"10.1109\/SIS.2013.6615186"},{"key":"12_CR22","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1016\/j.ins.2014.05.033","volume":"281","author":"D Bose","year":"2014","unstructured":"Bose, D., Biswas, S., Vasilakos, A.V., Laha, S.: Optimal filter design using an improved artificial bee colony algorithm. Inf. Sci. 281, 443\u2013461 (2014)","journal-title":"Inf. Sci."}],"container-title":["Lecture Notes in Computer Science","Swarm, Evolutionary, and Memetic Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-20294-5_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,15]],"date-time":"2023-02-15T13:23:22Z","timestamp":1676467402000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-20294-5_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319202938","9783319202945"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-20294-5_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"16 July 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}