Faites connaître cet article à vos amis:
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
Commandé depuis un entrepôt distant
Les cadeaux de Noël peuvent être échangés jusqu'au 31 janvier
Nos clients disent :
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.
| Médias | Livres Paperback Book (Livre avec couverture souple et dos collé) |
| Validé | 13 juillet 2010 |
| ISBN13 | 9783838383705 |
| Éditeurs | LAP LAMBERT Academic Publishing |
| Pages | 64 |
| Dimensions | 225 × 4 × 150 mm · 113 g |
| Langue et grammaire | Allemand |
Plus par Abdullah Al Mohammad
Afficher tout
Voir tous les Abdullah Al Mohammad ( par ex. Paperback Book )