Close
0%
0%

Travelling salesman problem - TSP

Trying to solve the problem in amateur way

Similar projects worth following
51 views
0 followers
  • Description
  • Details
  • Files 0
  • Components 0
  • Logs 0
  • Instructions 0
  • Discussion 0
The travelling salesman problem (TSP) asks the following question: "Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city and returns to the origin city?

The TSP has several applications even in its purest formulation, such as planning, logistics, and the manufacture of microchips.

I have tried to solve the problem in my understanding, and I hope to have a new way to solve this problem.

Enjoy this project?

Share

Discussions

Similar Projects

Does this project spark your interest?

Become a member to follow this project and never miss any updates