TSP problem based on dynamic environment

Many real world optimization problems are related with time and some of them can be modeled by the Dynamic TSP(DTSP). A DTSP is harder than a general TSP, which is a NP-hard problem, because the city number of the DTSP is time varying. We have first given a mathematical model for DTSP. Then we have discussed the GT algorithm which is a algorithm solve static TSP problem. Based on GT algorithm, we have proposed an evolutionary algorithm, which can solve DTSP problem, given its details, analyzed its character and have given a graph of CHN144+1 problem. In the end, we have given the research area in future.