对回溯法解决TSP问题的改进

We can search for all the solutions by using backtrack algorithm, which can solve TSP problem better. But we find it have many flaws such as heavy computing works, high redundance, low efficiency etc. in practical application. This paper put forward a new method of preparing reduction, which introduced a new idea of mutant in GA to improve the backtrack algorithm. Also it describe the detail algorithms of preparing and mutant. In application we find they are effectual in improve BT algorithm.