摘要
将求解TSP问题的算法分为两大类:仿生算法和非仿生算法。通过实验比较两类算法在解决TSP问题时的优劣。实验结果表明,仿生算法是解决TSP问题的有效方法,在问题规模较大时,能够在允许的时间和误差内求得问题的解;而非仿生算法或者求解问题的规模很小,或者无法满足误差要求,因此都无法有效求解TSP问题。基于仿生算法在解决大规模组合优化问题时的有效性,论文提出了将仿生算法应用于云计算这一当今IT界热门话题的猜想。
Divide algorithms for solving TSP（Traveling Salesman Problem） problem into two categories： bionic algorithm and non bion ic algorithm. Compare the two kinds of algorithm by experiment on solving the TSP problem. The experimental result shows that, bionic al- gorithms are effective methods to solving the TSP problem, in large-scale problem, bionic algorithms are able to find solutions to the problem in time and in allowed error, while non bionic algorithms can only solve the problems of small scale and can not meet the error requirement, therefore they are unable to effectively solve the TSP problem. Because of validity of bionic algorithm in solving large-scale combinatorial op- timization problem, the conjecture of applying bionic algorithm to cloud computing is proposed, which is hot in IT industry nowadays.
出处
《计算机与数字工程》
2013年第9期1445-1447,共3页
Computer & Digital Engineering
关键词
TSP
仿生算法
非仿生算法
云计算
TSP, bionic algorithm, non bionic algorithm, cloud computing
