Dynamic traveling salesman problem based on evolutionary computation

In the optimization process to some ordering problems, we compare them to Traveling Salesman Problem (TSP) and put forward the conception of virtual map. Based on this conception, the problems are all put into the framework of Dynamic Traveling Salesman Problem (DTSP). The paper makes a lot of comparisons between TSP and DTSP about their characteristics, and rinds out the commonality and differences between them. At the same time, we consider that the presentation of DTSP conception is attributed to the rise of modern optimization methods founded on probability, and Evolutionary Computation is one of the best Algorithms to solve DTSP nowadays.