📞 +91-7667918914 | ✉️ ijarcce@gmail.com
IJARCCE Logo
International Journal of Advanced Research in Computer and Communication Engineering A monthly Peer-reviewed & Refereed journal
ISSN Online 2278-1021ISSN Print 2319-5940Since 2012
IJARCCE adheres to the suggestive parameters outlined by the University Grants Commission (UGC) for peer-reviewed journals, upholding high standards of research quality, ethical publishing, and academic excellence.
← Back to VOLUME 5, ISSUE 6, JUNE 2016

Review Paper on Solving the Travelling Salesman Problem Using Genetic Algorithm, Ant Colony Optimization, Artificial Neural Network

Dipta Das Chowdhary, Rahul Jain, Prof (Dr.) Anindya Jyoti Pal

DOI: 10.17148/IJARCCE.2016.5618

Abstract: The Traveling Salesman problem is one of the very important problems in Computer Science and Operations Research. It is used to find the minimum cost of doing a work while covering the entire area or scope of the work in concern. In this paper we will review the past work done in solving the travelling salesman problem using three different techniques- genetic algorithm, ant colony optimization and artificial neural network



Keywords: Travelling Salesman Problem, Genetic Algorithm, Artificial Neural Network, Ant Colony Optimization.

How to Cite:

[1] Dipta Das Chowdhary, Rahul Jain, Prof (Dr.) Anindya Jyoti Pal, “Review Paper on Solving the Travelling Salesman Problem Using Genetic Algorithm, Ant Colony Optimization, Artificial Neural Network,” International Journal of Advanced Research in Computer and Communication Engineering (IJARCCE), DOI: 10.17148/IJARCCE.2016.5618