资源列表
排序选择:
[matlab例程] Traveling-salesman
说明:旅行商问题:全国省会二维坐标如图30所示,基于遗传算法设计从黑龙江到西藏,并遍历全国各省会(每个省会只经过一次)的最短路径-Traveling salesman problem: two-dimensional coordinates of the national capital as shown in Figure 30, based on genetic algorithm design from Heilongjiang to Tibet and traverse the provinc<郑威> 在 2025-09-20 上传 | 大小:3kb | 下载:0