{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,3]],"date-time":"2026-02-03T20:20:58Z","timestamp":1770150058355,"version":"3.49.0"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,8,21]],"date-time":"2021-08-21T00:00:00Z","timestamp":1629504000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,8,21]],"date-time":"2021-08-21T00:00:00Z","timestamp":1629504000000},"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":["Evol. Intel."],"published-print":{"date-parts":[[2023,2]]},"DOI":"10.1007\/s12065-021-00651-5","type":"journal-article","created":{"date-parts":[[2021,8,21]],"date-time":"2021-08-21T05:03:40Z","timestamp":1629522220000},"page":"229-245","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["A random-permutation based GA for generalized traveling salesman problem in imprecise environments"],"prefix":"10.1007","volume":"16","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4052-551X","authenticated-orcid":false,"given":"Indadul","family":"Khan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manas Kumar","family":"Maiti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Krishnendu","family":"Basuli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,8,21]]},"reference":[{"key":"651_CR1","doi-asserted-by":"publisher","first-page":"546","DOI":"10.1016\/j.asoc.2014.08.033","volume":"26","author":"Z Ardalan","year":"2015","unstructured":"Ardalan Z, Karimi S, Poursabzi O, Naderi B (2015) A novel imperialist competitive algorithm for generalized traveling salesman problems. Appl Soft Comput 26:546\u2013555","journal-title":"Appl Soft Comput"},{"key":"651_CR2","doi-asserted-by":"publisher","first-page":"1844","DOI":"10.1016\/j.cor.2009.05.004","volume":"37","author":"B Bontouxa","year":"2010","unstructured":"Bontouxa B, Artigues C, Feilletc D (2010) A memetic algorithm with a large neighborhood crossover operator for the generalized traveling salesman problem. Comput Oper Res 37:1844\u20131852","journal-title":"Comput Oper Res"},{"issue":"1","key":"651_CR3","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"},{"key":"651_CR4","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.swevo.2013.11.001","volume":"15","author":"C Changdar","year":"2014","unstructured":"Changdar C, Mahapatra GS, Pal R (2014) An efficient genetic algorithm for multi-objective solid traveling salesman problem under fuzziness. Swarm Evol Comput 15:27\u201337","journal-title":"Swarm Evol Comput"},{"key":"651_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0020-0255(96)00084-9","volume":"102","author":"V Dimitrijevi\u0107","year":"1997","unstructured":"Dimitrijevi\u0107 V, \u0160ari\u0107 Z (1997) An efficient transformation of the generalized traveling salesman problem into the traveling salesman problem on digraphs. Inf Sci 102:1\u20134","journal-title":"Inf Sci"},{"key":"651_CR6","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 JJ, Toth P (1997) A branch-and-cut algorithm for the symmetric generalized traveling salesman problem. Oper Res 45:378\u2013394","journal-title":"Oper Res"},{"key":"651_CR7","volume-title":"Genetic algorithms: search, optimization and machine learning","author":"DE Goldberg","year":"1989","unstructured":"Goldberg DE (1989) Genetic algorithms: search, optimization and machine learning. Addison Wesley, Reading"},{"issue":"3","key":"651_CR8","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/s12597-013-0153-2","volume":"51","author":"P Guchhait","year":"2013","unstructured":"Guchhait P, Maiti MK, Maitia M (2013) Inventory model of a deteriorating item with price and credit linked fuzzy demand: a fuzzy differential equation approach. Opsearch 51(3):321\u2013353","journal-title":"Opsearch"},{"key":"651_CR9","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/s11047-009-9111-6","volume":"9","author":"G Gutin","year":"2010","unstructured":"Gutin G, Karapetyan D (2010) A memetic algorithm for the generalized traveling salesman problem. Nat Comput 9:47\u201360","journal-title":"Nat Comput"},{"issue":"3","key":"651_CR10","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/s12532-015-0080-8","volume":"7","author":"K Helsgaun","year":"2015","unstructured":"Helsgaun K (2015) Solving the equality generalized traveling salesman problem using the Lin\u2013Kernighan\u2013Helsgaun algorithm. Math Program Comput 7(3):269\u2013287","journal-title":"Math Program Comput"},{"key":"651_CR11","first-page":"43","volume":"B2","author":"AL Henry-Labordere","year":"1969","unstructured":"Henry-Labordere AL (1969) The record balancing problem: a dynamic programming solution of a generalized traveling salesman problem. RAIRO Oper Res B2:43\u201349","journal-title":"RAIRO Oper Res"},{"key":"651_CR12","volume-title":"Adaptation in natural and artificial systems","author":"JH Holland","year":"1975","unstructured":"Holland JH (1975) Adaptation in natural and artificial systems. The University of Michigan Press, Ann Arbor"},{"key":"651_CR13","doi-asserted-by":"crossref","unstructured":"Khanra A, Maiti MK, Maiti M (2015) 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. Springer, p 404","DOI":"10.1007\/978-81-322-2695-6_26"},{"key":"651_CR14","doi-asserted-by":"publisher","first-page":"1987","DOI":"10.3233\/IFS-151913","volume":"30","author":"A Khanra","year":"2016","unstructured":"Khanra A, Maiti MK, Maiti M (2016) A hybrid heuristic algorithm for single and multi-objective imprecise traveling salesman problems. J Intell Fuzzy Syst 30:1987\u20132001","journal-title":"J Intell Fuzzy Syst"},{"issue":"5","key":"651_CR15","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/s40595-017-0099-z","volume":"1","author":"I Khan","year":"2018","unstructured":"Khan I, Maiti MK (2018) A novel hybrid algorithm for generalized traveling salesman problems in different environments. Vietnam J Comput Sci 1(5):27\u201343","journal-title":"Vietnam J Comput Sci"},{"key":"651_CR16","first-page":"61","volume":"21","author":"G Laporte","year":"1983","unstructured":"Laporte G, Nobert Y (1983) Generalized traveling salesman through n sets of nodes: an integer programming approach. INFOR 21:61\u201375","journal-title":"INFOR"},{"key":"651_CR17","doi-asserted-by":"publisher","first-page":"1461","DOI":"10.1057\/jors.1996.190","volume":"47","author":"G Laporte","year":"1996","unstructured":"Laporte G, Asef-Vaziri A, Sriskandarajah C (1996) Some applications of the generalized traveling salesman problem. J Oper Res Soc 47:1461\u20131467","journal-title":"J Oper Res Soc"},{"key":"651_CR18","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, Heidelberg"},{"key":"651_CR19","doi-asserted-by":"publisher","first-page":"1549","DOI":"10.1016\/j.asoc.2009.12.029","volume":"11","author":"AK Maity","year":"2011","unstructured":"Maity AK (2011) One machine multiple-product problem with production-inventory system under fuzzy inequality constraint. Appl Soft Comput 11:1549\u20131555","journal-title":"Appl Soft Comput"},{"key":"651_CR20","doi-asserted-by":"publisher","first-page":"2433","DOI":"10.1016\/j.apm.2008.07.024","volume":"33","author":"AK Maiti","year":"2009","unstructured":"Maiti AK, Maiti MK, Maiti M (2009) Inventory model with stochastic lead-time and price dependent demand incorporating advance payment. Appl Math Model 33:2433\u20132443","journal-title":"Appl Math Model"},{"key":"651_CR21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-02830-8","volume-title":"Genetic algorithms + data structure = evolution programs","author":"Z Michalewicz","year":"1992","unstructured":"Michalewicz Z (1992) Genetic algorithms + data structure = evolution programs. Springer, Berlin"},{"key":"651_CR22","doi-asserted-by":"publisher","first-page":"3200","DOI":"10.1016\/j.apm.2012.07.024","volume":"37","author":"M Mondal","year":"2013","unstructured":"Mondal M, Maity AK, Maiti MK, Maiti M (2013) A production-repairing inventory model with fuzzy rough coefficients under inflation and time value of money. Appl Math Model 37:3200\u20133215","journal-title":"Appl Math Model"},{"key":"651_CR23","unstructured":"Mohon C (2000) Optimization in fuzzy-stochastic environment and its importance in present day industrial scenario. In: Proceedings on mathematics and its application in industry and business. Narosa Publishing House, India"},{"key":"651_CR24","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1287\/opre.39.4.623","volume":"39","author":"CE Noon","year":"1991","unstructured":"Noon CE, Bean JC (1991) A Lagrangian based approach for the asymmetric generalized traveling salesman problem. Oper Res 39:623\u2013632","journal-title":"Oper Res"},{"issue":"1","key":"651_CR25","first-page":"39","volume":"31","author":"CE Noon","year":"1993","unstructured":"Noon CE, Bean JC (1993) An efficient transformation of the generalized traveling salesman problem. INFOR Inf Syst Oper Res 31(1):39\u201344","journal-title":"INFOR Inf Syst Oper Res"},{"key":"651_CR26","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":"651_CR27","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:376\u201384","journal-title":"ORSA J Comput"},{"issue":"3","key":"651_CR28","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1016\/S0377-2217(97)00142-2","volume":"108","author":"J Renaud","year":"1998","unstructured":"Renaud J, Boctor FF (1998) An efficient composite heuristic for the symmetric generalized traveling salesman problem. Eur J Oper Res 108(3):571\u2013584","journal-title":"Eur J Oper Res"},{"key":"651_CR29","doi-asserted-by":"publisher","first-page":"228","DOI":"10.2991\/ijcis.d.201127.001","volume":"14","author":"X Ren","year":"2020","unstructured":"Ren X, Wang X, Wang Z, Wu T (2020) Parallel DNA algorithms of generalized traveling salesman problem-based bioinspired computing model. Int J Comput Intell Syst 14:228\u2013237","journal-title":"Int J Comput Intell Syst"},{"key":"651_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cor.2017.05.010","volume":"87","author":"SL Smith","year":"2017","unstructured":"Smith SL, Imeson F (2017) GLNS: an effective large neighborhood search heuristic for the generalized traveling salesman problem. Comput Oper Res 87:1\u201319","journal-title":"Comput Oper Res"},{"key":"651_CR31","first-page":"185","volume":"8","author":"JP Saskena","year":"1970","unstructured":"Saskena JP (1970) Mathematical model of scheduling clients through welfare agencies. J Can Oper Res Soc 8:185\u2013200","journal-title":"J Can Oper Res Soc"},{"key":"651_CR32","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/j.ipl.2007.03.010","volume":"103","author":"XH Shi","year":"2007","unstructured":"Shi XH, Lianga YC, Leeb HP, Lub C, Wanga QX (2007) Particle swarm optimization-based algorithms for TSP and generalized TSP. Inf Process Lett 103:69\u2013176","journal-title":"Inf Process Lett"},{"key":"651_CR33","first-page":"97","volume":"7","author":"SS Srivastava","year":"1969","unstructured":"Srivastava SS, Kumar S, Garg RC, Sen P (1969) Generalized traveling salesman problem through n sets of nodes. CORS J 7:97\u2013101","journal-title":"CORS J"},{"key":"651_CR34","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1016\/j.ejor.2004.09.057","volume":"174","author":"LV Snyder","year":"2006","unstructured":"Snyder LV, Daskin MS (2006) A random-key genetic algorithm for the generalized traveling salesman problem. Eur J Oper Res 174:38\u201353","journal-title":"Eur J Oper Res"},{"key":"651_CR35","doi-asserted-by":"publisher","first-page":"016701","DOI":"10.1103\/PhysRevE.70.016701","volume":"70","author":"CG Wu","year":"2004","unstructured":"Wu CG, Liang YC, Lee HP, Lu C (2004) A generalized chromosome genetic algorithm for generalized traveling salesman problems and its applications for machining. Phys Rev E 70:016701","journal-title":"Phys Rev E"},{"key":"651_CR36","doi-asserted-by":"publisher","first-page":"1417","DOI":"10.1016\/j.pnsc.2008.03.028","volume":"18","author":"J Yang","year":"2008","unstructured":"Yang J, Shi X, Marchese M, Liang Y (2008) An ant colony optimization method for generalized TSP problem. Prog Nat Sci 18:1417\u20131422","journal-title":"Prog Nat Sci"},{"key":"651_CR37","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":"651_CR38","doi-asserted-by":"crossref","unstructured":"Zhao X, Zhu XP (2010) Innovative genetic algorithm for solving GTSP. In: Second international conference on modeling, simulation and visualization methods. College of Computer Science and Engineering, Guangdong Institute of Science and Technology","DOI":"10.1109\/WMSVM.2010.67"}],"container-title":["Evolutionary Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12065-021-00651-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12065-021-00651-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12065-021-00651-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,30]],"date-time":"2023-01-30T20:19:36Z","timestamp":1675109976000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12065-021-00651-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,21]]},"references-count":38,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,2]]}},"alternative-id":["651"],"URL":"https:\/\/doi.org\/10.1007\/s12065-021-00651-5","relation":{},"ISSN":["1864-5909","1864-5917"],"issn-type":[{"value":"1864-5909","type":"print"},{"value":"1864-5917","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,8,21]]},"assertion":[{"value":"15 September 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 June 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 August 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 August 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}