closeall%closeall%%salesmen%min_tour每個旅行商最 %pop_size種 %num_iternargs=7; fork=nargin:nargs-1 switch case dmat= case salesmen= case min_tour= case pop_size= case num_iter= case show_prog= case show_res= %檢查輸入矩陣ifnr~=nc error('InvalidXYorDMATinputs!')nnr1;%% salesmen=pop_size=max(8,8*ceil(pop_size(1)/8));num_iter=salesmen=pop_size=max(8,8*ceil(pop_size(1)/8));num_iter=show_res=logical(show_res(1));num_brks=salesmen-dof=n- %可 addto=ones(1,dof+1);fork=2:num_brks cum_prob=%pop_rte=zeros(pop_size,n); %路徑集合的種群pop_brk=zeros(pop_size,num_brks); %斷點集合的種群fork=1:pop_size pop_rte(k,:)= %global_min=Inf; total_dist=zeros(1,pop_size);dist_history=tmp_pop_rte=zeros(8,n); tmp_pop_brk=zeros(8,num_brks);%當前的斷點設置new_pop_rte=zeros(pop_size,n);%更新的路徑設置new_pop_brkzeros(pop_size,num_brks);%更新的斷點設置ifshow_prog pfig=figure('Name','MTSPF_GA|CurrentBestSolution','Numbertitle','off');foriter= forp= d p_rte= p_brk= rng=[[1p_brk+1];[p_brk d(sd(sdmat(1,p_rte(rng(s,1)))/35;%添加開始的路徑所用時間(到斷點 if d(sd(s d(sd(sdmat(1,p_rte(rng(s,1)))/35;%添加開始的路徑所用時間(到斷點 if d(sd(s d(sd(s d(sd(sdmat(p_rte(rng(s,2)),1)/35 加的，即加上每一個商人旅行時間不超過24小時的約束條件 if for total_dist(p)= 0行處理后再找最小值 for iftotal_dist(p) ifmin_dist< global_min= rng=[[1opt_brk+1];[opt_brk %opt_rte opt_brk fors== forp= rtes== forp= rtes= brks= dists= [ignore,idx]= best_of_8_rte= best_of_8_brk= rte_ins_pts= I= J= fork1:8% tmp_pop_rte(k,:)= tmp_pop_brk(k,:)= switch case2% case3% tmp_pop_rte(k,[IJ])=tmp_pop_rte(k,[J case4% case5% tmp_pop_brk(k,:)= case6% tmp_pop_brk(k,:)= case7% tmp_pop_rte(k,[IJ])=tmp_pop_rte(k,[J tmp_pop_brk(k,:)= case8% tmp_pop_brk(k,:)= otherwise pop_rte= %rng=[[1opt_brk+1];[opt_brk fors=1:salesmen if dd+ fors=1:salesmen if dd+ dd dddmat(opt_rte(rng(s,2)),1)/35 if varargout{2}= varargout{3}= % functionbreaks= ifmin_tour1 breaks= else% = adjus