{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,12]],"date-time":"2024-06-12T16:10:03Z","timestamp":1718208603193},"reference-count":45,"publisher":"Wiley","issue":"3","license":[{"start":{"date-parts":[[2015,11,20]],"date-time":"2015-11-20T00:00:00Z","timestamp":1447977600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Int Trans Operational Res"],"published-print":{"date-parts":[[2017,5]]},"abstract":"Abstract<\/jats:title>In this paper, we study thek<\/jats:italic>\u2010labeled spanning forest (kLSF) problem in which an undirected graph whose edges are labeled and an integer\u2010positive valueare given; the aim is to find a spanning forest of the input graph with the minimum number of connected components and the upper boundon the number of labels. The problem is related to the minimum labeling spanning tree problem and has several applications in the real world. In this paper, we compare several metaheuristics to solve this NP\u2010hard problem. In particular, the proposed intelligent variable neighborhood search (VNS) shows excellent performance, obtaining high\u2010quality solutions in short computational running time. This approach integrates VNS with other complementary approaches from machine learning, statistics, and experimental algorithmics, in order to produce high\u2010quality performance and completely automate the resulting optimization strategy.<\/jats:p>","DOI":"10.1111\/itor.12217","type":"journal-article","created":{"date-parts":[[2015,11,20]],"date-time":"2015-11-20T19:57:18Z","timestamp":1448049438000},"page":"559-582","update-policy":"http:\/\/dx.doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Comparison of metaheuristics for thek<\/i>\u2010labeled spanning forest problem"],"prefix":"10.1111","volume":"24","author":[{"given":"Sergio","family":"Consoli","sequence":"first","affiliation":[{"name":"National Research Council (CNR) Institute of Cognitive Sciences and Technologies Via Gaifami 18 95028 Catania Italy"}]},{"given":"Jos\u00e9 Andr\u00e9s","family":"Moreno P\u00e9rez","sequence":"additional","affiliation":[{"name":"Department of Computing Engineering University of La Laguna 38271 Santa Cruz de Tenerife Spain"}]},{"given":"Nenad","family":"Mladenovi\u0107","sequence":"additional","affiliation":[{"name":"LAMIH CNRS University of Valenciennes F\u201059313 Valenciennes Cedex 9 France"}]}],"member":"311","published-online":{"date-parts":[[2015,11,20]]},"reference":[{"key":"e_1_2_9_2_1","doi-asserted-by":"crossref","unstructured":"Aarts E. Korst J. Michiels W. 2005.Simulated annealing. In Burke E.K. Kendall G. (eds)Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques. Springer\u2010Verlag New York pp.187\u2013210.","DOI":"10.1007\/0-387-28356-0_7"},{"key":"e_1_2_9_3_1","volume-title":"The LION Way: Machine Learning Plus Intelligent Optimization","author":"Battiti R.","year":"2014"},{"key":"e_1_2_9_4_1","volume-title":"Operations Research\/Computer Science Interfaces Series","author":"Battiti R.","year":"2008"},{"key":"e_1_2_9_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00483-4"},{"key":"e_1_2_9_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2009.03.002"},{"key":"e_1_2_9_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2011.02.032"},{"key":"e_1_2_9_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/937503.937505"},{"key":"e_1_2_9_9_1","volume-title":"Optimization in Engineering Sciences: Approximate and Metaheuristic Methods","author":"Borne P.","year":"2014"},{"key":"e_1_2_9_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6377(02)00241-9"},{"key":"e_1_2_9_11_1","doi-asserted-by":"publisher","DOI":"10.14778\/2536222.2536247"},{"key":"e_1_2_9_12_1","unstructured":"Carr R.D. Doddi S. Konjevod G. Marathe M. 2000.On the red\u2010blue set cover problem.Proceedings of the 11th Annual ACM\u2010SIAM Symposium on Discrete Algorithms. San Francisco CA pp.345\u2013353."},{"key":"e_1_2_9_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2008.05.012"},{"key":"e_1_2_9_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.sbspro.2013.12.828"},{"key":"e_1_2_9_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/0-387-23529-9_7"},{"key":"e_1_2_9_16_1","doi-asserted-by":"crossref","first-page":"39","DOI":"10.26636\/jtit.2006.4.396","article-title":"Extensions of the minimum labeling spanning tree problem","volume":"4","author":"Cerulli R.","year":"2006","journal-title":"Journal of Telecommunications and Information Technology"},{"key":"e_1_2_9_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(97)00127-0"},{"key":"e_1_2_9_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-77780-1_9"},{"key":"e_1_2_9_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2008.03.014"},{"key":"e_1_2_9_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-008-0507-y"},{"key":"e_1_2_9_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2014.12.020"},{"key":"e_1_2_9_22_1","first-page":"75","volume-title":"Proceedings of the Mini EURO Conference XXVIII on Variable Neighbourhood Search (EUROmC\u2010XXVIII\u2010VNS), Vol. 39","author":"Consoli S.","year":"2012"},{"key":"e_1_2_9_23_1","first-page":"29","volume-title":"Proceedings of the 3rd International Conference on Variable Neighborhood Search (VNS'2014), Vol. 47","author":"Consoli S.","year":"2015"},{"key":"e_1_2_9_24_1","first-page":"313","volume-title":"Nature Inspired Cooperative Strategies for Optimization, Vol. 129, Studies in Computational Intelligence","author":"Consoli S.","year":"2008"},{"key":"e_1_2_9_25_1","first-page":"399","volume-title":"Proceedings of the International Network Optimization Conference (INOC 2013), Vol. 41","author":"Consoli S.","year":"2013"},{"key":"e_1_2_9_26_1","first-page":"1","article-title":"Statistical comparison of classifiers over multiple data sets","volume":"7","author":"Dem\u015bar J.","year":"2006","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_2_9_27_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1475-3995.2009.00663.x"},{"key":"e_1_2_9_28_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1475-3995.2009.00664.x"},{"key":"e_1_2_9_29_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177731944"},{"key":"e_1_2_9_30_1","first-page":"24","volume-title":"Proceedings of the 4th International Conference on Genetic Algorithms","author":"Goldberg D.E.","year":"1991"},{"key":"e_1_2_9_31_1","doi-asserted-by":"publisher","DOI":"10.1002\/9781118577202"},{"key":"e_1_2_9_32_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(97)00031-2"},{"key":"e_1_2_9_33_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(98)00034-9"},{"key":"e_1_2_9_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-1306-7"},{"key":"e_1_2_9_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-44973-4_44"},{"key":"e_1_2_9_36_1","doi-asserted-by":"crossref","unstructured":"Miller J.S. 2006.Multimodal Statewide Transportation Planning: A Survey of State Practices.Transportation Research Board National Research Council VA.","DOI":"10.3141\/1981-11"},{"key":"e_1_2_9_37_1","volume-title":"Distribution\u2010free multiple comparisons. Ph.D. thesis","author":"Nemenyi P.B.","year":"1963"},{"key":"e_1_2_9_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-7997-1"},{"key":"e_1_2_9_39_1","doi-asserted-by":"publisher","DOI":"10.1504\/IJMHEUR.2013.054143"},{"key":"e_1_2_9_40_1","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.1110.0396"},{"key":"e_1_2_9_41_1","volume-title":"Computer Networks: Pearson New International Edition","author":"Tanenbaum A.S.","year":"2013"},{"key":"e_1_2_9_42_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2004.03.035"},{"key":"e_1_2_9_43_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-005-2060-2"},{"key":"e_1_2_9_44_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2006.877147"},{"key":"e_1_2_9_45_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-48793-9_8"},{"key":"e_1_2_9_46_1","first-page":"39","volume-title":"Telecommunications Modeling, Policy, and Technology, Vol. 44, Operations Research\/Computer Science Interfaces","author":"Xiong Y.","year":"2008"}],"container-title":["International Transactions in Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1111%2Fitor.12217","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1111%2Fitor.12217","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1111\/itor.12217","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,12]],"date-time":"2024-06-12T15:52:49Z","timestamp":1718207569000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1111\/itor.12217"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,11,20]]},"references-count":45,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017,5]]}},"alternative-id":["10.1111\/itor.12217"],"URL":"https:\/\/doi.org\/10.1111\/itor.12217","archive":["Portico"],"relation":{},"ISSN":["0969-6016","1475-3995"],"issn-type":[{"value":"0969-6016","type":"print"},{"value":"1475-3995","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,11,20]]},"assertion":[{"value":"2015-02-13","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2015-09-25","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2015-11-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}