An Approach to Find the Solution of Assignment Problem

Abstract

In this paper we introduce an approach to give a solution for travelling salesman problem(Assignment problem). We consider a salesman problem if he wants to visit a certain number of cities allotted to work. He knows the distance (or cost or time) of journey between every pair of cities, usually denoted by $c_{ij}$, i.e., from city $i$ to city $j$. His problem is to select such a route that starts from his home city, passes through each city once and only once, and returns to his home city in the shortest possible distance and its goal would be to minimize the total distance traveled so that the cost or time will be optimal.