In the dynamic traveling salesman problem (TSP), the vertices and/or weights of the graph that represents the TSP are changed during the optimization process. The dynamic TSP with weight changes is ...

Results show that both Genetic Programming and Adaptive Genetic Programming are viable algorithms for dynamic environments yielding a performance gain over Gradient Descent for lower dimensional ...