Table of Contents Author Guidelines Submit a Manuscript
The Scientific World Journal
Volume 2014 (2014), Article ID 258207, 13 pages
http://dx.doi.org/10.1155/2014/258207
Research Article

The Ordered Clustered Travelling Salesman Problem: A Hybrid Genetic Algorithm

Department of Computer Science, Al Imam Mohammad Ibn Saud Islamic University (IMSIU), P.O. Box 5701, Riyadh 11432, Saudi Arabia

Received 28 August 2013; Accepted 30 December 2013; Published 19 February 2014

Academic Editors: M. Rǎdulescu, L. Scrimali, and W. Szeto

Copyright © 2014 Zakir Hussain Ahmed. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Citations to this Article [7 citations]

The following is the list of published articles that have cited the current article.

  • Zakir Hussain Ahmed, “Experimental analysis of crossover and mutation operators on the quadratic assignment problem,” Annals of Operations Research, 2015. View at Publisher · View at Google Scholar
  • Zakir Hussain Ahmed, “A multi-parent genetic algorithm for the quadratic assignment problem,” Opsearch, 2015. View at Publisher · View at Google Scholar
  • Fatih Camci, “Maintenance scheduling of geographically distributed assets with prognostics information,” European Journal of Operational Research, vol. 245, no. 2, pp. 506–516, 2015. View at Publisher · View at Google Scholar
  • Yong Deng, Yang Liu, and Deyun Zhou, “An Improved Genetic Algorithm with Initial Population Strategy for Symmetric TSP,” Mathematical Problems in Engineering, vol. 2015, pp. 1–6, 2015. View at Publisher · View at Google Scholar
  • Dalibor Bartonek, Jiří Bures, and Otakar Svabensky, “Optimization of Process Field Measurement GNSS-RTK for Railway Infrastructure,” Solid State Phenomena, vol. 258, pp. 481–484, 2016. View at Publisher · View at Google Scholar
  • Dalibor Bartonek, Jiri Bures, and Otakar Svabensky, “Optimized GNSS RTK measurement planning for effective point occupation via heuristic analysis,” Engineering Computations, vol. 34, no. 1, pp. 90–104, 2017. View at Publisher · View at Google Scholar
  • Santosh Kumar, Elias Munapo, Maseka Lesaoana, and Philimon Nyamugure, “A Minimum Spanning Tree Approximation to the Routing Problem through ‘K’ Specified Nodes,” Journal of Economics, vol. 5, no. 3, pp. 307–312, 2017. View at Publisher · View at Google Scholar