nefu最优化理论实验四

import numpy as np

import matplotlib.pyplot as plt



def fitness_func(X):

    # 目标函数，即适应度值，X是种群的表现型

    a = 10

    pi = np.pi

    x = X[:, 0]

    y = X[:, 1]

    return 2 * a + x ** 2 - a * np.cos(2 * pi * x) + y ** 2 - a * np.cos(2 * np.pi * y)





def decode(x, a, b):

    """解码，即基因型到表现型"""

    xt = 0

    for i in range(len(x)):

        xt = xt + x[i] * np.power(2, i)

    return a + xt * (b - a) / (np.power(2, len(x)) - 1)



def decode_X(X: np.array):



    X2 = np.zeros((X.shape[0], 2))

    for i in range(X.shape[0]):

        xi = decode(X[i, :20], -5, 5)

        yi = decode(X[i, 20:], -5, 5)

        X2[i, :] = np.array([xi, yi])

    return X2



def select(X, fitness):



    fitness = 1 / fitness  # fitness越小表示越优秀，被选中的概率越大，做 1/fitness 处理

    fitness = fitness / fitness.sum()  # 归一化

    idx = np.array(list(range(X.shape[0])))

    X2_idx = np.random.choice(idx, size=X.shape[0], p=fitness)  # 根据概率选择

    X2 = X[X2_idx, :]

    return X2



def crossover(X, c):



    for i in range(0, X.shape[0], 2):

        xa = X[i, :]

        xb = X[i + 1, :]

        for j in range(X.shape[1]):

            # 产生0-1区间的均匀分布随机数，判断是否需要进行交叉替换

            if np.random.rand() <= c:

                xa[j], xb[j] = xb[j], xa[j]

        X[i, :] = xa

        X[i + 1, :] = xb

    return X



def mutation(X, m):

    """变异操作"""

    for i in range(X.shape[0]):

        for j in range(X.shape[1]):

            if np.random.rand() <= m:

                X[i, j] = (X[i, j] + 1) % 2

    return X



def ga():

    """遗传算法主函数"""

    c = 0.3  # 交叉概率

    m = 0.05  # 变异概率

    best_fitness = []  # 记录每次迭代的效果

    best_xy = []

    iter_num = 100  # 最大迭代次数

    X0 = np.random.randint(0, 2, (50, 40))  # 随机初始化种群

    for i in range(iter_num):

        X1 = decode_X(X0)  # 染色体解码

        fitness = fitness_func(X1)  # 计算个体适应度

        X2 = select(X0, fitness)  # 选择操作

        X3 = crossover(X2, c)  # 交叉操作

        X4 = mutation(X3, m)  # 变异操作

        # 计算一轮迭代的效果

        X5 = decode_X(X4)

        fitness = fitness_func(X5)

        best_fitness.append(fitness.min())

        x, y = X5[fitness.argmin()]

        best_xy.append((x, y))

        X0 = X4

        



    best_idx = np.argmin(best_fitness)

    best_f = best_fitness[best_idx]

    best_x, best_y = best_xy[best_idx]

  



    return best_fitness, (best_x, best_y)



best_fitness, best_xy = ga()



print("Best Fitness Value:", best_fitness)

print("Best Solution (x, y):", best_xy)

x = [i for i in range(len(best_fitness))]

plt.plot(x,best_fitness)

plt.xlabel("Iteration")

plt.ylabel("Fitness Value")

plt.title("Fitness Value Evolution")

plt.show()