代码搜索：种群进化
找到约 1,664 项符合「种群进化」的源代码
代码结果 1,664
www.eeworm.com/read/180494/9305206
m normgeomselect.m
function[newPop] = normGeomSelect(oldPop,options)
q=options(2); % 选择最优的概率
e = size(oldPop,2); % xZome的长度, 即：numvars+fit
n = size(oldPop,1); % 种群中个体数目
newPop = zeros(n,e); % 为返回pop分配内存空间
www.eeworm.com/read/380669/6966861
m keepbest.m
%保优函数
%==================================
%第一种群保优
min_dis=min(adapt_A(:));
if min_dis
www.eeworm.com/read/464287/7166749
m c68.m
function [ObjVal,t,x] = objdopi(Chrom,sswitch);
% Chrom-当代种群的染色体
% sswitch-选择变量
% 目标函数维数
Dim = 20;
TSTART = 0;
TEND = 1;
STEPSIMU = min(0.1,abs((TEND-TSTART)/(Dim-1)));
TIMEVEC = linspace(TS
www.eeworm.com/read/460021/7258670
m example5_37.m
function [ObjVal,t,x] = objdopi(Chrom,sswitch);
% Chrom-当代种群的染色体
% sswitch-选择变量
% 目标函数维数
Dim = 20;
TSTART = 0;
TEND = 1;
STEPSIMU = min(0.1,abs((TEND-TSTART)/(Dim-1)));
TIMEVEC = linspace(TS
www.eeworm.com/read/460021/7258717
m normgeomselect.m
function[newPop] = normGeomSelect(oldPop,options)
q=options(2); % 选择最优的概率
e = size(oldPop,2); % xZome的长度, 即：numvars+fit
n = size(oldPop,1); % 种群中个体数目
newPop = zeros(n,e); % 为返回pop分配内存空间
www.eeworm.com/read/198334/7940055
m keepbest.m
%保优函数
%==================================
%第一种群保优
min_dis=min(adapt_A(:));
if min_dis
www.eeworm.com/read/240067/13238250
txt tsp.txt
求解tsp问题的遗传算法
function [bestpop,trace]=ga(D,termOps,num,pc,cxOps,pm,alpha)
%
%????????????????????????
%[bestpop,trace]=ga(D,termOps,num,pc,cxOps,pm,alpha)
%D:距离矩阵
%termOps:种群带数
%num:每带染色体的个数
%
www.eeworm.com/read/405263/11467263
m normgeomselect.m
function[newPop] = normGeomSelect(oldPop,options)
q=options(2); % 选择最优的概率
e = size(oldPop,2); % xZome的长度, 即：numvars+fit
n = size(oldPop,1); % 种群中个体数目
newPop = zeros(n,e); % 为返回pop分配内存空间
www.eeworm.com/read/405263/11467312
m example5_37.m
function [ObjVal,t,x] = objdopi(Chrom,sswitch);
% Chrom-当代种群的染色体
% sswitch-选择变量
% 目标函数维数
Dim = 20;
TSTART = 0;
TEND = 1;
STEPSIMU = min(0.1,abs((TEND-TSTART)/(Dim-1)));
TIMEVEC = linspace(TS
www.eeworm.com/read/405125/11471123
m initpop.m
%初始化种群，采用二进制编码
function [pop]=initpop(popsize,bits)
len=sum(bits);
pop(1,:)=zeros(1,len);%The whole zero encoding
for i=2:popsize-1
pop(i,:)=round(rand(1,len));
end
pop(popsize,:)=ones(1,len);%