{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,24]],"date-time":"2026-07-24T04:42:25Z","timestamp":1784868145081,"version":"3.55.0"},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2018,9,8]],"date-time":"2018-09-08T00:00:00Z","timestamp":1536364800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100012639","name":"Prince Sultan University","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100012639","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Gaitech Robotics"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Intel Serv Robotics"],"published-print":{"date-parts":[[2018,10]]},"DOI":"10.1007\/s11370-018-0259-8","type":"journal-article","created":{"date-parts":[[2018,9,8]],"date-time":"2018-09-08T11:17:07Z","timestamp":1536405427000},"page":"355-369","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":19,"title":["An analytical hierarchy process-based approach to solve the multi-objective multiple traveling salesman problem"],"prefix":"10.1007","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5564-3212","authenticated-orcid":false,"given":"Sahar","family":"Trigui","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Omar","family":"Cheikhrouhou","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Anis","family":"Koubaa","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Anis","family":"Zarrad","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Habib","family":"Youssef","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2018,9,8]]},"reference":[{"issue":"4","key":"259_CR1","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1007\/s10514-015-9485-5","volume":"40","author":"K Alexis","year":"2016","unstructured":"Alexis K, Darivianakis G, Burri M, Siegwart R (2016) Aerial robotic contact-based inspection: planning and control. Auton Robots 40(4):631\u2013655. \n                    https:\/\/doi.org\/10.1007\/s10514-015-9485-5","journal-title":"Auton Robots"},{"issue":"3","key":"259_CR2","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 traveling salesman problem: an overview of formulations and solution procedures. Omega 34(3):209\u2013219","journal-title":"Omega"},{"issue":"4","key":"259_CR3","doi-asserted-by":"publisher","first-page":"559","DOI":"10.5267\/j.dsl.2015.5.003","volume":"4","author":"R Bola\u00f1os","year":"2015","unstructured":"Bola\u00f1os R, Echeverry M, Escobar J (2015) A multiobjective non-dominated sorting genetic algorithm (NSGA-II) for the multiple traveling salesman problem. Dec Sci Lett 4(4):559\u2013568","journal-title":"Dec Sci Lett"},{"issue":"02","key":"259_CR4","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1142\/S0219622007002447","volume":"6","author":"EC Brown","year":"2007","unstructured":"Brown EC, Ragsdale CT, Carter AE (2007) A grouping genetic algorithm for the multiple traveling salesperson problem. Int J Inf Technol Dec Mak 6(02):333\u2013347","journal-title":"Int J Inf Technol Dec Mak"},{"issue":"1","key":"259_CR5","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1016\/j.ejor.2005.04.027","volume":"175","author":"AE Carter","year":"2006","unstructured":"Carter AE, Ragsdale CT (2006) A new approach to solving the multiple traveling salesperson problem using genetic algorithms. Eur J Oper Res 175(1):246\u2013257. \n                    https:\/\/doi.org\/10.1016\/j.ejor.2005.04.027","journal-title":"Eur J Oper Res"},{"key":"259_CR6","doi-asserted-by":"crossref","unstructured":"Chaari I, Koubaa A, Bennaceur H, Trigui S, Al-Shalfan K (2012) Smartpath: a hybrid ACO-GA algorithm for robot path planning. In: 2012 IEEE congress on evolutionary computation, pp 1\u20138. \n                    https:\/\/doi.org\/10.1109\/CEC.2012.6256142","DOI":"10.1109\/CEC.2012.6256142"},{"issue":"7","key":"259_CR7","doi-asserted-by":"publisher","first-page":"94","DOI":"10.5772\/58543","volume":"11","author":"I Chaari","year":"2014","unstructured":"Chaari I, Koubaa A, Trigui S, Bennaceur H, Ammar A, Al-Shalfan K (2014) Smartpath: an efficient hybrid aco-ga algorithm for solving the global path planning problem of mobile robots. Int J Adv Robot Syst 11(7):94. \n                    https:\/\/doi.org\/10.5772\/58543","journal-title":"Int J Adv Robot Syst"},{"issue":"1","key":"259_CR8","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/j.eswa.2005.09.049","volume":"30","author":"ZS Chan","year":"2006","unstructured":"Chan ZS, Collins L, Kasabov N (2006) An efficient greedy k-means algorithm for global gene trajectory clustering. Expert Syst Appl 30(1):137\u2013141. \n                    https:\/\/doi.org\/10.1016\/j.eswa.2005.09.049","journal-title":"Expert Syst Appl"},{"key":"259_CR9","doi-asserted-by":"crossref","unstructured":"Cheikhrouhou O, Koubaa A, Bennaceur H (2014) Move and improve: a distributed multi-robot coordination approach for multiple depots multiple travelling salesmen problem. In: 2014 IEEE international conference on autonomous robot systems and competitions (ICARSC), pp 28\u201335. \n                    https:\/\/doi.org\/10.1109\/ICARSC.2014.6849758","DOI":"10.1109\/ICARSC.2014.6849758"},{"issue":"1","key":"259_CR10","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"},{"issue":"6","key":"259_CR11","doi-asserted-by":"publisher","first-page":"6486","DOI":"10.1016\/j.eswa.2010.11.097","volume":"38","author":"M Elango","year":"2011","unstructured":"Elango M, Nachiappan S, Tiwari MK (2011) Balancing task allocation in multi-robot systems using k-means clustering and auction based mechanisms. Expert Syst Appl 38(6):6486\u20136491. \n                    https:\/\/doi.org\/10.1016\/j.eswa.2010.11.097","journal-title":"Expert Syst Appl"},{"key":"259_CR12","first-page":"79","volume":"33","author":"E Falkenauer","year":"1992","unstructured":"Falkenauer E (1992) The grouping genetic algorithms widening the scope of the GAs, jorbel. Belg J Oper Res Stat Comput Sci 33:79\u2013102","journal-title":"Belg J Oper Res Stat Comput Sci"},{"issue":"1","key":"259_CR13","doi-asserted-by":"publisher","first-page":"1256","DOI":"10.1016\/j.asoc.2010.03.002","volume":"11","author":"S Ghafurian","year":"2011","unstructured":"Ghafurian S, Javadian N (2011) An ant colony algorithm for solving fixed destination multi-depot multiple traveling salesmen problems. Appl Soft Comput 11(1):1256\u20131262. \n                    https:\/\/doi.org\/10.1016\/j.asoc.2010.03.002","journal-title":"Appl Soft Comput"},{"key":"259_CR14","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, New York"},{"key":"259_CR15","unstructured":"Heap B, Pagnucco M (2012) Repeated sequential auctions with dynamic task clusters. In: Proceedings of the twenty-sixth AAAI conference on artificial intelligence, AAAI\u201912. AAAI Press, pp 1997\u20132002. \n                    http:\/\/dl.acm.org\/citation.cfm?id=2900929.2901010"},{"key":"259_CR16","unstructured":"Helsgaun K (2012) LKH. \n                    http:\/\/www.akira.ruc.dk\/~keld\/research\/LKH\/\n                    \n                  . Accessed 2012"},{"key":"259_CR17","volume-title":"Adaptation in natural and artificial systems: an introductory analysis with applications to biology, control, and artificial intelligence","author":"JH Holland","year":"1975","unstructured":"Holland JH (1975) Adaptation in natural and artificial systems: an introductory analysis with applications to biology, control, and artificial intelligence. University of Michigan Press, Ann Arbor"},{"key":"259_CR18","unstructured":"Karaboga D (2005) An idea based on honey bee swarm for numerical optimization. Technical report-tr06, Erciyes University, Engineering Faculty, Computer Engineering Department"},{"issue":"6","key":"259_CR19","doi-asserted-by":"publisher","first-page":"1845","DOI":"10.1109\/TSMCB.2012.2231860","volume":"43","author":"L Ke","year":"2013","unstructured":"Ke L, Zhang Q, Battiti R (2013) MOEA\/D-ACO: a multiobjective evolutionary algorithm using decomposition and antcolony. IEEE Trans Cybern 43(6):1845\u20131859. \n                    https:\/\/doi.org\/10.1109\/TSMCB.2012.2231860","journal-title":"IEEE Trans Cybern"},{"key":"259_CR20","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/978-3-642-21705-0_9","volume-title":"Optimization of multiple traveling salesmen problem by a novel representation based genetic algorithm","author":"A Kir\u00e1ly","year":"2011","unstructured":"Kir\u00e1ly A, Abonyi J (2011) Optimization of multiple traveling salesmen problem by a novel representation based genetic algorithm. Springer, Berlin, pp 241\u2013269. \n                    https:\/\/doi.org\/10.1007\/978-3-642-21705-0_9"},{"key":"259_CR21","unstructured":"Kirk J (2011) Traveling-salesman-problem-genetic-algorithm. \n                    http:\/\/www.mathworks.com\/matlabcentral\/fileexchange\/13680-traveling-salesman-problem-genetic-algorithm\n                    \n                  . Accessed 11 July 2011"},{"key":"259_CR22","unstructured":"Kivelevitch E (2011) Mdmtspv\\_ga-multiple depot multiple traveling salesmen problem solved by genetic algorithm. \n                    http:\/\/www.mathworks.com\/matlabcentral\/fileexchange\/31814-mdmtspv-ga-multiple-depot-multiple-traveling-salesmen-problem-solved-by-genetic-algorithm\n                    \n                  . Accessed 15 June 2011"},{"issue":"1","key":"259_CR23","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s10846-012-9805-3","volume":"72","author":"E Kivelevitch","year":"2013","unstructured":"Kivelevitch E, Cohen K, Kumar M (2013) A market-based solution to the multiple traveling salesmen problem. J Intell Robot Syst 72(1):21\u201340. \n                    https:\/\/doi.org\/10.1007\/s10846-012-9805-3","journal-title":"J Intell Robot Syst"},{"key":"259_CR24","unstructured":"Koub\u00e2a A, Trigui S, Ch\u00e2ari I (2012) Indoor surveillance application using wireless robots and sensor networks: coordination and path planning. In: Mobile ad hoc robots and wireless robotic systems: design and implementation, pp 19\u201357"},{"key":"259_CR25","doi-asserted-by":"crossref","unstructured":"Li J, Sun Q, Zhou M, Dai X (2013) A new multiple traveling salesman problem and its genetic algorithm-based solution. In: 2013 IEEE international conference on systems, man, and cybernetics, pp 627\u2013632. \n                    https:\/\/doi.org\/10.1109\/SMC.2013.112","DOI":"10.1109\/SMC.2013.112"},{"key":"259_CR26","doi-asserted-by":"crossref","unstructured":"Liu W, Li S, Zhao F, Zheng A (2009) An ant colony optimization algorithm for the multiple traveling salesmen problem. In: 2009 4th IEEE conference on industrial electronics and applications, pp 1533\u20131537. \n                    https:\/\/doi.org\/10.1109\/ICIEA.2009.5138451","DOI":"10.1109\/ICIEA.2009.5138451"},{"key":"259_CR27","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/978-3-642-11218-8_6","volume-title":"The multiobjective traveling salesman problem: a survey and a new approach","author":"T Lust","year":"2010","unstructured":"Lust T, Teghem J (2010) The multiobjective traveling salesman problem: a survey and a new approach. Springer, Berlin, pp 119\u2013141. \n                    https:\/\/doi.org\/10.1007\/978-3-642-11218-8_6"},{"issue":"4","key":"259_CR28","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1016\/j.ecoinf.2006.07.003","volume":"1","author":"A Mehrabian","year":"2006","unstructured":"Mehrabian A, Lucas C (2006) A novel numerical optimization algorithm inspired from weed colonization. Ecol Inform 1(4):355\u2013366. \n                    https:\/\/doi.org\/10.1016\/j.ecoinf.2006.07.003","journal-title":"Ecol Inform"},{"key":"259_CR29","volume-title":"Nonlinear multiobjective optimization","author":"K Miettinen","year":"1999","unstructured":"Miettinen K (1999) Nonlinear multiobjective optimization. Springer, New York"},{"key":"259_CR30","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/978-3-540-88051-6_14","volume-title":"Comparison between MOEA\/D and NSGA-II on the multi-objective travelling salesman problem","author":"W Peng","year":"2009","unstructured":"Peng W, Zhang Q, Li H (2009) Comparison between MOEA\/D and NSGA-II on the multi-objective travelling salesman problem. Springer, Berlin, pp 309\u2013324. \n                    https:\/\/doi.org\/10.1007\/978-3-540-88051-6_14"},{"key":"259_CR31","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/0-306-48213-4_1","volume-title":"The traveling salesman problem: applications, formulations and variations","author":"AP Punnen","year":"2007","unstructured":"Punnen AP (2007) The traveling salesman problem: applications, formulations and variations. Springer, Boston, pp 1\u201328. \n                    https:\/\/doi.org\/10.1007\/0-306-48213-4_1"},{"issue":"3\u20135","key":"259_CR32","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/0270-0255(87)90473-8","volume":"9","author":"R Saaty","year":"1987","unstructured":"Saaty R (1987) The analytic hierarchy process: what it is and how it is used. Math Model 9(3\u20135):161\u2013176. \n                    https:\/\/doi.org\/10.1016\/0270-0255(87)90473-8","journal-title":"Math Model"},{"issue":"5","key":"259_CR33","doi-asserted-by":"publisher","first-page":"682","DOI":"10.1109\/TSMCC.2012.2188285","volume":"42","author":"VA Shim","year":"2012","unstructured":"Shim VA, Tan KC, Cheong CY (2012) A hybrid estimation of distribution algorithm with decomposition for solving the multiobjective multiple traveling salesman problem. IEEE Trans Syst Man Cybern Part C (Appl Rev) 42(5):682\u2013691. \n                    https:\/\/doi.org\/10.1109\/TSMCC.2012.2188285","journal-title":"IEEE Trans Syst Man Cybern Part C (Appl Rev)"},{"key":"259_CR34","doi-asserted-by":"crossref","unstructured":"Shim VA, Tan KC, Tan KK (2012) A hybrid estimation of distribution algorithm for solving the multi-objective multiple traveling salesman problem. In: 2012 IEEE congress on evolutionary computation, pp 1\u20138. \n                    https:\/\/doi.org\/10.1109\/CEC.2012.6256438","DOI":"10.1109\/CEC.2012.6256438"},{"key":"259_CR35","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1016\/j.ejor.2013.01.043","volume":"228","author":"Y Shuai","year":"2013","unstructured":"Shuai Y, Bradley S, Shoudong H, Dikai L (2013) A new crossover approach for solving the multiple travelling salesmen problem using genetic algorithms. Eur J Oper Res 228:72\u201382","journal-title":"Eur J Oper Res"},{"issue":"1","key":"259_CR36","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/s00500-008-0312-1","volume":"13","author":"A Singh","year":"2009","unstructured":"Singh A, Baghel AS (2009) A new grouping genetic algorithm approach to the multiple traveling salesperson problem. Soft Comput 13(1):95\u2013101. \n                    https:\/\/doi.org\/10.1007\/s00500-008-0312-1","journal-title":"Soft Comput"},{"issue":"2","key":"259_CR37","first-page":"209","volume":"3","author":"H Singh","year":"2013","unstructured":"Singh H, Kaur R (2013) Resolving multiple traveling salesman problem using genetic algorithms. Int J Comput Sci Eng 3(2):209\u2013212","journal-title":"Int J Comput Sci Eng"},{"issue":"7","key":"259_CR38","first-page":"107","volume":"14","author":"S Singh","year":"2014","unstructured":"Singh S, Lodhi EA (2014) Comparison study of multiple traveling salesmen problem using genetic algorithm. Int J Comput Sci Netw Secur (IJCSNS) 14(7):107\u2013110","journal-title":"Int J Comput Sci Netw Secur (IJCSNS)"},{"key":"259_CR39","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-016-2279-7","author":"S Trigui","year":"2016","unstructured":"Trigui S, Cheikhrouhou O, Koubaa A, Baroudi U, Youssef H (2016) FL-MTSP: a fuzzy logic approach to solve the multi-objective multiple traveling salesman problem for multi-robot systems. Soft Comput. \n                    https:\/\/doi.org\/10.1007\/s00500-016-2279-7","journal-title":"Soft Comput"},{"key":"259_CR40","doi-asserted-by":"crossref","unstructured":"Trigui S, Koubaa A, Cheikhrouhou O, Qureshi B, Youssef H (2016) A clustering market-based approach for multi-robot emergency response applications. In: 2016 International conference on autonomous robot systems and competitions (ICARSC), pp 137\u2013143. \n                    https:\/\/doi.org\/10.1109\/ICARSC.2016.14","DOI":"10.1109\/ICARSC.2016.14"},{"key":"259_CR41","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1016\/j.asoc.2014.09.029","volume":"26","author":"P Venkatesh","year":"2015","unstructured":"Venkatesh P, Singh A (2015) Two metaheuristic approaches for the multiple traveling salesperson problem. Appl Soft Comput 26:74\u201389. \n                    https:\/\/doi.org\/10.1016\/j.asoc.2014.09.029","journal-title":"Appl Soft Comput"},{"issue":"2","key":"259_CR42","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1109\/TMECH.2009.2014056","volume":"14","author":"A Viguria","year":"2009","unstructured":"Viguria A, Howard AM (2009) An integrated approach for achieving multirobot task formations. IEEE\/ASME Trans Mechatron 14(2):176\u2013186. \n                    https:\/\/doi.org\/10.1109\/TMECH.2009.2014056","journal-title":"IEEE\/ASME Trans Mechatron"},{"key":"259_CR43","doi-asserted-by":"crossref","unstructured":"Wang X, Liu D, Hou M (2013) A novel method for multiple depot and open paths, multiple traveling salesmen problem. In: 2013 IEEE 11th international symposium on applied machine intelligence and informatics (SAMI), pp 187\u2013192. \n                    https:\/\/doi.org\/10.1109\/SAMI.2013.6480972","DOI":"10.1109\/SAMI.2013.6480972"},{"key":"259_CR44","doi-asserted-by":"crossref","unstructured":"Xu Z, Li Y, Feng X (2008) Constrained multi-objective task assignment for UUVs using multiple ant colonies system. In: 2008 ISECS international colloquium on computing, communication, control, and management, vol 1, pp 462\u2013466. \n                    https:\/\/doi.org\/10.1109\/CCCM.2008.318","DOI":"10.1109\/CCCM.2008.318"},{"issue":"3","key":"259_CR45","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1007\/s00500-014-1279-8","volume":"19","author":"W Yong","year":"2015","unstructured":"Yong W (2015) Hybrid max\u2013min ant system with four vertices and three lines inequality for traveling salesman problem. Soft Comput 19(3):585\u2013596. \n                    https:\/\/doi.org\/10.1007\/s00500-014-1279-8","journal-title":"Soft Comput"},{"issue":"1","key":"259_CR46","first-page":"65","volume":"16","author":"M Yousefikhoshbakht","year":"2013","unstructured":"Yousefikhoshbakht M, Didehvar F, Rahmati F (2013) Modification of the ant colony optimization for solving the multiple traveling salesman problem. Rom Acad Sect Inf Sci Technol 16(1):65\u201380","journal-title":"Rom Acad Sect Inf Sci Technol"}],"container-title":["Intelligent Service Robotics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11370-018-0259-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11370-018-0259-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11370-018-0259-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,7]],"date-time":"2019-09-07T19:08:39Z","timestamp":1567883319000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11370-018-0259-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,9,8]]},"references-count":46,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2018,10]]}},"alternative-id":["259"],"URL":"https:\/\/doi.org\/10.1007\/s11370-018-0259-8","relation":{},"ISSN":["1861-2776","1861-2784"],"issn-type":[{"value":"1861-2776","type":"print"},{"value":"1861-2784","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,9,8]]},"assertion":[{"value":"15 September 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 August 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 September 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}