SBAM in solving Traveling Salesman Problem A Cost Efficient Algorithm sBAM in Comparison to Genetic Algorithm for Solving the Traveling Salesman Problem
-
- Englisch ausgewählt
Fr. 67.90
inkl. gesetzl. MwSt.,
Beschreibung
Produktdetails
Einband
Taschenbuch
Erscheinungsdatum
13.07.2010
Verlag
LAP LAMBERT Academic PublishingSeitenzahl
64
Maße (L/B/H)
22/15/0.4 cm
Gewicht
113 g
Auflage
1. Auflage
Sprache
Englisch
ISBN
978-3-8383-8370-5
The Traveling Salesman Problem (TSP) has already been solved in the semi-optimal manners using the numbers of different methods. Among them, genetic algorithms (GA) are pre-dominating. This paper presents a new approach to solve this problem using the Simplified Bi-directional Associative Memory (sBAM), a type of Artificial Neural Network. To get a comparative idea of its performance, the same problem has been solved using a genetic algorithm. In this paper, performance has been analyzed of a TSP by Genetic Algorithm (GA) and sBAM. Finally we proved that sBAM provide real time highly faster nearly optimal solutions than the genetic algorithm.
Noch keine Bewertungen vorhanden
Verfassen Sie die erste Bewertung zu diesem Artikel
Helfen Sie anderen Kundinnen und Kunden durch Ihre Meinung.