{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,6]],"date-time":"2026-01-06T20:11:13Z","timestamp":1767730273946,"version":"build-2238731810"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"23-24","license":[{"start":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T00:00:00Z","timestamp":1761868800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T00:00:00Z","timestamp":1761868800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2025,12]]},"DOI":"10.1007\/s00500-025-10925-0","type":"journal-article","created":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T17:37:30Z","timestamp":1761932250000},"page":"6005-6022","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On multi-objective multi-coverage covering salesman problem"],"prefix":"10.1007","volume":"29","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3469-5042","authenticated-orcid":false,"given":"Amiya","family":"Biswas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Erfan Babaee","family":"Tirkolaee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lakshmi Narayan","family":"De","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vincent F.","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tandra","family":"Pal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,10,31]]},"reference":[{"issue":"3","key":"10925_CR1","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/0166-218X(94)90008-6","volume":"55","author":"EM Arkin","year":"1994","unstructured":"Arkin EM, Hassin R (1994) Approximation algorithms for the geometric covering salesman problem. Discrete Appl Math 55(3):197\u2013218","journal-title":"Discrete Appl Math"},{"key":"10925_CR2","doi-asserted-by":"crossref","unstructured":"Biswas A, Tripathy SP, Pal T (2022) On multi-objective covering salesman problem. Neural Comput Appl, 1\u201314","DOI":"10.1007\/s00521-022-07683-7"},{"key":"10925_CR3","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/j.cor.2016.09.003","volume":"78","author":"F Carrabs","year":"2017","unstructured":"Carrabs F, Cerrone C, Cerulli R, Gaudioso M (2017) A novel discretization scheme for the close enough traveling salesman problem. Comput Oper Res 78:163\u2013171","journal-title":"Comput Oper Res"},{"key":"10925_CR4","unstructured":"Current JR (1982) Multiobjective Design of Transportation Networks"},{"issue":"3","key":"10925_CR5","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(3):208\u2013213","journal-title":"Transp Sci"},{"key":"10925_CR7","unstructured":"De Jong KA (1975) An analysis of the behavior of a class of genetic adaptive systems. University of Michigan"},{"issue":"2","key":"10925_CR8","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb K, Pratap A, Agarwal S, Meyarivan TAMT (2002) A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans Evol Comput 6(2):182\u2013197","journal-title":"IEEE Trans Evol Comput"},{"key":"10925_CR9","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1016\/j.neucom.2015.03.119","volume":"174","author":"L Deng","year":"2016","unstructured":"Deng L, Lu G, Shao Y, Fei M, Hu H (2016) A novel camera calibration technique based on differential evolution particle swarm optimization algorithm. Neurocomputing 174:456\u2013465","journal-title":"Neurocomputing"},{"issue":"2\u20133","key":"10925_CR10","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/j.tcs.2005.05.020","volume":"344","author":"M Dorigo","year":"2005","unstructured":"Dorigo M, Blum C (2005) Ant colony optimization theory: a survey. Theor Comput Sci 344(2\u20133):243\u2013278","journal-title":"Theor Comput Sci"},{"key":"10925_CR11","unstructured":"Fonseca CM, Fleming PJ (1993), May Multiobjective genetic algorithms. In IEE colloquium on genetic algorithms for control systems engineering (pp. 6\u2009\u2013\u20091). Iet"},{"issue":"3","key":"10925_CR12","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F Glover","year":"1989","unstructured":"Glover F (1989) Tabu search\u2014part I. ORSA J Comput 1(3):190\u2013206","journal-title":"ORSA J Comput"},{"key":"10925_CR13","volume-title":"Genetic algorithms in search, optimization, and machine learning","author":"DE Goldberg","year":"1989","unstructured":"Goldberg DE (1989) Genetic algorithms in search, optimization, and machine learning. Addison, Reading"},{"issue":"4","key":"10925_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(4):534\u2013553","journal-title":"INFORMS J Comput"},{"key":"10925_CR15","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/978-0-387-39934-8_16","volume-title":"Perspectives in operations research: papers in honor of saul gass\u2019 80th birthday 2006","author":"DJ Gulczynski","year":"2006","unstructured":"Gulczynski DJ, Heath JW, Price CC. The close enough traveling salesman problem: A discussion of several heuristics. In: Francis BA, Michael CF, Bruce LG (ed) Perspectives in operations research: papers in honor of saul gass\u2019 80th birthday 2006. Springer US, Boston, MA, pp 271\u2013283"},{"issue":"1","key":"10925_CR16","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 MJ, Laporte G, Semet F (2000) Heuristics for the multi-vehicle covering tour problem. Comput Oper Res 27(1):29\u201342","journal-title":"Comput Oper Res"},{"key":"10925_CR18","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/s12532-009-0004-6","volume":"1","author":"K Helsgaun","year":"2009","unstructured":"Helsgaun K (2009) General k-opt submoves for the Lin\u2013Kernighan TSP heuristic. Math Program Comput 1:119\u2013163","journal-title":"Math Program Comput"},{"issue":"11\u201312","key":"10925_CR19","doi-asserted-by":"publisher","first-page":"1767","DOI":"10.1016\/j.camwa.2008.10.037","volume":"57","author":"J Jia","year":"2009","unstructured":"Jia J, Chen J, Chang G, Wen Y, Song J (2009) Multi-objective optimization for coverage control in wireless sensor network with adjustable sensing radius. Comput Math Appl 57(11\u201312):1767\u20131775","journal-title":"Comput Math Appl"},{"issue":"1","key":"10925_CR20","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/s11590-021-01709-0","volume":"16","author":"L Jiang","year":"2022","unstructured":"Jiang L, Zang X, Dong J, Liang C (2022) A covering traveling salesman problem with profit in the last mile delivery. Optim Lett 16(1):375\u2013393","journal-title":"Optim Lett"},{"issue":"7","key":"10925_CR22","doi-asserted-by":"publisher","first-page":"1929","DOI":"10.1016\/j.cor.2005.07.022","volume":"34","author":"N Jozefowiez","year":"2007","unstructured":"Jozefowiez N, Semet F, Talbi EG (2007) The bi-objective covering tour problem. Comput Oper Res 34(7):1929\u20131942","journal-title":"Comput Oper Res"},{"key":"10925_CR23","doi-asserted-by":"crossref","unstructured":"Kennedy J, Eberhart R (1995), November Particle swarm optimization. In Proceedings of ICNN\u201995-international conference on neural networks (Vol. 4, pp. 1942\u20131948). IEEE","DOI":"10.1109\/ICNN.1995.488968"},{"issue":"4598","key":"10925_CR24","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick S, Gelatt Jr CD, Vecchi MP (1983) Optimization by simulated annealing. Science 220(4598):671\u2013680","journal-title":"Science"},{"issue":"2","key":"10925_CR25","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 traveling-salesman problem. Oper Res 21(2):498\u2013516","journal-title":"Oper Res"},{"key":"10925_CR26","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1007\/0-306-48056-5_11","volume-title":"Handbook of metaheuristics","author":"HR Louren\u00e7o","year":"2003","unstructured":"Louren\u00e7o HR, Martin OC, St\u00fctzle T (2003) Iterated local search. In: Glover F, Kochenberger GA (ed) Handbook of metaheuristics. Springer US, Boston, MA, pp 320\u2013353"},{"key":"10925_CR27","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1016\/j.ins.2021.02.053","volume":"564","author":"Y Lu","year":"2021","unstructured":"Lu Y, Benlic U, Wu Q (2021) A highly effective hybrid evolutionary algorithm for the covering salesman problem. Inf Sci 564:144\u2013162","journal-title":"Inf Sci"},{"issue":"11","key":"10925_CR28","doi-asserted-by":"publisher","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N Mladenovi\u0107","year":"1997","unstructured":"Mladenovi\u0107 N, Hansen P (1997) Variable neighborhood search. Comput Oper Res 24(11):1097\u20131100","journal-title":"Comput Oper Res"},{"issue":"1","key":"10925_CR29","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s12652-017-0620-3","volume":"10","author":"A Mukherjee","year":"2019","unstructured":"Mukherjee A, Panigrahi G, Kar S, Maiti M (2019) Constrained covering solid travelling salesman problems in uncertain environment. J Ambient Intell Humaniz Comput 10(1):125\u2013141","journal-title":"J Ambient Intell Humaniz Comput"},{"key":"10925_CR30","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1016\/j.asoc.2019.03.001","volume":"78","author":"V Pandiri","year":"2019","unstructured":"Pandiri V, 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"},{"issue":"19","key":"10925_CR31","doi-asserted-by":"publisher","first-page":"15643","DOI":"10.1007\/s00521-020-04898-4","volume":"32","author":"V Pandiri","year":"2020","unstructured":"Pandiri V, Singh A, Rossi A (2020) Two hybrid metaheuristic approaches for the covering salesman problem. Neural Comput Appl 32(19):15643\u201315663","journal-title":"Neural Comput Appl"},{"issue":"1","key":"10925_CR32","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/S0305-0548(01)00084-3","volume":"30","author":"R Patterson","year":"2003","unstructured":"Patterson R, Rolland E (2003) The cardinality constrained covering traveling salesman problem. Comput Oper Res 30(1):97\u2013116","journal-title":"Comput Oper Res"},{"key":"10925_CR34","unstructured":"Reinelt G (1995) Tsplib95. Interdisziplin\u00e4res Zentrum f\u00fcr Wissenschaftliches Rechnen (IWR), Heidelberg, 338, 1\u201316"},{"issue":"11","key":"10925_CR35","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(11):2594\u20132602","journal-title":"Comput Oper Res"},{"key":"10925_CR36","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":"10925_CR37","volume-title":"Some experiments in machine learning using vector evaluated genetic algorithms","author":"JD Schaffer","year":"1985","unstructured":"Schaffer JD (1985) Some experiments in machine learning using vector evaluated genetic algorithms. Vanderbilt Univ., Nashville, TN (USA)"},{"key":"10925_CR38","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/978-0-387-77778-8_22","volume-title":"The vehicle routing problem: latest advances and new challenges","author":"R Shuttleworth","year":"2008","unstructured":"Shuttleworth R, Golden BL, Smith S, Wasil E (2008) Advances in meter reading: heuristic solution of the close enough traveling salesman problem over a street network. In: Golden B, Raghavan S, Wasil E (ed) The vehicle routing problem: latest advances and new challenges. Springer, Boston, MA, pp 487\u2013501"},{"issue":"3","key":"10925_CR39","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1007\/s12597-020-00503-3","volume":"58","author":"P Singh","year":"2021","unstructured":"Singh P, Kamthane AR, Tanksale AN (2021) Metaheuristics for the distance constrained generalized covering traveling salesman problem. Opsearch 58(3):575\u2013609","journal-title":"Opsearch"},{"issue":"7","key":"10925_CR40","first-page":"245","volume":"10","author":"SP Tripathy","year":"2017","unstructured":"Tripathy SP, 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"},{"key":"10925_CR41","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2021.108024","volume":"113","author":"SP Tripathy","year":"2021","unstructured":"Tripathy SP, Biswas A, Pal T (2021) A multi-objective covering salesman problem with 2-coverage. Appl Soft Comput 113:108024","journal-title":"Appl Soft Comput"},{"key":"10925_CR42","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. In: Yadav N, Yadav A, Bansal JC, Deep K, Kim JH (ed) Harmony search and nature inspired optimization algorithms. Springer, Singapore, pp 279\u2013292"},{"key":"10925_CR44","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s11590-019-01524-8","volume":"14","author":"X Zang","year":"2020","unstructured":"Zang X, Jiang L, Ratli M, Ding B (2020) A parallel variable neighborhood search for solving covering salesman problem. Optim Lett 14:1\u20136","journal-title":"Optim Lett"},{"issue":"6","key":"10925_CR45","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1109\/TEVC.2007.892759","volume":"11","author":"Q Zhang","year":"2007","unstructured":"Zhang Q, Li H (2007) MOEA\/D: a multiobjective evolutionary algorithm based on decomposition. IEEE Trans Evol Comput 11(6):712\u2013731","journal-title":"IEEE Trans Evol Comput"},{"key":"10925_CR47","unstructured":"Zitzler E, Laumanns M, Thiele L (2001) SPEA2: Improving the strength Pareto evolutionary algorithm. TIK-report 103"}],"updated-by":[{"DOI":"10.1007\/s00500-025-10990-5","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T00:00:00Z","timestamp":1767139200000}}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-025-10925-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00500-025-10925-0","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-025-10925-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,4]],"date-time":"2026-01-04T00:37:59Z","timestamp":1767487079000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00500-025-10925-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,31]]},"references-count":41,"journal-issue":{"issue":"23-24","published-print":{"date-parts":[[2025,12]]}},"alternative-id":["10925"],"URL":"https:\/\/doi.org\/10.1007\/s00500-025-10925-0","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,10,31]]},"assertion":[{"value":"27 September 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 September 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 October 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 December 2025","order":5,"name":"change_date","label":"Change Date","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Update","order":6,"name":"change_type","label":"Change Type","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The original online version of this article was revised: The affiliation and email address of author Erfan Babaee Tirkolae has been revised in the original article.","order":7,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 December 2025","order":8,"name":"change_date","label":"Change Date","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Correction","order":9,"name":"change_type","label":"Change Type","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"A Correction to this paper has been published:","order":10,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"https:\/\/doi.org\/10.1007\/s00500-025-10990-5","URL":"https:\/\/doi.org\/10.1007\/s00500-025-10990-5","order":11,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"No conflict of interest exists in the submission of this manuscript, and manuscript is approved by all authors for publication.","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"}}]}}