{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T20:15:09Z","timestamp":1762028109195,"version":"build-2065373602"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T00:00:00Z","timestamp":1605744000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T00:00:00Z","timestamp":1605744000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"name":"the Ministry of Chinese Education, Humanities, and Social Sciences Project","award":["17YJA630037"],"award-info":[{"award-number":["17YJA630037"]}]},{"name":"Graduate teaching reform research project of Hefei University of Technology","award":["2018YJG02"],"award-info":[{"award-number":["2018YJG02"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2021,6]]},"DOI":"10.1007\/s10489-020-02072-w","type":"journal-article","created":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T08:02:55Z","timestamp":1605772975000},"page":"3789-3800","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["A hybrid ant colony system algorithm for solving the ring star problem"],"prefix":"10.1007","volume":"51","author":[{"given":"Xiaoning","family":"Zang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Li","family":"Jiang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bin","family":"Ding","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiang","family":"Fang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,11,19]]},"reference":[{"key":"2072_CR1","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1016\/S0377-2217(02)00831-7","volume":"151","author":"JAM Perez","year":"2003","unstructured":"Perez JAM, Moreno-Vega JM, Martin IR (2003) Variable neighborhood tabu search and its application to the median cycle problem. Eur J Oper Res 151:365\u2013378","journal-title":"Eur J Oper Res"},{"key":"2072_CR2","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1057\/palgrave.jors.2601672","volume":"55","author":"J Renaud","year":"2004","unstructured":"Renaud J, Boctor FF, Laporte G (2004) Efficient heuristics for median cycle problems. J Oper Res Soc 55:179\u2013186","journal-title":"J Oper Res Soc"},{"key":"2072_CR3","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1002\/net.10114","volume":"43","author":"M Labbe","year":"2004","unstructured":"Labbe M, Laporte G, Martin IR, Gonzalez JJS (2004) The ring star problem: polyhedral analysis and exact algorithm. Networks 43:177\u2013189","journal-title":"Networks"},{"key":"2072_CR4","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1080\/02331930903500332","volume":"59","author":"S Kedad-Sidhoum","year":"2010","unstructured":"Kedad-Sidhoum S, Viet Hung N (2010) An exact algorithm for solving the ring star problem. Optimization 59:125\u2013140","journal-title":"Optimization"},{"key":"2072_CR5","doi-asserted-by":"publisher","first-page":"1901","DOI":"10.1016\/j.dam.2011.01.015","volume":"159","author":"L Simonetti","year":"2011","unstructured":"Simonetti L, Frota Y, de Souza CC (2011) The ring-star problem: a new integer programming formulation and a branch-and-cut algorithm. Discret Appl Math 159:1901\u20131914","journal-title":"Discret Appl Math"},{"key":"2072_CR6","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/j.ejor.2015.04.049","volume":"246","author":"HI Calvete","year":"2015","unstructured":"Calvete HI, Gale C, Iranzo JA (2015) An efficient evolutionary algorithm for the ring star problem (vol 231, pg 22, 2013). Eur J Oper Res 246:343\u2013343","journal-title":"Eur J Oper Res"},{"key":"2072_CR7","doi-asserted-by":"publisher","first-page":"1147","DOI":"10.1287\/opre.1070.0432","volume":"55","author":"R Baldacci","year":"2007","unstructured":"Baldacci R, Dell'Amico M, Gonzalez JS (2007) The capacitated m-ring-star problem. Oper Res 55:1147\u20131162","journal-title":"Oper Res"},{"key":"2072_CR8","doi-asserted-by":"publisher","first-page":"879","DOI":"10.1016\/j.ejor.2017.04.025","volume":"262","author":"R Baldacci","year":"2017","unstructured":"Baldacci R, Hill A, Hoshino EA, Lim A (2017) Pricing strategies for capacitated ring-star problems based on dynamic programming algorithms. Eur J Oper Res 262:879\u2013893","journal-title":"Eur J Oper Res"},{"key":"2072_CR9","doi-asserted-by":"publisher","first-page":"1227","DOI":"10.1016\/j.ejor.2010.06.030","volume":"207","author":"Z Naji-Azimi","year":"2010","unstructured":"Naji-Azimi Z, Salari M, Toth P (2010) A heuristic procedure for the capacitated m-ring-star problem. Eur J Oper Res 207:1227\u20131234","journal-title":"Eur J Oper Res"},{"key":"2072_CR10","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/j.ejor.2011.08.026","volume":"217","author":"Z Naji-Azimi","year":"2012","unstructured":"Naji-Azimi Z, Salari M, Toth P (2012) An integer linear programming based heuristic for the capacitated m-ring-star problem. Eur J Oper Res 217:17\u201325","journal-title":"Eur J Oper Res"},{"key":"2072_CR11","doi-asserted-by":"publisher","first-page":"2728","DOI":"10.1016\/j.dam.2011.11.029","volume":"160","author":"EA Hoshino","year":"2012","unstructured":"Hoshino EA, de Souza CC (2012) A branch-and-cut-and-price approach for the capacitated m-ring-star problem. Discret Appl Math 160:2728\u20132741","journal-title":"Discret Appl Math"},{"key":"2072_CR12","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/s10489-013-0460-6","volume":"40","author":"Z Zhang","year":"2014","unstructured":"Zhang Z, Qin H, Lim A (2014) A memetic algorithm for the capacitated m-ring-star problem. Appl Intell 40:305\u2013321","journal-title":"Appl Intell"},{"key":"2072_CR13","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1287\/trsc.23.3.208","volume":"23","author":"JR Current","year":"1989","unstructured":"Current JR, Schilling DA (1989) The covering salesman problem. Transp Sci 23:208\u2013213","journal-title":"Transp Sci"},{"key":"2072_CR14","doi-asserted-by":"publisher","first-page":"534","DOI":"10.1287\/ijoc.1110.0480","volume":"24","author":"B Golden","year":"2012","unstructured":"Golden B, Naji-Azimi Z, Raghavan S, Salari M, Toth P (2012) The generalized covering salesman problem. INFORMS J Comput 24:534\u2013553","journal-title":"INFORMS J Comput"},{"key":"2072_CR15","doi-asserted-by":"publisher","first-page":"2594","DOI":"10.1016\/j.cor.2012.01.004","volume":"39","author":"M Salari","year":"2012","unstructured":"Salari M, Naji-Azimi Z (2012) An integer programming-based local search for the covering salesman problem. Comput Oper Res 39:2594\u20132602","journal-title":"Comput Oper Res"},{"key":"2072_CR16","doi-asserted-by":"publisher","first-page":"867","DOI":"10.1016\/j.asoc.2014.08.057","volume":"24","author":"MH Shaelaie","year":"2014","unstructured":"Shaelaie MH, Salari M, Naji-Azimi Z (2014) The generalized covering traveling salesman problem. Appl Soft Comput 24:867\u2013878","journal-title":"Appl Soft Comput"},{"key":"2072_CR17","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1016\/j.cie.2015.02.019","volume":"83","author":"M Salari","year":"2015","unstructured":"Salari M, Reihaneh M, Sabbagh MS (2015) Combining ant colony optimization algorithm and dynamic programming technique for solving the covering salesman problem. Comput Ind Eng 83:244\u2013251","journal-title":"Comput Ind Eng"},{"key":"2072_CR18","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1016\/j.cor.2016.06.019","volume":"76","author":"G Ozbaygin","year":"2016","unstructured":"Ozbaygin G, Yaman H, Karasan OE (2016) Time constrained maximal covering salesman problem with weighted demands and partial coverage. Comput Oper Res 76:226\u2013237","journal-title":"Comput Oper Res"},{"key":"2072_CR19","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1016\/j.asoc.2019.03.001","volume":"78","author":"P Venkatesh","year":"2019","unstructured":"Venkatesh P, Singh A (2019) An artificial bee colony algorithm with variable degree of perturbation for the generalized covering traveling salesman problem. Appl Soft Comput 78:481\u2013495","journal-title":"Appl Soft Comput"},{"key":"2072_CR20","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1016\/j.asoc.2017.06.059","volume":"60","author":"LM Abualigah","year":"2017","unstructured":"Abualigah LM, Khader AT, Hanandeh ES, Gandomi AH (2017) A novel hybridization strategy for krill herd algorithm applied to clustering techniques. Appl Soft Comput 60:423\u2013435","journal-title":"Appl Soft Comput"},{"key":"2072_CR21","doi-asserted-by":"crossref","unstructured":"He L, Huang S (2020) An efficient krill herd algorithm for color image multilevel thresholding segmentation problem, applied soft computing, 89","DOI":"10.1016\/j.asoc.2020.106063"},{"key":"2072_CR22","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1016\/j.jocs.2017.07.018","volume":"25","author":"LM Abualigah","year":"2018","unstructured":"Abualigah LM, Khader AT, Hanandeh ES (2018) A new feature selection method to improve the document clustering using particle swarm optimization algorithm. Journal of Computational Science 25:456\u2013466","journal-title":"Journal of Computational Science"},{"key":"2072_CR23","doi-asserted-by":"crossref","unstructured":"Saeedi S, Khorsand R, Bidgoli SG, Ramezanpour M (2020) Improved many-objective particle swarm optimization algorithm for scientific workflow scheduling in cloud computing. Computers & Industrial Engineering, 147","DOI":"10.1016\/j.cie.2020.106649"},{"key":"2072_CR24","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/j.ijpe.2016.01.016","volume":"174","author":"X Li","year":"2016","unstructured":"Li X, Gao L (2016) An effective hybrid genetic algorithm and tabu search for flexible job shop scheduling problem. Int J Prod Econ 174:93\u2013110","journal-title":"Int J Prod Econ"},{"key":"2072_CR25","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/j.ejor.2019.11.037","volume":"289","author":"CE Andrade","year":"2020","unstructured":"Andrade CE, Toso RF, Goncalves JF, Resende MGC (2020) The multi-parent biased random-key genetic algorithm with implicit path-relinking and its real-world applications. Eur J Oper Res 289:17\u201330","journal-title":"Eur J Oper Res"},{"key":"2072_CR26","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1016\/j.cie.2019.04.029","volume":"132","author":"H Kilic","year":"2019","unstructured":"Kilic H, Yuzgec U (2019) Improved antlion optimization algorithm via tournament selection and its application to parallel machine scheduling. Comput Ind Eng 132:166\u2013186","journal-title":"Comput Ind Eng"},{"key":"2072_CR27","doi-asserted-by":"crossref","unstructured":"Abualigah L, Diabat A (2020) A novel hybrid antlion optimization algorithm for multi-objective task scheduling problems in cloud computing environments. Clust Comput","DOI":"10.1007\/s10586-020-03075-5"},{"key":"2072_CR28","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1109\/4235.585892","volume":"1","author":"M Dorigo","year":"1997","unstructured":"Dorigo M, Gambardella LM (1997) Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Trans Evol Comput 1:53\u201366","journal-title":"IEEE Trans Evol Comput"},{"key":"2072_CR29","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/j.cie.2019.106115","volume":"138","author":"W Qin","year":"2019","unstructured":"Qin W, Zhuang ZL, Liu Y, Tang O (2019) A two-stage ant colony algorithm for hybrid flow shop scheduling with lot sizing and calendar constraints in printed circuit board assembly. Computers & Industrial Engineering 138:12","journal-title":"Computers & Industrial Engineering"},{"key":"2072_CR30","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/S0377-2217(99)00284-2","volume":"126","author":"K Helsgaun","year":"2000","unstructured":"Helsgaun K (2000) An effective implementation of the Lin\u2013Kernighan traveling salesman heuristic. Eur J Oper Res 126:106\u2013130","journal-title":"Eur J Oper Res"},{"key":"2072_CR31","doi-asserted-by":"publisher","first-page":"568","DOI":"10.1287\/opre.12.4.568","volume":"12","author":"G Clarke","year":"1964","unstructured":"Clarke G, Wright JW (1964) Scheduling of vehicles from a central depot to a number of delivery points. Oper Res 12:568\u2013581","journal-title":"Oper Res"},{"key":"2072_CR32","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1287\/opre.21.2.498","volume":"21","author":"S Lin","year":"1973","unstructured":"Lin S, Kernighan BW (1973) An effective heuristic algorithm for the travelling-salesman problem. Oper Res 21:498\u2013516","journal-title":"Oper Res"},{"key":"2072_CR33","doi-asserted-by":"publisher","first-page":"80","DOI":"10.2307\/3001968","volume":"1","author":"F Wilcoxon","year":"1945","unstructured":"Wilcoxon F (1945) Individual comparisons by ranking methods. Biom Bull 1:80\u201383","journal-title":"Biom Bull"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-020-02072-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-020-02072-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-020-02072-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,20]],"date-time":"2021-05-20T08:27:44Z","timestamp":1621499264000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-020-02072-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,11,19]]},"references-count":33,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2021,6]]}},"alternative-id":["2072"],"URL":"https:\/\/doi.org\/10.1007\/s10489-020-02072-w","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"type":"print","value":"0924-669X"},{"type":"electronic","value":"1573-7497"}],"subject":[],"published":{"date-parts":[[2020,11,19]]},"assertion":[{"value":"7 November 2020","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 November 2020","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"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"}}]}}