Weifeng Su

Finding the global optimal solution in Dynamic multiple TSPTW with data-driven ACO

2021

Dynamic Travelling Salesman Problem (D-TSP) is a classic dynamic optimization problem (DOP), which aims to maintain the optimal route with every change of the graph. D-TSP often greedily pursues the current optimum after each change …