{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T15:22:45Z","timestamp":1772119365885,"version":"3.50.1"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2022,4,8]],"date-time":"2022-04-08T00:00:00Z","timestamp":1649376000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,4,8]],"date-time":"2022-04-08T00:00:00Z","timestamp":1649376000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2022,6]]},"DOI":"10.1007\/s00500-022-06978-0","type":"journal-article","created":{"date-parts":[[2022,4,8]],"date-time":"2022-04-08T05:04:26Z","timestamp":1649394266000},"page":"5773-5803","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["A modified ACO with K-Opt for restricted covering salesman problems in different environments"],"prefix":"10.1007","volume":"26","author":[{"given":"Prasanta","family":"Dutta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4052-551X","authenticated-orcid":false,"given":"Indadul","family":"Khan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Krishnendu","family":"Basuli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manas Kumar","family":"Maiti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,4,8]]},"reference":[{"key":"6978_CR1","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.23.3.208","volume-title":"The covering salesman problem","author":"JR Current","year":"1989","unstructured":"Current JR, Schilling David A (1989) The covering salesman problem. The Ohio University, Columbus, Ohio"},{"issue":"2","key":"6978_CR2","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1287\/trsc.1070.0209","volume":"42","author":"AM Campbell","year":"2008","unstructured":"Campbell AM, Vandenbussche D, Hermann W (2008) Routing for relief efforts. Transport Sci 42(2):127\u2013145","journal-title":"Transport Sci"},{"key":"6978_CR3","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/S0303-2647(97)01708-5","volume":"43","author":"M Dorigo","year":"1997","unstructured":"Dorigo M, Gambardella LM (1997) Ant colonies for the traveling salesman problem. Biosystems 43:73\u201381","journal-title":"Biosystems"},{"key":"6978_CR4","first-page":"11","volume-title":"New ideas in optimization","author":"M Dorigo","year":"1999","unstructured":"Dorigo M, Di Caro G (1999) The ant colony optimization meta-heuristics. In: Corne D, Dorigo M, Glover F (eds) New ideas in optimization. McGraw-Hill, London, pp 11\u201332"},{"issue":"4","key":"6978_CR5","first-page":"376","volume":"3","author":"R Gerhard","year":"1999","unstructured":"Gerhard R (1999) TSPLIB-a traveling salesman problem library. ORSA J Comput 3(4):376\u2013384","journal-title":"ORSA J Comput"},{"key":"6978_CR6","first-page":"86","volume":"4010","author":"M Gendreau","year":"1992","unstructured":"Gendreau M, Laporte G, Semet F (1992) The covering tour problem. Comput Oper Res 4010:86\u201394","journal-title":"Comput Oper Res"},{"issue":"4","key":"6978_CR7","doi-asserted-by":"publisher","first-page":"534","DOI":"10.1287\/ijoc.1110.0480","volume":"24","author":"BL Golden","year":"2012","unstructured":"Golden BL, Nazi-Azimi Z, Raghavan S, Salari M, Toth P (2012) The generalized covering salesman problem. INFORMS J Comput 24(4):534\u2013553","journal-title":"INFORMS J Comput"},{"key":"6978_CR8","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/S0305-0548(99)00006-4","volume":"27","author":"M Hachicha","year":"2000","unstructured":"Hachicha M, Hodgson M, Laporte G, Semet F (2000) Heuristics for the multi-vehicle covering tour problem. Comput Oper Res 27:29\u201342","journal-title":"Comput Oper Res"},{"key":"6978_CR9","unstructured":"Kergosien Y, Lent\u00e9 C, Billaut J (2009) Home health care problem An extended multiple Traveling Salesman Problem. In: Multidisciplinary international conference on scheduling: theory and applications (MISTA 2009), Dublin, Ireland 10-12 August 2009"},{"key":"6978_CR10","doi-asserted-by":"publisher","unstructured":"Khanra A, Maiti MK, Maiti M (2016) Profit maximization of TSP with uncertain parameters through a hybrid algorithm. In: Proceedings of the 4th international conference on frontiers in intelligent computing: theory and applications (FICTA), Advances in Intelligent Systems and Computing Science. Springer https:\/\/doi.org\/10.1007\/978-81-322-2695-6_26","DOI":"10.1007\/978-81-322-2695-6_26"},{"key":"6978_CR11","doi-asserted-by":"publisher","unstructured":"Khan I, Maiti MK (2018) A novel hybrid algorithm for generalized traveling salesman problems in different environments. Vietnam J Comput Sci 5(1):27\u201343. https:\/\/doi.org\/10.1007\/s40595-017-0099-z","DOI":"10.1007\/s40595-017-0099-z"},{"key":"6978_CR12","doi-asserted-by":"publisher","unstructured":"Khan I, Pal S, Maiti MK (2018) A modified particle swarm optimization algorithm for solving traveling salesman problem with imprecise cost matrix. In: 4th International conference on recent advances in information technology (RAIT). https:\/\/doi.org\/10.1109\/RAIT.2018.8389060","DOI":"10.1109\/RAIT.2018.8389060"},{"issue":"5","key":"6978_CR13","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1142\/S0218488519500314","volume":"27","author":"I Khan","year":"2019","unstructured":"Khan I, Pal S, Maiti MK (2019) A hybrid PSO-GA algorithm for traveling salesman problems in different environments. Int J Uncertain Fuzziness Knowl Based Syst 27(5):693\u2013717","journal-title":"Int J Uncertain Fuzziness Knowl Based Syst"},{"key":"6978_CR14","first-page":"2594","volume":"39","author":"I Kotenko","year":"2019","unstructured":"Kotenko I, Saenko I (2019) Hierarchical fuzzy situational networks for online decision-making. Appl Telecommun Syst Comput Oper Res 39:2594\u20132602","journal-title":"Appl Telecommun Syst Comput Oper Res"},{"issue":"4","key":"6978_CR15","doi-asserted-by":"publisher","first-page":"365","DOI":"10.7763\/IJMLC.2012.V2.146","volume":"2","author":"R Kumar","year":"2012","unstructured":"Kumar R (2012) Blending roulette wheel selection & rank selection in genetic algorithms. Int J Mach Learn Comput 2(4):365\u2013370","journal-title":"Int J Mach Learn Comput"},{"key":"6978_CR16","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 B (1973) An effective heuristics algorithm for travelling salesman problem. Oper Res 21:498\u2013516","journal-title":"Oper Res"},{"issue":"3","key":"6978_CR17","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 I, Salzar G (2004) The ring star problem: polyhedral analysis and exact algorithm. Networks 43(3):177\u2013189","journal-title":"Networks"},{"key":"6978_CR18","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1016\/j.ejor.2003.07.010","volume":"160","author":"M Labbe","year":"2005","unstructured":"Labbe M, Laporte G, Martin I, Salzar G (2005) Locating median cycles in networks. Eur J Oper Res 160:457\u2013470","journal-title":"Eur J Oper Res"},{"key":"6978_CR19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-7908-1781-2","volume-title":"Theory and practice of uncertain programming","author":"B Liu","year":"2002","unstructured":"Liu B (2002) Theory and practice of uncertain programming. Physica-Verlag, Heidelberg"},{"key":"6978_CR20","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/S0165-0114(97)00291-1","volume":"100","author":"B Liu","year":"1998","unstructured":"Liu B, Iwamura K (1998) A note on chance constrained programming with fuzzy coeffcients. Fuzzy Sets Syst 100:229\u2013233","journal-title":"Fuzzy Sets Syst"},{"issue":"9","key":"6978_CR21","doi-asserted-by":"publisher","first-page":"177","DOI":"10.26483\/ijarcs.v8i8.4591","volume":"8","author":"AK Maurya","year":"2017","unstructured":"Maurya AK, Kumar N (2017) Localization problem in disaster management smartphone application. Int J Adv Res Comput Sci 8(9):177\u2013180","journal-title":"Int J Adv Res Comput Sci"},{"key":"6978_CR22","doi-asserted-by":"crossref","unstructured":"Pandiri V, Singh A, Rossi A (2020) Two hybrid metaheuristic approaches for the covering salesman problem. Neural Comput Appl 32(19):15643-15663","DOI":"10.1007\/s00521-020-04898-4"},{"key":"6978_CR23","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1016\/j.asoc.2017.04.013","volume":"58","author":"P Pramanik","year":"2017","unstructured":"Pramanik P, Maiti MK, Maiti M (2017) Three level partial trade credit with promotional cost sharing. Appl Soft Comput 58:553\u2013575","journal-title":"Appl Soft Comput"},{"key":"6978_CR24","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":"6978_CR25","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"},{"issue":"2","key":"6978_CR26","first-page":"351","volume":"22","author":"G Sierksma","year":"2014","unstructured":"Sierksma G (2014) Hamiltonicity and the 3-Opt procedure for the travelling salesman problem. Appl Math 22(2):351\u2013358","journal-title":"Appl Math"},{"issue":"7","key":"6978_CR27","first-page":"245","volume":"10","author":"S Tripathy","year":"2017","unstructured":"Tripathy S, Tulshyan A, Kar S, Pal T (2017) A metameric genetic algorithm with new operator for covering salesman problem with full coverage. Int J Control Theory Appl 10(7):245\u2013252","journal-title":"Int J Control Theory Appl"},{"issue":"2","key":"6978_CR28","first-page":"41","volume":"14","author":"V Ungureanu","year":"2006","unstructured":"Ungureanu V (2006) Traveling salesman problem with transportation. Comput Sci J Moldova 14(2):41","journal-title":"Comput Sci J Moldova"},{"key":"6978_CR29","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/978-981-13-0761-4_28","volume-title":"Harmony search and nature inspired optimization algorithms","author":"P Venkatesh","year":"2019","unstructured":"Venkatesh P, Srivastava G, Singh A (2019) A multi-start iterated local search algorithm with variable degree of perturbation for the covering salesman problem. Harmony search and nature inspired optimization algorithms. Springer, Singapore, pp 279\u2013292"},{"key":"6978_CR30","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1016\/S0019-9958(65)90241-X","volume":"8","author":"L Zadeh","year":"1965","unstructured":"Zadeh L (1965) Fuzzy sets. Inf Control 8:338\u2013356","journal-title":"Inf Control"},{"key":"6978_CR31","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/s11590-020-01642-8","volume":"16","author":"Z Zang","year":"2020","unstructured":"Zang Z, Jiang L, Ratli M, Ding B (2020) A parallel variable neighborhood search for solving covering salesman problem. Optim Lett 16:175\u2013190","journal-title":"Optim Lett"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-022-06978-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00500-022-06978-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-022-06978-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,19]],"date-time":"2022-05-19T08:11:52Z","timestamp":1652947912000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00500-022-06978-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,8]]},"references-count":31,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2022,6]]}},"alternative-id":["6978"],"URL":"https:\/\/doi.org\/10.1007\/s00500-022-06978-0","relation":{"has-preprint":[{"id-type":"doi","id":"10.21203\/rs.3.rs-1060695\/v1","asserted-by":"object"}]},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,4,8]]},"assertion":[{"value":"3 March 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 April 2022","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 known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper. The authors declare the following financial interests\/personal relationships which may be considered as potential competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}