A Constructive Self-Organizing Network Applied to a Discrete Optimization Problem

  • Authors:
  • Thiago A. S. Masutti;Leandro N. de Castro

  • Affiliations:
  • -;-

  • Venue:
  • ISDA '07 Proceedings of the Seventh International Conference on Intelligent Systems Design and Applications
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

Most discrete optimization problems belong to the NP-complete or NP-hard classes. A benchmark prob- lem to assess the performance of new heuristics to solve these classes of problems is the traveling sales- man problem (TSP). This paper proposes some modifi- cations on a self-organizing network, named RABNET- TSP, to solve TSP problems. The modified algorithm is compared, with encouraging results, to other propos- als from the literature on a number of different TSP instances.