A hierarchical strategy for solving traveling salesman problems using elastic nets

DOI10.1007/BF02430366zbMath0857.90132OpenAlexW2061609059MaRDI QIDQ1922629

Andrew I. Vakhutinsky, Bruce L. Golden

Publication date: 1 September 1996

Published in: Journal of Heuristics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02430366

zbMATH Keywords

neural networkstraveling salesmanelastic net method

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (4)

Metaheuristics: A bibliography ⋮ Self-organizing feature maps for the vehicle routing problem with backhauls ⋮ Fast, efficient and accurate solutions to the Hamiltonian path problem using neural approaches ⋮ A Neural-Network-Based Approach to the Double Traveling Salesman Problem

Cites Work

• A fast optimization method based on a hierarchical strategy for the travelling salesman problem
• Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane
• State-of-the-Art Survey—The Traveling Salesman Problem: A Neural Network Perspective

This page was built for publication: A hierarchical strategy for solving traveling salesman problems using elastic nets