Use of explicit memory in the dynamic traveling salesman problem
Renato Tinós, Darrell Whitley, Adele E. Howe · 2014
In the dynamic traveling salesman problem (DTSP), the weights and vertices of the graph representing the TSP are allowed to change during the optimization. This work first discusses some issues related to the use of evolutionary algorithms in the DTSP. When efficient algorithms used for the static TSP are applied with restart in the DTSP, we observe that only some edges are generally inserted in and removed from the best solutions after the changes. This result indicates a possible beneficial use of memory approaches, usually employed in cyclic dynamic environments. We propose a memory approach and a hybrid approach that combines our memory approach with the elitism-based immigrants genetic algorithm (EIGA). We compare these two algorithms to four existing algorithms and show that memory approaches can be beneficial for the DTSP with random changes.