论文部分内容阅读
旅行商问题(TSP问题)是运筹学中一个十分典型的组合优化问题。TSP问题看似简单,但是解决起来十分复杂、困难,采用传统的、一般的算法是很难求出问题的最优解的。蚁群算法是根据蚂蚁寻找食物的行为模拟出来的新型仿生算法,可以用于解决复杂的组合优化问题。
The traveling salesman problem (TSP problem) is a very typical combinatorial optimization problem in operations research. The TSP problem seems simple, but it is complicated and difficult to solve. It is difficult to find the optimal solution to the problem using the traditional and general algorithms. Ant colony algorithm is a new type of bionic algorithm which is simulated based on the behavior of ants looking for food and can be used to solve complex combinatorial optimization problems.