Travelling salesman problem with Genetic algorithm
GUI and no GUI versions, with description in docx file
You are now following this Submission
- You will see updates in your followed content feed
- You may receive emails, depending on your communication preferences
http://simulations.narod.ru/
There is a set of cities (points) in 2d plane. Each city has road to each city. We need to find loop-path that will be in each city only one time and path length is minimal. There are lot of paths with different lengths. A path can have crossover with another path and mutate. See description.docx . Run tsp_ga_gui.m To run no GUI version run tsp_ga.m in subflder no_gui_version
Cite As
Maxim Vedenyov (2026). Travelling salesman problem with Genetic algorithm (https://www.mathworks.com/matlabcentral/fileexchange/31818-travelling-salesman-problem-with-genetic-algorithm), MATLAB Central File Exchange. Retrieved .
Acknowledgements
Inspired: Genetic Algorithm for n-queen problem
General Information
- Version 1.0.0.0 (104 KB)
MATLAB Release Compatibility
- Compatible with any release
Platform Compatibility
- Windows
- macOS
- Linux
| Version | Published | Release Notes | Action |
|---|---|---|---|
| 1.0.0.0 |
