Travelling salesman problem with Genetic algorithm

Version 1.0.0.0 (104 KB) by Maxim Vedenyov
GUI and no GUI versions, with description in docx file
4.7
(7)
6.4K Downloads
Updated 15 Jun 2011

View License

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://in.mathworks.com/matlabcentral/fileexchange/31818-travelling-salesman-problem-with-genetic-algorithm), MATLAB Central File Exchange. Retrieved .

MATLAB Release Compatibility
Created with R2010a
Compatible with any release
Platform Compatibility
Windows macOS Linux
Tags Add Tags
Acknowledgements

Inspired: Genetic Algorithm for n-queen problem

no_gui_version/

Version Published Release Notes
1.0.0.0