风险的论文用到matlab,跪求大神解决 急急急 论文需要用到的程序

function varargout = tsp_ga(xy,dmat,pop_size,num_iter,show_prog,show_res)

%TSP_GA Traveling Salesman Problem (TSP) Genetic Algorithm (GA)

clc%清屏

clear all                              %删除workspace变量

close all                              %关掉显示图形窗口

n=50;                                  %城市的数量

xy=10*rand(n,2);                       %城市的位置坐标

popSize=60;                            %种群的大小，一般被4整除

numIter=1e4;                           %算法迭代的次数

showProg=1;                            %如果满足条件，执行遗传算法的步骤

showResult=1;                          %如果满足条件，执行遗传算法的结果

a=meshgrid(1:n);

dmat=reshape(sqrt(sum((xy(a,:)-xy(a',:)).^2, 2)),n,n);    %城市之间的距离/成本

[optRoute,minDist]=tsp_ga(xy,dmat,popSize,numIter,showProg,showResult);

%%Output

%optRoute  遗传算法得出的最优路径

%minDist    最优路径下的成本值或距离值

%%

figure,

for i=1:n

hold on

plot(xy(:, 1), xy(:, 2), 'k');

text(xy(i, 1), xy(i, 2)+0.08, num2str(i));

end

for i=1;n-1

plot([xy(optRoute(1,i), 1),xy(optRoute(1,i+1),1)],[xy(optRoute(1,i),2),xy(optRoute(1,i+1),2)])

hold on

end

for i=n

plot([xy(optRoute(1,i), 1),xy(optRoute(1,1),1)],[xy(optRoute(1,i),2),xy(optRoute(1,1),2)])

hold on

end

function varargout=tsp_ga(xy, dmat, popSize, numIter, showProg, showResult)

%Process Inputs and Initialize Defaults

nargs=6;

for k=nargin:nargs-1

switch k

case 0

xy=10*rand(50,2);

case 1

N=size(xy,1);

a=meshgrid(1:N);

dmat=reshape(sqrt(sum((xy(a,:)-xy(a',:)).^2, 2)),N, N);  %矩阵维数变换

case 2

popSize=100;

case 3

numIter=1e4;

case 4

showProg=1;

case 5

showResult=1;

otherwise

end

end

%Verify Inputs

[N,dims]=size(xy);

[nr,nc]=size(dmat);

if N~=nr||N~=nc

error('Invalid XY or DMAT inputs!')

end

n=N;

%Sanity=Checks

popSize=4*ceil(popSize/4);

numIter=max(1, round(real(numIter(1))));

showProg=logical(showProg(1));

showResult=logical(showResult(1));

%Initialize the Population 初始化种群

pop=zeros(popSize, n);

pop(1, :)=(1:n);

for K=1:popSize

pop(k,:)=randperm(n);

end

%Run the GA

globalMin=Inf;

totalDist=zeros(1,popSize);

distHistory=zeros(1,numIter);

tmpPop=zeros(4, n);

newPop=zeros(popSize, n);

if showProg

pfig=figure('Name','TSP_GA|Current Best Solution','Numbertitle','off');

end

for iter=1:numIter                             %迭代次数

% Evaluate Each Population Member (Calculate Total Distance)

for p=1:popSize

d=dmat(pop(p, n), pop(p, 1));                %Closed Path选择算子

for k=2:n

d=d+dmat(pop(p,k-1), pop(p, k));      %交叉算子、变异算子

end

totalDist(p)=d;                           %计算适应度

end

%找到最小和最大适应度的染色体及它们在种群中的位置

%Find the Best Route in the Population

[minDist,index]=min(totalDist);

distHistory(iter)=minDist

% 代替上一次进化中的最好的染色体

if minDist

globalMin=minDist

optRoute=pop(index, :);

if showProg

% Plot the Best Route

figure(pfig);

rte=optRoute([1:n 1]);

if dims==3,

plot3(xy(rte, 1), xy(rte, 2), xy(rte, 3), 'r.-');

else

plot(xy(rte, 1), xy(rte, 2),'r.-');

end

title(sprintf('Total Distance=%1.4f,  Iteration=%d',minDist,iter));

end

end

%Genetic Algorithm Operators

randomOrder=randperm(popSize);

for p=4:4popSize

rtes=pop(randomOrder(p-3:p),:);

dists=totalDist(randomOrder(p-3:p));

[ignore,idx]=min(dists);                        %#ok

bestOf4Route=rtes(idx,:);

routeInsertionPoints=sort(ceil(n*rand(1,2)));

I=routeInsertionPoints(1);

J=routeInsertionPoints(2);

for k=1:4 %Mutate the Best to get Three New Routes

tmpPop(K,:)=bestOf4Route;

switch k

case 2 % Flip

tmpPop(k, I:J)=tmpPop(k,J:-1:I);

case 3 % Swap

tmpPop(k, [IJ])=tmpPop(k,[J I]);

case 4 % Slide

tmpPop(k, I:J)=tmpPop(k,[I+1:J I]);

otherwise % Do Nothing

end

end

newPop(p-3:p,:)=tmpPop;

end

pop=newPop;

end

%画图

if showResult

%Plots the GA Results

figure('Name', 'TSP_GA|Results', 'Numbertitle','off');

%subplot(2,2,1);

figure(1);

pclr=~get(0,'DefaultAxesColor');

if dims==3,

plot3(xy(:,1), xy(:,2), xy(:,3),'.','Color',pclr);

else

plot(xy(:,1), xy(:,2),'.','Color',pclr);

end

title('城市位置');

grid on

%          subplot(2,2,2);

figure(2),

imagesc(dmat(optRoute,optRoute));

title('距离矩阵-imagesc');

%         subplot(2,2,3);

figure(3),

rte=optRoute([1:n 1]);

if dims>2,  plot3(xy(rte,1), xy(rte,2), xy(rte,3),'r.-');

else

plot(xy(rte,1), xy (rte, 2), 'r.-');

end

title(sprintf('最短距离 = %1.4f',minDist));

grid on

%      subplot(2,2,4);

figure(4),

plot(distHistory, 'b', 'LineWidth', 2);

title('最佳适应度曲线');

grid on

set(gca, 'XLim', [0 numIter+1], 'YLim',[0 1.1*max([1 distHistory])]);

end

%Return Outputs

if nargout

varargout{1}=optRoute;

varargout{2}=minDist;

end

遗传算法解决旅行商问题跪求

运行后一直出现带有下标的赋值维度不匹配。

出错 tsp_ga (line 40)

pop(k,:)=randperm(n);

出错 suiji (line 16)

[optRoute,minDist]=tsp_ga(xy,dmat,popSize,numIter,showProg,showResult);