Travelling salesman problem with Genetic algorithm
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
引用
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. 取得済み .
MATLAB リリースの互換性
プラットフォームの互換性
Windows macOS Linuxカテゴリ
- Mathematics and Optimization > Global Optimization Toolbox > Genetic Algorithm >
- AI, Data Science, and Statistics > Statistics and Machine Learning Toolbox > Cluster Analysis and Anomaly Detection > Nearest Neighbors >
- MATLAB > Mathematics > Graph and Network Algorithms > Shortest Path > Traveling Salesman (TSP) >
- Mathematics and Optimization > Optimization Toolbox > Linear Programming and Mixed-Integer Linear Programming > Solver-Based Linear Programming >
タグ
謝辞
ヒントを与えたファイル: 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/
バージョン | 公開済み | リリース ノート | |
---|---|---|---|
1.0.0.0 |