Solving Dynamic Traveling Salesman Problem
摘要
The rapid development in the applications in which data flow are considered to be time-dependent has caused an increasing interest in the dynamic optimization problems. The goal of an optimization search system for a dynamic optimization problem is to continuously track and adapt to the changing problem through time and to find the currently best solution quickly. This chapter describes how to apply the ABSS to solve the dynamic TSP.