@article{Roy_Sen Sarma_chakravorty_Maity_2013, title={A COMPARATIVE STUDY OF VARIOUS METHODS OF ANN FOR SOLVING TSP PROBLEM}, volume={4}, url={https://rajpub.com/index.php/ijct/article/view/311}, DOI={10.24297/ijct.v4i1a.3029}, abstractNote={<p class="MsoNormal" style="margin-bottom: .0001pt; line-height: normal; mso-layout-grid-align: none; text-autospace: none;"><strong style="mso-bidi-font-weight: normal;"><span style="font-size: 14.0pt; font-family: Algerian; mso-bidi-font-family: "Times New Roman";">Abstract</span></strong></p> <p class="MsoNormal" style="margin-bottom: .0001pt; text-align: center; line-height: normal; mso-layout-grid-align: none; text-autospace: none;"><strong style="mso-bidi-font-weight: normal;"><span style="font-size: 1.0pt; font-family: "Times New Roman","serif";"> </span></strong></p> <p class="MsoNormal" style="margin-bottom: .0001pt; text-align: justify; text-justify: inter-ideograph; line-height: normal; mso-layout-grid-align: none; text-autospace: none;"><span style="font-family: "Times New Roman","serif";"><span style="mso-spacerun: yes;"> </span>This paper represents TSP (Travelling Salesman Problem) by using Artificial Neural Networks.</span>A comparative study of various methods of ANN is shown here for solving TSP problem.<span style="font-family: "Times New Roman","serif";">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<span style="mso-spacerun: yes;"> </span>and return to starting vertex again.<span style="mso-spacerun: yes;"> </span></span></p>}, number={1}, journal={INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY}, author={Roy, Sharadindu and Sen Sarma, Prof Samer and chakravorty, Soumyadip and Maity, Suvodip}, year={2013}, month={Feb.}, pages={19–28} }