Abstract: This paper proposes an ant colony optimization algorithm for bottleneck travelling salesman problem, which combines a local search mechanism and a MAX-MIN strategy. Series of problem instances are solved through micro-computers that give satisfactory results.

摘要： 对瓶颈ＴＳＰ问题给出了一种融合局部搜索机制和ＭＡＸ－ＭＩＮ策略的蚂蚁优化算法，在通用微机上求解了一系列实例问题，获得了满意的效果。

关键词: 瓶颈, TSP, 蚂蚁算法

CLC Number: 

• O224