Travelling salesman problem with Genetic algorithm

バージョン 1.0.0.0 (104 KB) 作成者: Maxim Vedenyov
GUI and no GUI versions, with description in docx file
4.7
(7)
ダウンロード: 6.4K
更新 2011/6/15

ライセンスの表示

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 (2026). Travelling salesman problem with Genetic algorithm (https://jp.mathworks.com/matlabcentral/fileexchange/31818-travelling-salesman-problem-with-genetic-algorithm), MATLAB Central File Exchange. 取得日: .

MATLAB リリースの互換性
作成: R2010a
すべてのリリースと互換性あり
プラットフォームの互換性
Windows macOS Linux
タグ タグを追加
謝辞

ヒントを与えたファイル: Genetic Algorithm for n-queen problem

Open in new tab
バージョン 公開済み リリース ノート
1.0.0.0