Traveling Salesman Problem (TSP) is a classic combinatorial optimizes issue and an NP-hard. But in practice, it is applied in abroad field. In the past, people have been struggling to seek the new method that has not only high quality but also fast convergence rate all the while.One of the important methods in mathematic processing is solving the old problem using updating standard. In the past twenty years, many technologies of bionic algorithms spring up quietly, and pullulate companied with the developin...
| 
点击下列相关研究机构和相关文献作者，可以直接查到这些机构和作者被《中国知识资源总库》收录的其它文献，使您全面了解该机构和该作者的研究动态和历史。
