{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,2]],"date-time":"2026-09-02T15:03:52Z","timestamp":1788361432648,"version":"build-2803163510"},"reference-count":24,"publisher":"Wiley","license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100002383","name":"King Saud University","doi-asserted-by":"publisher","award":["RG-1437-027"],"award-info":[{"award-number":["RG-1437-027"]}],"id":[{"id":"10.13039\/501100002383","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computational Intelligence and Neuroscience"],"published-print":{"date-parts":[[2017]]},"abstract":"<jats:p>Genetic algorithms are evolutionary techniques used for optimization purposes according to survival of the fittest idea. These methods do not ensure optimal solutions; however, they give good approximation usually in time. The genetic algorithms are useful for NP-hard problems, especially the traveling salesman problem. The genetic algorithm depends on selection criteria, crossover, and mutation operators. To tackle the traveling salesman problem using genetic algorithms, there are various representations such as binary, path, adjacency, ordinal, and matrix representations. In this article, we propose a new crossover operator for traveling salesman problem to minimize the total distance. This approach has been linked with path representation, which is the most natural way to represent a legal tour. Computational results are also reported with some traditional path representation methods like partially mapped and order crossovers along with new cycle crossover operator for some benchmark TSPLIB instances and found improvements.<\/jats:p>","DOI":"10.1155\/2017\/7430125","type":"journal-article","created":{"date-parts":[[2017,10,25]],"date-time":"2017-10-25T19:31:54Z","timestamp":1508959914000},"page":"1-7","source":"Crossref","is-referenced-by-count":126,"title":["Genetic Algorithm for Traveling Salesman Problem with Modified Cycle Crossover Operator"],"prefix":"10.1155","volume":"2017","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4141-0359","authenticated-orcid":true,"given":"Abid","family":"Hussain","sequence":"first","affiliation":[{"name":"Department of Statistics, Quaid-i-Azam University, Islamabad, Pakistan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3541-6220","authenticated-orcid":true,"given":"Yousaf Shad","family":"Muhammad","sequence":"additional","affiliation":[{"name":"Department of Statistics, Quaid-i-Azam University, Islamabad, Pakistan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8988-4946","authenticated-orcid":true,"given":"M.","family":"Nauman Sajid","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Foundation University, Islamabad, Pakistan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1586-1503","authenticated-orcid":true,"given":"Ijaz","family":"Hussain","sequence":"additional","affiliation":[{"name":"Department of Statistics, Quaid-i-Azam University, Islamabad, Pakistan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alaa","family":"Mohamd Shoukry","sequence":"additional","affiliation":[{"name":"Arriyadh Community College, King Saud University, Riyadh, Saudi Arabia"},{"name":"KSA Workers University, El Mansoura, Egypt"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Showkat","family":"Gani","sequence":"additional","affiliation":[{"name":"College of Business Administration, King Saud University, Muzahimiyah, Saudi Arabia"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"311","reference":[{"key":"1","year":"1975"},{"key":"2","year":"1989"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1023\/A:1006529012972"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(89)90037-0"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1016\/0141-9331(92)90038-U"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1007\/BF01609016"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1287\/opre.21.2.498"},{"key":"9","year":"2001"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1051\/jphys:019850046080127700"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/4235.585892"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/3477.484436"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/12.257714"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1002\/mde.4090110512"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-07418-3"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(01)00227-2"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1007\/BF02125403"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1002\/9780470172254"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2012.02.029"},{"issue":"1","key":"21","volume":"2","year":"2011","journal-title":"International Journal of Combinatorial Optimization Problems and Informatics"},{"issue":"3","key":"22","first-page":"258","volume":"2","year":"2015","journal-title":"International Journal of Advances in Applied Mathematics and Mechanics"},{"key":"23","first-page":"51","year":"2010","journal-title":"Informatyka"},{"key":"24","volume":"1","year":"2012","journal-title":"International Journal of Latest Research in Science and Technology"},{"key":"26","first-page":"162","volume":"85","year":"1985","journal-title":"IJCAI"},{"key":"27","volume-title":"Study of permutation crossover operators on the traveling salesman problem","year":"1987"}],"container-title":["Computational Intelligence and Neuroscience"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/cin\/2017\/7430125.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/cin\/2017\/7430125.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/cin\/2017\/7430125.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,10,25]],"date-time":"2017-10-25T19:31:56Z","timestamp":1508959916000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.hindawi.com\/journals\/cin\/2017\/7430125\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"references-count":24,"alternative-id":["7430125","7430125"],"URL":"https:\/\/doi.org\/10.1155\/2017\/7430125","relation":{},"ISSN":["1687-5265","1687-5273"],"issn-type":[{"value":"1687-5265","type":"print"},{"value":"1687-5273","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]}}}