專題7 退火算法和貪心算法練習

1、問題一：問題一：球度誤差的網(wǎng)格搜索算法球度誤差的網(wǎng)格搜索算法復原代碼如下：復原代碼如下：clearM=load(1.txt)P=[0.00473040.00170270.0018167]f=0.021n=41l=1zuobiao=zeros(700003)%創(chuàng)建mn全零矩陣fi=1:nx(i)=P(1)f2f(i1)nfj=1:ny(j)=P(2)f2f(j1)nfk=1:nz(k)=P(3)f2f(k1)nfc=1:36R(c)=sq

2、rt((M(c1)x(i))^2(M(c2)y(j))^2(M(c3)z(k))^2)endRmax(l)=max(R[]2)Rmin(l)=min(R[]2)W(l)=Rmax(l)Rmin(l)zuobiao(l:)=[x(i)y(j)z(k)]l=l1endendendw=st(W2)%最大內(nèi)接球法Rout=min(Rmax[]2)Oout=zuobiao(find(Rmax==Rout):)rout=Rmin(find(Rmax

3、==Rout))Fout=Routrout%最小外接球法rin=max(Rmin[]2)Oin=zuobiao(find(Rmin==rin):)Rin=Rmax(find(Rmin==rin))Fout=Rinrin%最小區(qū)域法Farea=min(w[]2)程序運行結(jié)果：程序運行結(jié)果：Oout=0.00530.00830.0087object[i].Num=0初始化放入背包的物品為0if(object[i].WeightC)break

4、當物品重量大于背包容量時else小于時object[i].Num=1物品i放入一件C=object[i].Weight背包容量減小if(i0)cout“重量為:“object[i].Weight“價值為:“object[i].Value“的物品放入“object[i].Num“件“endlvoidStObject(_Objectobject[]intn)將各個物品按單位價值進行排序intj_Objecttempintif(i=0ini)

5、object[i].AveValue=object[i].Valueobject[i].Weight各個物品的單位價值f(i=0in1i)根據(jù)物品的單位價值對物品進行從大到小的冒泡排序f(j=0jni1j)if(object[j].AveValueobject[j1].AveValue)temp=object[j]object[j]=object[j1]object[j1]=tempintmain()_Objectobject[12]1