改进型蚁群算法求解旅行Agent问题  

Improved Ant Colony Algorithm to Solve Traveling

作　　者：马骏 张健沛[1] 杨静[1] 程丽丽[1] 

机构地区：[1]哈尔滨工程大学计算机科学与技术学院,哈尔滨150001

出　　处：《北京邮电大学学报》2008年第6期46-49,共4页Journal of Beijing University of Posts and Telecommunications

基　　金：国家自然科学基金项目(6087303760673131)

摘　　要：旅行agent问题是一类复杂的组合优化问题,目的在于解决移动agent在不同主机间移动时如何规划最优的迁移路线问题.在蚁群算法的基础上,引入变异运算,并且对蚁群算法的全局和局部更新规则进行改进,显著地降低了因蚁群算法陷入局部极小而可能导致系统出现的停滞现象.实验结果表明,改进后的蚁群算法使得移动agent能够以更优的效率和更短的时间来完成任务.Traveling agent problem is a complex and combinatorial optimization problem, which solves the problem of finding an optimal path when an agent migrates to several hosts. An improved ant colony algorithm is presented. A mutation operator is introduced. The local and global updating rules of pheromone are modified on the basis of ant colony algorithm with which the possibility of halting the ant system becomes much lower than the ever in the time arriving at local minimum. Experiment shows that the mobile agents can accomplish the computing tasks with much higher efficiency and in a shorter time.

关 键 词：蚁群算法 移动AGENT 旅行AGENT问题 信息素 

分 类 号：TN929.53[电子电信—通信与信息系统]