Recomienda este artículo a tus amigos:
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
Precio
€ 42,49
Pedido desde almacén remoto
Entrega prevista 8 - 16 de ene. de 2026
Los regalos de Navidad se podrán canjear hasta el 31 de enero
Nuestros clientes opinan:
Añadir a tu lista de deseos de iMusic
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.
| Medios de comunicación | Libros Paperback Book (Libro con tapa blanda y lomo encolado) |
| Publicado | 13 de julio de 2010 |
| ISBN13 | 9783838383705 |
| Editores | LAP LAMBERT Academic Publishing |
| Páginas | 64 |
| Dimensiones | 225 × 4 × 150 mm · 113 g |
| Lengua | Alemán |
