文件名称:chapter4
介绍说明－－下载内容来自于网络，使用问题请自行百度
TSP是典型的NP完全问题，既其最坏情况下的时间复杂度随着问题规模的增大按指数方式增长，到目前为止还未找到一个多项式时间的有效算法。(TSP is a typical NP complete problem, and its worst-case time complexity increases exponentially as the problem size increases. So far, no polynomial time efficient algorithm has been found.)
相关搜索： MATLAB；遗传算法；TSP算法
(系统自动生成,下载前可以参看下载内容)
下载文件列表
chapter4\CityPosition1.mat
chapter4\CityPosition2.mat
chapter4\CityPosition3.mat
chapter4\Distanse.m
chapter4\DrawPath.m
chapter4\dsxy2figxy.m
chapter4\Fitness.m
chapter4\GA_TSP.m
chapter4\InitPop.m
chapter4\Mutate.m
chapter4\OutputPath.m
chapter4\PathLength.m
chapter4\Recombin.m
chapter4\Reins.m
chapter4\Reverse.m
chapter4\Select.m
chapter4\Sus.m
chapter4
chapter4\CityPosition2.mat
chapter4\CityPosition3.mat
chapter4\Distanse.m
chapter4\DrawPath.m
chapter4\dsxy2figxy.m
chapter4\Fitness.m
chapter4\GA_TSP.m
chapter4\InitPop.m
chapter4\Mutate.m
chapter4\OutputPath.m
chapter4\PathLength.m
chapter4\Recombin.m
chapter4\Reins.m
chapter4\Reverse.m
chapter4\Select.m
chapter4\Sus.m
chapter4
本网站为编程资源及源代码搜集、介绍的搜索网站，版权归原作者所有！ 粤ICP备11031372号
1999-2046 搜珍网 All Rights Reserved.