Solving dynamic traveling salesman problem using dynamic Gaussian process regression

DOI10.1155/2014/818529MaRDI QIDQ1714778zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Stephen M. Akandwanaho, Aderemi O. Adewumi, Ayodele A. Adebiyi

Publication date 1 February 2019

Published in Journal of Applied Mathematics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1155/2014/818529

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Review text

Summary: 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.

Recommendations

• Corrigendum to: ``Solving dynamic traveling salesman problem using dynamic Gaussian process regression
• On a dynamic traveling salesman problem
• Evolutionary Computation in Combinatorial Optimization
• The dynamic programming method in the generalized traveling salesman problem
• A sampling algorithm based on supervised learning for a dynamic traveling salesman problem
• A dynamic traveling salesman problem with stochastic arc costs
• Solving the dynamic traveling salesman game problem
• New policies for the dynamic traveling salesman problem

Cited in

(4)

• Dynamic graph conv-LSTM model with dynamic positional encoding for the large-scale traveling salesman problem
• Solving the dynamic traveling salesman problem using a genetic algorithm with trajectory prediction: an application to fish aggregating devices
• Evolutionary Computation in Combinatorial Optimization
• A sampling algorithm based on supervised learning for a dynamic traveling salesman problem

This page was built for publication: Solving dynamic traveling salesman problem using dynamic Gaussian process regression

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1714778)