Skip to main navigation menu Skip to main content Skip to site footer

Vol. 9 No. 1.3 (2020)
Scholar : National School of Leadership

Research Articles

TRAVELLING SALESMAN PROBLEM

Published 2020-04-25

  • RAMYA R

RAMYA R
Dhanalakshmi Srinivasan College of Arts & Science for Women (Autonomous), Perambalur, Tamil Nadu, India

Abstract

Travelling salesman problem can be modeled as graph where as the cities are the graph vertices, path is graph edges and path distance is edge distance. Our goal is to seek out the shortest tour that visits each city during a given graph exactly ones then return to the starting city

Article Full Text