蚂蚁算法在组合优化中的应用

Applications of the ant algorithm to combinatorial optimization

蚂蚁算法是近年来新出现的一种随机型搜索寻优算法 ,自从在 TSP等著名问题中得到富有成效的应用之后 ,已引起越来越多的关注和重视 .本文进一步将这种新型的生物优化思想扩展到其他一些组合优化难题 ,包括目前尚缺乏有效求解手段的多目标组合优化问题 ,从实验上探索了蚂蚁算法的优化能力 。

Ant algorithm is a newly emerged stochastic searching optimization algorithm in recent years. It has been paid much attention to since the successful application in the famous travelling salesman problem. This paper further extends the idea of this new biological optimization strategy to some other hard combinatorial optimization problems, including the multi attribute situation which lack of efficient solving methods. The ability of optimization for the algorithm is tested experimentally which give encouraging results.