
Vertel uw vrienden over dit artikel:
Sbam in Solving Traveling Salesman Problem: a Cost Efficient Algorithm Sbam in Comparison to Genetic Algorithm for Solving the Traveling Salesman Problem
Abdullah Al Mohammad
Sbam in Solving Traveling Salesman Problem: a Cost Efficient Algorithm Sbam in Comparison to Genetic Algorithm for Solving the Traveling Salesman Problem
Abdullah Al Mohammad
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.
Media | Boeken Paperback Book (Boek met zachte kaft en gelijmde rug) |
Vrijgegeven | 13 juli 2010 |
ISBN13 | 9783838383705 |
Uitgevers | LAP LAMBERT Academic Publishing |
Pagina's | 64 |
Afmetingen | 225 × 4 × 150 mm · 113 g |
Taal en grammatica | Duits |
Meer door Abdullah Al Mohammad
Bekijk alles van Abdullah Al Mohammad ( bijv. Paperback Book )