WHAT IS SALESMAN TRAVERSING PROBLEM

Question

Accepted Answer

Salesman traversing problem refers to finding the shortest route for a salesman to visit a set of locations and return to the starting point.

It is a classic optimization problem in computer science and operations research.
The problem involves determining the optimal order in which to visit a set of locations to minimize the total distance traveled.
The solution requires calculating the distances between all pairs of locations and finding the shortest Hamiltonian cycle.
Various algorithms can be used to solve the problem, such as the brute-force approach, dynamic programming, or the traveling salesman problem heuristic algorithms like nearest neighbor or genetic algorithms.
Example: A salesman needs to visit 5 cities and return to the starting point. The problem is to find the shortest route that covers all cities.

Accepted Answer

Vichle problem and traffic

Top Shriram Finance Management Trainee interview questions & answers