模拟退火算法求解TSP问题Matlab源码

function[f,T]=TSPSA(d,t0,tf)%TSP问题（货郎担问题，旅行商问题）的模拟退火算法通用malab源程序%f目标最优值,T最优路线,d距离矩阵,t0初始温度,tf结束温度[m,n]=size(d);L=100*n;t=t0;pi0=1:n;min_f=0;fork=1：n-1min_f=min_f+d(pi0(k),pi0(k+1));endmin_f=min_f+d(pi0(n),pi0(1));p_min=pi0;whilettffork=1:L;kk=rand;[d_f,pi_1]=exchange_2(pi0,d);r_r=rand;ifd_f0pi0=pi_1;elseifexp(d_f/t)r_rpi0=pi_1;elsepi0=pi0;endendf_temp=0;fork=1：n-1f_temp=f_temp+d(pi0(k),pi0(k+1));endf_temp=f_temp+d(pi0(n),pi0(1));ifmin_ff_tempmin_f=f_temp;p_min=pi0;endt=0.87*t;endf=min_f;T=p_min;%aiwa要调用的子程序,用于产生新解function[d_f,pi_r]=exchange_2(pi0,d)[m,n]=size(d);clearm;u=rand;u=u*(n-2);u=round(u);ifu2u=2;endifun-2u=n-2;endv=rand;v=v*(n-u+1);v=round(v);ifv1v=1;endv=u+v;ifvnv=n;endpi_1(u)=pi0(v);pi_1(v)=pi0(u);ifu1fork=1：u-1pi_1(k)=pi0(k);endendifv(u+1)fork=1：v-u-1pi_1(u+k)=pi0(v-k);endendifvnfork=(v+1):npi_1(k)=pi0(k);endendd_f=0;ifvnd_f=d(pi0(u-1),pi0(v))+d(pi0(u),pi0(v+1));fork=(u+1):nd_f=d_f+d(pi0(k),pi0(k-1));endd_f=d_f-d(pi0(u-1),pi0(u))-d(pi0(v),pi0(v+1));fork=(u+1):nd_f=d_f-d(pi0(k-1),pi0(k));endelsed_f=d(pi0(u-1),pi0(v))+d(pi0(u),pi0(1))-d(pi0(u-1),pi0(u))-d(pi0(v),pi0(1));fork=(u+1):nd_f=d_f+d(pi0(k),pi0(k-1));endfork=(u+1):nd_f=d_f-d(pi0(k-1),pi0(k));endendpi_r=pi_1;