{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,17]],"date-time":"2024-08-17T07:47:36Z","timestamp":1723880856298},"reference-count":35,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"funder":[{"name":"Science and Engineering Research Board \u2013 Department of Science & Technology, Government of India","award":["YSS\/2015\/000276"]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Applied Soft Computing"],"published-print":{"date-parts":[[2018,1]]},"DOI":"10.1016\/j.asoc.2017.10.022","type":"journal-article","created":{"date-parts":[[2017,10,23]],"date-time":"2017-10-23T17:06:36Z","timestamp":1508778396000},"page":"110-118","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":18,"special_numbering":"C","title":["Artifical bee colony algorithm using problem-specific neighborhood strategies for the tree t-spanner problem"],"prefix":"10.1016","volume":"62","author":[{"given":"Kavita","family":"Singh","sequence":"first","affiliation":[]},{"given":"Shyam","family":"Sundar","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.asoc.2017.10.022_bib0005","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1016\/j.asoc.2015.01.013","article-title":"Constrained binary artificial bee colony to minimize the makespan for single machine batch processing with non-identical job sizes","volume":"29","author":"Al-Salamah","year":"2015","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.asoc.2017.10.022_bib0010","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/BF02189308","article-title":"On sparse spanners of weighted graphs","volume":"9","author":"Alth\u00f3fer","year":"1993","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/j.asoc.2017.10.022_bib0015","series-title":"Efficient broadcast and light-weight spanners","author":"Awerbuch","year":"1992"},{"key":"10.1016\/j.asoc.2017.10.022_bib0020","first-page":"274","article-title":"Optimal simulations of tree machines","author":"Bhatt","year":"1986","journal-title":"Proceedings of 27th IEEE Foundation of Computer Science"},{"key":"10.1016\/j.asoc.2017.10.022_bib0025","series-title":"Tuning Metaheuristics: A Machine Learning Perspective","author":"Birattari","year":"2005"},{"key":"10.1016\/j.asoc.2017.10.022_bib0030","series-title":"Tree spanners: spanning trees that approximate distances","author":"Cai","year":"1992"},{"key":"10.1016\/j.asoc.2017.10.022_bib0035","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1137\/S0895480192237403","article-title":"Tree spanners","volume":"8","author":"Cai","year":"1995","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/j.asoc.2017.10.022_bib0040","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1016\/j.neucom.2013.07.056","article-title":"An improved discrete artificial bee colony algorithm to minimize the makespan on hybrid flow shop problems","volume":"148","author":"Cui","year":"2015","journal-title":"Neurocomputing"},{"key":"10.1016\/j.asoc.2017.10.022_bib0045","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/j.swevo.2011.02.001","article-title":"Parameter tuning for configuring and analyzing evolutionary algorithms","volume":"1","author":"Eiben","year":"2011","journal-title":"Swarm Evol. Comput."},{"key":"10.1016\/j.asoc.2017.10.022_bib0050","doi-asserted-by":"crossref","first-page":"1761","DOI":"10.1137\/060666202","article-title":"Approximating minimum max-stretch spanning trees on unweighted graphs","volume":"38","author":"Emek","year":"2008","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.asoc.2017.10.022_bib0055","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1137\/0213024","article-title":"Fast algorithms for finding nearest common ancestors","volume":"13","author":"Harel","year":"1984","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.asoc.2017.10.022_bib0060","doi-asserted-by":"crossref","first-page":"691","DOI":"10.1007\/s13042-015-0466-y","article-title":"A hybrid artificial bee colony algorithm for the cooperative maximum covering location problem","volume":"8","author":"Jayalakshmi","year":"2017","journal-title":"Int. J. Mach. Learn. Cybern."},{"key":"10.1016\/j.asoc.2017.10.022_bib0065","series-title":"An idea based on honey bee swarm for numerical optimization","author":"Karaboga","year":"2005"},{"key":"10.1016\/j.asoc.2017.10.022_bib0070","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1007\/s10898-007-9149-x","article-title":"A powerful and efficient algorithm for numeric function optimization: artificial bee colony (ABC) algorithm","volume":"39","author":"Karaboga","year":"2007","journal-title":"J. Glob. Optim."},{"key":"10.1016\/j.asoc.2017.10.022_bib0075","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/s10462-012-9328-0","article-title":"A comprehensive survey: artificial bee colony (ABC) algorithm and applications","volume":"42","author":"Karaboga","year":"2014","journal-title":"Artif. Intell. Rev."},{"key":"10.1016\/j.asoc.2017.10.022_bib0080","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1002\/net.3230230417","article-title":"Additive graph spanners","volume":"23","author":"Liestman","year":"1993","journal-title":"Networks"},{"key":"10.1016\/j.asoc.2017.10.022_bib0085","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1016\/j.swevo.2016.06.005","article-title":"Genetic algorithms to balanced tree structures in graphs","volume":"32","author":"Moharam","year":"2017","journal-title":"Swarm Evol. Comput."},{"key":"10.1016\/j.asoc.2017.10.022_bib0090","doi-asserted-by":"crossref","first-page":"2455","DOI":"10.1016\/j.ins.2009.12.025","article-title":"A discrete artificial bee colony algorithm for the lot-streaming flow shop scheduling problem","volume":"181","author":"Pan","year":"2011","journal-title":"Inf. Sci."},{"key":"10.1016\/j.asoc.2017.10.022_bib0095","series-title":"Low stretch spanning trees for planar graphs","author":"Peleg","year":"2001"},{"key":"10.1016\/j.asoc.2017.10.022_bib0100","series-title":"Proceedings of 6th ACM Symposium on Principles of Distributed Computing","first-page":"77","article-title":"An optimal synchronizer for the hypercube","author":"Peleg","year":"1987"},{"key":"10.1016\/j.asoc.2017.10.022_bib0105","series-title":"Proceedings of 20th ACM Symposium on Theory of Computing","first-page":"43","article-title":"A tradeoff between space and efficiency for routing tables","author":"Peleg","year":"1988"},{"key":"10.1016\/j.asoc.2017.10.022_bib0110","doi-asserted-by":"crossref","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","article-title":"Shortest connection networks and some generalizations","volume":"36","author":"Prim","year":"1957","journal-title":"Bell Syst. Tech. J."},{"key":"10.1016\/j.asoc.2017.10.022_bib0115","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1109\/TEVC.2002.807275","article-title":"Edge-sets: an effective evolutionary coding of spanning trees","volume":"7","author":"Raidl","year":"2003","journal-title":"IEEE Trans. Evol. Comput."},{"key":"10.1016\/j.asoc.2017.10.022_bib0120","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1016\/j.asoc.2008.09.001","article-title":"An artificial bee colony algorithm for the leaf-constrained minimum spanning tree problem","volume":"9","author":"Singh","year":"2009","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.asoc.2017.10.022_bib0125","doi-asserted-by":"crossref","DOI":"10.1007\/s10489-017-0950-z","article-title":"Hybrid artificial bee colony algorithm based approaches for two ring loading problems","author":"Singh","year":"2017","journal-title":"Appl. Intell."},{"key":"10.1016\/j.asoc.2017.10.022_bib0130","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1007\/s11047-016-9609-7","article-title":"Solving the non-unicost set covering problem by using cuckoo search and black hole optimization","volume":"16","author":"Soto","year":"2017","journal-title":"Nat. Comput."},{"key":"10.1016\/j.asoc.2017.10.022_bib0135","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/s11047-016-9576-z","article-title":"Online control of enumeration strategies via bat algorithm and black hole optimization","volume":"16","author":"Soto","year":"2017","journal-title":"Nat. Comput."},{"key":"10.1016\/j.asoc.2017.10.022_bib0140","doi-asserted-by":"crossref","first-page":"3182","DOI":"10.1016\/j.ins.2010.05.001","article-title":"A swarm intelligence approach to the quadratic minimum spanning tree problem","volume":"180","author":"Sundar","year":"2010","journal-title":"Inf. Sci."},{"key":"10.1016\/j.asoc.2017.10.022_bib0145","series-title":"Proceedings of the 17th International Conference on Neural Information Processing (ICONIP 2010), vol. 6443","first-page":"626","article-title":"A swarm intelligence approach to the quadratic multiple knapsack problem","author":"Sundar","year":"2010"},{"key":"10.1016\/j.asoc.2017.10.022_bib0150","doi-asserted-by":"crossref","first-page":"4695","DOI":"10.1016\/j.asoc.2013.07.014","article-title":"New heuristic approaches for the dominating tree problem","volume":"13","author":"Sundar","year":"2013","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.asoc.2017.10.022_bib0155","doi-asserted-by":"crossref","first-page":"1237","DOI":"10.1109\/JSYST.2014.2342931","article-title":"Metaheuristic approaches for the blockmodel problem","volume":"9","author":"Sundar","year":"2015","journal-title":"IEEE Syst. J."},{"key":"10.1016\/j.asoc.2017.10.022_bib0160","doi-asserted-by":"crossref","first-page":"1237","DOI":"10.1109\/JSYST.2014.2342931","article-title":"Metaheuristic approaches for the blockmodel problem","volume":"9","author":"Sundar","year":"2015","journal-title":"IEEE Syst. J."},{"key":"10.1016\/j.asoc.2017.10.022_bib0165","first-page":"1","article-title":"A hybrid artificial bee colony algorithm for the job-shop scheduling problem with no-wait constraint","volume":"7","author":"Sundar","year":"2015","journal-title":"Soft Comput."},{"key":"10.1016\/j.asoc.2017.10.022_bib0170","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1006\/inco.1997.2641","article-title":"Restrictions of minimum spanner problems","volume":"136","author":"Venkatesan","year":"1997","journal-title":"Inf. Comput."},{"key":"10.1016\/j.asoc.2017.10.022_bib0175","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1016\/j.adhoc.2016.07.001","article-title":"A binary artificial bee colony algorithm for constructing spanning trees in vehicular ad hoc networks","volume":"58","author":"Zhang","year":"2017","journal-title":"Ad Hoc Netw."}],"container-title":["Applied Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1568494617306270?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1568494617306270?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,10,3]],"date-time":"2018-10-03T16:48:07Z","timestamp":1538585287000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1568494617306270"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,1]]},"references-count":35,"alternative-id":["S1568494617306270"],"URL":"https:\/\/doi.org\/10.1016\/j.asoc.2017.10.022","relation":{},"ISSN":["1568-4946"],"issn-type":[{"value":"1568-4946","type":"print"}],"subject":[],"published":{"date-parts":[[2018,1]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Artifical bee colony algorithm using problem-specific neighborhood strategies for the tree t-spanner problem","name":"articletitle","label":"Article Title"},{"value":"Applied Soft Computing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.asoc.2017.10.022","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2017 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}