Depth genetic algorithm solve ultra-large-scale Traveling Salesman Problem
Minghai Yao · Computer Engineering and Applications Journal · 2009
Many evolutionary algorithms are sensitive for initial parameters design,the different Traveling Salesman Problem(TSP) need for corresponding adjustment for the initial parameters.And the local optimal solution is easy when you solve the issue of ultra-large-scale TSP problem.Therefore,this paper presents a programme about depth genetic algorithms to solve TSP problems and improved function,variation function,cross-function in order to resolve the question.For example,pr1002(259 269.09),pla85900(152 394 182.43) and brd14051(489 842.93) have a relatively good optimal solution.Experimental results show that the algorithm has great advantages.