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.
| Autorius: | Boshir Ahmed, Abdullah Al Mohammad, |
| Leidėjas: | LAP LAMBERT Academic Publishing |
| Išleidimo metai: | 2010 |
| Knygos puslapių skaičius: | 64 |
| ISBN-10: | 3838383702 |
| ISBN-13: | 9783838383705 |
| Formatas: | 220 x 150 x 4 mm. Knyga minkštu viršeliu |
| Kalba: | Anglų |
Parašykite atsiliepimą apie „sBAM in solving Traveling Salesman Problem: A Cost Efficient Algorithm sBAM in Comparison to Genetic Algorithm for Solving the Traveling Salesman Problem“
