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 (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 릴리스 호환 정보
개발 환경: R2010a
모든 릴리스와 호환
플랫폼 호환성
Windows macOS Linux

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