Solving Dynamic Traveling Salesman Problem Using Dynamic Gaussian Process Regression

Abstract EN

This paper solves the dynamic traveling salesman problem (DTSP) using dynamic Gaussian Process Regression (DGPR) method.

The problem of varying correlation tour is alleviated by the nonstationary covariance function interleaved with DGPR to generate a predictive distribution for DTSP tour.

This approach is conjoined with Nearest Neighbor (NN) method and the iterated local search to track dynamic optima.

Experimental results were obtained on DTSP instances.

The comparisons were performed with Genetic Algorithm and Simulated Annealing.

The proposed approach demonstrates superiority in finding good traveling salesman problem (TSP) tour and less computational time in nonstationary conditions.