DocumentCode :
2227930
Title :
A Constructive Self-Organizing Network Applied to a Discrete Optimization Problem
Author :
Masutti, Thiago A S ; de Castro, Leandro N.
Author_Institution :
Catholic Univ. of Santos, Santos
fYear :
2007
fDate :
20-24 Oct. 2007
Firstpage :
52
Lastpage :
57
Abstract :
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.
Keywords :
travelling salesman problems; NP-complete; NP-hard classes; RABNET-TSP; constructive self-organizing network; discrete optimization problem; traveling salesman problem; Cities and towns; Design optimization; Intelligent networks; Intelligent systems; Laboratories; Neural networks; Neurons; Proposals; Self-organizing networks; Traveling salesman problems;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Intelligent Systems Design and Applications, 2007. ISDA 2007. Seventh International Conference on
Conference_Location :
Rio de Janeiro
Print_ISBN :
978-0-7695-2976-9
Type :
conf
DOI :
10.1109/ISDA.2007.37
Filename :
4389585
Link To Document :
بازگشت