旅行商问题的程序c语言,旅行商的问题

该楼层疑似违规已被系统折叠 隐藏此楼查看此楼

function varargout = tsp_ga(xy,dmat,pop_size,num_iter,show_prog,show_res)

nargs = 6;for k = nargin:nargs-1 switch k case 0 xy = 10*rand(50,2); case 1 N = size(xy,1); a = meshgrid(1:N); dmat = reshape(sqrt(sum((xy(a,:)-xy(a',:)).^2,2)),N,N); case 2 pop_size = 100; case 3 num_iter = 1e4; case 4 show_prog = 1; case 5 show_res = 1; otherwise endend% Verify Inputs[N,dims] = size(xy);[nr,nc] = size(dmat);if N ~= nr || N ~= nc error('Invalid XY or DMAT inputs!')endn = N;% Sanity Checkspop_size = 4*ceil(pop_size/4);num_iter = max(1,round(real(num_iter(1))));show_prog = logical(show_prog(1));show_res = logical(show_res(1));% Initialize the Populationpop = zeros(pop_size,n);for k = 1:pop_size pop(k,:) = randperm(n);end% Run the GAglobal_min = Inf;total_dist = zeros(1,pop_size);dist_history = zeros(1,num_iter);tmp_pop = zeros(4,n);new_pop = zeros(pop_size,n);if show_prog pfig = figure('Name','TSP_GA | Current Best Solution','Numbertitle','off');endfor iter = 1:num_iter % Evaluate Each Population Member (Calculate Total Distance) for p = 1:pop_size d = dmat(pop(p,n),pop(p,1)); % Closed Path for k = 2:n d = d + dmat(pop(p,k-1),pop(p,k)); end total_dist(p) = d; end % Find the Best Route in the Population [min_dist,index] = min(total_dist); dist_history(iter) = min_dist; if min_dist < global_min global_min = min_dist; opt_rte = pop(index,:); if show_prog % Plot the Best Route figure(pfig); rte = opt_rte([1:n 1]); if dims == 3, plot3(xy(rte,1),xy(rte,2),xy(rte,3),'r.-'); else plot(xy(rte,1),xy(rte,2),'r.-'); end title(sprintf('Total Distance = %1.4f, Iteration = %d',min_dist,iter)); end end % Genetic Algorithm Operators rand_pair = randperm(pop_size); for p = 4:4:pop_size rtes = pop(rand_pair(p-3:p),:); dists = total_dist(rand_pair(p-3:p)); [ignore,idx] = min(dists); best_of_4_rte = rtes(idx,:); ins_pts = sort(ceil(n*rand(1,2))); I = ins_pts(1); J = ins_pts(2); for k = 1:4 % Mutate the Best to get Three New Routes tmp_pop(k,:) = best_of_4_rte; switch k case 2 % Flip tmp_pop(k,I:J) = fliplr(tmp_pop(k,I:J)); case 3 % Swap tmp_pop(k,[I J]) = tmp_pop(k,[J I]); case 4 % Slide tmp_pop(k,I:J) = tmp_pop(k,[I+1:J I]); otherwise % Do Nothing end end new_pop(p-3:p,:) = tmp_pop; end pop = new_pop;endif show_res % Plots the GA Results figure('Name','TSP_GA | Results','Numbertitle','off'); subplot(2,2,1); if dims == 3, plot3(xy(:,1),xy(:,2),xy(:,3),'k.'); else plot(xy(:,1),xy(:,2),'k.'); end title('City Locations'); subplot(2,2,2); imagesc(dmat(opt_rte,opt_rte)); title('Distance Matrix'); subplot(2,2,3); rte = opt_rte([1:n 1]); if dims == 3, plot3(xy(rte,1),xy(rte,2),xy(rte,3),'r.-'); else plot(xy(rte,1),xy(rte,2),'r.-'); end title(sprintf('Total Distance = %1.4f',min_dist)); subplot(2,2,4); plot(dist_history,'b','LineWidth',2); title('Best Solution History'); set(gca,'XLim',[0 num_iter+1],'YLim',[0 1.1*max([1 dist_history])]);end% Return Outputsif nargout varargout{1} = opt_rte; varargout{2} = min_dist;end

求问这个程序用的是什么思想??