On the performance of self-organizing maps for the non-Euclidean traveling salesman problem in the polygonal domain
From MaRDI portal
Publication:433075
DOI10.1016/j.ins.2011.05.019zbMath1242.68220OpenAlexW1989307874MaRDI QIDQ433075
Publication date: 13 July 2012
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2011.05.019
Related Items
Multi-goal motion planning using traveling salesman problem in belief space ⋮ Hybrid evolutionary fuzzy learning scheme in the applications of traveling salesman problems
Uses Software
Cites Work
- A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons
- Solving a combinatorial problem via self-organizing process: An application of the Kohonen algorithm to the traveling salesman problem
- The Guilty net for the traveling salesman problem
- Neural methods for the traveling salesman problem: Insights from operations research
- The incorporation of an efficient initialization method and parameter adaptation using self-organizing maps to solve the TSP
- An new self-organizing maps strategy for solving the traveling salesman problem
- ``Conscientious neural nets for tour construction in the traveling salesman problem: The vigilant net
- A Neural-Network-Based Approach to the Double Traveling Salesman Problem
- Solution of a Large-Scale Traveling-Salesman Problem
- A new point-location algorithm and its practical efficiency: comparison with existing algorithms
- TSPLIB—A Traveling Salesman Problem Library
- A self-organising model for the travelling salesman problem
- Neural Networks for Combinatorial Optimization: A Review of More Than a Decade of Research
- Walking in a triangulation
- Dynamic and Robust Local Clearance Triangulations
- Autonomous Mobile Robots
