{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T14:02:39Z","timestamp":1777903359634,"version":"3.51.4"},"reference-count":52,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,5,2]],"date-time":"2022-05-02T00:00:00Z","timestamp":1651449600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,5,2]],"date-time":"2022-05-02T00:00:00Z","timestamp":1651449600000},"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":["Artif Intell Rev"],"published-print":{"date-parts":[[2023,2]]},"DOI":"10.1007\/s10462-022-10190-9","type":"journal-article","created":{"date-parts":[[2022,5,2]],"date-time":"2022-05-02T21:02:38Z","timestamp":1651525358000},"page":"965-993","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["A two-phase ant colony optimization based approach for single depot multiple travelling salesman problem in Type-2 fuzzy environment"],"prefix":"10.1007","volume":"56","author":[{"given":"Chiranjit","family":"Changdar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Moumita","family":"Mondal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pravash Kumar","family":"Giri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Utpal","family":"Nandi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rajat Kumar","family":"Pal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,5,2]]},"reference":[{"key":"10190_CR1","doi-asserted-by":"publisher","first-page":"100802","DOI":"10.1016\/j.swevo.2020.100802","volume":"60","author":"M Alinaghian","year":"2021","unstructured":"Alinaghian M, Tirkolaee EB, Dezaki ZK, Hejazi SR, Ding W (2021) An augmented tabu search algorithm for the green inventory-routing problem with time windows. Swarm Evol Comput 60:100802","journal-title":"Swarm and Evolutionary Computation"},{"issue":"6","key":"10190_CR2","doi-asserted-by":"publisher","first-page":"B-279","DOI":"10.1287\/mnsc.18.6.B279","volume":"18","author":"RD Angel","year":"1972","unstructured":"Angel RD, Caudle WL, Noonan R, Whinston A (1972) Computer-assisted school bus scheduling. Manag Sci 18(6):B-279-B-88","journal-title":"Management Science"},{"issue":"9","key":"10190_CR3","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1016\/j.ifacol.2015.08.084","volume":"48","author":"S Ann","year":"2015","unstructured":"Ann S, Kim Y, Ahn J (2015) Area allocation algorithm for multiple UAVS area coverage based on clustering and graph method. IFAC Pap OnLine 48(9):204\u2013209","journal-title":"IFAC-PapersOnLine"},{"key":"10190_CR4","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1057\/jors.2014.17","volume":"66","author":"A Baltz","year":"2015","unstructured":"Baltz A, Ouali M. El., Jager G, Sauerland V, Srivastav A (2015) Exact and heuristic algorithms for the travelling salesman problem with multiple time windows and hotel selection. J Oper Res Soc 66:615\u2013626","journal-title":"Journal of the Operational Research Society"},{"key":"10190_CR5","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/j.omega.2004.10.004","volume":"34","author":"T Bektas","year":"2006","unstructured":"Bektas T (2006) The multiple travelling salesman problem: an overview of formulations and solution procedures. Omega 34:209\u2013219","journal-title":"Omega"},{"issue":"3","key":"10190_CR6","doi-asserted-by":"publisher","first-page":"863","DOI":"10.1016\/j.ejor.2019.11.058","volume":"283","author":"S Bock","year":"2020","unstructured":"Bock S (2020) Optimally solving a versatile Travelling salesman problem on tree networks with soft due dates and multiple congestion scenarios. Eur J Oper Res 283(3):863\u2013882","journal-title":"European Journal of Operational Research"},{"key":"10190_CR7","doi-asserted-by":"publisher","first-page":"104766","DOI":"10.1016\/j.cor.2019.104766","volume":"112","author":"S Bock","year":"2019","unstructured":"Bock S, Klamroth K (2019) Combining traveling salesman and travelling repairman problems: A multi-objective approach based on multiple scenarios. Comput Oper Res 112:104766","journal-title":"Computers & Operations Research"},{"key":"10190_CR8","doi-asserted-by":"publisher","first-page":"1423","DOI":"10.1057\/jors.2013.88","volume":"65","author":"F Camci","year":"2014","unstructured":"Camci F (2014) The travelling maintainer problem: Integration of condition-based maintenance with the travelling salesman problem. J the Oper Res Soc 65:1423\u20131436","journal-title":"Journal of the Operational Research Society"},{"key":"10190_CR9","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 RK (2014) An efficient genetic algorithm for multi-objective solid travelling salesman problem under fuzziness. Swarm Evol Comput 15:27\u201337","journal-title":"Swarm and Evolutionary Computation"},{"issue":"12","key":"10190_CR10","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1016\/j.ifacol.2016.07.767","volume":"49","author":"A Chentsov","year":"2016","unstructured":"Chentsov A, Khachay M, Khachay D (2016) Linear time algorithm for precedence constrained asymmetric generalized travelling salesman problem. IFAC Pap OnLine 49(12):651\u2013655","journal-title":"IFAC-PapersOnLine"},{"key":"10190_CR11","first-page":"39","volume":"34","author":"A Colorni","year":"1994","unstructured":"Colorni A, Dorigo M, Maniezzo V, Trubian M (1994) Ant system for job-shop scheduling. Belg J Oper Res Stat Comput Sci 34:39\u201353","journal-title":"Belgian Journal of Operations Research, Statistics, and Computer Science"},{"key":"10190_CR12","unstructured":"Colorni A, Dorigo M, Maniezzo V (1991) Distributed optimization by ant colonies. In: Proceedings of the first European conference on artificial life, Paris, France, pp 134\u2013142"},{"key":"10190_CR13","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1007\/BF03398645","volume":"38","author":"S Das","year":"2001","unstructured":"Das S, Ahmed N (2001) A travelling salesman problem (TSP) with multiple job facilties. OPSEARCH 38:394\u2013406","journal-title":"OPSEARCH"},{"issue":"2","key":"10190_CR14","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/S0303-2647(97)01708-5","volume":"43","author":"M Dorigo","year":"1997","unstructured":"Dorigo M, Gambardella LM (1997) Ant colonies for the travelling salesman problem. Bio Systems 43(2):73\u201381","journal-title":"Bio Systems"},{"issue":"1","key":"10190_CR15","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1109\/4235.585892","volume":"1","author":"M Dorigo","year":"1997","unstructured":"Dorigo M, Gambardella LM (1997) Ant colony system: A cooperative learning approach to the travelling salesman problem. IEEE Trans on Evol Comput 1(1):53\u201366","journal-title":"IEEE Transactions on Evolutionary Computation"},{"issue":"1","key":"10190_CR16","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 Transactions on System, Man, and Cybernetics Part-B: Cybernetics"},{"key":"10190_CR51","doi-asserted-by":"crossref","unstructured":"Dubois D, Prade H (1979) Operations in a fuzzy-valued logic. Informat Contr 43(2):224\u2013240","DOI":"10.1016\/S0019-9958(79)90730-7"},{"key":"10190_CR17","volume-title":"Fundamentals of Computational Swarm Intelligence","author":"AP Engelbrech","year":"2005","unstructured":"Engelbrech AP (2005) Fundamentals of computational swarm intelligence. Wiley, Hoboken"},{"key":"10190_CR18","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1016\/j.ins.2014.02.098","volume":"27020","author":"HM Feng","year":"2014","unstructured":"Feng HM, Liao KL (2014) Hybrid evolutionary fuzzy learning scheme in the applications of travelling salesman problems. Inf Sci 27020:204\u2013225","journal-title":"Information Sciences"},{"key":"10190_CR19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/3-540-48661-5_1","volume":"840","author":"R Gerhard","year":"1994","unstructured":"Gerhard R (1994) The travelling salesman: computational solutions for TSP applications. Lect Notes Comput Sci 840:1\u2013223","journal-title":"Lecture Notes in Computer Science"},{"key":"10190_CR20","volume-title":"Genetic Algorithms in Search, Optimization and Machine Learning","author":"DE Goldberg","year":"1989","unstructured":"Goldberg DE (1989) Genetic algorithms in search, optimization and machine learning. Addison-Wesley, Boston"},{"key":"10190_CR21","first-page":"46","volume":"12","author":"E Haq","year":"2019","unstructured":"Haq E, Hussain E (2019) Development a new crossover scheme for traveling salesman problem by aid of genetic algorithm. Int J Intell Syst Appl 12:46\u201352","journal-title":"International Journal of Intelligent Systems and Applications"},{"issue":"2","key":"10190_CR22","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1049\/trit.2019.0078","volume":"5","author":"TS Haque","year":"2020","unstructured":"Haque TS, Chakraborty A, Mondal SP, Alam S (2020) Approach to solve multi-criteria group decision-making problems by exponential operational law in generalised spherical fuzzy environment. Trans Intell Technol 5(2):106\u2013114","journal-title":"Transactions on Intelligence Technology"},{"issue":"4","key":"10190_CR23","doi-asserted-by":"publisher","first-page":"32","DOI":"10.4018\/IJAEC.2017100103","volume":"8","author":"A Hatamlou","year":"2017","unstructured":"Hatamlou A (2017) Solving travelling salesman problem using heart algorithm. Int J Appl Evol Comput 8(4):32\u201342","journal-title":"International Journal of Applied Evolutionary Computation"},{"key":"10190_CR24","volume-title":"Adaptation in Natural and Artificial Systems","author":"JH Holland","year":"1975","unstructured":"Holland JH (1975) Adaptation in natural and artificial systems. MIT, Cambridge"},{"issue":"1","key":"10190_CR25","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1049\/trit.2019.0040","volume":"5","author":"R Hosseini","year":"2020","unstructured":"Hosseini R, Rezvanian A (2020) AntLP: Ant-based label propagation algorithm for community detection in social networks. CAAI Trans Intell Technol 5(1):34\u201341","journal-title":"CAAI Trans. Intell. Technol."},{"key":"10190_CR26","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1057\/jors.1980.97","volume":"31","author":"R Hurrion","year":"1980","unstructured":"Hurrion R (1980) Visual interactive (computer) solutions for the travelling salesman problem. J Oper Res Soc 31:537\u2013539","journal-title":"Journal of the Operational Research Society"},{"key":"10190_CR27","doi-asserted-by":"publisher","first-page":"112867","DOI":"10.1016\/j.eswa.2019.112867","volume":"139","author":"C Jiang","year":"2020","unstructured":"Jiang C, Wan Z, Peng Z (2020) A new efficient hybrid algorithm for large scale multiple traveling salesman problems. Expert Syst Appl 139:112867","journal-title":"Expert Systems with Applications"},{"issue":"Part A","key":"10190_CR28","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/j.jclepro.2015.05.036","volume":"111","author":"A Kiraly","year":"2016","unstructured":"Kiraly A, Christidou M, Chovan T, Karlopoulos E, Abonyi J (2016) Minimization of off-grade production in multi-site multi-product plants by solving multiple travelling salesman problem. J Clean Product 111(Part A):253\u2013261","journal-title":"Journal of Cleaner Production"},{"key":"10190_CR29","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1016\/j.ins.2013.08.005","volume":"255","author":"P Kundu","year":"2014","unstructured":"Kundu P, Kar S, Maiti M (2014) Fixed charge transportation problem with type-2 fuzzy variables. Inf Sci 255:170\u2013186","journal-title":"Information Sciences"},{"key":"10190_CR30","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1023\/A:1006529012972","volume":"13","author":"P Larra\u00f1aga","year":"1999","unstructured":"Larra\u00f1aga P, Kuijpers CMH, Murga RH, Inza I, Dizdarevic S (1999) Genetic algorithms for the travelling salesman problem: a review of representations and operators. Artif Intell Rev 13:129\u2013170","journal-title":"Artificial Intelligence Review"},{"key":"10190_CR31","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"},{"issue":"1","key":"10190_CR32","first-page":"65","volume":"16","author":"YK Majid","year":"2013","unstructured":"Majid YK, Farzad D, Farhad R (2013) Modification of the ant colony optimization for solving the multiple travelling salesman problem. Roman J Inf Sci Technol 16(1):65\u201380","journal-title":"Romanian Journal of Information Science and Technology"},{"issue":"1","key":"10190_CR33","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/0377-2217(95)00185-9","volume":"93","author":"CJ Malmborg","year":"1996","unstructured":"Malmborg CJ (1996) A genetic algorithm for service level based vehicle scheduling. Eur J Oper Res 93(1):121\u2013134","journal-title":"European Journal of Operational Research"},{"key":"10190_CR34","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1007\/s10958-019-04415-6","volume":"241","author":"EA Markevich","year":"2019","unstructured":"Markevich EA, Trushechkin AS (2019) Quantum branch-and-bound algorithm and its application to the travelling salesman problem. J Math Sci 241:168\u2013184","journal-title":"Journal of Mathematical Sciences"},{"key":"10190_CR35","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-02830-8","volume-title":"Genetic Algorithms + Data Structures = Evolution Programs","author":"Z Michalewicz","year":"1992","unstructured":"Michalewicz Z (1992) Genetic algorithms + data structures = evolution programs. Springer, Berlin"},{"key":"10190_CR36","doi-asserted-by":"publisher","first-page":"754","DOI":"10.1126\/science.251.4995.754","volume":"251","author":"DL Miller","year":"1991","unstructured":"Miller DL, Pekny JF (1991) Exact solution of large asymmetric travelling salesman problems. Science 251:754\u2013761","journal-title":"Science"},{"key":"10190_CR37","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1016\/j.trc.2019.11.003","volume":"110","author":"CC Murray","year":"2020","unstructured":"Murray CC, Raj R (2020) The multiple flying sidekicks travelling salesman problem: parcel delivery with multiple drones. Transp Res Part C Emerg Technol 110:368\u2013398","journal-title":"Transportation Research Part C: Emerging Technologies"},{"key":"10190_CR38","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/s10462-011-9288-9","volume":"40","author":"K-H Nguyen","year":"2013","unstructured":"Nguyen K-H, Ock C-Y (2013) Word sense disambiguation as a traveling salesman problem. Artif Intell Rev 40:405\u2013427","journal-title":"Artificial Intelligence Review"},{"key":"10190_CR39","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cor.2018.01.005","volume":"93","author":"AH Pereira","year":"2018","unstructured":"Pereira AH, Urrutia S (2018) Formulations and algorithms for the pickup and delivery travelling salesman problem with multiple stacks. Comput Oper Res 93:1\u201314","journal-title":"Computers & Operations Research"},{"key":"10190_CR40","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/s10462-015-9441-y","volume":"45","author":"A Prakasam","year":"2016","unstructured":"Prakasam A, Savarimuthu N (2016) Metaheuristic algorithms and probabilistic behaviour: a comprehensive analysis of Ant Colony Optimization and its variants. Artif Intell Rev 45:97\u2013130","journal-title":"Artificial Intelligence Review"},{"key":"10190_CR41","doi-asserted-by":"publisher","first-page":"1454","DOI":"10.1016\/j.cam.2010.08.031","volume":"235","author":"R Qin","year":"2011","unstructured":"Qin R, Liu YK, Liu ZQ (2011) Methods of critical value reduction for type-2 fuzzy variables and their applications. J Comput Appl Math 235:1454\u20131481","journal-title":"Journal of Computational and Applied Mathematics"},{"key":"10190_CR42","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1016\/j.eswa.2016.12.013","volume":"7215","author":"Y Shi","year":"2017","unstructured":"Shi Y, Boudouh T, Grunder O (2017) A hybrid genetic algorithm for a home health care routing problem with time window and fuzzy demand. Expert Syst Appl 7215:160\u2013176","journal-title":"Expert Systems with Applications"},{"key":"10190_CR43","doi-asserted-by":"publisher","first-page":"1181","DOI":"10.1007\/s40565-018-0386-4","volume":"6","author":"R Srikakulapu","year":"2018","unstructured":"Srikakulapu R, Vinatha U (2018) Optimized design of collector topology for offshore wind farm based on ant colony optimization with multiple travelling salesman problem. J Mod Power Syst Clean Energy 6:1181\u20131192","journal-title":"Journal of Modern Power Systems and Clean Energy"},{"issue":"2","key":"10190_CR44","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/S0377-2217(99)00380-X","volume":"124","author":"L Tang","year":"2000","unstructured":"Tang L, Liu J, Rong A, Yang Z (2000) A multiple travelling salesman problem model for hot rolling scheduling in Shanghai Baoshan iron & steel complex. Eur J Oper Res 124(2):267\u2013282","journal-title":"European Journal of Operational Research"},{"key":"10190_CR45","unstructured":"Tsai PF (2006) Tight flow-based formulations for the asymmetric travelling salesman problem and their applications to some scheduling problems. PhD dissertation, Virginia Polytechnic Institute and State University. Blacksburg"},{"key":"10190_CR46","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1016\/j.compeleceng.2018.01.040","volume":"77","author":"EB Tirkolaee","year":"2019","unstructured":"Tirkolaee EB, Alinaghian M, Hosseinabadi AAR, Sasi MB, Sangaiah AK (2019) An improved ant colony optimization for the multi-trip capacitated arc routing problem. Comput Electr Eng 77:457\u2013470","journal-title":"Computers & Electrical Engineering"},{"key":"10190_CR52","doi-asserted-by":"crossref","unstructured":"Trigui S, Cheikhrouhou O, Koubaa A, Baroudi U, Youssef H (2017) FL-MTSP: a fuzzy logic approach to solve the multi-objective multiple travelling salesman problem for multirobot systems. Soft Comput 21:7351\u20137362","DOI":"10.1007\/s00500-016-2279-7"},{"key":"10190_CR47","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/j.cie.2016.12.017","volume":"106","author":"Y Wang","year":"2017","unstructured":"Wang Y, Chen Y, Lin Y (2017) Memetic algorithm based on sequential variable neighborhood descent for the minmax multiple travelling salesman problem. Comput Ind Eng 106:105\u2013122","journal-title":"Computers & Industrial Engineering"},{"key":"10190_CR48","doi-asserted-by":"publisher","first-page":"6567","DOI":"10.1007\/s00500-017-2705-5","volume":"22","author":"X Xu","year":"2018","unstructured":"Xu X, Yuan H, Liptrott M, Trovati M (2018) Two phase heuristic algorithm for the multiple-travelling salesman problem. Soft Comput 22:6567\u20136581","journal-title":"Soft Computing"},{"issue":"3","key":"10190_CR49","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1016\/S0019-9958(65)90241-X","volume":"8","author":"LA Zadeh","year":"1965","unstructured":"Zadeh LA (1965) Fuzzy sets. Inf Control 8(3):338\u2013353","journal-title":"Information and Control"},{"key":"10190_CR50","doi-asserted-by":"crossref","unstructured":"Zimmermann HJ (1996) Fuzzy set theory and its applications, 4th edn. Van Nostrand Reinhold, New York","DOI":"10.1007\/978-94-015-8702-0"}],"container-title":["Artificial Intelligence Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10462-022-10190-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10462-022-10190-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10462-022-10190-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T19:14:48Z","timestamp":1675278888000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10462-022-10190-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,2]]},"references-count":52,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,2]]}},"alternative-id":["10190"],"URL":"https:\/\/doi.org\/10.1007\/s10462-022-10190-9","relation":{},"ISSN":["0269-2821","1573-7462"],"issn-type":[{"value":"0269-2821","type":"print"},{"value":"1573-7462","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,5,2]]},"assertion":[{"value":"2 May 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no potential conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}