Table of Contents Author Guidelines Submit a Manuscript
Computational Intelligence and Neuroscience
Volume 2017, Article ID 7430125, 7 pages
https://doi.org/10.1155/2017/7430125
Research Article

Genetic Algorithm for Traveling Salesman Problem with Modified Cycle Crossover Operator

1Department of Statistics, Quaid-i-Azam University, Islamabad, Pakistan
2Department of Computer Science, Foundation University, Islamabad, Pakistan
3Arriyadh Community College, King Saud University, Riyadh, Saudi Arabia
4KSA Workers University, El Mansoura, Egypt
5College of Business Administration, King Saud University, Muzahimiyah, Saudi Arabia

Correspondence should be addressed to Yousaf Shad Muhammad; kp.ude.uaq@fusuoy

Received 1 June 2017; Revised 17 July 2017; Accepted 7 August 2017; Published 25 October 2017

Academic Editor: Silvia Conforto

Copyright © 2017 Abid Hussain et al. 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.

Linked References

  1. J. H. Holland, Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence, University of Michigan Press, Oxford, UK, 1975. View at MathSciNet
  2. D. E. Golberg, Genetic algorithms in search, optimization and machine learning, Addison-Wesley Publishing Company, 1989.
  3. P. Larrañaga, C. M. H. Kuijpers, R. H. Murga, I. Inza, and S. Dizdarevic, “Genetic algorithms for the travelling salesman problem: a review of representations and operators,” Artificial Intelligence Review, vol. 13, no. 2, pp. 129–170, 1999. View at Publisher · View at Google Scholar · View at Scopus
  4. R. G. Bland and D. F. Shallcross, “Large traveling salesman problems arising from experiments in x-ray crystallography: a preliminary report on computation,” Operations Research Letters, vol. 8, no. 3, pp. 125–128, 1989. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  5. C. Ravikumar, “Parallel techniques for solving large scale travelling salesperson problems,” Microprocessors and Microsystems, vol. 16, no. 3, pp. 149–158, 1992. View at Publisher · View at Google Scholar · View at Scopus
  6. G. Finke, A. Claus, and E. Gunn, “A two-commodity network flow approach to the traveling salesman problem,” vol. 41, pp. 167–178. View at Google Scholar · View at MathSciNet
  7. P. Miliotis, “Using cutting planes to solve the symmetric Travelling Salesman problem,” Mathematical Programming, vol. 15, no. 1, pp. 177–188, 1978. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  8. S. Lin and B. W. Kernighan, “An effective heuristic algorithm for the traveling-salesman problem,” Operations Research, vol. 21, pp. 498–516, 1973. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  9. J. Kennedy, R. C. Eberhart, and Y. Shi, Swarm intelligence, morgan kaufmann publishers, Inc., San Francisco, CA, USA, 2001.
  10. S. Kirkpatrick and G. Toulouse, “Configuration space analysis of travelling salesman problems,” Le Journal de Physique, vol. 46, no. 8, pp. 1277–1292, 1985. View at Publisher · View at Google Scholar · View at MathSciNet
  11. M. Dorigo and L. M. Gambardella, “Ant colony system: a cooperative learning approach to the traveling salesman problem,” IEEE Transactions on Evolutionary Computation, vol. 1, no. 1, pp. 53–66, 1997. View at Publisher · View at Google Scholar · View at Scopus
  12. M. Dorigo, V. Maniezzo, and A. Colorni, “Ant system: optimization by a colony of cooperating agents,” IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics, vol. 26, no. 1, pp. 29–41, 1996. View at Publisher · View at Google Scholar · View at Scopus
  13. S. Bhide, N. John, and M. R. Kabuka, “A Boolean Neural Network Approach for the Traveling Salesman Problem,” IEEE Transactions on Computers, vol. 42, no. 10, pp. 1271–1278, 1993. View at Publisher · View at Google Scholar · View at Scopus
  14. F. Glover, “Artificial intelligence, heuristic frameworks and tabu search,” Managerial and Decision Economics, vol. 11, no. 5, pp. 365–375, 1990. View at Publisher · View at Google Scholar · View at Scopus
  15. Z. Michalewicz, Genetic Algorithms + Data Structures = Evolution Programs, Springer, New York, NY, USA, 1996. View at Publisher · View at Google Scholar · View at MathSciNet
  16. C. Moon, J. Kim, G. Choi, and Y. Seo, “An efficient genetic algorithm for the traveling salesman problem with precedence constraints,” European Journal of Operational Research, vol. 140, no. 3, pp. 606–617, 2002. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  17. J.-Y. Potvin, “Genetic algorithms for the traveling salesman problem,” Annals of Operations Research, vol. 63, pp. 339–370, 1996. View at Publisher · View at Google Scholar · View at Scopus
  18. M. Gen and R. Cheng, Genetic Algorithms and Engineering Design, John Wiley & Sons, London, UK, 1997. View at Publisher · View at Google Scholar
  19. H. Z. Ahmed, “Genetic algorithm for the traveling salesman problem using sequential constructive crossover operator,” in Proceedings of the International Journal of Biometrics & Bioinformatics (IJBB), vol. 3, p. 96, 2010.
  20. Y. Nagata and D. Soler, “A new genetic algorithm for the asymmetric traveling salesman problem,” Expert Systems with Applications, vol. 39, no. 10, pp. 8947–8953, 2012. View at Publisher · View at Google Scholar · View at Scopus
  21. K. Deep and H. M. Adane, “New variations of order crossover for travelling salesman problem,” International Journal of Combinatorial Optimization Problems and Informatics, vol. 2, no. 1, 2011. View at Google Scholar
  22. K. P. Ghadle and Y. M. Muley, “Travelling salesman problem with {MATLAB} programming,” International Journal of Advances in Applied Mathematics and Mechanics, vol. 2, no. 3, pp. 258–266, 2015. View at Google Scholar · View at MathSciNet
  23. A. Piwonska, “Genetic algorithm finds routes in travelling salesman problem with profits. Zeszyty Naukowe Politechniki Bia lostockiej,” Informatyka, pp. 51–65, 2010. View at Google Scholar
  24. N. Kumar, R. K. Karambir et al., “A comparative analysis of pmx, cx and ox crossover operators for solving traveling salesman problem,” International Journal of Latest Research in Science and Technology, vol. 1, 2012. View at Google Scholar
  25. D. Goldberg and R. Lingle, “Alleles, Loci and the Traveling Salesman Problem,” in Proceedings of the 1st International Conference on Genetic Algorithms and Their Applications, vol. 1985, pp. 154–159, Los Angeles, USA.
  26. L. Davis, “Applying adaptive algorithms to epistatic domains,” IJCAI, vol. 85, pp. 162–164, 1985. View at Google Scholar
  27. I. M. Oliver, D. J. d. Smith, and R. C. J. Holland, “Study of permutation crossover operators on the traveling salesman problem,” in Genetic algorithms and their applications: proceedings of the second International Conference on Genetic Algorithms: July 28-31, 1987 at the Massachusetts Institute of Technology, Cambridge, MA, USA, 1987. View at Google Scholar
  28. G. Reinelt, http://www.iwr.uni-heidelberg.de/group/comopt/software.