5-2布谷鸟算法(CS)代码

代码利用Python3实现。

# -*- coding: utf-8 -*-
from random import uniform
from random import randint
import math

inputMatrix = [[0 , 29 , 20 , 21 , 16 , 31 , 100 ,12 , 4  , 31 , 18],
[29 , 0  , 15 , 29 , 28 , 40 , 72 , 21 , 29 , 41 , 12],
[20 , 15 , 0  , 15 , 14 , 25 , 81 , 9  , 23 , 27 , 13],
[21 , 29 , 15 , 0  , 4 ,  12 , 92 , 12 , 25 , 13 , 25],
[16 , 28 , 14 , 4  , 0 ,  16 , 94 , 9  , 20 , 16 , 22],
[31 , 40 , 25 , 12 , 16 , 0 ,  95 , 24 , 36 , 3 ,  37],
[100 ,72 , 81 , 92 , 94 , 95 , 0 ,  90 , 101 ,99 , 84],
[12 , 21 , 9 ,  12 , 9  , 24 , 90 , 0  , 15 , 25 , 13],
[4  , 29 , 23 , 25 , 20 , 36 , 101 ,15 , 0 ,  35,  18],
[31 , 41 , 27 , 13 , 16 , 3 ,  99,  25,  35,  0 ,  38],
[18 , 12 , 13 , 25 , 22 , 37  ,84 , 13 , 18 , 38 , 0]]

distanceMatrix = inputMatrix

# levy飞行
def levyFlight(u):
	return math.pow(u,-1.0/3.0)

def randF():
	return uniform(0.0001,0.9999)

# 计算距离
def calculateDistance(path):
        index = path[0]
        distance = 0
        for nextIndex in path[1:]:
                distance += distanceMatrix[index][nextIndex]
                index = nextIndex
        return distance+distanceMatrix[path[-1]][path[0]];

点击查看完整代码