TSP+problem技术资料下载专区，收录670份相关技术文档、开发源码、电路图纸等优质工程师资源，全部免费下载。
旅行商问题（Travelling Salesman Problem, 简记TSP，亦称货郎担问题)：设有n个城市和距离矩阵D=[dij]，其中dij表示城市i到城市j的距离，i，j=1，2 … n，则问题是要找出遍访每个城市恰好一次的一条回...
主要解决旅行商问题(traveling saleman problem,简称tsp，即已知n个城市之间的相互距离，现有一个推销员必须遍访这n个城市，并且每个城市只能访问一次，最后又必须返回出发城市，求解最短距离的遗传算法。
this tar includes my code which employ the Lin-Kernighan algorithm to address the tsp problem. this tar also include som...
Finds a (near) optimal solution to the Traveling Salesman Problem (TSP) by setting up a Genetic Algorithm (GA) to search...
this m file can Find a (near) optimal solution to the Traveling Salesman Problem (TSP) by setting up a Genetic Algorithm...
％this program is written by 刘学智. Finished time is 05.1.23 16:03 ％utilizing it solving TSP problem by simulating steali...
％this program is written by 刘学智. Finished time is 05.1.23 16:03 ％utilizing it solving TSP problem by simulating steali...
％this program is written by 刘学智. Finished time is 05.1.23 16:03 ％utilizing it solving TSP problem by simulating steali...