The Travelling Salesman Problem (TSP) is the challenge of finding the shortest yet most efficient route for a person to take given a list of specific destinations. It is a well-known algorithmic problem in the fields of computer science and operations research. - The wiki
This project with use an approximation algorithm to solve TSP on Peru with a visual map.
Despite the complexity of solving the Travelling Salesman Problem, it still finds applications in all verticals.
- Last mile delivery
In the project directory, you can run:
Runs the app in the development mode.
Open http://localhost:3000 to view it in the browser.
The page will reload if you make edits.
You will also see any lint errors in the console.
- Antonio Toche