Autorenfreundlich Bücher kaufen?!
Beschreibung
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.
A Cost Efficient Algorithm sBAM in Comparison to Genetic Algorithm for Solving the Traveling Salesman Problem
Details
| Verlag | LAP LAMBERT Academic Publishing |
| Ersterscheinung | 13. Juli 2010 |
| Maße | 22 cm x 15 cm x 0.4 cm |
| Gewicht | 113 Gramm |
| Format | Softcover |
| ISBN-13 | 9783838383705 |
| Seiten | 64 |
Schlagwörter
Bekannt durch
