sBAM in solving Traveling Salesman Problem: A Cost Efficient Algorithm sBAM in Comparison to Genetic Algorithm for Solving the Traveling Salesman Problem - Softcover

Ahmed, Boshir; Al Mohammad, Abdullah

Softcover

ISBN 10: 3838383702 ISBN 13: 9783838383705

Publisher: LAP LAMBERT Academic Publishing, 2010

Synopsis

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.

About this title

About the Authors

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.

Edition details

• Publisher: LAP LAMBERT Academic Publishing
• Publication date: 2010
• Language: English
• ISBN 10: 3838383702
• ISBN 13: 9783838383705
• Binding: Paperback
• Number of pages: 64