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 exactly once and returns to the origin city?" It is an NP-hard problem in combinatorial optimization, important in theoretical computer science and operations research.
-
Notifications
You must be signed in to change notification settings - Fork 0
miladpayandehh/TSP-using-Genetic-Algorithm
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Travelling Salesman Problem (TSP)
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published