{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T22:12:01Z","timestamp":1773699121335,"version":"3.50.1"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"24","license":[{"start":{"date-parts":[[2022,8,13]],"date-time":"2022-08-13T00:00:00Z","timestamp":1660348800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,8,13]],"date-time":"2022-08-13T00:00:00Z","timestamp":1660348800000},"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":["Neural Comput & Applic"],"published-print":{"date-parts":[[2022,12]]},"DOI":"10.1007\/s00521-022-07683-7","type":"journal-article","created":{"date-parts":[[2022,8,13]],"date-time":"2022-08-13T16:02:46Z","timestamp":1660406566000},"page":"22127-22140","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["On multi-objective covering salesman problem"],"prefix":"10.1007","volume":"34","author":[{"given":"Amiya","family":"Biswas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Siba Prasada","family":"Tripathy","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":[[2022,8,13]]},"reference":[{"issue":"4","key":"7683_CR1","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","volume":"3","author":"G Reinelt","year":"1991","unstructured":"Reinelt G (1991) TSPLIB\u2014a traveling salesman problem library. ORSA J Comput 3(4):376\u2013384","journal-title":"ORSA J Comput"},{"key":"7683_CR2","unstructured":"Current JR (1981) Multi-objective design of transportation networks. Ph.D. thesis, Department of Geography and Environmental Engineering, Johns Hopkins University, Baltimore"},{"issue":"4","key":"7683_CR3","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"},{"issue":"11","key":"7683_CR4","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"},{"issue":"78","key":"7683_CR5","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1016\/j.asoc.2019.03.001","volume":"1","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 1(78):481\u2013495","journal-title":"Appl Soft Comput"},{"issue":"2","key":"7683_CR6","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"},{"issue":"3","key":"7683_CR7","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":"7683_CR8","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":"7683_CR9","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":"3","key":"7683_CR10","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":"7683_CR11","doi-asserted-by":"crossref","unstructured":"Venkatesh P, Srivastava G, Singh A. A multi-start iterated local search algorithm with variable degree of perturbation for the covering salesman problem. In: Harmony Search and Nature Inspired Optimization Algorithms 2019. Springer, Singapore, pp 279\u2013292","DOI":"10.1007\/978-981-13-0761-4_28"},{"issue":"7","key":"7683_CR12","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"},{"issue":"19","key":"7683_CR13","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":"7683_CR14","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"},{"issue":"113","key":"7683_CR15","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2021.108024","volume":"1","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 1(113):108024","journal-title":"Appl Soft Comput"},{"issue":"2","key":"7683_CR16","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":"7683_CR17","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"},{"key":"7683_CR18","first-page":"1","volume":"21","author":"L Jiang","year":"2021","unstructured":"Jiang L, Zang X, Dong J, Liang C (2021) A covering traveling salesman problem with profit in the last mile delivery. Optim Lett 21:1\u20139","journal-title":"Optim Lett"},{"key":"7683_CR19","first-page":"1","volume":"16","author":"P Singh","year":"2021","unstructured":"Singh P, Kamthane AR, Tanksale AN (2021) Metaheuristics for the distance constrained generalized covering traveling salesman problem. Opsearch 16:1\u201335","journal-title":"Opsearch"},{"issue":"4","key":"7683_CR20","doi-asserted-by":"publisher","first-page":"568","DOI":"10.1287\/opre.45.4.568","volume":"45","author":"M Gendreau","year":"1997","unstructured":"Gendreau M, Laporte G, Semet F (1997) The covering tour problem. Oper Res 45(4):568\u2013576","journal-title":"Oper Res"},{"issue":"1","key":"7683_CR21","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":"7683_CR22","unstructured":"Motta L, Ochi LS, Martinhon C (2001) Grasp metaheuristics for the generalized covering tour problem. In: Proceedings of IV metaheuristic international conference, vol 1. Porto, Portugal, pp 387\u2013391"},{"issue":"1","key":"7683_CR23","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1016\/0377-2217(94)90149-X","volume":"73","author":"JR Current","year":"1994","unstructured":"Current JR, Schilling DA et al (1994) The median tour and maximal covering tour problems: formulations and heuristics. Eur J Oper Res 73(1):114\u2013126","journal-title":"Eur J Oper Res"},{"issue":"3","key":"7683_CR24","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1002\/net.10114","volume":"43","author":"Labbe\u00b4 M, Laporte G, Mart\u0131\u00b4n IR, Go","year":"2004","unstructured":"Labbe\u00b4 M, Laporte G, Mart\u0131\u00b4n IR, Gonza\u00b4lez JJS, (2004) The ring star problem: polyhedral analysis and exact algorithm. Networks 43(3):177\u2013189","journal-title":"Networks"},{"key":"7683_CR25","doi-asserted-by":"crossref","unstructured":"Baldacci R, Dell\u2019Amico M, Gonza\u00b4lez JS (2007) The capacitated m-ring-star problem. Oper Res 55(6):1147\u20131162","DOI":"10.1287\/opre.1070.0432"},{"issue":"3","key":"7683_CR26","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(3):1227\u20131234","journal-title":"Eur J Oper Res"},{"key":"7683_CR27","doi-asserted-by":"crossref","unstructured":"Labbe\u00b4 M, Laporte G, Mart\u0131n IR, Gonza\u00b4lez JJS (2005) Locating median cycles in networks. Eur J Oper Res 160(2):457\u2013470","DOI":"10.1016\/j.ejor.2003.07.010"},{"issue":"3","key":"7683_CR28","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1287\/opre.45.3.378","volume":"45","author":"M Fischetti","year":"1997","unstructured":"Fischetti M, Salazar Gonz\u00e1lez JJ, Toth P (1997) A branch-and-cut algorithm for the symmetric generalized traveling salesman problem. Oper Res 45(3):378\u2013394","journal-title":"Oper Res"},{"key":"7683_CR29","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/0166-218X(90)90100-Q","volume":"26","author":"G Laporte","year":"1990","unstructured":"Laporte G, Martello S (1990) The selective traveling salesman problem. Discr Appl Math 26:193\u2013207","journal-title":"Discr Appl Math"},{"key":"7683_CR30","volume-title":"The traveling salesman problem and its variations","year":"2002","unstructured":"Gutin G, Punnen AP (eds) (2002) The traveling salesman problem and its variations. Kluwer Academic Publishers, Dordrecht, The Netherlands"},{"key":"7683_CR31","doi-asserted-by":"crossref","unstructured":"Gulczynski DJ, Heath JW, Price CC (2006). The close enough traveling salesman problem: a discussion of several heuristics. In: Perspectives in operations research, operations research\/computer science interfaces book series (ORCS), vol 36. Springer, pp 271\u2013283","DOI":"10.1007\/978-0-387-39934-8_16"},{"key":"7683_CR32","doi-asserted-by":"crossref","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: The vehicle routing problem: latest advances and new challenges, operations research\/computer science interfaces book series (ORCS), vol 43. Springer, pp 487\u2013501","DOI":"10.1007\/978-0-387-77778-8_22"},{"key":"7683_CR33","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"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-022-07683-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00521-022-07683-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-022-07683-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,8]],"date-time":"2022-11-08T00:11:57Z","timestamp":1667866317000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00521-022-07683-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,13]]},"references-count":33,"journal-issue":{"issue":"24","published-print":{"date-parts":[[2022,12]]}},"alternative-id":["7683"],"URL":"https:\/\/doi.org\/10.1007\/s00521-022-07683-7","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"value":"0941-0643","type":"print"},{"value":"1433-3058","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,8,13]]},"assertion":[{"value":"23 June 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 July 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 August 2022","order":3,"name":"first_online","label":"First Online","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"}}]}}