{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T06:48:48Z","timestamp":1774421328949,"version":"3.50.1"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"13-14","license":[{"start":{"date-parts":[[2024,7,1]],"date-time":"2024-07-01T00:00:00Z","timestamp":1719792000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,7,1]],"date-time":"2024-07-01T00:00:00Z","timestamp":1719792000000},"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":["Soft Comput"],"published-print":{"date-parts":[[2024,7]]},"DOI":"10.1007\/s00500-023-09509-7","type":"journal-article","created":{"date-parts":[[2024,7,11]],"date-time":"2024-07-11T07:02:02Z","timestamp":1720681322000},"page":"8497-8511","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["An artificial bee colony algorithm for the minimum edge-dilation K-center problem"],"prefix":"10.1007","volume":"28","author":[{"given":"Manisha","family":"Israni","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9679-0892","authenticated-orcid":false,"given":"Shyam","family":"Sundar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,7,11]]},"reference":[{"key":"9509_CR1","doi-asserted-by":"crossref","unstructured":"Abraham I, Gavoille C, Malkhi D, Nisan N, Thorup M (2004) Compact name-independent routing with minimum stretch. In: Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures, pp 20\u201324","DOI":"10.1145\/1007912.1007916"},{"issue":"3","key":"9509_CR2","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1016\/0196-6774(90)90017-9","volume":"11","author":"B Awerbuch","year":"1990","unstructured":"Awerbuch B, Bar-Noy A, Linial N, Peleg D (1990) Improved routing strategies with succinct tables. J Algorithms 11(3):307\u2013341","journal-title":"J Algorithms"},{"key":"9509_CR3","doi-asserted-by":"crossref","unstructured":"Awerbuch B, Peleg D (1990) Sparse partitions. In: Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science, pp 503\u2013513","DOI":"10.1109\/FSCS.1990.89571"},{"key":"9509_CR4","volume-title":"A c++ implementation of tabu search for k- cardinality tree problem based on generic programming and component reuse","author":"MJ Blesa","year":"2000","unstructured":"Blesa MJ, Xhafa F (2000) A c++ implementation of tabu search for k- cardinality tree problem based on generic programming and component reuse. Young Researchers Workshop, Citeseer"},{"issue":"6","key":"9509_CR5","doi-asserted-by":"publisher","first-page":"1355","DOI":"10.1016\/j.cor.2003.11.007","volume":"32","author":"C Blum","year":"2005","unstructured":"Blum C, Blesa MJ (2005) New metaheuristic approaches for the edge-weighted k-cardinality tree problem. Comput Oper Res 32(6):1355\u20131377","journal-title":"Comput Oper Res"},{"key":"9509_CR6","doi-asserted-by":"crossref","unstructured":"Chechik S (2013) Compact routing schemes with improved stretch. In: Proceedings of the 2013 ACM symposium on Principles of distributed computing, pp 33\u201341","DOI":"10.1145\/2484239.2484268"},{"issue":"1","key":"9509_CR7","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1006\/jagm.2000.1134","volume":"38","author":"LJ Cowen","year":"2001","unstructured":"Cowen LJ (2001) Compact routing with minimum stretch. J Algorithms 38(1):170\u2013183","journal-title":"J Algorithms"},{"issue":"10","key":"9509_CR8","doi-asserted-by":"publisher","first-page":"1367","DOI":"10.1016\/j.cor.2010.12.002","volume":"38","author":"T Davidovi\u0107","year":"2011","unstructured":"Davidovi\u0107 T, Ramljak D, \u0160elmi\u0107 M, Teodorovi\u0107 D (2011) Bee colony optimization for the p-center problem. Comput Oper Res 38(10):1367\u20131376","journal-title":"Comput Oper Res"},{"issue":"2","key":"9509_CR9","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/S0196-6774(03)00002-6","volume":"46","author":"T Eilam","year":"2003","unstructured":"Eilam T, Gavoille C, Peleg D (2003) Compact routing schemes with low stretch factor. J Algorithms 46(2):97\u2013114","journal-title":"J Algorithms"},{"key":"9509_CR10","doi-asserted-by":"crossref","unstructured":"Enachescu M, Wang M, Goel A (2008) Reducing maximum stretch in compact routing. In: IEEE INFOCOM 2008-The 27th Conference on Computer Communications, pp 336\u2013340. IEEE","DOI":"10.1109\/INFOCOM.2008.76"},{"key":"9509_CR11","doi-asserted-by":"publisher","first-page":"109228","DOI":"10.1109\/ACCESS.2019.2933875","volume":"7","author":"J Garcia-Diaz","year":"2019","unstructured":"Garcia-Diaz J, Menchaca-Mendez R, Menchaca-Mendez R, Hern\u00e1ndez SP, P\u00e9rez-Sansalvador JC, Lakouari N (2019) Approximation algorithms for the vertex k-center problem: Survey and experimental evaluation. IEEE Access 7:109228\u2013109245","journal-title":"IEEE Access"},{"issue":"3","key":"9509_CR12","doi-asserted-by":"publisher","first-page":"853","DOI":"10.1016\/j.ejor.2020.02.045","volume":"285","author":"S Ghoshal","year":"2020","unstructured":"Ghoshal S, Sundar S (2020) Two heuristics for the rainbow spanning forest problem. Eur J Oper Res 285(3):853\u2013864","journal-title":"Eur J Oper Res"},{"issue":"3","key":"9509_CR13","doi-asserted-by":"publisher","first-page":"853","DOI":"10.1016\/j.ejor.2020.02.045","volume":"285","author":"S Ghoshal","year":"2020","unstructured":"Ghoshal S, Sundar S (2020) Two heuristics for the rainbow spanning forest problem. Eur J Oper Res 285(3):853\u2013864","journal-title":"Eur J Oper Res"},{"key":"9509_CR14","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2021.107715","volume":"111","author":"S Ghoshal","year":"2021","unstructured":"Ghoshal S, Sundar S (2021) Two approaches for the min-degree constrained minimum spanning tree problem. Appl Soft Comput 111:107715","journal-title":"Appl Soft Comput"},{"key":"9509_CR15","volume-title":"An idea based on honey bee swarm for numerical optimization","author":"D Karaboga","year":"2005","unstructured":"Karaboga D (2005) An idea based on honey bee swarm for numerical optimization. Technical report, Citeseer"},{"issue":"1\u20134","key":"9509_CR16","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 (2009) A survey: algorithms simulating bee swarm intelligence. Artif Intell Rev 31(1\u20134):61","journal-title":"Artif Intell Rev"},{"issue":"1","key":"9509_CR17","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 (2014) A comprehensive survey: artificial bee colony (abc) algorithm and applications. Artif Intell Rev 42(1):21\u201357","journal-title":"Artif Intell Rev"},{"issue":"1\u20132","key":"9509_CR18","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/S0304-3975(98)00222-9","volume":"242","author":"S Khuller","year":"2000","unstructured":"Khuller S, Pless R, Sussmann YJ (2000) Fault tolerant k-center problems. Theor Comput Sci 242(1\u20132):237\u2013245","journal-title":"Theor Comput Sci"},{"issue":"3","key":"9509_CR19","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1137\/S0895480197329776","volume":"13","author":"S Khuller","year":"2000","unstructured":"Khuller S, Sussmann YJ (2000) The capacitated k-center problem. SIAM J Discr Math 13(3):403\u2013418","journal-title":"SIAM J Discr Math"},{"issue":"5","key":"9509_CR20","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1016\/j.orl.2003.11.011","volume":"32","author":"J K\u00f6nemann","year":"2004","unstructured":"K\u00f6nemann J, Li Y, Parekh O, Sinha A (2004) An approximation algorithm for the edge-dilation k-center problem. Oper Res Lett 32(5):491\u2013495","journal-title":"Oper Res Lett"},{"issue":"3","key":"9509_CR21","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1145\/1273445.1273450","volume":"37","author":"D Krioukov","year":"2007","unstructured":"Krioukov D, Claffy K, Fall K, Brady A (2007) On compact routing for the internet. ACM SIGCOMM Comput Commun Rev 37(3):41\u201352","journal-title":"ACM SIGCOMM Comput Commun Rev"},{"key":"9509_CR22","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1016\/j.cor.2018.12.017","volume":"104","author":"AD L\u00f3pez-S\u00e1nchez","year":"2019","unstructured":"L\u00f3pez-S\u00e1nchez AD, S\u00e1nchez-Oro J, Hern\u00e1ndez-D\u00edaz AG (2019) Grasp and vns for solving the p-next center problem. Comput Oper Res 104:295\u2013303","journal-title":"Comput Oper Res"},{"key":"9509_CR23","unstructured":"Lu\u010di\u0107 P, Teodorovi\u0107 D (2001) Bee system: modeling combinatorial optimization transportation engineering problems by swarm intelligence. u: Preprints of the triennial symposium on transportation analysis tristan iv. Azores, Portugal, June, pp 13\u201319"},{"key":"9509_CR24","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1016\/j.cie.2017.09.029","volume":"113","author":"D Matic","year":"2017","unstructured":"Matic D, Kratica J, Maksimovic Z (2017) Solving the minimum edge-dilation k-center problem by genetic algorithms. Comput Ind Eng 113:282\u2013293","journal-title":"Comput Ind Eng"},{"key":"9509_CR25","doi-asserted-by":"crossref","unstructured":"Moy J (1998) Ospf version 2, ietf rfc 2328,1998 (at http:\/\/www.ietf.org\/rfc)","DOI":"10.17487\/rfc2328"},{"key":"9509_CR26","doi-asserted-by":"crossref","unstructured":"Olague G, Puente C (2006) The honeybee search algorithm for three-dimensional reconstruction. In: Workshops on applications of evolutionary computation, Springer, pp 427\u2013437","DOI":"10.1007\/11732242_38"},{"key":"9509_CR27","doi-asserted-by":"crossref","unstructured":"Osaba E, Villar-Rodriguez E, Del\u00a0Ser J, Nebro AJ, Molina D, LaTorre A, Suganthan PN, Coello C AC, Herrera F (2021) A tutorial on the design, experimentation and application of metaheuristic algorithms to real-world optimization problems. Swarm Evolut Comput, p 100888","DOI":"10.1016\/j.swevo.2021.100888"},{"issue":"12","key":"9509_CR28","doi-asserted-by":"publisher","first-page":"2455","DOI":"10.1016\/j.ins.2009.12.025","volume":"181","author":"Q-K Pan","year":"2011","unstructured":"Pan Q-K, Tasgetiren MF, Suganthan PN, Chua TJ (2011) A discrete artificial bee colony algorithm for the lot-streaming flow shop scheduling problem. Inf Sci 181(12):2455\u20132468","journal-title":"Inf Sci"},{"issue":"3","key":"9509_CR29","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1145\/65950.65953","volume":"36","author":"D Peleg","year":"1989","unstructured":"Peleg D, Upfal E (1989) A trade-off between space and efficiency for routing tables. J ACM (JACM) 36(3):510\u2013530","journal-title":"J ACM (JACM)"},{"key":"9509_CR30","doi-asserted-by":"crossref","unstructured":"Pham DT, Ghanbarzadeh A, Ko\u00e7 E, Otri S, Rahim S, Zaidi M (2006) The bees algorithm-a novel tool for complex optimisation problems. In Intelligent production machines and systems, Elsevier, pp 454\u2013459","DOI":"10.1016\/B978-008045157-2\/50081-X"},{"key":"9509_CR31","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.swevo.2016.06.001","volume":"32","author":"A Rajasekhar","year":"2017","unstructured":"Rajasekhar A, Lynn N, Das S, Suganthan PN (2017) Computing with the collective intelligence of honey bees-a survey. Swarm Evolut Comput 32:25\u201348","journal-title":"Swarm Evolut Comput"},{"key":"9509_CR32","doi-asserted-by":"crossref","unstructured":"Roditty L, Tov R (2015) New routing techniques and their applications. In: Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, pp 23\u201332","DOI":"10.1145\/2767386.2767409"},{"issue":"2","key":"9509_CR33","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 (2009) An artificial bee colony algorithm for the leaf-constrained minimum spanning tree problem. Appl Soft Comput 9(2):625\u2013631","journal-title":"Appl Soft Comput"},{"key":"9509_CR34","doi-asserted-by":"crossref","unstructured":"Singh K, Sundar S (2018) Artifical bee colony algorithm using problem-specific neighborhood strategies for the tree $$t$$-spanner problem. Appl Soft Comput 62:110\u2013118","DOI":"10.1016\/j.asoc.2017.10.022"},{"issue":"8","key":"9509_CR35","doi-asserted-by":"publisher","first-page":"2247","DOI":"10.1007\/s10489-017-1075-0","volume":"48","author":"K Singh","year":"2018","unstructured":"Singh K, Sundar S (2018) Two new heuristics for the dominating tree problem. Appl Intell 48(8):2247\u20132267","journal-title":"Appl Intell"},{"issue":"5","key":"9509_CR36","doi-asserted-by":"publisher","first-page":"1193","DOI":"10.1007\/s00500-015-1852-9","volume":"21","author":"S Sundar","year":"2017","unstructured":"Sundar S, Suganthan PN, Chua TJ, Cai TX, Soon CC (2017) A hybrid artificial bee colony algorithm for the job-shop scheduling problem with no-wait constraint. Soft Comput 21(5):1193\u20131202","journal-title":"Soft Comput"},{"key":"9509_CR37","doi-asserted-by":"crossref","unstructured":"Thorup M, Zwick U (2001) Compact routing schemes. In: 13th annual acm symposium on parallel algorithms and architectures (spaa)","DOI":"10.1145\/378580.378581"},{"key":"9509_CR38","doi-asserted-by":"crossref","unstructured":"Wedde HF, Farooq M, Zhang Y (2004) Beehive: an efficient fault-tolerant routing algorithm inspired by honey bee behavior. In: International Workshop on Ant Colony Optimization and Swarm Intelligence, Springer, pp 83\u201394","DOI":"10.1007\/978-3-540-28646-2_8"},{"key":"9509_CR39","unstructured":"Wilcoxon F (1945) Wilcoxon signed-rank test calculator. https:\/\/www.socscistatistics.com\/tests\/signedranks\/default2.aspx"},{"key":"9509_CR40","doi-asserted-by":"crossref","unstructured":"Xu Y, Peng J, Xu Y (2018) The mixed center location problem. J Combin Optim 36(4):1128-1144","DOI":"10.1007\/s10878-017-0183-4"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-023-09509-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00500-023-09509-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-023-09509-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,17]],"date-time":"2024-08-17T06:53:51Z","timestamp":1723877631000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00500-023-09509-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7]]},"references-count":40,"journal-issue":{"issue":"13-14","published-print":{"date-parts":[[2024,7]]}},"alternative-id":["9509"],"URL":"https:\/\/doi.org\/10.1007\/s00500-023-09509-7","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,7]]},"assertion":[{"value":"22 November 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 July 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}