{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,13]],"date-time":"2026-06-13T09:45:14Z","timestamp":1781343914465,"version":"3.54.1"},"reference-count":94,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2025,5,8]],"date-time":"2025-05-08T00:00:00Z","timestamp":1746662400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,5,8]],"date-time":"2025-05-08T00:00:00Z","timestamp":1746662400000},"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":[[2025,6]]},"DOI":"10.1007\/s12065-025-01045-7","type":"journal-article","created":{"date-parts":[[2025,5,8]],"date-time":"2025-05-08T03:48:20Z","timestamp":1746676100000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A collaborative use of two metaheuristic methods using Q-learning for the travelling salesman problems in different fields: an application to smart home delivery system"],"prefix":"10.1007","volume":"18","author":[{"ORCID":"https:\/\/orcid.org\/0009-0001-3605-8330","authenticated-orcid":false,"given":"Sk Hojayfa","family":"Rahaman","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5639-8439","authenticated-orcid":false,"given":"Sukumar","family":"Mondal","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-1033-578X","authenticated-orcid":false,"given":"Manas Kumar","family":"Maiti","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,5,8]]},"reference":[{"key":"1045_CR1","volume-title":"The traveling salesman problem","author":"DB Shmoys","year":"1985","unstructured":"Shmoys DB, Lenstra J, Kan AR, Lawler EL (1985) The traveling salesman problem, vol 12. John Wiley & Sons, Hoboken"},{"issue":"2","key":"1045_CR2","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":"1","key":"1045_CR3","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1109\/3477.484436","volume":"26","author":"M Dorigo","year":"1996","unstructured":"Dorigo M, Maniezzo V, Colorni A (1996) Ant system: optimization by a colony of cooperating agents. IEEE Trans Syst Man Cybern Part b (cybern) 26(1):29\u201341","journal-title":"IEEE Trans Syst Man Cybern Part b (cybern)"},{"issue":"9","key":"1045_CR4","doi-asserted-by":"publisher","first-page":"3063","DOI":"10.1016\/j.cam.2010.12.027","volume":"235","author":"J Majumdar","year":"2011","unstructured":"Majumdar 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":"5","key":"1045_CR5","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/j.ipl.2007.03.010","volume":"103","author":"XH Shi","year":"2007","unstructured":"Shi XH, Liang YC, Lee HP, Lu C, Wang Q (2007) Particle swarm optimization-based algorithms for tsp and generalized tsp. Inf Process Lett 103(5):169\u2013176","journal-title":"Inf Process Lett"},{"issue":"1","key":"1045_CR6","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1287\/opre.4.1.61","volume":"4","author":"MM Flood","year":"1956","unstructured":"Flood MM (1956) The traveling-salesman problem. Oper Res 4(1):61\u201375","journal-title":"Oper Res"},{"issue":"3","key":"1045_CR7","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1287\/opre.16.3.538","volume":"16","author":"M Bellmore","year":"1968","unstructured":"Bellmore M, Nemhauser GL (1968) The traveling salesman problem: a survey. Oper Res 16(3):538\u2013558","journal-title":"Oper Res"},{"key":"1045_CR8","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1016\/j.knosys.2018.05.033","volume":"158","author":"Y Zhao","year":"2018","unstructured":"Zhao Y, Zheng Z, Liu Y (2018) Survey on computational-intelligence-based UAV path planning. Knowl-Based Syst 158:54\u201364","journal-title":"Knowl-Based Syst"},{"issue":"4","key":"1045_CR9","doi-asserted-by":"publisher","first-page":"904","DOI":"10.1109\/JAS.2019.1911540","volume":"6","author":"K Gao","year":"2019","unstructured":"Gao K, Cao Z, Zhang L, Chen Z, Han Y, Pan Q (2019) A review on swarm intelligence and evolutionary algorithms for solving flexible job shop scheduling problems. IEEE\/CAA J Autom Sin 6(4):904\u2013916","journal-title":"IEEE\/CAA J Autom Sin"},{"issue":"3","key":"1045_CR10","first-page":"2033","volume":"22","author":"GD Konstantakopoulos","year":"2020","unstructured":"Konstantakopoulos GD, Gayialis SP, Kechagias EP (2020) Vehicle routing problem and related algorithms for logistics distribution: a literature review and classification. Oper Res 22(3):2033\u20132062","journal-title":"Oper Res"},{"key":"1045_CR11","doi-asserted-by":"crossref","unstructured":"Erol MH, Bulut F (2017) Real-time application of travelling salesman problem using google maps API. In: 2017 electric electronics, computer science, biomedical engineerings\u2019 meeting (EBBT), IEEE. pp 1\u20135","DOI":"10.1109\/EBBT.2017.7956764"},{"issue":"1","key":"1045_CR12","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1080\/13873954.2019.1705496","volume":"26","author":"T Derya","year":"2020","unstructured":"Derya T, Dinler E, Ke\u00e7eci B (2020) Selective generalized travelling salesman problem. Math Comput Model Dyn Syst 26(1):80\u2013118","journal-title":"Math Comput Model Dyn Syst"},{"issue":"3","key":"1045_CR13","first-page":"219","volume":"14","author":"A U\u011fur","year":"2009","unstructured":"U\u011fur A, Koruko\u011flu S, \u00c7al\u0131skan A, Cinsdikici M, Alp A (2009) Genetic algorithm based solution for TSP on a sphere. Math Comput Appl 14(3):219\u2013228","journal-title":"Math Comput Appl"},{"key":"1045_CR14","doi-asserted-by":"publisher","first-page":"798","DOI":"10.1016\/j.sbspro.2012.09.796","volume":"54","author":"F Ciaffi","year":"2012","unstructured":"Ciaffi F, Cipriani E, Petrelli M (2012) Feeder bus network design problem: a new metaheuristic procedure and real size applications. Procedia Soc Behav Sci 54:798\u2013807","journal-title":"Procedia Soc Behav Sci"},{"issue":"1","key":"1045_CR15","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1109\/TEPM.2003.813002","volume":"26","author":"R Kumar","year":"2003","unstructured":"Kumar R, Luo Z (2003) Optimizing the operation sequence of a chip placement machine using tsp model. IEEE Trans Electron Packag Manuf 26(1):14\u201321","journal-title":"IEEE Trans Electron Packag Manuf"},{"issue":"10","key":"1045_CR16","doi-asserted-by":"publisher","first-page":"1837","DOI":"10.1080\/00207548908942657","volume":"27","author":"D Chan","year":"1989","unstructured":"Chan D, Mercier D (1989) IC insertion: an application of the travelling salesman problem. Int J Prod Res 27(10):1837\u20131841","journal-title":"Int J Prod Res"},{"key":"1045_CR17","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/BF01324873","volume":"6","author":"JF Bard","year":"1994","unstructured":"Bard JF, Clayton RW, Feo TA (1994) Machine setup and component placement in printed circuit board assembly. Int J Flex Manuf Syst 6:5\u201331","journal-title":"Int J Flex Manuf Syst"},{"key":"1045_CR18","volume-title":"The traveling salesman problem and its variations","author":"G Gutin","year":"2006","unstructured":"Gutin G, Punnen AP (2006) The traveling salesman problem and its variations, vol 12. Springer Science & Business Media, Berlin"},{"issue":"1","key":"1045_CR19","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1287\/opre.26.1.86","volume":"26","author":"J-C Picard","year":"1978","unstructured":"Picard J-C, Queyranne M (1978) The time-dependent traveling salesman problem and its application to the tardiness problem in one-machine scheduling. Oper Res 26(1):86\u2013110","journal-title":"Oper Res"},{"issue":"4","key":"1045_CR20","doi-asserted-by":"publisher","first-page":"929","DOI":"10.1016\/j.cie.2010.09.003","volume":"59","author":"MM Paydar","year":"2010","unstructured":"Paydar MM, Mahdavi I, Sharafuddin I, Solimanpur M (2010) Applying simulated annealing for designing cellular manufacturing systems using MDmTSP. Comput Ind Eng 59(4):929\u2013936","journal-title":"Comput Ind Eng"},{"issue":"7","key":"1045_CR21","doi-asserted-by":"publisher","first-page":"1427","DOI":"10.1080\/00207540410001733896","volume":"43","author":"J Won","year":"2005","unstructured":"Won J, Olafsson S (2005) Joint order batching and order picking in warehouse operations. Int J Prod Res 43(7):1427\u20131442","journal-title":"Int J Prod Res"},{"issue":"3","key":"1045_CR22","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/S0925-5273(98)00010-3","volume":"54","author":"L Khoo","year":"1998","unstructured":"Khoo L, Ng T (1998) A genetic algorithm-based planning system for PCB component placement. Int J Prod Econ 54(3):321\u2013332","journal-title":"Int J Prod Econ"},{"issue":"1","key":"1045_CR23","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1080\/00207540310001601073","volume":"42","author":"E Duman","year":"2004","unstructured":"Duman E, Or I (2004) Precedence constrained tsp arising in printed circuit board assembly. Int J Prod Res 42(1):67\u201378","journal-title":"Int J Prod Res"},{"issue":"6","key":"1045_CR24","doi-asserted-by":"publisher","first-page":"B-279","DOI":"10.1287\/mnsc.18.6.B279","volume":"18","author":"R Angel","year":"1972","unstructured":"Angel R, Caudle W, Noonan R, Whinston A (1972) Computer-assisted school bus scheduling. Manag Sci 18(6):B-279","journal-title":"Manag Sci"},{"key":"1045_CR25","first-page":"193","volume":"17","author":"JS Arias-Rojas","year":"2012","unstructured":"Arias-Rojas JS, Jim\u00e9nez JF, Montoya-Torres JR (2012) Solving of school bus routing problem by ant colony optimization. Revista EIA 17:193\u2013208","journal-title":"Revista EIA"},{"key":"1045_CR26","doi-asserted-by":"crossref","unstructured":"Brumitt BL, Stentz A (1996) Dynamic mission planning for multiple mobile robots. In: Proceedings of IEEE international conference on robotics and automation, vol 3. IEEE, pp 2396\u20132401","DOI":"10.1109\/ROBOT.1996.506522"},{"key":"1045_CR27","doi-asserted-by":"crossref","unstructured":"Tian J, Shen L, Zheng Y (2006) Genetic algorithm based approach for multi-UAV cooperative reconnaissance mission planning problem. In: International symposium on methodologies for intelligent systems, Springer, pp 101\u2013110","DOI":"10.1007\/11875604_13"},{"key":"1045_CR28","unstructured":"Wang K.-P, Huang L, Zhou C-G, Pang W (2003) Particle swarm optimization for traveling salesman problem. In: Proceedings of the 2003 international conference on machine learning and cybernetics (IEEE cat. no. 03ex693), vol 3. IEEE, pp 1583\u20131585"},{"key":"1045_CR29","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"},{"key":"1045_CR30","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1016\/j.asoc.2015.01.068","volume":"30","author":"M Mahi","year":"2015","unstructured":"Mahi M, Baykan \u00d6K, Kodaz H (2015) A new hybrid method based on particle swarm optimization, ant colony optimization and 3-opt algorithms for traveling salesman problem. Appl Soft Comput 30:484\u2013490","journal-title":"Appl Soft Comput"},{"key":"1045_CR31","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: Mathematics and computing: third international conference, ICMC 2017, Haldia, India, January 17-21, 2017, Proceedings 3. Springer, pp 103\u2013119","DOI":"10.1007\/978-981-10-4642-1_10"},{"key":"1045_CR32","doi-asserted-by":"crossref","unstructured":"Sopto DS, Ayon SI, Akhand M, Siddique N (2018) Modified grey wolf optimization to solve traveling salesman problem In: 2018 International conference on innovation in engineering and technology (ICIET). IEEE, pp 1\u20134","DOI":"10.1109\/CIET.2018.8660872"},{"issue":"18","key":"1045_CR33","first-page":"6256","volume":"96","author":"A Shaheen","year":"2018","unstructured":"Shaheen A, Sleit A, Al-Sharaeh S (2018) A solution for traveling salesman problem using grey wolf optimizer algorithm. J Theor Appl Inf Technol 96(18):6256\u20136266","journal-title":"J Theor Appl Inf Technol"},{"key":"1045_CR34","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 Evol Comput 44:428\u2013438","journal-title":"Swarm Evol Comput"},{"issue":"4","key":"1045_CR35","first-page":"1987","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(4):1987\u20132001","journal-title":"J Intell Fuzzy Syst"},{"key":"1045_CR36","doi-asserted-by":"publisher","first-page":"107298","DOI":"10.1016\/j.asoc.2021.107298","volume":"105","author":"K Panwar","year":"2021","unstructured":"Panwar K, Deep K (2021) Discrete grey wolf optimizer for symmetric travelling salesman problem. Appl Soft Comput 105:107298","journal-title":"Appl Soft Comput"},{"key":"1045_CR37","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1155\/2021\/6668345","volume":"2021","author":"M Yousefikhoshbakht","year":"2021","unstructured":"Yousefikhoshbakht M (2021) Solving the traveling salesman problem: a modified metaheuristic algorithm. Complexity 2021:1\u201313","journal-title":"Complexity"},{"issue":"06","key":"1045_CR38","doi-asserted-by":"publisher","first-page":"975","DOI":"10.1142\/S0218488523500447","volume":"31","author":"S Pal","year":"2023","unstructured":"Pal S, Dutta P, Khan I, Pramanik P, Maiti AK, Maiti MK (2023) Coordination of cyclic crossover and bat algorithm for the travelling salesman problems in different environments: a simulation approach. Intern J Uncertain Fuzziness Knowl Based Syst 31(06):975\u20131003","journal-title":"Intern J Uncertain Fuzziness Knowl Based Syst"},{"key":"1045_CR39","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2023.110219","volume":"139","author":"GK Jati","year":"2023","unstructured":"Jati GK, Kuwanto G, Hashmi T, Widjaja H (2023) Discrete Komodo algorithm for traveling salesman problem. Appl Soft Comput 139:110219","journal-title":"Appl Soft Comput"},{"key":"1045_CR40","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2021.107199","volume":"227","author":"SR Kanna","year":"2021","unstructured":"Kanna SR, Sivakumar K, Lingaraj N (2021) Development of deer hunting linked earthworm optimization algorithm for solving large scale traveling salesman problem. Knowl-Based Syst 227:107199","journal-title":"Knowl-Based Syst"},{"issue":"05","key":"1045_CR41","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1142\/S0218488519500314","volume":"27","author":"I Khan","year":"2019","unstructured":"Khan I, Pal S, Maiti MK (2019) A hybrid PSO-GA algorithm for traveling salesman problems in different environments. Intern J Uncertain Fuzziness Knowl-Based Syst 27(05):693\u2013717","journal-title":"Intern J Uncertain Fuzziness Knowl-Based Syst"},{"key":"1045_CR42","doi-asserted-by":"publisher","first-page":"13127","DOI":"10.1007\/s00500-024-10340-x","volume":"28","author":"H Rahaman","year":"2024","unstructured":"Rahaman H, Maiti MK (2024) A hybridisation of grey wolf optimizer and genetic algorithm for the traveling salesman problems. Soft Comput 28:13127\u201313148","journal-title":"Soft Comput"},{"key":"1045_CR43","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/j.engappai.2015.10.006","volume":"48","author":"E Osaba","year":"2016","unstructured":"Osaba E, Yang X-S, Diaz F, Lopez-Garcia P, Carballedo R (2016) An improved discrete bat algorithm for symmetric and asymmetric traveling salesman problems. Eng Appl Artif Intell 48:59\u201371","journal-title":"Eng Appl Artif Intell"},{"key":"1045_CR44","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2021.107275","volume":"105","author":"M Gunduz","year":"2021","unstructured":"Gunduz M, Aslan M (2021) DJAYA: a discrete Jaya algorithm for solving traveling salesman problem. Appl Soft Comput 105:107275","journal-title":"Appl Soft Comput"},{"issue":"3","key":"1045_CR45","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1147\/rd.33.0210","volume":"3","author":"AL Samuel","year":"1959","unstructured":"Samuel AL (1959) Some studies in machine learning using the game of checkers. IBM J Res Dev 3(3):210\u2013229","journal-title":"IBM J Res Dev"},{"key":"1045_CR46","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/BF00994018","volume":"20","author":"C Cortes","year":"1995","unstructured":"Cortes C, Vapnik V (1995) Support-vector networks. Mach Learn 20:273\u2013297","journal-title":"Mach Learn"},{"key":"1045_CR47","volume-title":"Foundations of machine learning","author":"M Mohri","year":"2018","unstructured":"Mohri M, Rostamizadeh A, Talwalkar A (2018) Foundations of machine learning. MIT press, Cambridge"},{"key":"1045_CR48","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/7011.001.0001","volume-title":"Unsupervised learning: foundations of neural computation","author":"G Hinton","year":"1999","unstructured":"Hinton G, Sejnowski TJ (1999) Unsupervised learning: foundations of neural computation. MIT press, Cambridge"},{"key":"1045_CR49","unstructured":"Watkins CJCH (1989) Learning from delayed rewards"},{"key":"1045_CR50","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/BF00992698","volume":"8","author":"CJ Watkins","year":"1992","unstructured":"Watkins CJ, Dayan P (1992) Q-learning. Mach Learn 8:279\u2013292","journal-title":"Mach Learn"},{"key":"1045_CR51","doi-asserted-by":"crossref","unstructured":"Meerza SIA, Islam M, Uzzal M (2019) Q-learning based particle swarm optimization algorithm for optimal path planning of swarm of mobile robots. In: 2019 1st International Conference on Advances in Science, Engineering and Robotics Technology (ICASERT), Dhaka, Bangladesh","DOI":"10.1109\/ICASERT.2019.8934450"},{"key":"1045_CR52","doi-asserted-by":"publisher","first-page":"5147","DOI":"10.1007\/s00521-019-04008-z","volume":"32","author":"H Samma","year":"2020","unstructured":"Samma H, Mohamad-Saleh J, Suandi SA, Lahasan B (2020) Q-learning-based simulated annealing algorithm for constrained engineering design problems. Neural Comput Appl 32:5147\u20135161","journal-title":"Neural Comput Appl"},{"key":"1045_CR53","doi-asserted-by":"publisher","first-page":"92879","DOI":"10.1109\/ACCESS.2022.3203072","volume":"10","author":"C Wang","year":"2022","unstructured":"Wang C, Yang X, Li H (2022) Improved q-learning applied to dynamic obstacle avoidance and path planning. IEEE Access 10:92879\u201392888","journal-title":"IEEE Access"},{"key":"1045_CR54","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2021.107464","volume":"107","author":"TN Huynh","year":"2021","unstructured":"Huynh TN, Do DT, Lee J (2021) Q-learning-based parameter control in differential evolution for structural optimization. Appl Soft Comput 107:107464","journal-title":"Appl Soft Comput"},{"key":"1045_CR55","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1023\/A:1008202821328","volume":"11","author":"R Storn","year":"1997","unstructured":"Storn R, Price K (1997) Differential evolution-a simple and efficient heuristic for global optimization over continuous spaces. J Global Optim 11:341\u2013359","journal-title":"J Global Optim"},{"key":"1045_CR56","doi-asserted-by":"publisher","first-page":"107044","DOI":"10.1016\/j.knosys.2021.107044","volume":"223","author":"A Seyyedabbasi","year":"2021","unstructured":"Seyyedabbasi A, Aliyev R, Kiani F, Gulle MU, Basyildiz H, Shah MA (2021) Hybrid algorithms based on combining reinforcement learning and metaheuristic methods to solve global optimization problems. Knowl-Based Syst 223:107044","journal-title":"Knowl-Based Syst"},{"key":"1045_CR57","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/j.ins.2021.10.070","volume":"583","author":"IA Zamfirache","year":"2022","unstructured":"Zamfirache IA, Precup R-E, Roman R-C, Petriu EM (2022) Reinforcement learning-based control using q-learning and gravitational search algorithm with experimental validation on a nonlinear servo system. Inf Sci 583:99\u2013120","journal-title":"Inf Sci"},{"key":"1045_CR58","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2023.110368","volume":"265","author":"F Zhao","year":"2023","unstructured":"Zhao F, Wang Q, Wang L (2023) An inverse reinforcement learning framework with the q-learning mechanism for the metaheuristic algorithm. Knowl-Based Syst 265:110368","journal-title":"Knowl-Based Syst"},{"issue":"2","key":"1045_CR59","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1016\/j.ejor.2020.07.063","volume":"290","author":"Y Bengio","year":"2021","unstructured":"Bengio Y, Lodi A, Prouvost A (2021) Machine learning for combinatorial optimization: a methodological tour d\u2019horizon. Eur J Oper Res 290(2):405\u2013421","journal-title":"Eur J Oper Res"},{"key":"1045_CR60","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.aiopen.2021.01.001","volume":"1","author":"J Zhou","year":"2020","unstructured":"Zhou J, Cui G, Hu S, Zhang Z, Yang C, Liu Z, Wang L, Li C, Sun M (2020) Graph neural networks: a review of methods and applications. AI open 1:57\u201381","journal-title":"AI open"},{"key":"1045_CR61","doi-asserted-by":"publisher","DOI":"10.1007\/s12597-024-00893-8","author":"SK Mandal","year":"2024","unstructured":"Mandal SK, Halim KA, Maiti MK (2024) A coordination of some basic heuristics using q-learning for global optimization. OPSEARCH. https:\/\/doi.org\/10.1007\/s12597-024-00893-8","journal-title":"OPSEARCH"},{"issue":"1","key":"1045_CR62","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":"2","key":"1045_CR63","doi-asserted-by":"publisher","first-page":"265","DOI":"10.22457\/apam.v16n2a2","volume":"16","author":"A Khanra","year":"2018","unstructured":"Khanra A, Maiti MK, Pal T, Maiti M (2018) Special TSPS considering conveyances and routes through a hybrid algorithm. Ann Pure Appl Math 16(2):265\u2013281","journal-title":"Ann Pure Appl Math"},{"key":"1045_CR64","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/j.cie.2015.06.018","volume":"88","author":"K Aditi","year":"2015","unstructured":"Aditi K, Kumar MM, Manoranjan M (2015) Profit maximization of tsp through a hybrid algorithm [j]. Comput Ind Eng 88:229\u2013236","journal-title":"Comput Ind Eng"},{"issue":"1","key":"1045_CR65","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1504\/IJOR.2018.091202","volume":"32","author":"PK Giri","year":"2018","unstructured":"Giri PK, Maiti MK, Maiti M (2018) Simulation approach to solve fuzzy fixed charge multi-item solid transportation problems under budget constraint. Int J Oper Res 32(1):56\u201391","journal-title":"Int J Oper Res"},{"key":"1045_CR66","doi-asserted-by":"publisher","first-page":"5773","DOI":"10.1007\/s00500-022-06978-0","volume":"26","author":"P Dutta","year":"2022","unstructured":"Dutta P, Khan I, Maiti MK, Basuli K (2022) A modified ACO with K-OPT for restricted covering salesman problems in different environments. Soft Comput 26:5773\u20135803","journal-title":"Soft Comput"},{"issue":"06","key":"1045_CR67","doi-asserted-by":"publisher","first-page":"975","DOI":"10.1142\/S0218488523500447","volume":"31","author":"S Pal","year":"2023","unstructured":"Pal S, Dutta P, Khan I, Pramanik P, Maiti AK, Maiti MK (2023) Coordination of cyclic crossover and bat algorithm for the travelling salesman problems in different environments: a simulation approach. Intern J Uncertain Fuzziness Knowl Based Syst 31(06):975\u20131003","journal-title":"Intern J Uncertain Fuzziness Knowl Based Syst"},{"issue":"3","key":"1045_CR68","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(3):338\u2013353","journal-title":"Inf Control"},{"key":"1045_CR69","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/S0165-0114(99)80004-9","volume":"100","author":"L Zadeh","year":"1999","unstructured":"Zadeh L (1999) Fuzzy sets as a basis for a theory of possibility. Fuzzy Sets Syst 100:9\u201334","journal-title":"Fuzzy Sets Syst"},{"issue":"1","key":"1045_CR70","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1016\/j.fss.2005.06.021","volume":"157","author":"MK Maiti","year":"2006","unstructured":"Maiti MK, Maiti M (2006) Fuzzy inventory model with two warehouses under possibility constraints. Fuzzy Sets Syst 157(1):52\u201373","journal-title":"Fuzzy Sets Syst"},{"issue":"1","key":"1045_CR71","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1080\/03081077508960870","volume":"2","author":"H-J Zimmermann","year":"1975","unstructured":"Zimmermann H-J (1975) Description and optimization of fuzzy systems. Int J Gen Syst 2(1):209\u2013215","journal-title":"Int J Gen Syst"},{"key":"1045_CR72","volume-title":"Fuzzy sets and systems: theory and applications","author":"DJ Dubois","year":"1980","unstructured":"Dubois DJ (1980) Fuzzy sets and systems: theory and applications. Academic Press, New York"},{"key":"1045_CR73","doi-asserted-by":"publisher","first-page":"2002","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 2002"},{"issue":"3","key":"1045_CR74","doi-asserted-by":"publisher","first-page":"746","DOI":"10.1016\/j.ejor.2007.04.046","volume":"188","author":"MK Maiti","year":"2008","unstructured":"Maiti MK (2008) Fuzzy inventory model with two warehouses under possibility measure on fuzzy goal. Eur J Oper Res 188(3):746\u2013774","journal-title":"Eur J Oper Res"},{"issue":"4","key":"1045_CR75","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1109\/TFUZZ.2002.800692","volume":"10","author":"B Liu","year":"2002","unstructured":"Liu B, Liu Y-K (2002) Expected value of fuzzy variable and fuzzy expected value models. IEEE Trans Fuzzy Syst 10(4):445\u2013450","journal-title":"IEEE Trans Fuzzy Syst"},{"key":"1045_CR76","doi-asserted-by":"publisher","first-page":"7527","DOI":"10.1007\/s00500-023-09615-6","volume":"28","author":"R Sau","year":"2024","unstructured":"Sau R, Ranjit C, Maiti MK (2024) A supply chain of a coastal biomass incorporating fuzzy deterioration and freshness under dynamic unit price. Soft Comput 28:7527\u20137555","journal-title":"Soft Comput"},{"key":"1045_CR77","doi-asserted-by":"publisher","unstructured":"Dutta P, Khan I, Basuli k, Maiti MK (2025) A novel heuristic for the generalized traveling salesman problems with imprecise cost matrices. New Math Nat Comput. https:\/\/doi.org\/10.1142\/S1793005726500432","DOI":"10.1142\/S1793005726500432"},{"issue":"55","key":"1045_CR78","doi-asserted-by":"publisher","first-page":"2701","DOI":"10.12988\/ijma.2015.510245","volume":"9","author":"DH Hong","year":"2015","unstructured":"Hong DH (2015) Note on the expected value of a function of a fuzzy variable. Int J Math Anal 9(55):2701\u20132706","journal-title":"Int J Math Anal"},{"key":"1045_CR79","doi-asserted-by":"publisher","first-page":"1215","DOI":"10.1016\/j.camwa.2007.04.042","volume":"55","author":"F Xue","year":"2008","unstructured":"Xue F, Tang W, Zhao R (2008) The expected value of a function of a fuzzy variable with a continuous membership function. Comput Math Appl 55:1215\u20131224","journal-title":"Comput Math Appl"},{"issue":"5","key":"1045_CR80","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1142\/S0218488519500314","volume":"27","author":"I Khan","year":"2019","unstructured":"Khan I, Pal S, Maiti MK (2019) A hybrid PSO-GA algorithm for traveling salesman problems in different environments. Intern J Uncertain Fuzziness Knowl Based Syst 27(5):693\u2013717","journal-title":"Intern J Uncertain Fuzziness Knowl Based Syst"},{"issue":"1","key":"1045_CR81","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/j.ejor.2011.02.014","volume":"213","author":"M Kumar Maiti","year":"2011","unstructured":"Kumar Maiti M (2011) A fuzzy genetic algorithm with varying population size to solve an inventory model with credit-linked promotional demand in an imprecise planning horizon. Eur J Oper Res 213(1):96\u2013106","journal-title":"Eur J Oper Res"},{"issue":"3","key":"1045_CR82","first-page":"351","volume":"22","author":"G Sierksma","year":"1994","unstructured":"Sierksma G (1994) Hamiltonicity and the 3-Opt procedure for the traveling salesman problem. Appl Math 22(3):351\u2013358","journal-title":"Appl Math"},{"key":"1045_CR83","unstructured":"Karaboga D et al. (2005) An idea based on honey bee swarm for numerical optimization. tech. rep., Technical report-tr06, Erciyes university, engineering faculty, computer...,"},{"key":"1045_CR84","first-page":"372","volume":"24","author":"M Zbigniew","year":"1996","unstructured":"Zbigniew M (1996) Genetic algorithms+ data structures= evolution programs. Comput Stat 24:372\u2013373","journal-title":"Comput Stat"},{"key":"1045_CR85","first-page":"561","volume-title":"Adaptation in natural and artificial systems","author":"J Holland","year":"1975","unstructured":"Holland J (1975) Adaptation in natural and artificial systems. University of Michigan press, Ann Arbor, vol, p 561"},{"key":"1045_CR86","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/BF01889983","volume":"1","author":"Z Michalewicz","year":"1991","unstructured":"Michalewicz Z, Janikow CZ (1991) Genetic algorithms for numerical optimization. Stat Comput 1:75\u201391","journal-title":"Stat Comput"},{"issue":"1","key":"1045_CR87","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1098\/rsnr.2005.0128","volume":"60","author":"J Wyhe","year":"2006","unstructured":"Wyhe J (2006) The complete work of Charles darwin online. Notes Records R Soc 60(1):87\u201389","journal-title":"Notes Records R Soc"},{"key":"1045_CR88","doi-asserted-by":"crossref","unstructured":"Rarita L (2020) Optimization approaches to manage congestions for the phenomenon \u201cLuci D\u2019Atista\u201d in Salerno. In: Proceedings of the 32nd European modeling & simulation symposium (EMSS 2020), vol 388, pp 319\u2013324","DOI":"10.46354\/i3m.2020.emss.046"},{"key":"1045_CR89","volume":"388","author":"L Rarita","year":"2021","unstructured":"Rarita L, Stamova I, Tomasiello S (2021) Numerical schemes and genetic algorithms for the optimal control of a continuous model of supply chains. Appl Math Comput 388:125464","journal-title":"Appl Math Comput"},{"key":"1045_CR90","unstructured":"Oliver I, Smith D, Holland JR (1987) A study of permutation crossover operators on the traveling salesman problem. In: Proceedings of the second international conference on genetic algorithms on genetic algorithms and their application, pp 224\u2013230"},{"key":"1045_CR91","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1613\/jair.639","volume":"13","author":"TG Dietterich","year":"2000","unstructured":"Dietterich TG (2000) Hierarchical reinforcement learning with the MAXQ value function decomposition. J Artif Intell Res 13:227\u2013303","journal-title":"J Artif Intell Res"},{"issue":"4","key":"1045_CR92","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-a traveling salesman problem library. ORSA J Comput 3(4):376\u2013384","journal-title":"ORSA J Comput"},{"issue":"1","key":"1045_CR93","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.swevo.2011.02.002","volume":"1","author":"J Derrac","year":"2011","unstructured":"Derrac J, Garc\u00eda S, Molina D, Herrera F (2011) A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms. Swarm Evol Comput 1(1):3\u201318","journal-title":"Swarm Evol Comput"},{"key":"1045_CR94","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1016\/j.ins.2017.07.015","volume":"417","author":"T Eftimov","year":"2017","unstructured":"Eftimov T, Koro\u0161ec P, Seljak BK (2017) A novel approach to statistical comparison of meta-heuristic stochastic optimization algorithms using deep statistics. Inf Sci 417:186\u2013215","journal-title":"Inf Sci"}],"container-title":["Evolutionary Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12065-025-01045-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12065-025-01045-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12065-025-01045-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,26]],"date-time":"2025-06-26T06:02:01Z","timestamp":1750917721000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12065-025-01045-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5,8]]},"references-count":94,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,6]]}},"alternative-id":["1045"],"URL":"https:\/\/doi.org\/10.1007\/s12065-025-01045-7","relation":{},"ISSN":["1864-5909","1864-5917"],"issn-type":[{"value":"1864-5909","type":"print"},{"value":"1864-5917","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,5,8]]},"assertion":[{"value":"6 December 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 March 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 April 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 May 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no Conflict of interest.","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"}}],"article-number":"53"}}