摘要
建立指派问题的数学模型,将其转化为旅行商问题,利用蚁群算法求解此问题。蚁群算法是一种解决组合优化问题的有效算法,但同样存在搜索速度慢,易于陷于局部最优的缺陷。该文提出一种具有动态信息素更新的蚁群算法,通过具体的算例分析,表明该算法比传统的蚁群算法有更快的收敛速度和较好的稳定性。
This paper establishes the mathematical model of assignment problem. Assignment problem is translated into Traveling Salesman Problem（TSP）, and Ant Colony Algorithm（ACA） is used to solve the TSR ACA is an effective algorithm to solve combinatorial problems. Its searching speed is slow and it is easy to fall in local best as other evolutionary algorithm. In this paper, the dynamic pheromone updating ACA is proposed. Experimental results on TSP show that the algorithm has faster convergence speed and greater stability than classical ACA.
出处
《计算机工程》
CAS
CSCD
北大核心
2008年第15期187-189,共3页
Computer Engineering
基金
浙江省教育厅科研基金资助项目(20060315)
关键词
组合优化
蚁群算法
指派问题
动态信息素
combinatorial optimization
Ant Colony Algorithm（ACA）
assignment problem
dynamic pheromone
