以下是一个使用Python实现遗传算法求解演化计算基准函数（以Rastrigin函数为例）极小值的代码示例： ```python import numpy as np import random # 定义Rastrigin函数 def rastrigin(x): A = 10 n = len(x) return A * n + np.sum(x**2 - A * np.cos(2 * np.pi * x)) # 初始化种群 def initialize_population(pop_size, dim, min_val, max_val): return np.random.uniform(min_val, max_val, (pop_size, dim)) # 计算适应度 def fitness(population): return np.array([rastrigin(ind) for ind in population]) # 选择操作（锦标赛选择） def tournament_selection(population, fitness_values, tournament_size): selected = [] for _ in range(len(population)): tournament = random.sample(range(len(population)), tournament_size) winner = tournament[np.argmin([fitness_values[i] for i in tournament])] selected.append(population[winner]) return np.array(selected) # 交叉操作（单点交叉） def crossover(parent1, parent2): crossover_point = random.randint(1, len(parent1) - 1) child1 = np.concatenate((parent1[:crossover_point], parent2[crossover_point:])) child2 = np.concatenate((parent2[:crossover_point], parent1[crossover_point:])) return child1, child2 # 变异操作（高斯变异） def mutate(individual, mutation_rate, mutation_std): for i in range(len(individual)): if random.random() < mutation_rate: individual[i] += np.random.normal(0, mutation_std) return individual # 遗传算法主函数 def genetic_algorithm(pop_size, dim, min_val, max_val, generations, tournament_size, mutation_rate, mutation_std): population = initialize_population(pop_size, dim, min_val, max_val) for _ in range(generations): fitness_values = fitness(population) selected = tournament_selection(population, fitness_values, tournament_size) new_population = [] for i in range(0, pop_size, 2): parent1 = selected[i] parent2 = selected[i + 1] child1, child2 = crossover(parent1, parent2) child1 = mutate(child1, mutation_rate, mutation_std) child2 = mutate(child2, mutation_rate, mutation_std) new_population.extend([child1, child2]) population = np.array(new_population) final_fitness = fitness(population) best_index = np.argmin(final_fitness) best_solution = population[best_index] best_fitness = final_fitness[best_index] return best_solution, best_fitness # 参数设置 pop_size = 100 dim = 2 min_val = -5.12 max_val = 5.12 generations = 200 tournament_size = 3 mutation_rate = 0.1 mutation_std = 0.1 # 运行遗传算法 best_solution, best_fitness = genetic_algorithm(pop_size, dim, min_val, max_val, generations, tournament_size, mutation_rate, mutation_std) print(f"最优解: {best_solution}") print(f"最优适应度: {best_fitness}") ``` ### 代码说明： 1. **函数定义**：定义了Rastrigin函数作为演化计算基准函数，用于计算个体的适应度。 2. **初始化种群**：使用`initialize_population`函数随机生成初始种群。 3. **适应度计算**：通过`fitness`函数计算每个个体的适应度值。 4. **选择操作**：采用锦标赛选择方法，从种群中选择适应度较好的个体。 5. **交叉操作**：使用单点交叉方法生成新的个体。 6. **变异操作**：通过高斯变异对个体进行变异。 7. **遗传算法主函数**：在指定的代数内不断进行选择、交叉和变异操作，最终得到最优解。 ###