《蚁群算法原理及其应用》（段海滨）附录Matlab源程序_段海滨教授主编的《蚁群算法原理及其应用》附录里的c程序代码-优快云博客

本文链接：https://blog.youkuaiyun.com/chenyusiyuan/article/details/2434391

本文提供了一个基本的蚁群算法解决旅行商问题（TSP）的Matlab源程序。程序首先定义了城市坐标，然后计算城市之间的距离矩阵。接下来，通过循环迭代，蚂蚁们构建它们的路径并更新信息素。最后，程序输出最佳路径并进行可视化展示。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%% Function: Open and import file of city coordinates in TSP %%
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%

[fname,pname,filterindex]=uigetfile('*.*','All Files (*.*)');
set(handles.text_filename,'String',filename);
fid=fopen(filename,'r');
if fid==-1
    warndlg('Can not open the file','WARN');
    fclose(fid);
end
[citymat,COUNT]=fscanf(fid,' %g');
cN=COUNT/3;
set(handles.edit_citysum,'String',cN);
fclose(fid);
aN=str2double(get(handles.edit_antsum,'String'));
ncmax=str2double(get(handles.edit_ncmax,'String'));
for nc=1:ncmax
    for k=1:aN
        g(nc,k)=fix((aN-1)*rand(1))+1;
    end
end

% Basic Ant Colony Algorithm for TSP

global citymat;
global cN; % city number
global g

aN=str2double(get(handles.edit_antsum,'String')); % Set ant number by using Matlab GUI
initao=str2double(get(handles.edit_tao,'String'));
alpha=str2double(get(handles.edit_alpha,'String'));
beta=str2double(get(handles.edit_beta,'String'));
Q=str2double(get(handles.edit_q,'String'));
rou=str2double(get(handles.edit_rou,'String'));
ncmax=str2double(get(handles.edit_ncmax,'String'));

%
% 原文中以上参数是通过作者自建的GUI界面读入的
% 为便于调用，可把程序改为Matlab的M函数文件，以上参数作为函数的输入
%
% function bestroute = fun_basic_TSP(aN,initao,alpha,beta,Q,rou,ncmax)
%