3.8. 旅行销售员(TSP - traveling Salesman 问题)
考虑到城市列表,请找到获得每个城市完全访问的销售人员的最短产品。
这个问题由 Wikipedia 定义。它是计算数学 中最广泛的问题之一。然而,在现实世界中,它通常只是规划问题的一部分,以及其他限制,如员工的转变限制。
问题大小
dj38 has 38 cities with a search space of 10^43. europe40 has 40 cities with a search space of 10^46. st70 has 70 cities with a search space of 10^98. pcb442 has 442 cities with a search space of 10^976. lu980 has 980 cities with a search space of 10^2504.
dj38 has 38 cities with a search space of 10^43.
europe40 has 40 cities with a search space of 10^46.
st70 has 70 cities with a search space of 10^98.
pcb442 has 442 cities with a search space of 10^976.
lu980 has 980 cities with a search space of 10^2504.
问题困难
尽管 TSP 的简单定义,但问题很难解决。因为它是一个 NP-hard 问题(如大多数规划问题),所以当问题数据集略有变化时,特定问题数据集的最佳解决方案可能会有较大变化: