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.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
Boshir Ahmed is an Assistant Professor in the Department of Computer Science and Engineering at Rajshahi University of Engineering and Technology (RUET), Bangladesh. His research interests include Microprocessor Based System Design, Digital Communication Systems, Computer Networking, Neural Network, Digital System Design and Algorithms.
Boshir Ahmed is an Assistant Professor in the Department of Computer Science and Engineering at Rajshahi University of Engineering and Technology (RUET), Bangladesh. His research interests include Microprocessor Based System Design, Digital Communication Systems, Computer Networking, Neural Network, Digital System Design and Algorithms.
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
Anbieter: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Deutschland
Taschenbuch. Zustand: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 64 pp. Englisch. Bestandsnummer des Verkäufers 9783838383705
Anzahl: 2 verfügbar
Anbieter: Books Puddle, New York, NY, USA
Zustand: New. pp. 64. Bestandsnummer des Verkäufers 26131721281
Anzahl: 4 verfügbar
Anbieter: Majestic Books, Hounslow, Vereinigtes Königreich
Zustand: New. Print on Demand pp. 64 2:B&W 6 x 9 in or 229 x 152 mm Perfect Bound on Creme w/Gloss Lam. Bestandsnummer des Verkäufers 128866206
Anzahl: 4 verfügbar
Anbieter: Biblios, Frankfurt am main, HESSE, Deutschland
Zustand: New. PRINT ON DEMAND pp. 64. Bestandsnummer des Verkäufers 18131721291
Anzahl: 4 verfügbar
Anbieter: moluna, Greven, Deutschland
Zustand: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Ahmed BoshirBoshir Ahmed is an Assistant Professor in the Department of Computer Science and Engineering at Rajshahi University of Engineering and Technology (RUET), Bangladesh. His research interests include Microprocessor Based Sys. Bestandsnummer des Verkäufers 5418627
Anzahl: Mehr als 20 verfügbar
Anbieter: buchversandmimpf2000, Emtmannsberg, BAYE, Deutschland
Taschenbuch. Zustand: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 64 pp. Englisch. Bestandsnummer des Verkäufers 9783838383705
Anzahl: 1 verfügbar
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Taschenbuch. Zustand: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - 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. Bestandsnummer des Verkäufers 9783838383705
Anzahl: 1 verfügbar
Anbieter: preigu, Osnabrück, Deutschland
Taschenbuch. Zustand: Neu. sBAM in solving Traveling Salesman Problem | A Cost Efficient Algorithm sBAM in Comparison to Genetic Algorithm for Solving the Traveling Salesman Problem | Boshir Ahmed (u. a.) | Taschenbuch | 64 S. | Englisch | 2010 | LAP LAMBERT Academic Publishing | EAN 9783838383705 | Verantwortliche Person für die EU: BoD - Books on Demand, In de Tarpen 42, 22848 Norderstedt, info[at]bod[dot]de | Anbieter: preigu Print on Demand. Bestandsnummer des Verkäufers 107464905
Anzahl: 5 verfügbar
Anbieter: Mispah books, Redhill, SURRE, Vereinigtes Königreich
paperback. Zustand: New. NEW. SHIPS FROM MULTIPLE LOCATIONS. book. Bestandsnummer des Verkäufers ERICA82938383837026
Anzahl: 1 verfügbar