算法5·贪婪算法（旅行商问题）

最新推荐文章于 2023-03-09 18:38:10 发布

原创

最新推荐文章于 2023-03-09 18:38:10 发布 · 2.2k 阅读

7 ·

CC 4.0 BY-SA版权

文章标签：

#旅行商问题解法

解释:
该算法用于需要计算所有的解，并从中找到最短的那一个
与狄克斯特拉算法不同的是：这里只输入了狄克斯特拉算法里面的cost


# 输入旅行表信息
distance = {
   
   }
distance['ab'] = distance['ba'] = 10
distance['ac'] = distance['ca'] = 12
distance['ad'] = distance['da'] = 16
distance['bc'] = distance['cb'] = 12
distance['bd'] = distance['db'] = 10
distance['cd'] = distance['dc'] = 8


def search2(data, will_del, end, count):

    lowest_distance = 1000
    lowest_distance_name = None

    for i in distance.keys():
        if i[0] == data and i[-1] != will_del:  # 选择出发打头的路线并且剔除返回路线