GA0-1beibao.zip_01背包_01背包问题_背包 遗传_背包问题代码_遗传背包问题

function [ ] = test( ) %UNTITLED3 Summary of this function goes here % Detailed explanation goes here global pop_size; global chormo_size; global pop; global fitness_value; global pop_table; global pop_new; global cross_rate; global variation_rate; global n; global fitness_ave; global generation_size; global best_fitness; global best_choice; global last_best; global S; global C; global x_value; %clear last_best; clear best_fitness; clear fitness_ave; clear n; cross_rate=1; variation_rate=0.2; best_choice=1; generation_size=200; n=1; pop_size=40; chormo_size=20; C=1882.6; S=[255 234 199 182 180 169 144 111 105 88 77 68 58 55 49 37 26 22 19 11]; population_init(); fitness(); rank(); %pop best_fitness(n)=fitness_value(pop_size); %best_fitness fitness_ave(n)=pop_table(pop_size)/pop_size; for i=1:generation_size selection(); %pop_new crossover(); %pop_new variation(); pop=pop_new; n=n+1; fitness(); rank(); %pop best_fitness(n)=fitness_value(pop_size); %if best_fitness(n)==last_best % s=s+1; %else % s=0; %end fitness_ave(n)=pop_table(pop_size)/pop_size; last_best=best_fitness(n); %if s==30 % break; %end end best_fitness disp 最优取值; pop(pop_size,:) x=1:1:(generation_size+1); y=fitness_ave; z=best_fitness; %plot(x,y,'r'); %hold on; %plot(x,1); %hold on; %plot(x,0); %hold on; plot(x,z,'k'); end