State-of-the-Art Survey—The Traveling Salesman Problem: A Neural Network Perspective

DOI10.1287/ijoc.5.4.328zbMath0789.90086OpenAlexW2122334939MaRDI QIDQ4282265

Jean-Yves Potvin

Publication date: 24 March 1994

Published in: ORSA Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.5.4.328

zbMATH Keywords

neural networktraveling salesman

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Neural networks for/in biological studies, artificial life and related topics (92B20)

Related Items (13)

Genetic operators for combinatorial optimization in TSP and microarray gene ordering ⋮ Estimating the length of the optimal TSP tour: An empirical study using regression and neural networks ⋮ Using artificial neural networks to solve the orienteering problem ⋮ Routing problems: A bibliography ⋮ A hierarchical strategy for solving traveling salesman problems using elastic nets ⋮ Self-organizing feature maps for the vehicle routing problem with backhauls ⋮ A novel bio-inspired approach based on the behavior of mosquitoes ⋮ A neural-tabu search heuristic for the real time vehicle routing problem ⋮ Fast, efficient and accurate solutions to the Hamiltonian path problem using neural approaches ⋮ Locating a cycle in a transportation or a telecommunications network ⋮ A Neural-Network-Based Approach to the Double Traveling Salesman Problem ⋮ Massively parallel analog tabu search using neural networks applied to simple plant location problems ⋮ Mapping a logical representation of TSP to quantum annealing

This page was built for publication: State-of-the-Art Survey—The Traveling Salesman Problem: A Neural Network Perspective