摘要
TSP问题是典型的NP-hard组合优化问题,蚁群算法是一种求解此类问题的优化算法,通过模拟蚂蚁觅食行为来解决NP问题。文章使用蚁群算法求解TSP问题,并结合TSP问题的特点选择了一种合适的蚁群更新策略。
Tsp is a classical NP -hard combinatorial optimization problem. Ant algorithm is a method for solving this problem. The paper, in order to solve the problem, considering the characteristic of TSP, put forward an feat ant renewed tactic.
出处
《河南机电高等专科学校学报》
CAS
2008年第5期42-43,共2页
Journal of Henan Mechanical and Electrical Engineering College
