Algorithm 1 Outline of the procedure for solving the DTSP.

Load the static TSP instance  ▹ The original TSP instance becomes the first DTSP sub-problem Initialize the algorithm-related data while Stop criterion is not met do     sub-problem-related initialization            ▹ Create swarm, neighborhood, etc.     Solve the current sub-problem                ▹ Solve with DPSO, ACO, etc.     Modify the current sub-problem to obtain the next one end while