求解最小比率旅行商问题的混合行为蚁群算法  

Mixing behavior ant colony algorithm for solving minimum ratio traveling salesman problem

作　　者：倪郁东[1] 赵群[1] 沈吟东[2] 张玉洁[1] 

机构地区：[1]合肥工业大学数学学院,安徽合肥230009 [2]华中科技大学自动化学院,湖北武汉430074

出　　处：《合肥工业大学学报（自然科学版）》2016年第1期140-144,共5页Journal of Hefei University of Technology：Natural Science

基　　金：国家自然科学基金资助项目(71171087);合肥工业大学教学研究资助项目(XJ2009005)

摘　　要：为了快速并且有效地求解最小比率旅行商问题,文章提出了一种混合行为蚁群算法。通过对蚁群算法中转移概率以及信息素更新策略加以改进,使蚂蚁能够随机性地选择自己的行为规范,将蚁群进一步智能化;为防止陷入局部最优,算法中设计了交换策略与灾变策略。仿真实验结果表明,改进后的算法能够有效求解最小比率旅行商问题。In order to optimize the minimum ratio traveling salesman problem（MRTSP） quickly and effectively, a kind of mixing behavior ant colony optimization（ACO） is proposed. By improving ACO＇s transition probabilities and strategy of updating pheromone, every ant can select its behavior rules randomly, which makes the ant colony more intelligentialized. Exchange strategy and catastrophe strategy are designed in the algorithm to avoid falling into local optimum. The results of simulation experiment indicate that the modified algorithm can optimize MRTSP effectively.

关 键 词：最小比率旅行商问题 蚁群算法 混合行为 优化 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]