{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T23:56:05Z","timestamp":1775346965544,"version":"3.50.1"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2017,11,15]],"date-time":"2017-11-15T00:00:00Z","timestamp":1510704000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Ambient Intell Human Comput"],"published-print":{"date-parts":[[2019,1]]},"DOI":"10.1007\/s12652-017-0620-3","type":"journal-article","created":{"date-parts":[[2017,11,15]],"date-time":"2017-11-15T05:36:11Z","timestamp":1510724171000},"page":"125-141","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":20,"title":["Constrained covering solid travelling salesman problems in uncertain environment"],"prefix":"10.1007","volume":"10","author":[{"given":"Anupam","family":"Mukherjee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Goutam","family":"Panigrahi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2059-1755","authenticated-orcid":false,"given":"Samarjit","family":"Kar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manoranjan","family":"Maiti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,11,15]]},"reference":[{"key":"620_CR1","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1016\/j.cie.2015.04.007","volume":"85","author":"S Al-Shihabi","year":"2015","unstructured":"Al-Shihabi S, Arafeh M, Barghash M (2015) An improved hybrid algorithm for the set covering problem. Comput Ind Eng 85:328\u2013334","journal-title":"Comput Ind Eng"},{"issue":"2","key":"620_CR2","doi-asserted-by":"crossref","first-page":"843","DOI":"10.3233\/IFS-141366","volume":"28","author":"D Chakraborty","year":"2015","unstructured":"Chakraborty D, Jana DK, Roy TK (2015) A new approach to solve multi-objective multi-choice multi-item Atanassov\u2019s intuitionistic fuzzy transportation problem using chance operator. J Intell Fuzzy Syst 28(2):843\u2013865","journal-title":"J Intell Fuzzy Syst"},{"issue":"3","key":"620_CR3","doi-asserted-by":"publisher","first-page":"748","DOI":"10.1016\/j.ejor.2008.10.012","volume":"198","author":"T Chang","year":"2009","unstructured":"Chang T, Wan Y, Tooi W (2009) A stochastic dynamic travelling salesman problem with hard time windows. Eur J Oper Res 198(3):748\u2013759","journal-title":"Eur J Oper Res"},{"issue":"1","key":"620_CR4","first-page":"1","volume":"10","author":"C Changdar","year":"2013","unstructured":"Changdar C, Maiti MK, Maiti M (2013) A constrained solid TSP in fuzzy environment: two heuristic approaches. Iran J Fuzzy Syst 10(1):1\u201328","journal-title":"Iran J Fuzzy Syst"},{"issue":"3","key":"620_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":"620_CR6","first-page":"115","volume":"9","author":"K Deb","year":"1995","unstructured":"Deb K, Agarwal RB (1995) Simulated binary crossover for continuous search space. Complex Syst 9:115\u2013148","journal-title":"Complex Syst"},{"issue":"2","key":"620_CR7","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 T (2002) A fast elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans Evol Comput 6(2):182\u2013197","journal-title":"IEEE Trans Evol Comput"},{"issue":"3","key":"620_CR8","doi-asserted-by":"publisher","first-page":"378394","DOI":"10.1287\/opre.45.3.378","volume":"45","author":"M Fischetti","year":"1997","unstructured":"Fischetti M, Salazar Gonzlez JJ, Toth P (1997) A branch and cut algorithm for the symmetric generalized traveling salesman problem. Oper Res 45(3):378394","journal-title":"Oper Res"},{"key":"620_CR9","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1016\/j.dam.2006.04.043","volume":"155","author":"P Galiniera","year":"2007","unstructured":"Galiniera P, Hertzb A (2007) Solution techniques for the large set covering problem. Discrete Appl Math 155:312\u2013326","journal-title":"Discrete Appl Math"},{"issue":"4","key":"620_CR10","doi-asserted-by":"publisher","first-page":"534","DOI":"10.1287\/ijoc.1110.0480","volume":"24","author":"BL Golden","year":"2012","unstructured":"Golden BL, 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":"4","key":"620_CR11","first-page":"568576","volume":"45","author":"M Gendreau","year":"1997","unstructured":"Gendreau M, Laporte G, Semet F (1997) The covering tour problem. Oper Res 45(4):568576","journal-title":"Oper Res"},{"key":"620_CR12","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:29\u201342","journal-title":"Comput Oper Res"},{"key":"620_CR38","unstructured":"International Business Times (2015) Nepal earthquake death toll rises to 8,413. http:\/\/www.ibtimes.co.in\/nepal-earthquake-death-toll-rises-8413-631650 . Accessed 7 May 2015"},{"key":"620_CR13","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/j.cie.2015.06.018","volume":"88","author":"A Khanra","year":"2015","unstructured":"Khanra A, Maiti MK, Maiti M (2015) Profit maximization of TSP through a hybrid algorithm. Comput Ind Eng 88:229\u2013236","journal-title":"Comput Ind Eng"},{"issue":"9","key":"620_CR14","doi-asserted-by":"publisher","first-page":"2297","DOI":"10.1007\/s00500-015-1941-9","volume":"21","author":"P Kundu","year":"2015","unstructured":"Kundu P, Kar MB, Kar S, Pal T, Maiti M (2015) A solid transportation model with product blending and parameters as rough variables. Soft Comput 21(9):2297\u20132306","journal-title":"Soft Comput"},{"issue":"3","key":"620_CR15","doi-asserted-by":"publisher","first-page":"177189","DOI":"10.1002\/net.10114","volume":"43","author":"M Labb\u00e9","year":"2004","unstructured":"Labb\u00e9 M, Laporte G, Martn IR, Salazar Gonzlez JJ (2004) The ring star problem: polyhedral analysis and exact algorithm. Networks 43(3):177189","journal-title":"Networks"},{"key":"620_CR16","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1016\/j.cie.2006.08.002","volume":"51","author":"G Lan","year":"2006","unstructured":"Lan G, DePuy GW (2006) On the effectiveness of incorporating randomness and memory into a multi-start metaheuristic with application to the set covering problem. Comput Ind Eng 51:362\u2013374","journal-title":"Comput Ind Eng"},{"issue":"3","key":"620_CR17","doi-asserted-by":"publisher","first-page":"6995","DOI":"10.1016\/j.eswa.2008.08.026","volume":"36","author":"F Liu","year":"2008","unstructured":"Liu F, Zeng G (2008) Study of genetic algorithm woth reinforcement learning to solve the TSP.\u00a0Expert Syst Appl 36(3):6995\u20137001","journal-title":"Expert Syst Appl"},{"key":"620_CR18","first-page":"125","volume":"216","author":"YH Liu","year":"2010","unstructured":"Liu YH (2010) Different initial solution generators in genetic algorithms for solving the probabilistic travelling salesman problem. Appl Math Comput 216:125\u2013137","journal-title":"Appl Math Comput"},{"key":"620_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":"620_CR20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-39987-2","volume-title":"Uncertainty theory: an introduction to its axiomatic foundations","author":"B Liu","year":"2004","unstructured":"Liu B (2004) Uncertainty theory: an introduction to its axiomatic foundations. Springer, Berlin"},{"key":"620_CR21","doi-asserted-by":"publisher","first-page":"258","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. Springer, Berlin, p 258"},{"key":"620_CR22","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/j.cie.2015.02.023","volume":"83","author":"S Maity","year":"2015","unstructured":"Maity S, Roy A, Maiti M (2015) A modified genetic algorithm for solving uncertain constrained solid travelling salesman problems. Comput Ind Eng 83:273\u2013296","journal-title":"Comput Ind Eng"},{"issue":"9","key":"620_CR23","doi-asserted-by":"publisher","first-page":"3063","DOI":"10.1016\/j.cam.2010.12.027","volume":"235","author":"j Majumder","year":"2011","unstructured":"Majumder j, Bhunia AK (2011) Genetic algorithm for asymmetric traveling salesman problem with imprecise travel times. J Comput Appl Math 235(9):3063\u20133078","journal-title":"J Comput Appl Math"},{"issue":"12","key":"620_CR24","doi-asserted-by":"publisher","first-page":"3218","DOI":"10.1016\/j.cor.2012.10.001","volume":"40","author":"M Mestria","year":"2013","unstructured":"Mestria M, Ochi LS, Martins SL (2013) GRASP with path relinking for the symmetric Euclidean clustered traveling salesman problem. Comput Oper Res 40(12):3218\u20133229","journal-title":"Comput Oper Res"},{"key":"620_CR25","doi-asserted-by":"publisher","first-page":"606","DOI":"10.1016\/S0377-2217(01)00227-2","volume":"140","author":"C Moon","year":"2002","unstructured":"Moon C, Ki J, Choi G, Seo Y (2002) An efficient genetic algorithm for the traveling salesman problem with precedence constraints. Eur J Oper Res 140:606\u2013617","journal-title":"Eur J Oper Res"},{"key":"620_CR26","doi-asserted-by":"publisher","first-page":"8947","DOI":"10.1016\/j.eswa.2012.02.029","volume":"39","author":"Y Nagata","year":"2012","unstructured":"Nagata Y, Soler D (2012) A new genetic algorithm for the asymmetric travelling salesman problem. Expert Syst Appl 39:8947\u20138953","journal-title":"Expert Syst Appl"},{"key":"620_CR27","doi-asserted-by":"publisher","first-page":"2643","DOI":"10.3233\/IFS-151542","volume":"28","author":"S Pramanik","year":"2015","unstructured":"Pramanik S, Jana DK, Maiti M (2015) A fixed charge multi-objective solid transportation problem in random fuzzy environment. J Intell Fuzzy Syst 28:2643\u20132654","journal-title":"J Intell Fuzzy Syst"},{"key":"620_CR28","doi-asserted-by":"publisher","first-page":"774","DOI":"10.1016\/j.cie.2010.02.011","volume":"58","author":"Z Ren","year":"2010","unstructured":"Ren Z, Feng Z, Ke L, Zhang Z (2010) New ideas for applying ant colony optimization to the set covering problem. Comput Ind Eng 58:774\u2013784","journal-title":"Comput Ind Eng"},{"key":"620_CR29","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":"620_CR30","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":"620_CR31","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.cie.2011.02.008","volume":"61","author":"N Sapkota","year":"2011","unstructured":"Sapkota N, Reilly CH (2011) Simulating realistic set covering problems with known optimal solutions. Comput Ind Eng 61:39\u201347","journal-title":"Comput Ind Eng"},{"key":"620_CR32","unstructured":"TSPLIB (1995). http:\/\/elib.zib.de\/pub\/mp-testdata\/tsp\/tsplib\/tsp"},{"key":"620_CR37","unstructured":"United States Geological Survey (2015) M7.8 36 km E of Khudi, Nepal. Accessed 12 May 2015"},{"key":"620_CR33","unstructured":"Xudong S, Yunlong X (2013) An improved adaptive genetic algorithm. In: International conference on education technology and management science (ICETMS)"},{"key":"620_CR34","first-page":"887","volume":"18","author":"J Yang","year":"2008","unstructured":"Yang J, Wu C, Lee HP, Liang Y (2008) Solving travelling salesman problems using generalized chromosome genetic algorithm. Nat Sci 18:887\u2013892","journal-title":"Nat Sci"},{"key":"620_CR35","doi-asserted-by":"crossref","unstructured":"Zadeh LA (1994) Fuzzy logic and soft computing: issues, contentions and perspectives. In: Proceedings of $$IIZUKA$$ I I Z U K A 94 third international conference on fuzzy (1994) logic, neural nets and soft computing, vol 1\u20132. Iizuka, Japan","DOI":"10.1145\/197530.197667"},{"issue":"1","key":"620_CR36","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/s11633-009-0097-4","volume":"06","author":"F Zhao","year":"2009","unstructured":"Zhao F, Sun J, Li S, Liu W (2009) A hybrid genetic algorithm for the traveling salesman problem with pickup and delivery. Int J Autom Comput 06(1):97\u2013102","journal-title":"Int J Autom Comput"}],"container-title":["Journal of Ambient Intelligence and Humanized Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12652-017-0620-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12652-017-0620-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12652-017-0620-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,7]],"date-time":"2022-08-07T10:15:22Z","timestamp":1659867322000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12652-017-0620-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,11,15]]},"references-count":38,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,1]]}},"alternative-id":["620"],"URL":"https:\/\/doi.org\/10.1007\/s12652-017-0620-3","relation":{},"ISSN":["1868-5137","1868-5145"],"issn-type":[{"value":"1868-5137","type":"print"},{"value":"1868-5145","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,11,15]]},"assertion":[{"value":"12 April 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 November 2017","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 November 2017","order":3,"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 there is no conflict of interest regarding the publication of this paper.","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"}},{"value":"Informed consent was obtained from all individual participants included in the study.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Informed consent"}}]}}