{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,13]],"date-time":"2025-11-13T07:21:29Z","timestamp":1763018489935,"version":"3.37.3"},"reference-count":49,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2022,1,29]],"date-time":"2022-01-29T00:00:00Z","timestamp":1643414400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,29]],"date-time":"2022-01-29T00:00:00Z","timestamp":1643414400000},"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":["Appl Intell"],"published-print":{"date-parts":[[2022,8]]},"DOI":"10.1007\/s10489-021-02989-w","type":"journal-article","created":{"date-parts":[[2022,1,29]],"date-time":"2022-01-29T07:02:42Z","timestamp":1643439762000},"page":"11755-11783","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Multi-objective generalized traveling salesman problem: A decomposition approach"],"prefix":"10.1007","volume":"52","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":[[2022,1,29]]},"reference":[{"issue":"NB 2","key":"2989_CR1","first-page":"43","volume":"3","author":"H AL","year":"1969","unstructured":"AL H (1969) Record balancing problem-a dynamic programming solution of a generalized traveling salesman problem. Revue Francaise D Informatique De Recherche Operationnelle 3(NB 2):43","journal-title":"Revue Francaise D Informatique De Recherche Operationnelle"},{"key":"2989_CR2","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/j.swevo.2015.02.003","volume":"23","author":"I Ariyasingha","year":"2015","unstructured":"Ariyasingha I, Fernando T (2015) Performance analysis of the multi-objective ant colony optimization algorithms for the traveling salesman problem. Swarm Evolution Comput 23:11\u201326","journal-title":"Swarm Evolution Comput"},{"doi-asserted-by":"crossref","unstructured":"Audet C, Bigeon J, Cartier D, Le Digabel S, Salomon L (2020) Performance indicators in multiobjective optimization. Europ J Oper Res","key":"2989_CR3","DOI":"10.1016\/j.ejor.2020.11.016"},{"issue":"2","key":"2989_CR4","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1287\/mnsc.1.2.138","volume":"1","author":"A Charnes","year":"1955","unstructured":"Charnes A, Cooper WW, Ferguson RO (1955) Optimal estimation of executive compensation by linear programming. Manag Sci 1(2):138\u2013151","journal-title":"Manag Sci"},{"issue":"2","key":"2989_CR5","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/s10710-005-6164-x","volume":"6","author":"CAC Coello","year":"2005","unstructured":"Coello CAC, Cort\u00e9s NC (2005) Solving multiobjective optimization problems using an artificial immune system. Genetic Programm Evolvable Machines 6(2):163\u2013190","journal-title":"Genetic Programm Evolvable Machines"},{"unstructured":"Cohon J (2013) Chapter 6: Techniques for generating noninferior solutions. Multiobjective programming and planning, Courier Corporation","key":"2989_CR6"},{"issue":"3","key":"2989_CR7","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1137\/S1052623496307510","volume":"8","author":"I Das","year":"1998","unstructured":"Das I, Dennis JE (1998) Normal-boundary intersection: A new method for generating the pareto surface in nonlinear multicriteria optimization problems. SIAM J Optim 8(3):631\u2013657","journal-title":"SIAM J Optim"},{"issue":"2-4","key":"2989_CR8","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/S0045-7825(99)00389-8","volume":"186","author":"K Deb","year":"2000","unstructured":"Deb K (2000) An efficient constraint handling method for genetic algorithms. Comput Methods Appl Mechan Eng 186(2-4):311\u2013338","journal-title":"Comput Methods Appl Mechan Eng"},{"key":"2989_CR9","volume-title":"Multi-objective optimization using evolutionary algorithms, vol 16","author":"K Deb","year":"2001","unstructured":"Deb K (2001) Multi-objective optimization using evolutionary algorithms, vol 16. Wiley, Hoboken"},{"issue":"2","key":"2989_CR10","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 and elitist multiobjective genetic algorithm: Nsga-ii. IEEE Trans Evolution Comput 6(2):182\u2013197","journal-title":"IEEE Trans Evolution Comput"},{"issue":"3","key":"2989_CR11","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"},{"unstructured":"Fonseca CM, Fleming PJ, et al. (1993) Genetic algorithms for multiobjective optimization: Formulationdiscussion and generalization. In: Icga, vol 93. Citeseer, Pennsylvania, pp 416\u2013423","key":"2989_CR12"},{"key":"2989_CR13","doi-asserted-by":"publisher","DOI":"10.1007\/11730095","volume-title":"Evolutionary Computation in Combinatorial optimization: 6th European Conference, evoCOP 2006, Budapest, Hungary, April 10-12, 2006, proceedings, vol 3906","author":"J Gottlieb","year":"2006","unstructured":"Gottlieb J, Raidl GR (2006) Evolutionary Computation in Combinatorial optimization: 6th European Conference, evoCOP 2006, Budapest, Hungary, April 10-12, 2006, proceedings, vol 3906. Springer, Berlin"},{"issue":"1","key":"2989_CR14","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(1):47\u201360","journal-title":"Nat Comput"},{"issue":"2","key":"2989_CR15","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/BF01759923","volume":"4","author":"P Hajela","year":"1992","unstructured":"Hajela P, Lin C. -Y. (1992) Genetic search strategies in multicriterion optimal design. Struct Optim 4(2):99\u2013107","journal-title":"Struct Optim"},{"unstructured":"Helsgaun K (2006) An effective implementation of K-opt moves for the Lin-Kernighan TSP heuristic. PhD thesis, Roskilde University. Department of Computer Science","key":"2989_CR16"},{"doi-asserted-by":"crossref","unstructured":"Horn J, Nafpliotis N, Goldberg DE (1994) A niched pareto genetic algorithm for multiobjective optimization. In: Proceedings of the first IEEE conference on evolutionary computation. IEEE world congress on computational intelligence. Ieee, pp 82\u201387","key":"2989_CR17","DOI":"10.1109\/ICEC.1994.350037"},{"doi-asserted-by":"crossref","unstructured":"Huang W, Zhang Y, Li L (2019) Survey on multi-objective evolutionary algorithms. Journal of physics: Conference series, 1288:012057 aug","key":"2989_CR18","DOI":"10.1088\/1742-6596\/1288\/1\/012057"},{"issue":"2","key":"2989_CR19","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1016\/S0377-2217(98)00218-5","volume":"113","author":"A Jaszkiewicz","year":"1999","unstructured":"Jaszkiewicz A, S\u0142owi\u0144ski R (1999) The \u2019light beam search\u2019approach\u2013an overview of methodology applications. Eur J Oper Res 113(2):300\u2013314","journal-title":"Eur J Oper Res"},{"key":"2989_CR20","volume-title":"Nonlinear Multiobjective Optimization, vol 12","author":"M Kaisa","year":"1999","unstructured":"Kaisa M (1999) Nonlinear Multiobjective Optimization, vol 12. Springer, US"},{"issue":"1","key":"2989_CR21","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/s40595-017-0099-z","volume":"5","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 5(1):27\u201343","journal-title":"Vietnam J Comput Sci"},{"key":"2989_CR22","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1016\/j.swevo.2018.05.006","volume":"44","author":"I Khan","year":"2019","unstructured":"Khan I, Maiti MK (2019) A swap sequence based artificial bee colony algorithm for traveling salesman problem. Swarm Evolution Comput 44:428\u2013438","journal-title":"Swarm Evolution Comput"},{"doi-asserted-by":"crossref","unstructured":"Khan I, Maiti MK, Basuli K (2021) A random-permutation based ga for generalized traveling salesman problem in imprecise environments. Evol Intel 1\u201317","key":"2989_CR23","DOI":"10.1007\/s12065-021-00651-5"},{"doi-asserted-by":"crossref","unstructured":"Khan I, Maiti MK, Maiti M (2017) Coordinating particle swarm optimization, ant colony optimization and k-opt algorithm for traveling salesman problem. In: International conference on mathematics and computing. Springer, pp 103\u2013119","key":"2989_CR24","DOI":"10.1007\/978-981-10-4642-1_10"},{"doi-asserted-by":"crossref","unstructured":"Khan MMK, Indadul, Kreshnendu B (2020) Multi-objective traveling salesman problem: an abc approach. Applied Intelligence","key":"2989_CR25","DOI":"10.1007\/s10489-020-01713-4"},{"doi-asserted-by":"crossref","unstructured":"Knowles J, Corne D (1999) The pareto archived evolution strategy: a new baseline algorithm for pareto multiobjective optimisation. In: Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406), vol 1. IEEE, pp 98\u2013105","key":"2989_CR26","DOI":"10.1109\/CEC.1999.781913"},{"issue":"2","key":"2989_CR27","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1162\/106365600568167","volume":"8","author":"JD Knowles","year":"2000","unstructured":"Knowles JD, Corne DW (2000) Approximating the nondominated front using the pareto archived evolution strategy. Evolution Comput 8(2):149\u2013172","journal-title":"Evolution Comput"},{"issue":"2","key":"2989_CR28","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/0377-2217(86)90050-0","volume":"24","author":"PJ Korhonen","year":"1986","unstructured":"Korhonen PJ, Laakso J (1986) A visual interactive method for solving the multiple criteria problem. Eur J Oper Res 24(2):277\u2013287","journal-title":"Eur J Oper Res"},{"doi-asserted-by":"crossref","unstructured":"Lancia G, Dalpasso M (2019) Algorithmic strategies for a fast exploration of the tsp 4-opt neighborhood. In: Advances in optimization and decision science for society, services and enterprises. Springer, pp 457\u2013470","key":"2989_CR29","DOI":"10.1007\/978-3-030-34960-8_40"},{"issue":"12","key":"2989_CR30","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 travelling salesman problem. J Oper Res Soc 47(12):1461\u20131467","journal-title":"J Oper Res Soc"},{"issue":"1","key":"2989_CR31","first-page":"61","volume":"21","author":"G Laporte","year":"1983","unstructured":"Laporte G, Nobert Y (1983) Generalized travelling salesman problem through n sets of nodes: an integer programming approach. INFOR: Inform Syst Oper Res 21(1):61\u201375","journal-title":"INFOR: Inform Syst Oper Res"},{"key":"2989_CR32","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1016\/j.eswa.2015.10.019","volume":"46","author":"S Maity","year":"2016","unstructured":"Maity S, Roy A, Maiti M (2016) An imprecise multi-objective genetic algorithm for uncertain constrained multi-objective solid travelling salesman problem. Expert Syst Appl 46:196\u2013223","journal-title":"Expert Syst Appl"},{"unstructured":"Pintea C, Pop P, Chira C (2006) Reinforcing ant colony system for the generalized traveling salesman problem. Proc. BIC-TA. Evolutionary Computing 245\u2013252","key":"2989_CR33"},{"issue":"4","key":"2989_CR34","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\u2013a traveling salesman problem library. ORSA J Comput 3(4):376\u2013384","journal-title":"ORSA J Comput"},{"issue":"3","key":"2989_CR35","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":"2989_CR36","first-page":"185","volume":"8","author":"J Saskena","year":"1970","unstructured":"Saskena J (1970) Mathematical model of scheduling clients through welfare agencies. J Canadian Oper Res Soc 8:185\u2013 200","journal-title":"J Canadian Oper Res Soc"},{"unstructured":"Schaffer JD (1985) Multiple objective optimization with vector evaluated genetic algorithms. In: Proceedings of the first international conference on genetic algorithms and their applications. Lawrence Erlbaum Associates. Inc. Publishers, New Jersey, p 1985","key":"2989_CR37"},{"issue":"1","key":"2989_CR38","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. Europ J Oper Res 174(1):38\u201353","journal-title":"Europ J Oper Res"},{"issue":"3","key":"2989_CR39","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1162\/evco.1994.2.3.221","volume":"2","author":"N Srinivas","year":"1994","unstructured":"Srinivas N, Deb K (1994) Muiltiobjective optimization using nondominated sorting in genetic algorithms. Evolution Ccomput 2(3):221\u2013248","journal-title":"Evolution Ccomput"},{"issue":"2","key":"2989_CR40","first-page":"97","volume":"7","author":"S Srivastava","year":"1969","unstructured":"Srivastava S, Kumar S, Garg R, Sen P (1969) Generalized traveling salesman problem through n sets of nodes. CORS J 7(2):97","journal-title":"CORS J"},{"doi-asserted-by":"crossref","unstructured":"van Pinxten J, Geilen M, Basten T, Waqas U, Somers L (2016) Online heuristic for the multi-objective generalized traveling salesman problem. In: 2016 Design, automation & test in europe conference & exhibition (DATE). IEEE, pp 822\u2013825","key":"2989_CR41","DOI":"10.3850\/9783981537079_0953"},{"doi-asserted-by":"crossref","unstructured":"Van Veldhuizen DA, Lamont GB (2000) On measuring multiobjective evolutionary algorithm performance. In: Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No. 00TH8512), vol 1. IEEE, pp 204\u2013211","key":"2989_CR42","DOI":"10.1109\/CEC.2000.870296"},{"doi-asserted-by":"crossref","unstructured":"Wierzbicki AP (1980) The use of reference objectives in multiobjective optimization. In: Multiple criteria decision making theory and application. Springer, pp 468\u2013486","key":"2989_CR43","DOI":"10.1007\/978-3-642-48782-8_32"},{"issue":"1","key":"2989_CR44","doi-asserted-by":"publisher","first-page":"016701","DOI":"10.1103\/PhysRevE.70.016701","volume":"70","author":"C Wu","year":"2004","unstructured":"Wu C, Liang Y, Lee HP, Lu C (2004) Generalized chromosome genetic algorithm for generalized traveling salesman problems and its applications for machining. Phys Rev E 70(1):016701","journal-title":"Phys Rev E"},{"issue":"6","key":"2989_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, Moea D (2007) A multiobjective evolutionary algorithm based on decomposition. IEEE Trans Evolution Comput 11(6):712\u2013731","journal-title":"IEEE Trans Evolution Comput"},{"doi-asserted-by":"crossref","unstructured":"Zhao Y, Liu H-L (2013) Multi-objective particle swarm optimization algorithm based on population decomposition. In: International conference on intelligent data engineering and automated learning. Springer, pp 463\u2013470","key":"2989_CR46","DOI":"10.1007\/978-3-642-41278-3_56"},{"issue":"1","key":"2989_CR47","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/j.swevo.2011.03.001","volume":"1","author":"A Zhou","year":"2011","unstructured":"Zhou A, Qu B-Y, Li H, Zhao S-Z, Suganthan PN, Zhang Q (2011) Multiobjective evolutionary algorithms: a survey of the state of the art. Swarm Evolution Comput 1(1):32\u201349","journal-title":"Swarm Evolution Comput"},{"key":"2989_CR48","volume-title":"Evolutionary algorithms for multiobjective optimization: Methods and applications, vol 63","author":"E Zitzler","year":"1999","unstructured":"Zitzler E (1999) Evolutionary algorithms for multiobjective optimization: Methods and applications, vol 63. Citeseer, Pennsylvania"},{"issue":"4","key":"2989_CR49","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1109\/4235.797969","volume":"3","author":"E Zitzler","year":"1999","unstructured":"Zitzler E, Thiele L (1999) Multiobjective evolutionary algorithms: a comparative case study and the strength pareto approach. IEEE Trans Evolution Comput 3(4):257\u2013271","journal-title":"IEEE Trans Evolution Comput"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-021-02989-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-021-02989-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-021-02989-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,28]],"date-time":"2022-06-28T05:33:26Z","timestamp":1656394406000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-021-02989-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1,29]]},"references-count":49,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2022,8]]}},"alternative-id":["2989"],"URL":"https:\/\/doi.org\/10.1007\/s10489-021-02989-w","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"type":"print","value":"0924-669X"},{"type":"electronic","value":"1573-7497"}],"subject":[],"published":{"date-parts":[[2022,1,29]]},"assertion":[{"value":"8 November 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 January 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}