基于改进蚁群算法的应用与研究  

Application and research on improved ant colony algorithm

作　　者：赵丽虹[1] 裴振兵 

机构地区：[1]鞍山技师学院电气工程系,辽宁鞍山114020 [2]辽宁科技大学电子与信息工程学院,辽宁鞍山114051

出　　处：《辽宁科技大学学报》2014年第5期460-466,共7页Journal of University of Science and Technology Liaoning

摘　　要：针对传统蚁群算法在构造解的过程中收敛速度慢且容易陷入局部最优问题,提出了一种改进蚁群算法。在蚁群搜索路径过程中,通过建立信息素启发式因子α和期望启发式因子β的互锁关系,动态自适应调整α和β;结合车辆运输调度问题,对距离启发式因子ηij(t)进行重新定义,引入不同客户间的"偏好力",提高算法的搜索效率及实用性。将改进蚁群算法分别应用到机器人路径规划及车辆调度问题并进行仿真,取得了较好实验效果,验证了该方法的可行性和有效性。Due to slow convergence speed and easy to fall into local optimum in traditional ant colony algo-rithm,the pheromone heuristic factor α and expected heuristic foctor β are modified adaptively.By combin-ing with vehicle routing and scheduling problems,the distance heuristic factor ηij（t） is redefined,and the pref-erence force among different customers is introduced to improve the search efficiency and practicality of the al-gorithm. Finally,the improved algorithm is applied to the path planning for mobile robot and vehicle routing scheduling problems respectively. Through the simulation of different application targets,the feasibility and ef-fectiveness of the algorithm are verified,and a good experiment effect has been achieved.

关 键 词：改进蚁群算法 车辆路径问题 偏好力 互锁关系 

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