{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T04:40:26Z","timestamp":1783572026859,"version":"3.55.0"},"reference-count":25,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014,11]]},"DOI":"10.1109\/isda.2014.7066271","type":"proceedings-article","created":{"date-parts":[[2015,3,28]],"date-time":"2015-03-28T22:53:42Z","timestamp":1427583222000},"page":"76-81","source":"Crossref","is-referenced-by-count":31,"title":["GELS-GA: Hybrid metaheuristic algorithm for solving Multiple Travelling Salesman Problem"],"prefix":"10.1109","author":[{"given":"Ali A. R.","family":"Hosseinabadi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Maryam","family":"Kardgar","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mohammad","family":"Shojafar","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shahaboddin","family":"Shamshirband","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ajith","family":"Abraham","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/321832.321847"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1287\/opre.25.5.871"},{"key":"ref12","first-page":"167","article-title":"A two-commodity network flow approach to the traveling salesman problem","volume":"41","author":"finke","year":"1984","journal-title":"Congressus Numerantium"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/12.257714"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1057\/jors.2009.76"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/0957-4174(93)90056-C"},{"key":"ref16","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/978-3-642-15220-7_12","article-title":"A Novel Approach to Solve Multiple Traveling Salesmen Problem by Genetic Algorithm","volume":"313","author":"kir\u00e1ly","year":"2010","journal-title":"Computational Intelligence in Engineering"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.chaos.2005.08.114"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2010.03.002"},{"key":"ref19","first-page":"200","article-title":"A Comparison between Heuristic and Meta-Heuristic Methods for Solving the Multiple Traveling Salesman Problem","volume":"1","author":"sze","year":"2007","journal-title":"International Journal of Computational and Mathematical Sciences"},{"key":"ref4","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/j.omega.2004.10.004","article-title":"The multiple traveling salesman problem: an overview of formulations and solution procedures","volume":"34","author":"bektas","year":"2006","journal-title":"Omega"},{"key":"ref3","doi-asserted-by":"crossref","first-page":"1886","DOI":"10.1007\/s11434-012-5162-7","article-title":"A novel method for solving the multiple traveling salesmen problem with multiple depots","volume":"57","author":"mengshu","year":"2012","journal-title":"Chinese Science Bulletin"},{"key":"ref6","first-page":"924","article-title":"New hybrid algorithm for task scheduling in grid computing to decrease missed task","volume":"55","author":"pooranian","year":"2011","journal-title":"World Acad Sci Eng Technol"},{"key":"ref5","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/0166-218X(86)90087-9","article-title":"The asymmetric m-traveling salesmen problem: a duality based branch-and-bound algorithm","volume":"13","author":"ali","year":"1986","journal-title":"Discrete Applied Mathematics"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(98)00069-0"},{"key":"ref7","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1007\/BF00204755","article-title":"A neural network algorithm for the multiple traveling salesmen problem","volume":"61","author":"wacholder","year":"1989","journal-title":"Biological Cybernetics"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/s10846-012-9805-3"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2012.2237411"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-013-1402-2"},{"key":"ref20","first-page":"134","article-title":"TSPLIB- a traveling salesman problem library","volume":"4","author":"reinelt","year":"1996","journal-title":"ORSA Journal on Computing"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/SAMI.2013.6480972"},{"key":"ref21","year":"0"},{"key":"ref24","article-title":"An improved genetic algorithm for the multiple traveling salesman problemy","author":"zhao","year":"2008","journal-title":"Proc in Chinese Control and Decision Conference (CCDC)"},{"key":"ref23","first-page":"295","article-title":"A Combination of Sweep Algorithm and Elite Ant Colony Optimization For Solving The Multiple Traveling Salesman Problem","volume":"13","author":"yousefikhoshbakht","year":"2012","journal-title":"Proceedings of the Romanian Academy Series A"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-08156-4_5"}],"event":{"name":"2014 14th International Conference on Intelligent Systems Design and Applications (ISDA)","location":"Okinawa, Japan","start":{"date-parts":[[2014,11,28]]},"end":{"date-parts":[[2014,11,30]]}},"container-title":["2014 14th International Conference on Intelligent Systems Design and Applications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7058891\/7066251\/07066271.pdf?arnumber=7066271","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,23]],"date-time":"2017-06-23T04:11:40Z","timestamp":1498191100000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7066271\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,11]]},"references-count":25,"URL":"https:\/\/doi.org\/10.1109\/isda.2014.7066271","relation":{},"subject":[],"published":{"date-parts":[[2014,11]]}}}