A COMPARATIVE STUDY OF VARIOUS METHODS OF ANN FOR SOLVING TSP PROBLEM

Authors

  • Sharadindu Roy Calcutta university
  • Prof Samer Sen Sarma University of Calcutta
  • Soumyadip chakravorty University of Calcutta
  • Suvodip Maity University of Calcutta

DOI:

https://doi.org/10.24297/ijct.v4i1a.3029

Keywords:

TSP, Travelling Salesman Problem, ANN, Artificial Neural Network, HN, Hopfield Network, EN, Elastic Net, SRN, Simultaneous Recurrent Network

Abstract

Abstract

This paper represents TSP (Travelling Salesman Problem) by using Artificial Neural Networks.A comparative study of various methods of ANN is shown here for solving TSP problem.The Travelling Salesman Problem is a classical combinational optimization problem, which is a simple to state but very difficult to solve. This problem is to find the shortest possible tour through a set of N vertices so that each vertex is visited exactly once. TSP can be solved by Hopfield Network, Self-organization Map, and Simultaneous Recurrent Network. Hopfield net is a fully connected network, where every vertex is connected with each other forwardly and backwardly. So starting the walk from a vertex we can travel all the other vertex exactly once and return to starting vertex again.

Downloads

Download data is not yet available.

Author Biographies

Sharadindu Roy, Calcutta university

Asst. Professor, Computer science

Prof Samer Sen Sarma, University of Calcutta

Computer science

Soumyadip chakravorty, University of Calcutta

Computer science

Suvodip Maity, University of Calcutta

Computer science

Downloads

Published

2013-02-01

How to Cite

Roy, S., Sen Sarma, P. S., chakravorty, S., & Maity, S. (2013). A COMPARATIVE STUDY OF VARIOUS METHODS OF ANN FOR SOLVING TSP PROBLEM. INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY, 4(1), 19-28. https://doi.org/10.24297/ijct.v4i1a.3029

Issue

Section

Research Articles