Most discrete optimization problems belong to the NP-complete or NP-hard classes. A benchmark problem to assess the performance of new heuristics to solve these classes of problems is the traveling salesman problem (TSP). This paper proposes some modifications on a self-organizing network, named RABNET- TSP, to solve TSP problems. The modified algorithm is compared, with encouraging results, to other proposals from the literature on a number of different TSP instances.
['Thiago A. S. Masutti', 'L.N. de Castro']
A Constructive Self-Organizing Network Applied to a Discrete Optimization Problem