Search - distance matrix for traveling salesman problem

Search - distance matrix for traveling salesman problem - List

[AI-NN-PR] ant DL : 0: 旅行商问题（Travelling Salesman Problem, 简记TSP，亦称货郎担问题)：设有n个城市和距离矩阵D=[dij]，其中dij表示城市i到城市j的距离，i，j=1，2 … n，则问题是要找出遍访每个城市恰好一次的一条回路并使其路径长度为最短-TSP (Travelling Salesman Problem, abbreviated TSP, also known as the traveling salesman problem): with n cities and the distance matrix D = [dij], where dij that city i to city j the distance, i, j = 1, 2 ... n, then the problem is to find out I visited each city exactly once and make a loop for the shortest path length
Date : 2025-07-16 Size : 6kb User : hepeng
[matlab] Matlab_tsp DL : 0: TSP问题（又名：旅行商问题，货郎担问题）遗传算法通用matlab程序 D是距离矩阵，n为种群个数参数a是中国31个城市的坐标 C为停止代数，遗传到第 C代时程序停止,C的具体取值视问题的规模和耗费的时间而定 m为适应值归一化淘汰加速指数,最好取为1,2,3,4,不宜太大 alpha为淘汰保护指数,可取为0~1之间任意小数,取1时关闭保护功能,建议取0.8~1.0之间的值 R为最短路径,Rlength为路径长度- TSP problem (also known as: traveling salesman problem, traveling salesman problem) genetic algorithm generic matlab program D is the distance matrix, n is the population number of parameters a C coordinates of the 31 cities to stop algebra, genetic to C on behalf of the program stops, the specific values of C depending on the size and time-consuming, m alpha for the fitness value of the normalized phase-out acceleration index, and is best taken as 1, 2, 3, 4, and not too much eliminated the protection index, it is desirable for any decimal between 0 and 1, taking 1:00 off the protective function, it is recommended to take a value between 0.8 to 1.0 R for the shortest path, Rlength for the path length
Date : 2025-07-16 Size : 4kb User : fuhai