{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T08:02:53Z","timestamp":1725609773459},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"24","license":[{"start":{"date-parts":[[2016,8,9]],"date-time":"2016-08-09T00:00:00Z","timestamp":1470700800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"King Fahd University of Petroleum & Minerals (KFUPM), the Kingdom of Saudi Arabia","award":["11-LE2147-4"]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2017,12]]},"DOI":"10.1007\/s00500-016-2279-7","type":"journal-article","created":{"date-parts":[[2016,8,9]],"date-time":"2016-08-09T04:16:23Z","timestamp":1470716183000},"page":"7351-7362","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":46,"title":["FL-MTSP: a fuzzy logic approach to solve the multi-objective multiple traveling salesman problem for multi-robot systems"],"prefix":"10.1007","volume":"21","author":[{"given":"Sahar","family":"Trigui","sequence":"first","affiliation":[]},{"given":"Omar","family":"Cheikhrouhou","sequence":"additional","affiliation":[]},{"given":"Anis","family":"Koubaa","sequence":"additional","affiliation":[]},{"given":"Uthman","family":"Baroudi","sequence":"additional","affiliation":[]},{"given":"Habib","family":"Youssef","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,8,9]]},"reference":[{"key":"2279_CR1","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/j.ejor.2007.12.014","volume":"194","author":"JF B\u00e9rub\u00e9","year":"2009","unstructured":"B\u00e9rub\u00e9 JF, Gendreau M, Potvin JY (2009) An exact \n $$\\varepsilon $$\n \n \n \n \u03b5\n \n \n -constraint method for bi-objective combinatorial optimization problems: application to the traveling salesman problem with profits. Eur J Oper Res 194:39\u201350","journal-title":"Eur J Oper Res"},{"key":"2279_CR2","doi-asserted-by":"crossref","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. Decis Sci Lett 4:559\u2013568","journal-title":"Decis Sci Lett"},{"key":"2279_CR3","doi-asserted-by":"crossref","first-page":"333347","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 Decis Mak 6:333347","journal-title":"Int J Inf Technol Decis Mak"},{"key":"2279_CR4","doi-asserted-by":"crossref","first-page":"245","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:245\u2013257","journal-title":"Eur J Oper Res"},{"key":"2279_CR5","doi-asserted-by":"crossref","unstructured":"Cheikhrouhou O, Koub\u00e2a A, Bennaceur H (2014) Move and improve: a distributed multi-robot coordination approach for multiple depots multiple travelling salesmen problem. In: IEEE international conference on autonomous robot systems and competitions (ICARSC) 2014, IEEE, p 28\u201335","DOI":"10.1109\/ICARSC.2014.6849758"},{"key":"2279_CR6","doi-asserted-by":"crossref","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 Evol Comput 6:182\u2013197","journal-title":"IEEE Trans Evol Comput"},{"key":"2279_CR7","doi-asserted-by":"crossref","unstructured":"Fazli P, Davoodi A, Pasquier P, Mackworth AK (2010) Complete and robust cooperative robot area coverage with limited range. In: 2010 IEEE\/RSJ international conference on intelligent robots and systems (IROS), p 5577\u20135582","DOI":"10.1109\/IROS.2010.5651321"},{"key":"2279_CR8","unstructured":"Helsgaun K (2012) LKH. \n http:\/\/www.akira.ruc.dk\/~keld\/research\/LKH\/"},{"key":"2279_CR9","doi-asserted-by":"crossref","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:1845\u20131859","journal-title":"IEEE Trans Cybern"},{"key":"2279_CR10","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/s10846-010-9536-2","volume":"64","author":"AM Khamis","year":"2011","unstructured":"Khamis AM, Elmogy AM, Karray FO (2011) Complex task allocation in mobile surveillance systems. J Intell Robot Syst 64:33\u201355","journal-title":"J Intell Robot Syst"},{"key":"2279_CR11","unstructured":"Kirk J (2011) Traveling-salesman-problem-genetic-algorithm. \n http:\/\/www.mathworks.com\/matlabcentral\/fileexchange\/13680-traveling-salesman-problem-genetic-algorithm"},{"key":"2279_CR12","unstructured":"Kivelevitch E (2011) MDMTSPV_GA\u2014multiple 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"},{"key":"2279_CR13","doi-asserted-by":"crossref","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:21\u201340","journal-title":"J Intell Robot Syst"},{"key":"2279_CR14","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: Design and Implementation, pp 19\u201357"},{"key":"2279_CR15","unstructured":"Liu W, Li S, Zhao F, Zheng A (2009) An ant colony optimization algorithm for the multiple traveling salesmen problem. In: 4th IEEE conference on industrial electronics and applications, 2009. ICIEA 2009, p 1533\u20131537"},{"key":"2279_CR16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0020-7373(75)80002-2","volume":"7","author":"EH Mamdani","year":"1975","unstructured":"Mamdani EH, Assilian S (1975) An experiment in linguistic synthesis with a fuzzy logic controller. Int J Man Mach Stud 7:1\u201313","journal-title":"Int J Man Mach Stud"},{"key":"2279_CR17","doi-asserted-by":"crossref","first-page":"853","DOI":"10.1007\/s00158-009-0460-7","volume":"41","author":"RT Marler","year":"2010","unstructured":"Marler RT, Arora JS (2010) The weighted sum method for multi-objective optimization: new insights. Struct Multidiscip Optim 41:853\u2013862","journal-title":"Struct Multidiscip Optim"},{"key":"2279_CR18","first-page":"455","volume":"213","author":"G Mavrotas","year":"2009","unstructured":"Mavrotas G (2009) Effective implementation of the \n $$\\varepsilon $$\n \n \n \n \u03b5\n \n \n -constraint method in multi-objective mathematical programming problems. Appl Math Comput 213:455\u2013465","journal-title":"Appl Math Comput"},{"issue":"1","key":"2279_CR19","doi-asserted-by":"crossref","first-page":"125","DOI":"10.2298\/YJOR0701125N","volume":"17","author":"I Nikoli\u0107","year":"2007","unstructured":"Nikoli\u0107 I (2007) Total time minimizing transportation problem. Yugosl J Oper Res 17(1):125\u2013133","journal-title":"Yugosl J Oper Res"},{"key":"2279_CR20","doi-asserted-by":"crossref","unstructured":"Pippin C, Christensen H, Weiss L (2013) Performance based task assignment in multi-robot patrolling. In: Proceedings of the 28th annual ACM symposium on applied computing, p 70\u201376","DOI":"10.1145\/2480362.2480378"},{"key":"2279_CR21","unstructured":"Sariel S, Erdogan N, Balch T (2007) An integrated approach to solving the real-world multiple traveling robot problem. In: 5th international conference on electrical and electronics engineering"},{"key":"2279_CR22","unstructured":"Seshadri A (2006) A fast elitist multiobjective genetic algorithm: NSGA-II. MATLAB Central 182"},{"key":"2279_CR23","doi-asserted-by":"crossref","unstructured":"Shim VA, Tan KC, Tan KK (2012b) A hybrid estimation of distribution algorithm for solving the multi-objective multiple traveling salesman problem. In: 2012 IEEE congress on evolutionary computation (CEC), p 1\u20138","DOI":"10.1109\/CEC.2012.6256438"},{"key":"2279_CR24","doi-asserted-by":"crossref","first-page":"682","DOI":"10.1109\/TSMCC.2012.2188285","volume":"42","author":"VA Shim","year":"2012","unstructured":"Shim VA, Tan KC, Cheong CY (2012a) A hybrid estimation of distribution algorithm with decomposition for solving the multiobjective multiple traveling salesman problem. IEEE Trans Syst Man Cybern C Appl Rev 42:682\u2013691","journal-title":"IEEE Trans Syst Man Cybern C Appl Rev"},{"key":"2279_CR25","doi-asserted-by":"crossref","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:95\u2013101","journal-title":"Soft Comput"},{"key":"2279_CR26","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1109\/TSMC.1985.6313399","volume":"1","author":"T Takagi","year":"1985","unstructured":"Takagi T, Sugeno M (1985) Fuzzy identification of systems and its applications to modeling and control. IEEE Trans Syst Man Cybern 1:116\u2013132","journal-title":"IEEE Trans Syst Man Cybern"},{"key":"2279_CR27","doi-asserted-by":"crossref","first-page":"1108","DOI":"10.1016\/j.procs.2014.05.540","volume":"32","author":"S Trigui","year":"2014","unstructured":"Trigui S, Koub\u00e2a A, Cheikhrouhou O, Youssef H, Bennaceur H, Sriti MF, Javed Y (2014) A distributed market-based algorithm for the multi-robot assignment problem. Proced Comput Sci 32:1108\u20131114","journal-title":"Proced Comput Sci"},{"key":"2279_CR28","doi-asserted-by":"crossref","unstructured":"Trigui S, Koub\u00e2a A, Ben Jam\u00e2a M, Ch\u00e2ari I, Al-Shalfan K (2012) Coordination in a multi-robot surveillance application using wireless sensor networks. In: 16th IEEE mediterranean electrotechnical conference (MELECON), IEEE, p 989\u2013992","DOI":"10.1109\/MELCON.2012.6196593"},{"key":"2279_CR29","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: 11th IEEE international symposium on applied machine intelligence and informatics (SAMI), IEEE, p 187\u2013192","DOI":"10.1109\/SAMI.2013.6480972"},{"key":"2279_CR30","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: ISECS international colloquium on computing, communication, control, and management, 2008. CCCM\u201908., vol 1, p 462\u2013466","DOI":"10.1109\/CCCM.2008.318"},{"key":"2279_CR31","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. Roman Acad Sect Inf Sci Technol 16:65\u201380","journal-title":"Roman Acad Sect Inf Sci Technol"},{"key":"2279_CR32","doi-asserted-by":"crossref","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:338\u2013353","journal-title":"Inf Control"},{"key":"2279_CR33","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0020-0255(75)90036-5","volume":"8","author":"LA Zadeh","year":"1975","unstructured":"Zadeh LA (1975) The concept of a linguistic variable and its application to approximate reasoningI. Inf Sci 8:199\u2013249","journal-title":"Inf Sci"},{"key":"2279_CR34","doi-asserted-by":"crossref","first-page":"712","DOI":"10.1109\/TEVC.2007.892759","volume":"11","author":"Q Zhang","year":"2007","unstructured":"Zhang Q, Li H (2007) MOEA\/D: a multiobjective evolutionary algorithm based on decomposition. IEEE Trans Evol Comput 11:712\u2013731","journal-title":"IEEE Trans Evol Comput"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-016-2279-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-016-2279-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-016-2279-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-016-2279-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,11,8]],"date-time":"2017-11-08T07:30:42Z","timestamp":1510126242000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-016-2279-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,8,9]]},"references-count":34,"journal-issue":{"issue":"24","published-print":{"date-parts":[[2017,12]]}},"alternative-id":["2279"],"URL":"https:\/\/doi.org\/10.1007\/s00500-016-2279-7","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,8,9]]}}}
