Traveling salesman problem in time varying network
Gao Zi-You · Journal of systems engineering · 2010
In this paper,the time varying traveling salesman problem(TDTSP) was formulated by dealing with general time periods crossing,and novel dynamic search optimization algorithms ds-k-opt(k=2,2.5,3) were developed to solve it.Through the simulation,the dynamic search optimization algorithms can solve larger size problem compared with dynamic programming heuristics.As for the solution quality,most solutions of dynamic search optimization algorithms are better than those of dynamic programming heuristics.The solution of the dynamic search optimization algorithm becomes better with the increase of k value,while the computation time becomes longer with it.