{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T07:43:51Z","timestamp":1770277431151,"version":"3.49.0"},"reference-count":30,"publisher":"SAGE Publications","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IFS"],"published-print":{"date-parts":[[2019,3,26]]},"DOI":"10.3233\/jifs169939","type":"journal-article","created":{"date-parts":[[2019,3,26]],"date-time":"2019-03-26T16:51:11Z","timestamp":1553619071000},"page":"2285-2295","source":"Crossref","is-referenced-by-count":4,"title":["A multi-matching approximation algorithm for Symmetric Traveling Salesman Problem"],"prefix":"10.1177","volume":"36","author":[{"given":"Husain","family":"Naser","sequence":"first","affiliation":[{"name":"College of Information Technology, Ahlia University, Manama, Bahrain"}]},{"given":"Wasan S.","family":"Awad","sequence":"additional","affiliation":[{"name":"College of Information Technology, Ahlia University, Manama, Bahrain"}]},{"given":"El-Sayed M.","family":"El-Alfy","sequence":"additional","affiliation":[{"name":"Department of Information and Computer Science, College of Computer Sciences and Engineering King Fahd University of Petroleum and Minerals, Dhahran, Saudi Arabia"}]}],"member":"179","reference":[{"key":"10.3233\/JIFS169939_ref1","doi-asserted-by":"crossref","unstructured":"J. Puchinger and G.R. Raidl , Combining metaheuristics and exact algorithms in combinatorial optimization: A survey and classification, In International Work-Conference on the Interplay Between Natural and Artificial Computation, 2005, pp. 41\u201353.","DOI":"10.1007\/11499305_5"},{"issue":"3","key":"10.3233\/JIFS169939_ref2","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0304-3975(77)90012-3","article-title":"The euclidean travelling salesman problem is np-complete","volume":"4","author":"Papadimitriou","year":"1977","journal-title":"Theoretical Computer Science"},{"key":"10.3233\/JIFS169939_ref3","volume-title":"Introduction to algorithms","author":"Cormen","year":"2009"},{"key":"10.3233\/JIFS169939_ref4","volume-title":"Computational Business Analytics","author":"Subrata","year":"2014"},{"issue":"6","key":"10.3233\/JIFS169939_ref5","doi-asserted-by":"crossref","first-page":"972","DOI":"10.1287\/opre.11.6.972","article-title":"An algorithm for the traveling salesman problem","volume":"11","author":"Little","year":"1963","journal-title":"Operations Research"},{"key":"10.3233\/JIFS169939_ref6","unstructured":"K.G. Murty , C. Karel and J.D.C. Little , The traveling salesman problem: Solution by a method of ranking assignments, In Case Institute of Technology, (unpublished), 1962."},{"key":"10.3233\/JIFS169939_ref7","unstructured":"J.E. Mitchell , Branch-and-cut algorithms for combinatorial optimization problems, In Handbook of Applied Optimization, 2002, pp. 65\u201377."},{"key":"10.3233\/JIFS169939_ref8","doi-asserted-by":"crossref","unstructured":"D.L. Applegate , R.E. Bixby , V. Chvatal and A.J. Cook , The traveling salesman problem: A computational study, Princeton University Press, 2006.","DOI":"10.1515\/9781400841103"},{"key":"10.3233\/JIFS169939_ref9","volume-title":"Master\u2019s thesis","author":"Kutkut","year":"2001"},{"issue":"2","key":"10.3233\/JIFS169939_ref10","first-page":"62","article-title":"Asurvey of comparison between various meta-heuristic techniques for path planning problem","volume":"3","author":"Arora","year":"2013","journal-title":"International Journal of Computer Engineering & Science"},{"issue":"1","key":"10.3233\/JIFS169939_ref11","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1109\/4235.585892","article-title":"Ant colony system: A cooperative learning approach to the traveling salesman problem","volume":"1","author":"Dorigo","year":"1997","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"10.3233\/JIFS169939_ref12","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/j.engappai.2015.10.006","article-title":"An improved discrete bat algorithm for symmetric and asymmetric traveling salesman problems","volume":"48","author":"Osaba","year":"2016","journal-title":"Engineering Applications of Artificial Intelligence"},{"issue":"3","key":"10.3233\/JIFS169939_ref13","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/BF02125403","article-title":"Genetic algorithms for the traveling salesman problem","volume":"63","author":"Potvin","year":"1996","journal-title":"Annals of Operations Research"},{"issue":"2","key":"10.3233\/JIFS169939_ref14","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1023\/A:1006529012972","article-title":"Genetic algorithms for the travelling salesman problem: A review of representations and operators","volume":"13","author":"Larranaga","year":"1999","journal-title":"Artificial Intelligence Review"},{"key":"10.3233\/JIFS169939_ref15","doi-asserted-by":"crossref","unstructured":"A. Ouaarab , B. Ahiod and X.-S. Yang , Improved and discrete cuckoo search for solving the travelling salesman problem, In Cuckoo Search and Firefly Algorithm, 2014, pp. 63\u201384.","DOI":"10.1007\/978-3-319-02141-6_4"},{"key":"10.3233\/JIFS169939_ref16","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1016\/j.ins.2017.08.067","article-title":"Hybrid discrete artificial bee colony algorithm with threshold acceptance criterion for traveling salesman problem","volume":"421","author":"Zhong","year":"2017","journal-title":"Information Sciences"},{"issue":"2","key":"10.3233\/JIFS169939_ref17","first-page":"390","article-title":"Heuristic approaches to solve traveling salesman problem","volume":"15","author":"Abid","year":"2015","journal-title":"Indonesian Journal of Electrical Engineering and Computer Science"},{"issue":"3","key":"10.3233\/JIFS169939_ref18","doi-asserted-by":"crossref","first-page":"313","DOI":"10.3390\/mca18030313","article-title":"A new simulated annealing approach for travelling salesman problem","volume":"18","author":"Bayram","year":"2013","journal-title":"Mathematical and Computational Applications"},{"issue":"7","key":"10.3233\/JIFS169939_ref19","doi-asserted-by":"crossref","first-page":"1165","DOI":"10.1166\/jctn.2015.3868","article-title":"Simulated annealing with a hybrid local search for solving the traveling salesman problem","volume":"12","author":"Zhao","year":"2015","journal-title":"Journal of Computational and Theoretical Nanoscience"},{"issue":"4","key":"10.3233\/JIFS169939_ref20","doi-asserted-by":"crossref","first-page":"6","DOI":"10.5120\/ijais12-450678","article-title":"A comparative study of simulated annealing and genetic algorithm for solving the travelling salesman problem","volume":"4","author":"Adewole","year":"2012","journal-title":"International Journal of Applied Information Systems (IJAIS)"},{"issue":"1","key":"10.3233\/JIFS169939_ref21","first-page":"46","article-title":"Choice of best possible metaheuristic algorithm for the travelling salesman problem with limited computational time: Quality, uncertainty and speed","volume":"7","author":"Antosiewicz","year":"2013","journal-title":"Journal of Theoretical and Applied Computer Science"},{"key":"10.3233\/JIFS169939_ref22","doi-asserted-by":"crossref","unstructured":"Y. Deng , Y. Liu and Z. Deyun , An improved genetic algorithm with initial population strategy for symmetric tsp, Mathematical Problems in Engineering 2015 (2015).","DOI":"10.1155\/2015\/212794"},{"key":"10.3233\/JIFS169939_ref23","doi-asserted-by":"crossref","unstructured":"A.M. Mohsen , Annealing ant colony optimization with mutation operator for solving tsp, Computational Intelligence and Neuroscience 2016 (2016).","DOI":"10.1155\/2016\/8932896"},{"key":"10.3233\/JIFS169939_ref24","doi-asserted-by":"crossref","unstructured":"E. Osaba , R. Carballedo , P. L\u00f3pez-Garc\u00eda and F. Diaz , Comparison between golden ball metaheuristic, evolutionary simulated annealing and tabu search for the traveling salesman problem, In Proceedings of ACM Conference on Genetic and Evolutionary Computation, 2016, pp. 1469\u20131470.","DOI":"10.1145\/2908961.2931634"},{"issue":"3","key":"10.3233\/JIFS169939_ref25","doi-asserted-by":"crossref","first-page":"851","DOI":"10.1109\/7.599256","article-title":"Optimizing murty\u2019s ranked assignment method","volume":"33","author":"Miller","year":"1997","journal-title":"IEEE Transactions on Aerospace and Electronic Systems"},{"issue":"1","key":"10.3233\/JIFS169939_ref26","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/s12532-009-0002-8","article-title":"Blossom v: A new implementation of a minimum cost perfect matching algorithm","volume":"1","author":"Kolmogorov","year":"2009","journal-title":"Mathematical Programming Computation"},{"key":"10.3233\/JIFS169939_ref27","doi-asserted-by":"crossref","unstructured":"H.T. Lau , A Java library of graph algorithms and optimization, CRC Press, 2006.","DOI":"10.1201\/9781584887195"},{"key":"10.3233\/JIFS169939_ref28","unstructured":"G. Reinelt , TSPLIB95. http:\/\/comopt.ifi.uniheidelberg.de\/software\/TSPLIB95\/, 2013."},{"key":"10.3233\/JIFS169939_ref29","unstructured":"W. Cook , TSP test data. http:\/\/www.math.uwaterloo.ca\/tsp\/data\/index.html, 2009."},{"issue":"4","key":"10.3233\/JIFS169939_ref30","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","article-title":"Tsplib \u2013 a traveling salesman problem library","volume":"3","author":"Reinelt","year":"1991","journal-title":"ORSA Journal on Computing"}],"container-title":["Journal of Intelligent & Fuzzy Systems"],"original-title":[],"link":[{"URL":"https:\/\/content.iospress.com\/download?id=10.3233\/JIFS169939","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,4]],"date-time":"2026-02-04T18:26:06Z","timestamp":1770229566000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/full\/10.3233\/JIFS169939"}},"subtitle":[],"editor":[{"given":"Sabu M.","family":"Thampi","sequence":"additional","affiliation":[]},{"given":"El-Sayed M.","family":"El-Alfy","sequence":"additional","affiliation":[]}],"short-title":[],"issued":{"date-parts":[[2019,3,26]]},"references-count":30,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.3233\/jifs169939","relation":{},"ISSN":["1064-1246","1875-8967"],"issn-type":[{"value":"1064-1246","type":"print"},{"value":"1875-8967","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,3,26]]}}}