Solving the traveling salesman problem using a recurrent neural network

DOI10.1134/S1995423915030088MaRDI QIDQ5741300zbMATH OpenOpenAlexFDO

Authors Mikhail S. Tarkov

Publication date 22 July 2016

Published in Numerical Analysis and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/s1995423915030088

zbMATH Keywords

traveling salesman problem2-opt CUDA technologyLKH algorithmrecurrent neural Hopfield network

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Recommendations

• A parallel algorithm for solving the traveling salesman problem by a recurrent neural network
• scientific article; zbMATH DE number 1110519
• Discrete-time recurrent neural networks with linear threshold neurons for solving the traveling salesman problem
• Solving the TSP by the AALHNN algorithm
• A self-organising model for the travelling salesman problem

Cited in

(3)

• Solving the traveling salesman problem with a hybrid quantum-classical feedforward neural network
• A parallel algorithm for solving the traveling salesman problem by a recurrent neural network
• Dynamic graph conv-LSTM model with dynamic positional encoding for the large-scale traveling salesman problem

This page was built for publication: Solving the traveling salesman problem using a recurrent neural network

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