{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T21:07:01Z","timestamp":1761599221106,"version":"3.37.3"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"16","license":[{"start":{"date-parts":[[2021,7,8]],"date-time":"2021-07-08T00:00:00Z","timestamp":1625702400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,7,8]],"date-time":"2021-07-08T00:00:00Z","timestamp":1625702400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001843","name":"Science and Engineering Research Board","doi-asserted-by":"publisher","award":["YSS\/2015\/000276"],"award-info":[{"award-number":["YSS\/2015\/000276"]}],"id":[{"id":"10.13039\/501100001843","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2021,8]]},"DOI":"10.1007\/s00500-021-05913-z","type":"journal-article","created":{"date-parts":[[2021,7,8]],"date-time":"2021-07-08T20:02:20Z","timestamp":1625774540000},"page":"11289-11305","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Artificial bee colony algorithm using permutation encoding for the bounded diameter minimum spanning tree problem"],"prefix":"10.1007","volume":"25","author":[{"given":"Kavita","family":"Singh","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9679-0892","authenticated-orcid":false,"given":"Shyam","family":"Sundar","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,7,8]]},"reference":[{"key":"5913_CR1","first-page":"161","volume":"144","author":"A Abdalla","year":"2000","unstructured":"Abdalla A, Deo N, Gupta P (2000) Random-tree diameter and the diameter constrained mst. Cong Numer 144:161\u2013182","journal-title":"Cong Numer"},{"key":"5913_CR2","first-page":"51","volume":"10","author":"NR Achuthan","year":"1994","unstructured":"Achuthan NR, Caccetta L, Caccetta P, Geelen JF (1994) Computational methods for the diameter restricted minimum weight spanning tree problem. Aust J Comb 10:51\u201372","journal-title":"Aust J Comb"},{"issue":"1","key":"5913_CR3","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/s11263-013-0661-9","volume":"110","author":"R Anderson","year":"2014","unstructured":"Anderson R, Stenger B, Cipolla R (2014) Using bounded diameter minimum spanning trees to build dense active appearance models. Int J Comput Vis 110(1):48\u201357","journal-title":"Int J Comput Vis"},{"key":"5913_CR4","doi-asserted-by":"crossref","unstructured":"Bala K, Petropoulos K, Stern TE (1993) Multicasting in a linear lightwave network. In: Proceedings of IEEE INFOCOM\u201993, pp 1350\u20131358","DOI":"10.1109\/INFCOM.1993.253399"},{"key":"5913_CR5","unstructured":"Binh HTT, Hoai NX, McKay RI (2008) A new hybrid genetic algorithm for solving the bounded diameter minimum spanning tree problem. In: Proceedings of the IEEE Congress on Evolutionary Computation, CEC 2008, June 1\u20136, 2008, Hong Kong, China, pp 3128\u20133134"},{"key":"5913_CR6","first-page":"110","volume":"16","author":"A Bookstein","year":"1996","unstructured":"Bookstein A, Klein ST (1996) Compression of correlated bit-vectors. Inf Syst 16:110\u2013118","journal-title":"Inf Syst"},{"key":"5913_CR7","doi-asserted-by":"crossref","unstructured":"Deo N, Abdalla AM (2000) Computing a diameter-constrained minimum spanning tree in parallel. In: Bongiovanni GC, Gambosi G, Petreschi R (eds) Algorithms and Complexity, 4th Italian Conference, CIAC 2000, Rome, Italy, March 2000, Proceedings, Springer, Lecture Notes in Computer Science, vol 1767, pp 17\u201331","DOI":"10.1007\/3-540-46521-9_2"},{"issue":"6","key":"5913_CR8","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1007\/s10732-008-9080-4","volume":"15","author":"S Garc\u00eda","year":"2009","unstructured":"Garc\u00eda S, Molina D, Lozano M, Herrera F (2009) A study on the use of non-parametric tests for analyzing the evolutionary algorithms behaviour: a case study on the cec 2005 special session on real parameter optimization. J Heuristics 15(6):617\u2013644","journal-title":"J Heuristics"},{"key":"5913_CR9","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. Freeman, San Francisco"},{"issue":"3","key":"5913_CR10","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1002\/net.10069","volume":"41","author":"L Gouveia","year":"2003","unstructured":"Gouveia L, Magnanti TL (2003) Network flow models for designing diameter-constrained minimum-spanning and steiner trees. Networks 41(3):159\u2013173","journal-title":"Networks"},{"issue":"1\u20132","key":"5913_CR11","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/s10107-009-0297-2","volume":"128","author":"L Gouveia","year":"2011","unstructured":"Gouveia L, Simonetti L, Uchoa E (2011) Modeling hop-constrained and diameter-constrained minimum spanning tree problems as steiner tree problems over layered graphs. Math Program 128(1\u20132):123\u2013148","journal-title":"Math Program"},{"key":"5913_CR12","unstructured":"Gruber M, Raidl GR (2005) Variable neighborhood search for the bounded diameter minimum spanning tree problem. In: Proceedings of the 18th Mini Euro Conference on Variable Neighborhood Search, Tenerife, Spain"},{"key":"5913_CR13","doi-asserted-by":"publisher","unstructured":"Gruber M, Raidl GR (2008) Heuristic cut separation in a branch and cut approach for the bounded diameter minimum spanning tree problem. In: Proceedings of the 2008 International Symposium on Applications and the Internet, SAINT 2008, 28 July - 1 August 2008, Turku, Finland, IEEE Computer Society, pp 261\u2013264, https:\/\/doi.org\/10.1109\/SAINT.2008.68","DOI":"10.1109\/SAINT.2008.68"},{"key":"5913_CR14","doi-asserted-by":"crossref","unstructured":"Gruber M, Raidl GR (2009) Exploiting hierarchical clustering for finding bounded diameter minimum spanning trees on euclidean instances. In: Genetic and Evolutionary Computation Conference, GECCO 2009, Proceedings, Montreal, Qu\u00e9bec, Canada, July 8\u201312, 2009, ACM, pp 263\u2013270","DOI":"10.1145\/1569901.1569939"},{"key":"5913_CR15","doi-asserted-by":"crossref","unstructured":"Gruber M, An\u00a0Hemert JI, Raidl GR (2006) Neighbourhood searches for the bounded diameter minimum spanning tree problem embedded in a VNS, EA, and ACO. In: Genetic and Evolutionary Computation Conference, GECCO 2006, Proceedings, Seattle, Washington, USA, July 8\u201312, 2006, pp 1187\u20131194","DOI":"10.1145\/1143997.1144185"},{"key":"5913_CR16","unstructured":"Julstrom BA (2003) A permutation-coded evolutionary algorithm for the bounded-diameter minimum spanning tree problem. In: Proceedings of the 2003 Genetic and Evolutionary Computation Conference\u2019s Workshops Proceedings, Workshop on Analysis and Design of Representations, pp 2\u20137"},{"key":"5913_CR17","doi-asserted-by":"crossref","unstructured":"Julstrom BA (2004) Encoding bounded-diameter spanning trees with permutations and with random keys. Lecture Notes in Computer Science, Springer, Berlin Heidelberg New York 3102:1272\u20131281","DOI":"10.1007\/978-3-540-24854-5_122"},{"key":"5913_CR18","doi-asserted-by":"publisher","DOI":"10.1145\/1498698.1498699","author":"BA Julstrom","year":"2009","unstructured":"Julstrom BA (2009) Greedy heuristics for the bounded diameter minimum spanning tree problem. ACM J Exp Algorithmics. doi. https:\/\/doi.org\/10.1145\/1498698.1498699","journal-title":"ACM J Exp Algorithmics. doi"},{"key":"5913_CR19","unstructured":"Karaboga D (2005) An idea based on honey bee swarm for numerical optimization. Engineering Faculty, Erciyes University, Turkey, Computer Engineering Department"},{"key":"5913_CR20","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 (2007) A powerful and efficient algorithm for numeric function optimization: artificial bee colony (ABC) algorithm. J Global Optim 39:459\u2013471","journal-title":"J Global Optim"},{"issue":"1","key":"5913_CR21","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":"3","key":"5913_CR22","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/s10898-009-9430-2","volume":"46","author":"A Lucena","year":"2010","unstructured":"Lucena A, Ribeiro CC, Santos AC (2010) A hybrid heuristic for the diameter constrained minimum spanning tree problem. J Global Optim 46(3):363\u2013381","journal-title":"J Global Optim"},{"key":"5913_CR23","doi-asserted-by":"publisher","first-page":"2455","DOI":"10.1016\/j.ins.2009.12.025","volume":"181","author":"QK Pan","year":"2011","unstructured":"Pan QK, Tasgetiren MF, Suganthan PN, Chua TJ (2011) A discrete artificial bee colony algorithm for the lot-streaming flow shop scheduling problem. Inf Sci 181:2455\u20132468","journal-title":"Inf Sci"},{"key":"5913_CR24","doi-asserted-by":"crossref","unstructured":"Patvardhan C, Prakash VP (2009) Novel deterministic heuristics for building minimum spanning trees with constrained diameter. In: Pattern Recognition and Machine Intelligence, LNCS, pp 68\u201373","DOI":"10.1007\/978-3-642-11164-8_12"},{"key":"5913_CR25","doi-asserted-by":"crossref","unstructured":"Patvardhan C, Prakash VP, Srivastav A (2014) Parallel heuristics for the bounded diameter minimum spanning tree problem. In: Annual IEEE India conference (INDICON), pp 1\u20135","DOI":"10.1109\/INDICON.2014.7030575"},{"issue":"3","key":"5913_CR26","first-page":"281","volume":"39","author":"C Patvardhan","year":"2015","unstructured":"Patvardhan C, Prakash VP, Srivastav A (2015) Fast heuristics for large instances of the euclidean bounded diameter minimum spanning tree problem. Inform (Slovenia) 39(3):281\u2013292","journal-title":"Inform (Slovenia)"},{"key":"5913_CR27","doi-asserted-by":"publisher","unstructured":"Prakash VP, Patvardhan C, Srivastav A (2018) Effective heuristics for the bi-objective euclidean bounded diameter minimum spanning tree problem. In: Bhattacharyya P, Sastry H, Marriboyina V, Sharma R (eds) Smart and Innovative Trends in Next Generation Computing Technologies. NGCT 2017. Communications in Computer and Information Science, Springer, Singapore, vol 827, pp 580\u2013589, https:\/\/doi.org\/10.1007\/978-981-10-8657-1_44","DOI":"10.1007\/978-981-10-8657-1_44"},{"key":"5913_CR28","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2019.103237","author":"VP Prakash","year":"2020","unstructured":"Prakash VP, Patvardhan C, Srivastav A (2020) A novel hybrid multi-objective evolutionary algorithm for the bi-objective minimum diameter-cost spanning tree (bi-mdcst) problem. Eng Appl Artif Intell. https:\/\/doi.org\/10.1016\/j.engappai.2019.103237","journal-title":"Eng Appl Artif Intell"},{"key":"5913_CR29","doi-asserted-by":"publisher","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","volume":"36","author":"R Prim","year":"1957","unstructured":"Prim R (1957) Shortest connection networks and some generalizations. Bell Syst Tech J 36:1389\u20131401","journal-title":"Bell Syst Tech J"},{"key":"5913_CR30","doi-asserted-by":"crossref","unstructured":"Raidl GR, Julstrom BA (2003) Greedy heuristics and an evolutionary algorithm for the bounded-diameter minimum spanning tree problem. In: Proceedings of the 2003 ACM Symposium on Applied Computing (SAC), March 9\u201312, 2003, Melbourne, FL, USA, pp 747\u2013752","DOI":"10.1145\/952532.952678"},{"key":"5913_CR31","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1145\/58564.59295","volume":"7","author":"K Raymond","year":"1989","unstructured":"Raymond K (1989) A tree-based algorithm for distributed mutual exclusion. ACM Trans Comput Syst 7:61\u201377","journal-title":"ACM Trans Comput Syst"},{"key":"5913_CR32","doi-asserted-by":"crossref","unstructured":"Saha S, Kumar R (2011) Improvement of bounded-diameter MST instances with hybridization of multi-objective EA. In: Jena SK, Kumar R, Turuk AK, Dash M (eds) Proceedings of the 2011 International Conference on Communication, Computing and Security, ICCCS 2011, Odisha, India, February 12\u201314, 2011, ACM, pp 468\u2013473","DOI":"10.1145\/1947940.1948036"},{"key":"5913_CR33","doi-asserted-by":"crossref","unstructured":"Saha S, Aslam M, Kumar R (2010) Assessing the performance of bi-objective MST for euclidean and non-euclidean instances. In: Ranka S, Banerjee A, Biswas KK, Dua S, Mishra P, Moona R, Poon S, Wang C (eds) Contemporary Computing: Third International Conference, IC3 2010, Noida, India, August 9\u201311, 2010. Proceedings, Part I, Springer, Communications in Computer and Information Science, vol\u00a094, pp 229\u2013240","DOI":"10.1007\/978-3-642-14834-7_22"},{"key":"5913_CR34","first-page":"90","volume":"2009","author":"R Saxena","year":"2009","unstructured":"Saxena R, Singh A (2009) Solving bounded diameter minimum spanning tree problem with improved heuristics. ADCOM 2009:90\u201395","journal-title":"ADCOM"},{"issue":"2","key":"5913_CR35","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"},{"issue":"10","key":"5913_CR36","doi-asserted-by":"publisher","first-page":"911","DOI":"10.1007\/s00500-006-0142-y","volume":"11","author":"A Singh","year":"2007","unstructured":"Singh A, Gupta AK (2007) Improved heuristics for the bounded-diameter minimum spanning tree problem. Soft Comput 11(10):911\u2013921","journal-title":"Soft Comput"},{"issue":"1","key":"5913_CR37","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1287\/ijoc.2014.0617","volume":"27","author":"W Steitz","year":"2015","unstructured":"Steitz W (2015) New heuristic approaches for the bounded-diameter minimum spanning tree problem. INFORMS J Comput 27(1):151\u2013163","journal-title":"INFORMS J Comput"},{"issue":"17","key":"5913_CR38","doi-asserted-by":"publisher","first-page":"3182","DOI":"10.1016\/j.ins.2010.05.001","volume":"180","author":"S Sundar","year":"2010","unstructured":"Sundar S, Singh A (2010) A swarm intelligence approach to the quadratic minimum spanning tree problem. Inf Sci 180(17):3182\u20133191","journal-title":"Inf Sci"},{"key":"5913_CR39","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.swevo.2011.12.002","volume":"4","author":"S Sundar","year":"2012","unstructured":"Sundar S, Singh A (2012) A swarm intelligence approach to the early\/tardy scheduling problem. Swarm Evolut Comput 4:25\u201332","journal-title":"Swarm Evolut Comput"},{"issue":"11","key":"5913_CR40","doi-asserted-by":"publisher","first-page":"1977","DOI":"10.1007\/s00500-012-0869-6","volume":"16","author":"JA Torkestani","year":"2012","unstructured":"Torkestani JA (2012) An adaptive heuristic to the bounded-diameter minimum spanning tree problem. Soft Comput 16(11):1977\u20131988","journal-title":"Soft Comput"},{"key":"5913_CR41","doi-asserted-by":"publisher","DOI":"10.1111\/exsy.12610","author":"PP Vuppuluri","year":"2021","unstructured":"Vuppuluri PP, Patvardhan C (2021) Serial and parallel memetic algorithms for the bounded diameter minimum spanning tree problem. Expert Syst J Knowl Eng. https:\/\/doi.org\/10.1111\/exsy.12610","journal-title":"Expert Syst J Knowl Eng"},{"key":"5913_CR42","doi-asserted-by":"crossref","unstructured":"Wang S, Lang SD (1994) A tree-based distributed algorithm for the k-entry critical section problem. In: Proceedings of the 1994 International Conference on Parallel and Distributed Systems, IEEE, pp 592\u2013597","DOI":"10.1109\/ICPADS.1994.590400"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-021-05913-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00500-021-05913-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-021-05913-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,5]],"date-time":"2022-12-05T19:19:15Z","timestamp":1670267955000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00500-021-05913-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,8]]},"references-count":42,"journal-issue":{"issue":"16","published-print":{"date-parts":[[2021,8]]}},"alternative-id":["5913"],"URL":"https:\/\/doi.org\/10.1007\/s00500-021-05913-z","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"type":"print","value":"1432-7643"},{"type":"electronic","value":"1433-7479"}],"subject":[],"published":{"date-parts":[[2021,7,8]]},"assertion":[{"value":"25 May 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 July 2021","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"}}]}}