Travelling salesman problem

Question

Accepted Answer

The travelling salesman problem is a classic optimization problem where the goal is to find the shortest possible route that visits a set of given cities and returns to the original city.

The problem involves finding the shortest possible route that visits each city exactly once and returns to the starting city.
It is a NP-hard problem, meaning there is no known efficient algorithm to solve it optimally for large instances.
Various algorithms like brute force, dynamic programming, and heuristics like nearest neighbor and genetic algorithms are used to find approximate solutions.
Applications include route planning, logistics, and network design.
Example: A salesman needs to visit 5 cities and return to the starting city, finding the shortest route is the goal.

Travelling salesman problem

Popular interview questions of Data Analyst