蚁群算法解决TSP问题的MATLAB实现

出动m只蚂蚁，每只蚂蚁各随机选择一条路径，记为I=[1 2 3···m]，长度记为long(I)

计算出每条路径的信息素浓度，记为P(I)=1/long(I)，并进行归一化处理

重新出动m只蚂蚁，按如下规则选择路径：

每只蚂蚁都以一个概率p1选择新路径(路径随机)；

未选择新路径的蚂蚁以概率P(I)选择路径I；

所有蚂蚁都以一个小概率p2对自己的路径进行局部变化；

更新所有路径，计算出每条路径的信息素浓度；

重复上述步骤，直至仅剩一条路径。

-Ant colony algorithm to solve TSP problems MATLAB realization

Dispatched m ants, ants randomly select a path for each, denoted I = [1 2 3 · · · m], length denoted as long (I)

Calculated pheromone each path, denoted as P (I) = 1/long (I), and the normalization processing

Re-dispatched m ants, select the path according to the following rules:

Each ant with a probability p1 choose a new path (path random)

Ants do not select a new path with probability P (I) choose the path I

All ants are in a small probability p2 locally on their own path to change

Update all paths, each path is calculated pheromone

Repeat the above steps until the remaining path.