Travelling Salesman Problem Using Hamiltonian Circuit

Progress Report

Presented By:
Dhanjit kalita (CSI22012)
Gopal (CSE22015 )
Contact No:7578839598
CONTENT:

● Introduction
● Literature Review
● Objective
● Methodology
● Future work
● References
Introduction
It was first considered mathematically in the 1930s by Merrill M. Flood who was looking to solve a school bus
routing problem. Hassler Whitney at Princeton University generated interest in the problem, which he called
the "48 states problem". The earliest publication using the phrase "travelling salesman problem" was the 1949
RAND Corporation report by Julia Robinson, "On the Hamiltonian game (a traveling salesman problem).

TSP can be modelled as an undirected weighted graph, such that cities are the graph's vertices, paths are the
graph's edges, and a path's distance is the edge's weight. It is a minimization problem starting and finishing at
a specified vertex after having visited each other vertex exactly once. Often, the model is a complete graph
(i.e., each pair of vertices is connected by an edge). If no path exists between two cities, adding a sufficiently
long edge will complete the graph without affecting the optimal tour.
Literature Review

This review discusses given a set of cities that is marked as a vertices and the distance
between every pair of cities considering some distance, the problem is to find the shortest
possible route . The exposition attempts to highlight a comparative evaluation of various
techniques and their scopes of TSP.
Objective

Travelling Salesman Problem (TSP):

Given a set of cities and the distance between every pair of cities, the problem is to find the
shortest possible route that visits every city exactly once and returns to the starting point.
Note the difference between Hamiltonian Cycle and TSP. The Hamiltonian cycle problem is
to find if there exists a tour that visits every city exactly once. Here we know that Hamiltonian
Tour exists (because the graph is complete) and in fact, many such tours exist, the problem
is to find a minimum weight Hamiltonian Cycle.
Methodology

In Java, Travelling Salesman Problem is a problem in which we need to find the shortest route that covers each city exactly once and
returns to the starting point. Hamiltonian Cycle is another problem in Java that is mostly similar to Travelling Salesman Problem.

Steps to implement Travelling Salesman Problem

These are the following steps, which we use to implement the TSP program in Java:

1. We consider a city as the starting and ending point. We can use any city as a starting point because the route is cyclic.
2. In the DFS way, we start traversing from the source to its adjacent nodes.
3. Find the cost of each traversal and keep track of minimum cost and keep on updating the value of minimum cost stored value.
4. In the end, return the permutation with minimum cost.
Future work

Many different adaptations, tests, and experiments have been left for the future
due to lack of time (i.e. the experiments with real data are usually very time
consuming, requiring even days to finish a single run). Future work concerns
deeper analysis of particular mechanisms, new proposals to try different methods,
or simply curiosity.

So we are going to creating sample of .txt data forms for manual dynamic
programming for our project.
References
● https://www.geeksforgeeks.org
● https://link.springer.com/
● https://www.intechopen.com/