谁有车间作业调度问题遗传算法的MATLAB源码，要完整的程序哦~_软件运维

function [Zp,Y1p,Y2p,Y3p,Xp,LC1,LC2]=JSPGA(M,N,Pm,T,P)

%--------------------------------------------------------------------------

% JSPGA.m

% 车间作业调度问题遗传算法

%--------------------------------------------------------------------------

% 输入参数列表宴虚

% M 遗传进化迭代次数

% N 种群规模(取偶数)

% Pm 变异概率

% T m×n的慧祥樱矩阵，存储m个工件n个工序的加工时间

% P 1×n的向量，n个工序中，每一个工序所具有的机床数目

% 输出参数列表

% Zp 最优的Makespan值

% Y1p 最优方案中，各工件各工序的开始时刻，可根据它绘出甘特图

% Y2p 最优前丛方案中，各工件各工序的结束时刻，可根据它绘出甘特图

% Y3p 最优方案中，各工件各工序使用的机器编号

% Xp 最优决策变量的值，决策变量是一个实数编码的m×n矩阵

% LC1 收敛曲线1，各代最优个体适应值的记录

% LC2 收敛曲线2，各代群体平均适应值的记录

% 最后，程序还将绘出三副图片：两条收敛曲线图和甘特图（各工件的调度时序图）

%第一步：变量初始化

[m,n]=size(T)%m是总工件数，n是总工序数

Xp=zeros(m,n)%最优决策变量

LC1=zeros(1,M)%收敛曲线1

LC2=zeros(1,N)%收敛曲线2

%第二步：随机产生初始种群

farm=cell(1,N)%采用细胞结构存储种群

for k=1:N

X=zeros(m,n)

for j=1:n

for i=1:m

X(i,j)=1+(P(j)-eps)*rand

end

farm{k}=X

end

counter=0%设置迭代计数器

while counter

%第三步：交叉

newfarm=cell(1,N)%交叉产生的新种群存在其中

Ser=randperm(N)

for i=1:2:(N-1)

A=farm{Ser(i)}%父代个体

B=farm{Ser(i+1)}

Manner=unidrnd(2)%随机选择交叉方式

if Manner==1

cp=unidrnd(m-1)%随机选择交叉点

%双亲双子单点交叉

a=[A(1:cp,:)B((cp+1):m,:)]%子代个体

b=[B(1:cp,:)A((cp+1):m,:)]

else

cp=unidrnd(n-1)%随机选择交叉点

a=[A(:,1:cp),B(:,(cp+1):n)]%双亲双子单点交叉

b=[B(:,1:cp),A(:,(cp+1):n)]

end

newfarm{i}=a%交叉后的子代存入newfarm

newfarm{i+1}=b

end

%新旧种群合并

FARM=[farm,newfarm]

%第四步：选择复制

FITNESS=zeros(1,2*N)

fitness=zeros(1,N)

plotif=0

for i=1:(2*N)

X=FARM{i}

Z=COST(X,T,P,plotif)%调用计算费用的子函数

FITNESS(i)=Z

end

%选择复制采取两两随机配对竞争的方式，具有保留最优个体的能力

Ser=randperm(2*N)

for i=1:N

f1=FITNESS(Ser(2*i-1))

f2=FITNESS(Ser(2*i))

if f1<=f2

farm{i}=FARM{Ser(2*i-1)}

fitness(i)=FITNESS(Ser(2*i-1))

else

farm{i}=FARM{Ser(2*i)}

fitness(i)=FITNESS(Ser(2*i))

end

%记录最佳个体和收敛曲线

minfitness=min(fitness)

meanfitness=mean(fitness)

LC1(counter+1)=minfitness%收敛曲线1，各代最优个体适应值的记录

LC2(counter+1)=meanfitness%收敛曲线2，各代群体平均适应值的记录

pos=find(fitness==minfitness)

Xp=farm{pos(1)}

%第五步：变异

for i=1:N

if Pm>rand%变异概率为Pm

X=farm{i}

I=unidrnd(m)

J=unidrnd(n)

X(I,J)=1+(P(J)-eps)*rand

farm{i}=X

end

farm{pos(1)}=Xp

counter=counter+1

end

%输出结果并绘图

figure(1)

plotif=1

X=Xp

[Zp,Y1p,Y2p,Y3p]=COST(X,T,P,plotif)

figure(2)

plot(LC1)

figure(3)

plot(LC2)

function [path,lmin]=ga(data,d) %data为点集,d为距离矩阵，即赋权图

tic

%======================

sj0=data%开环最短路线

%=================================

% sj0=[datadata(1,:)]%闭环最短路线

%=========================

x=sj0(:,1)y=sj0(:,2)

N=length(x)

%=========================

% d(N,:)=d(1,:)%闭环最短路线

% d(:,N)=d(:,1)%距离矩阵d

%======================

L=N %sj0的长度

w=800dai=1000

%通过改良吵侍旦圈算法选取优良父代A

for k=1:w

c=randperm(L-2)

c1=[1,c+1,L]

flag=1

while flag>0

flag=0

for m=1:L-3

for n=m+2:L-1

if d(c1(m),c1(n))+d(c1(m+1),c1(n+1))<d(c1(m),c1(m+1))+d(c1(n),c1(n+1))

flag=1

c1(m+1:n)=c1(n:-1:m+1)

end

J(k,c1)=1:L

end

J=J/L

J(:,1)=0J(:,L)=1

rand('state',sum(clock))

%遗传算法实现过程

A=J

for k=1:dai %产生0～1 间随机数列进行编码

B=A

c=randperm(w)

%交配产生子代B

for i=1:2:w

F=2+floor(100*rand(1))

temp=B(c(i),F:L)

B(c(i),F:L)=B(c(i+1),F:L)

B(c(i+1),F:L)=temp

end

%变异产生子代谈答C

by=find(rand(1,w)<0.1)

if length(by)==0

by=floor(w*rand(1))+1

end

C=A(by,:)

L3=length(by)

for j=1:L3

<a href="https://www.baidu.com/s?wd=bw&tn=44039180_cpr&fenlei=mv6quAkxTZn0IZRqIHckPjm4nH00T1Y3PvF-rjf1rj6LryD3Pjm30ZwV5Hcvrjm3rH6sPfKWUMw85HfYnjn4nH6sgvPsT6KdThsqpZwYTjCEQLGCpyw9Uz4Bmy-bIi4WUvYETgN-TLwGUv3EnW0dnHmvrHcYnWTYnjn4rHb3Ps" target="_blank" class="baidu-highlight">bw</a>=sort(<a href="https://www.baidu.com/s?wd=bw&tn=44039180_cpr&fenlei=mv6quAkxTZn0IZRqIHckPjm4nH00T1Y3PvF-rjf1rj6LryD3Pjm30ZwV5Hcvrjm3rH6sPfKWUMw85HfYnjn4nH6sgvPsT6KdThsqpZwYTjCEQLGCpyw9Uz4Bmy-bIi4WUvYETgN-TLwGUv3EnW0dnHmvrHcYnWTYnjn4rHb3Ps" target="_blank" class="baidu-highlight">bw</a>)

C(j,:)=C(j,[1:bw(1)-1,bw(2)+1:bw(3),bw(1):bw(2),bw(3)+1:L])

end

G=[ABC]

<a href="https://www.baidu.com/s?wd=TL&tn=44039180_cpr&fenlei=mv6quAkxTZn0IZRqIHckPjm4nH00T1Y3PvF-rjf1rj6LryD3Pjm30ZwV5Hcvrjm3rH6sPfKWUMw85HfYnjn4nH6sgvPsT6KdThsqpZwYTjCEQLGCpyw9Uz4Bmy-bIi4WUvYETgN-TLwGUv3EnW0dnHmvrHcYnWTYnjn4rHb3Ps" target="_blank" class="baidu-highlight">TL</a>=size(G,1)

%在父代和子代中选择优良品种作为新的父代

[<a href="https://www.baidu.com/s?wd=dd&tn=44039180_cpr&fenlei=mv6quAkxTZn0IZRqIHckPjm4nH00T1Y3PvF-rjf1rj6LryD3Pjm30ZwV5Hcvrjm3rH6sPfKWUMw85HfYnjn4nH6sgvPsT6KdThsqpZwYTjCEQLGCpyw9Uz4Bmy-bIi4WUvYETgN-TLwGUv3EnW0dnHmvrHcYnWTYnjn4rHb3Ps" target="_blank" class="baidu-highlight">dd</a>,IX]=sort(G,2)

temp=[]

temp(1:<a href="https://www.baidu.com/s?wd=TL&tn=44039180_cpr&fenlei=mv6quAkxTZn0IZRqIHckPjm4nH00T1Y3PvF-rjf1rj6LryD3Pjm30ZwV5Hcvrjm3rH6sPfKWUMw85HfYnjn4nH6sgvPsT6KdThsqpZwYTjCEQLGCpyw9Uz4Bmy-bIi4WUvYETgN-TLwGUv3EnW0dnHmvrHcYnWTYnjn4rHb3Ps" target="_blank" class="baidu-highlight">TL</a>)=0

for j=1:<a href="https://www.baidu.com/s?wd=TL&tn=44039180_cpr&fenlei=mv6quAkxTZn0IZRqIHckPjm4nH00T1Y3PvF-rjf1rj6LryD3Pjm30ZwV5Hcvrjm3rH6sPfKWUMw85HfYnjn4nH6sgvPsT6KdThsqpZwYTjCEQLGCpyw9Uz4Bmy-bIi4WUvYETgN-TLwGUv3EnW0dnHmvrHcYnWTYnjn4rHb3Ps" target="_blank" class="baidu-highlight">TL</a>

for i=1:L-1

temp(j)=temp(j)+d(IX(j,i),IX(j,i+1))

end

[DZ,IZ]=sort(temp)

A=G(IZ(1:w),:)

end

path=IX(IZ(1),:)

% for i=1:length(path)

% path(i)=path(i)-1

% end

% path=path(2:end-1)

lmin=0l=0

for j=1:(length(path)-1)

<a href="https://www.baidu.com/s?wd=t1&tn=44039180_cpr&fenlei=mv6quAkxTZn0IZRqIHckPjm4nH00T1Y3PvF-rjf1rj6LryD3Pjm30ZwV5Hcvrjm3rH6sPfKWUMw85HfYnjn4nH6sgvPsT6KdThsqpZwYTjCEQLGCpyw9Uz4Bmy-bIi4WUvYETgN-TLwGUv3EnW0dnHmvrHcYnWTYnjn4rHb3Ps" target="_blank" class="baidu-highlight">t1</a>=path(j)t2=path(j+1)

l=d(<a href="https://www.baidu.com/s?wd=t1&tn=44039180_cpr&fenlei=mv6quAkxTZn0IZRqIHckPjm4nH00T1Y3PvF-rjf1rj6LryD3Pjm30ZwV5Hcvrjm3rH6sPfKWUMw85HfYnjn4nH6sgvPsT6KdThsqpZwYTjCEQLGCpyw9Uz4Bmy-bIi4WUvYETgN-TLwGUv3EnW0dnHmvrHcYnWTYnjn4rHb3Ps" target="_blank" class="baidu-highlight">t1</a>,t2)

lmin=lmin+l

end

xx=sj0(path,1)yy=sj0(path,2)

plot(xx,yy,'r-o')

axis equal

toc

你好歹看一下程序嘛，人家都给你注释了输入输出都是啥，弊并乱你使用的时候得先给输入赋值蔽棚。在命令行输入M=啥，N=啥···然后再输[Zp,Y1p,Y2p,Y3p,Xp,LC1,LC2]=JSPGA(M,N,Pm,T,P)

左边租档这些就是输出了，要是运行成功会在workspace里面看到

欢迎分享，转载请注明来源：内存溢出

原文地址: https://outofmemory.cn/yw/12367761.html

谁有车间作业调度问题遗传算法的MATLAB源码，要完整的程序哦~

发表评论

评论列表（0条）