Skip to content
ISBN: 3838383702
ISBN13: 9783838383705

sBAM in solving Traveling Salesman Problem

ISBN: 3838383702
ISBN13: 9783838383705
Formats

Conditions

Formats

Conditions

See all 1 editions

Book Overview

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. This description may be from another edition of this product.
Format:
Paperback
Language:
English
ISBN:
3838383702
ISBN13:
9783838383705
Release Date:
July 2010
Publisher:
LAP Lambert Academic Publishing
Length:
64 Pages
Weight:
0.23 lbs.
Dimensions:
0.2″ × 6.0″ × 9.0″
ComputersComputers & Technology

More by Boshir Ahmed

Customer Reviews

0 customer ratings | 0 reviews
Write a Review

There are currently no reviews. Be the first to review this work.