Travelling-Salesman-Problem-Solved-by-Genetic-Algorithm
This project used Genetic Algorithm for solving TSP and uses Processing Language and p5.js for animation
Travelling salesman problem
The travelling salesman problem (also called the travelling salesperson problem or 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?” It is an NP-hard problem in combinatorial optimization, important in operations research and theoretical computer science.
The travelling purchaser problem and the vehicle routing problem are both generalizations of TSP.
Suggestions:
Use the following website to run the code(if unable to get it done on the Processing Desktop App): https://www.openprocessing.org/sketch/create
Contributing
Pull requests are welcome. For major changes, please open an issue first to discuss what you would like to change.
License
Acknowledgements
HUGE HUGE THANKS TO THE CODING TRAIN(Daniel Shiffman)FOR TEACHING ME ABOUT GENETIC ALGORITHM AND TSP!!!