Travelling salesman problem with Genetic algorithm

GUI and no GUI versions, with description in docx file

版本 1.0.0.0 (104.1 KB)
6.5K 次下载
(7)
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://ww2.mathworks.cn/matlabcentral/fileexchange/31818-travelling-salesman-problem-with-genetic-algorithm), MATLAB Central File Exchange. 检索时间: .

类别

在 Help Center 和 MATLAB Answers 中查找有关 Nearest Neighbors 的更多信息

一般信息

MATLAB 版本兼容性

  • 兼容任何版本

平台兼容性

  • Windows
  • macOS
  • Linux
在新标签页中打开
版本 已发布 发行说明
1.0.0.0