Travelling salesman problem with Genetic algorithm

Versione 1.0.0.0 (104 KB) da Maxim Vedenyov
GUI and no GUI versions, with description in docx file
4.7
(7)
6,4K download
Aggiornato 15 giu 2011

Visualizza la licenza

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

Cita come

Maxim Vedenyov (2024). Travelling salesman problem with Genetic algorithm (https://www.mathworks.com/matlabcentral/fileexchange/31818-travelling-salesman-problem-with-genetic-algorithm), MATLAB Central File Exchange. Recuperato .

Compatibilità della release di MATLAB
Creato con R2010a
Compatibile con qualsiasi release
Compatibilità della piattaforma
Windows macOS Linux
Riconoscimenti

Ispirato: Genetic Algorithm for n-queen problem

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

no_gui_version/

Versione Pubblicato Note della release
1.0.0.0