進化算法程序

1、進化算法作業(yè) 1 全局優(yōu)化問題（1） ， 此問題的全局最優(yōu)值。一程序(1)主函數(shù)： main.mclear all;clc;popsize=60; %種群規(guī)模chromlength=34; %二進制編碼，編碼精度為0.0001，所以串長l為17pc=0.7; %雜交概率pm=0.1; %變異概率t=0; %進化代數(shù)初始為0pop=initpop(popsize,chromlength); %隨機產(chǎn)生初始種群while t<500 %迭代次數(shù) t=t+1; objvalue=calobjvalue(pop); %計算目標函數(shù)值 fitvalue=calfitvalue(objvalue);

2、 %計算群體中每個個體的適應(yīng)度 bestindividual,bestfit=best(pop,fitvalue); %求出群體中適應(yīng)度最大的個體及其適應(yīng)度值 x11=decodechrom(bestindividual,1,14); %將二進制數(shù)轉(zhuǎn)換為十進制數(shù) x22=decodechrom(bestindividual,15,14); x1(t)=-5+10*x11/(pow2(14)-1); %將二值域中的數(shù)轉(zhuǎn)換為變量域的數(shù) x2(t)=-5+10*x22/(pow2(14)-1); y(t)=4*x1(t)2-2.1*x1(t)4+1/3*x1(t)6+x1(t)*x2(t)-4*x2

3、(t)2+4*x2(t)4; %計算最佳個體的目標函數(shù)值 newpop1=selection(pop,fitvalue); %選擇算子 newpop2=crossover(newpop1,pc); %交叉算子 newpop3=mutation(newpop2,pm); %變異算子 objvalue1=calobjvalue(newpop3(1,:); if objvalue1>y(t) newpop3(1,:)=bestindividual; %保留最佳個體 end pop=newpop3; %產(chǎn)生新種群endy; %每代的最佳目標函數(shù)值x1; %每代的最佳目標函數(shù)值對應(yīng)的自變量x2;g

4、y,k=min(y) %gy為全局最優(yōu)值，k為最優(yōu)值對應(yīng)的進化代數(shù)gx1=x1(k) %全局最優(yōu)值對應(yīng)的自變量gx2=x2(k)plot(y) %最優(yōu)值收斂曲線title('收斂性曲線');xlabel('進化代數(shù)');ylabel('函數(shù)值');axis(0,500,-1.5,1.5);(2)初始種群：initpop.mfunction pop=initpop(popsize,chromlength)pop=round(rand(popsize,chromlength); %rand隨機產(chǎn)生0,1區(qū)間的一個小數(shù)，rand四舍五入取整end(3)

5、計算目標函數(shù)值:：calobjvalue.mfunction objvalue =calobjvalue( pop )temp1=decodechrom(pop,1,14);temp2=decodechrom(pop,15,14);x1=-5+(10*temp1)/(pow2(14)-1); %將二值域中的數(shù)轉(zhuǎn)化為變量域中的數(shù)x2=-5+(10*temp2)/(pow2(14)-1);objvalue=4*x1.2-2.1*x1.4+1/3*x1.6+x1.*x2-4*x2.2+4*x2.4; %計算目標函數(shù)enda二進制轉(zhuǎn)換為十進制：decodechrom.m function temp=d

6、ecodechrom(pop,spoint,length )pop1=pop(:,spoint:spoint+length-1); %按變量個數(shù)分組轉(zhuǎn)換，spoint為起始點，length為一個變量的長度temp=decodebinary(pop1);endb求二進制串對應(yīng)的十進制數(shù)：decodebinary.mfunction temp =decodebinary( pop)px,py=size(pop); %求pop行數(shù)和列數(shù)for i=1:py pop1(:,i)=2.(py-i).*pop(:,i);endtemp=sum(pop1,2); %每一行求和end(4)計算個體適應(yīng)度：ca

7、lfitvalue.mfunction fitvalue= calfitvalue( objvalue ) fitvalue=1./(1+exp(objvalue);end(5)種群中最大適應(yīng)度個體及其值：best.mfunction bestindividual,bestfit = best(pop,fitvalue )px,py=size(pop);bestindividual=pop(1,:);bestfit=fitvalue(1);for i=2:px; if fitvalue>bestfit bestindividual=pop(i,:); best=fitvalue(i);

8、endendend(6)選擇算子：selection.mfunction newpop1=selection(pop,fitvalue)totalfit=sum(fitvalue); %適應(yīng)度和ps=fitvalue./totalfit; %單個個體被選擇的概率pss=cumsum(ps); %前幾項累積和px,py=size(pop);ms=sort(rand(px,1); %隨機產(chǎn)生px個0,1之間的數(shù)，并按升序排列fitin=1;newin=1;while newin<=px if(ms(newin)<pss(fitin) newpop1(newin,:)=pop(fitin

9、,:); newin=newin+1; else fitin=fitin+1; endendend(7)交叉算子：crossover.mfunction newpop2 = crossover( pop,pc )px,py=size(pop);newpop2=ones(size(pop);for i=1:2:px-1 if rand<pc cpoint=round(rand*py); %隨機產(chǎn)生一個交叉位 newpop2(i,:)=pop(i,1:cpoint),pop(i+1,cpoint+1:py); %交換相鄰兩個個體交叉位之后的基因 newpop2(i+1,:)=pop(i+1,

10、1:cpoint),pop(i,cpoint+1:py); else nwepop2(i,:)=pop(i,:); newpop2(i+1,:)=pop(i+1,:); endendend(8)變異算子：mutation.mfunction newpop3 = mutation( pop,pm )px,py=size(pop);newpop3=pop;for i=1:px if(rand<pm) mpoint=round(rand*py); %隨機產(chǎn)生一個變異位 if mpoint<=0 mpoint=1; end if (newpop3(i,mpoint)=0) %變?yōu)榈葹榛?

11、newpop3(i,mpoint)=1; else newpop3(i,mpoint)=0; end endend end二獨立運行程序30次的結(jié)果x10.1590-0.0900-0.0888-0.0894-0.08090.07720.08760.1175-0.1578-0.0778x2-0.70160.71260.71020.64210.7120-0.6247-0.7023-0.71380.70290.7090y-1.0115-1.0316-1.0316-0.9751-1.0313-0.9763-1.0308-1.0287-1.0125-1.0310x10.0900-0.0015-0.156

12、6-0.0888-0.0882-0.00890.10040.0766-0.0900-0.0876x2-0.7126-0.70650.71690.71260.7029-0.6931-0.7029-0.71320.71510.7102y-1.0316-0.9989-0.10147-1.0316-1.0309-0.9922-1.0303-1.0309-1.0316-1.0316x1-0.9190.07780.09060.09060.09310.09060.0906-0.0925-0.0705-0.0919x20.7126-0.7114-0.7138-0.7126-0.7816-0.7132-0.70

13、960.71630.69860.7126y-1.0316-1.0331-1.0316-1.0316-0.9891-1.0316-1.0315-1.0315-1.0288-1.0316最好目標函數(shù)值：-1.0316 最差目標函數(shù)值：-0.9751平均目標函數(shù)值：-0.9914 標準方差：0.0286三最好的一次結(jié)果最好解：x1=0.0919 x2=-0.7126 最好值：-1.0316運行結(jié)果及收斂性曲線如下圖： 運行結(jié)果 收斂性曲線（2） ， 此問題的全局最優(yōu)值。一程序(1)主函數(shù)： main.mclear all;clcpopsize=40; %種群規(guī)模chromlength=28; %二進

14、制編碼，編碼精度為0.001，所以串長l為14pc=0.8; %雜交概率pm=0.2; %變異概率 t=0;pop=initpop(popsize,chromlength); %隨機產(chǎn)生初始種群while t<500 %迭代次數(shù) t=t+1; objvalue=calobjvalue(pop); %計算目標函數(shù)值 fitvalue=calfitvalue(objvalue); %計算群體中每個個體的適應(yīng)度 bestindividual,bestfit=best(pop,fitvalue); %求出群體中適應(yīng)度最大的個體及其適應(yīng)度值 x11=decodechrom(bestindividu

15、al,1,14); %將二進制數(shù)轉(zhuǎn)換為十進制數(shù) x22=decodechrom(bestindividual,15,14); x1(t)=-5+10*x11/(pow2(14)-1); %將二值域中的數(shù)轉(zhuǎn)換為變量域的數(shù) x2(t)=-5+10*x22/(pow2(14)-1); y(t)=(x2(t)-5.1/(4*pi*pi).*x1(t).2+5/pi.*x1(t)-6).2+10.*(1-1/(8*pi).*cos(x1(t)+10; %計算最佳個體的目標函數(shù)值 newpop1=selection(pop,fitvalue); %選擇算子 newpop2=crossover(newpop

16、1,pc); %雜交算子 newpop3=mutation(newpop2,pm); %變異算子 objvalue1=calobjvalue(newpop3(1,:); if objvalue1>y(t) newpop3(1,:)=bestindividual; %保留最佳個體 end pop=newpop3; %產(chǎn)生新種群endy; %每代的最佳目標函數(shù)值x1; %每代的最佳目標函數(shù)值對應(yīng)的自變量x2;gy,k=min(y); %全局最優(yōu)值gy=vpa(gy,3) %設(shè)置輸出精度gx1=x1(k); %全局最優(yōu)值對應(yīng)的自變量x1=vpa(gx1,4)gx2=x2(k);x2=vpa(g

17、x2,4)plot(y) %最優(yōu)值收斂曲線title('收斂性曲線');xlabel('進化代數(shù)');ylabel('函數(shù)值');axis(0,500,0.2,1.5);(2)初始種群：initpop.mfunction pop=initpop(popsize,chromlength)pop=round(rand(popsize,chromlength); %rand隨機產(chǎn)生0,1區(qū)間的一個小數(shù)，rand四舍五入取整end(3)計算目標函數(shù)值:：calobjvalue.mfunction objvalue =calobjvalue( pop )t

18、emp1=decodechrom(pop,1,14);temp2=decodechrom(pop,15,14);x1=-5+(10*temp1)/(pow2(14)-1); %將二值域中的數(shù)轉(zhuǎn)化為變量域中的數(shù)x2=-5+(10*temp2)/(pow2(14)-1);objvalue=(x2-5.1/(4*pi*pi).*x1.2+5/pi.*x1-6).2+10.*(1-1/(8*pi).*cos(x1)+10; enda二進制轉(zhuǎn)換為十進制：decodechrom.m function temp=decodechrom(pop,spoint,length )pop1=pop(:,spoint

19、:spoint+length-1); %按變量個數(shù)分組轉(zhuǎn)換，spoint為起始點，length為一個變量的長度temp=decodebinary(pop1);endb求二進制串對應(yīng)的十進制數(shù)：decodebinary.mfunction temp =decodebinary( pop)px,py=size(pop); %求pop行數(shù)和列數(shù)for i=1:py pop1(:,i)=2.(py-i).*pop(:,i);endtemp=sum(pop1,2); %每一行求和end(4)計算個體適應(yīng)度：calfitvalue.mfunction fitvalue= calfitvalue( objv

20、alue ) fitvalue=1./(1+exp(objvalue);end(5)種群中最大適應(yīng)度個體及其值：best.mfunction bestindividual,bestfit = best(pop,fitvalue )px,py=size(pop);bestindividual=pop(1,:);bestfit=fitvalue(1);for i=2:px; if fitvalue>bestfit bestindividual=pop(i,:); best=fitvalue(i); endendend(6)選擇算子：selection.mfunction newpop1=se

21、lection(pop,fitvalue)totalfit=sum(fitvalue); %適應(yīng)度和ps=fitvalue./totalfit; %單個個體被選擇的概率pss=cumsum(ps); %前幾項累積和px,py=size(pop);ms=sort(rand(px,1); %隨機產(chǎn)生px個0,1之間的數(shù)，并按升序排列fitin=1;newin=1;while newin<=px if(ms(newin)<pss(fitin) newpop1(newin,:)=pop(fitin,:); newin=newin+1; else fitin=fitin+1; endende

22、nd(7)交叉算子：crossover.mfunction newpop2 = crossover( pop,pc )px,py=size(pop);newpop2=ones(size(pop);for i=1:2:px-1 if rand<pc cpoint=round(rand*py); %隨機產(chǎn)生一個交叉位 newpop2(i,:)=pop(i,1:cpoint),pop(i+1,cpoint+1:py); %交換相鄰兩個個體交叉位之后的基因 newpop2(i+1,:)=pop(i+1,1:cpoint),pop(i,cpoint+1:py); else nwepop2(i,:)

23、=pop(i,:); newpop2(i+1,:)=pop(i+1,:); endendend(8)變異算子：mutation.mfunction newpop3 = mutation( pop,pm )px,py=size(pop);newpop3=pop;for i=1:px if(rand<pm) mpoint=round(rand*py); %隨機產(chǎn)生一個變異位 if mpoint<=0 mpoint=1; end if (newpop3(i,mpoint)=0) %變?yōu)榈葹榛?newpop3(i,mpoint)=1; else newpop3(i,mpoint)=0;

24、end endend end二獨立運行程序30次的結(jié)果x13.1253.1453.1283.1453.1413.1243.1253.1453.1453.125x22.2852.2652.5002.2652.2762.2902.3052.2652.2732.287y0.3990.3980.4450.3980.3980.3990.4000.3980.3980.399x13.1253.1253.1453.1403.1083.1463.1113.1653.1453.145x22.2652.2872.2652.2652.5002.2762.5002.1872.2702.265y0.4000.3990.3

25、980.3980.4430.3980.4430.4050.3980.398x13.1223.1253.1253.1423.1343.1253.1253.1433.1413.125x22.2842.2862.2852.2742.2862.3442.2852.2752.2762.288y0.4000.3990.3990.3980.3980.4020.3990.3980.3980.399最好目標函數(shù)值：0.398 最差目標函數(shù)值：0.445平均目標函數(shù)值：0.403 標準方差：1.886e-004三最好的一次結(jié)果最好解：x1=3.145 x2=2.265最好值：0.398運行結(jié)果及收斂性曲線如下圖：

26、 運行結(jié)果 收斂性曲線（3） ，此問題的全局最優(yōu)值。本題采用十進制編碼方式，與二進制編碼方式相比較，效率不如二進制，但程序相比簡單一些。多次運行，自變量去平均值可得到最好結(jié)果。一程序(1)主函數(shù)： main.mclear all;clcpopsize=40; %種群規(guī)模chromlength=10; %變量個數(shù)，十進制編碼pc=0.8; %雜交概率pm=0.1; %變異概率t=0; %進化代數(shù) pop=initpop(popsize,chromlength); %初始種群while t<5000 t=t+1; objvalue=calobjvalue(pop); %計算目標函數(shù)值 fit

27、value=calfitvalue(objvalue); %計算群體中每個個體的適應(yīng)度 bestindividual,bestfit=best(pop,fitvalue); %計算最佳個體的目標函數(shù)值 x(t,:)=bestindividual; y(t)=sum(x(t,:).*x(t,:); %每代最優(yōu)解的值 newpop1=selection(pop,fitvalue); %選擇算法 newpop2=crossover(newpop1,pc); %交叉算法 newpop3=mutation(newpop2,pm); %變異算法 objvalue1=calobjvalue(newpop3(

28、1,:); if objvalue1>y(t) newpop3(1,:)=bestindividual; %保留最佳個體 end pop=newpop3; %產(chǎn)生新種群endy; %每代的最佳目標函數(shù)值x; %每代的最佳目標函數(shù)值對應(yīng)的自變量gy,k=min(y) %gy為全局最優(yōu)值，k為最優(yōu)值對應(yīng)的進化代數(shù)x=x(k,:) %全局最優(yōu)值對應(yīng)的自變量plot(y) %最優(yōu)值收斂曲線 title('收斂性曲線');xlabel('進化代數(shù)');ylabel('函數(shù)值');axis(0,5000,0,1);(2)初始種群：initpop.mfu

29、nction pop=initpop(popsize,chromlength)pop=-100+200.*rand(popsize,chromlength); %隨機產(chǎn)生-100,100之間的數(shù)end(3)計算目標函數(shù)值:：calobjvalue.mfunction objvalue =calobjvalue( pop )px,py=size(pop);for i=1:py x(:,i)=pop(:,i);endobjvalue=sum(x.*x,2);end (4)計算個體適應(yīng)度：calfitvalue.mfunction fitvalue= calfitvalue( objvalue )f

30、itvalue=1./objvalue;end (5)種群中最大適應(yīng)度個體及其值：best.mfunction bestindividual,bestfit = best(pop,fitvalue )px,py=size(pop);bestindividual=pop(1,:);bestfit=fitvalue(1);for i=2:px; if fitvalue>bestfit bestindividual=pop(i,:); best=fitvalue(i); endendend(6)選擇算子：selection.mfunction newpop1=selection(pop,fit

31、value)totalfit=sum(fitvalue); %適應(yīng)度和if(fitvalue=0)newpop1=pop;elseps=fitvalue./totalfit; %單個個體被選擇的概率pss=cumsum(ps); %前幾項累積和px,py=size(pop);ms=sort(rand(px,1); %隨機產(chǎn)生px個0,1之間的數(shù)，并按升序排列fitin=1;newin=1;while newin<=px if(ms(newin)<pss(fitin) newpop1(newin,:)=pop(fitin,:); newin=newin+1; else fitin=f

32、itin+1; endendend end (7)交叉算子：crossover.mfunction newpop2 = crossover( pop,pc )px,py=size(pop);newpop2=ones(size(pop);for i=1:2:px-1 for j=1:py if rand<pc a=rand(); newpop2(i,j)=a*pop(i,j)+(1-a)*pop(i+1,j); %算數(shù)交叉 newpop2(i+1,j)=a*pop(i+1,j)+(1-a)*pop(i,j); else newpop2(i,j)=pop(i,j); newpop2(i+1,

33、j)=pop(i+1,j); end endendend(8)變異算子：mutation.mfunction newpop3 = mutation( pop,pm )px,py=size(pop);newpop3=pop;for i=1:px %每一個點以概率pm變?yōu)榈葹榛?for j=1:py if(rand<pm) r=-100+200*rand; while(r=pop(i,j) r=-100+200*rand; end newpop3(i,j)=r; else newpop3(i,j)=pop(i,j); endend end二獨立運行程序30次的結(jié)果y0.00420.0074

34、0.00800.00790.00680.00630.00200.00750.00990.0120x10.0460-0.02490.0108-0.0224-0.00670.02150.00340.00350.01190.0266x2-0.02640.02500.0188-0.04310.02220.0071-0.0184-0.02620.03020.0388x30.00780.00800.0316-0.00300.0058-0.0311-0.0080-0.0134-0.0382-0.0416x4-0.0184-0.0097-0.0386-0.0285-0.0167-0.02960.01560.0

35、3570.01050.0216x5-0.0160-0.0454-0.03320.00060.0169-0.0556-0.0127-0.00300.0545-0.0067x6-0.0024-0.04910.0108-0.0498-0.0467-0.00140.0000-0.03030.02760.0243x7-0.0131-0.0180-0.0048-0.0332-0.03280.0144-0.02340.0512-0.0366-0.0260x8-0.0051-0.01350.0227-0.01100.0069-0.00570.0131-0.00670.0440-0.0310x9-0.01930

36、.0275-0.03690.03040.04390.02200.0079-0.0392-0.0153-0.0710x10-0.01120.01510.0405-0.0111-0.0204-0.01030.02080.02530.0053-0.0162y0.00940.01110.01090.00480.00660.00480.00710.00550.01120.0072x1-0.0343-0.02180.0301-0.0309-0.0319-0.00370.01860.01660.0626-0.0349x20.0310-0.0030-0.0368-0.0271-0.03120.03380.03

37、54-0.03020.0089-0.0115x30.04240.0329-0.01880.00490.0214-0.0293-0.00980.0069-0.0098-0.0193x4-0.04150.0392-0.05440.00740.01290.00370.05140.03100.0039-0.0151x50.03240.0198-0.0236-0.0042-0.0133-0.01610.0116-0.0228-0.02070.0090x60.04790.0330-0.0581-0.01110.0103-0.0379-0.00300.0224-0.03440.0076x7-0.0012-0

38、.04270.0313-0.04180.02490.0027-0.04360.0204-0.05040.0340x80.0065-0.0231-0.00070.01580.0049-0.02050.0243-0.02320.0350-0.0466x9-0.0063-0.0452-0.01120.02960.03800.0092-0.00960.00500.0408-0.0173x10-0.01880.0454-0.0168-0.0058-0.0406-0.0226-0.0055-0.0363-0.0030-0.0384y0.00420.00740.00800.00790.00680.00630

39、.00200.00750.00990.0094x10.0460-0.02490.0108-0.0224-0.00670.02150.00340.00350.0119-0.0343x2-0.02640.0250-0.0188-0.04310.02220.0071-0.0184-0.02620.03020.0310x30.00780.00800.0316-0.00300.0058-0.031-0.0080-0.0134-0.03820.0424x4-0.0184-0.0097-0.0386-0.0285-0.0167-0.02960.01560.03570.0105-0.0415x5-0.0160

40、-0.0454-0.03320.00060.0169-0.0556-0.0127-0.00300.05450.0324x6-0.0024-0.04910.0108-0.0498-0.0467-0.00140.0000-0.03030.02760.0479x7-0.0131-0.0180-0.0048-0.0332-0.03280.0144-0.02340.0512-0.0366-0.0012x8-0.0051-0.01350.0277-0.01100.0069-0.00570.0131-0.00670.04400.0065x9-0.01930.0275-0.03690.03040.04390.

41、02200.0079-0.0329-0.0153-0.0063x10-0.01120.01510.0405-0.0111-0.0204-0.01030.02080.0253-0.0053-0.0188最好目標函數(shù)值：0.0020 最差目標函數(shù)值：0.0120平均目標函數(shù)值：0.0073 標準方差：6.3099e-006三最好的一次結(jié)果最好解：x1=0.0034 x2=-0.0184 x3=-0.0080 x4=0.0156 x5=-0.0127 x6=0.0000 x7=-0.0234 x8=0.0131 x9=0.0079 x10=0.0208最好值：0.0020運行結(jié)果及收斂性曲線如下圖：

42、 運行結(jié)果 收斂性曲線2 組合優(yōu)化問題多背包問題 ，測試算例： 100, 220, 90, 400, 300, 400, 205, 120, 160, 580, 400, 140, 100, 1300, 650;.最優(yōu)值為： 4015一程序(1)主函數(shù)： main.mclear all;clcc=100 220 90 400 300 400 205 120 160 580 400 140 100 1300 650;A=8 24 13 80 70 80 45 15 28 90 130 32 20 120 40 8 44 13 100 100 90 75 25 28 120 130 32 40 1

43、60 40 3 6 4 20 20 30 8 3 12 14 40 6 3 20 5 5 9 6 40 30 40 16 5 18 24 60 16 11 30 25 5 11 7 50 40 40 19 7 18 29 70 21 17 30 25 5 11 7 55 40 40 21 9 18 29 70 21 17 30 25 0 0 1 10 4 10 0 6 0 6 32 3 0 70 10 3 4 5 20 14 20 6 12 10 18 42 9 12 100 20 3 6 9 30 29 20 12 12 10 30 42 18 18 110 20 3 8 9 35 29 2

44、0 16 15 10 30 42 20 18 120 20;b=550;700;130;240;280;310;110;205;260;275;popsize=20; %種群規(guī)模chromlength=15; %變量個數(shù)pc=0.9; %雜交概率pm=0.2; %變異概率t=0;pop=initpop(popsize,chromlength); %隨機產(chǎn)生初始種群while t<500 %迭代次數(shù) t=t+1; pop=repair(pop,A,b,c); %修補算子，修補不滿足約束的解 objvalue=calobjvalue(pop,c); %計算目標函數(shù)值 fitvalue=cal

45、fitvalue(objvalue); %計算適應(yīng)度 bestindividual,bestfit=best(pop,fitvalue); %最近個體及其適應(yīng)度值 x(t,:)=bestindividual; %最佳個體 y(t)=sum(c.*bestindividual); %計算最佳個體的目標函數(shù)值 newpop1=selection(pop,fitvalue); %選擇算子 newpop2=crossover(newpop1,pc); %交叉算子 newpop3=mutation(newpop2,pm); %變異算子 objvalue1=calobjvalue(newpop3(1,:)

46、,c); if objvalue1<y(t) newpop3(1,:)=bestindividual; %保留最佳個體 end if t>1&&y(t)<y(t-1) y(t)=y(t-1); %保證每代結(jié)果遞增 end pop=newpop3; %產(chǎn)生新種群 end y; %每代的最佳目標函數(shù)值 gy,k=max(y) %全局最優(yōu)解 x=x(k,:) %全局最優(yōu)解對應(yīng)的自變量 plot(y) %收斂曲線 title('收斂性曲線'); xlabel('進化代數(shù)'); ylabel('函數(shù)值'); axis(0,

47、500,3000,4200);(2)初始種群：initpop.mfunction pop=initpop(popsize,chromlength)pop=round(rand(popsize,chromlength);end(3)修補算子 repair.munction pop= repair(pop,A,b,c)px,py=size(pop);m,n=size(A);for k=1:px for i=1:m for j=1:n if(pop(k,j)=1) t(i,j)=b(i)*c(j)/A(i,j); %計算每一個放入背包中的物資的利潤密度 else t(i,j)=Inf; %未放入背包的物資利潤密度為無窮 end end