sBAM in solving Traveling Salesman Problem

Name: sBAM in solving Traveling Salesman Problem
SKU: 25710385
Price: 124.99 AUD
Availability: InStock

By:

Format:

Paperback / softback

Show Hide Adult Content

$124.99

Available from supplier

Usually ships in 3-4 weeks

0 in Trolley

Price Match

Wrap this item as a gift ($5.90) - add a free gift card on the next page

Buy Now, Pay Later with:

4 payments of $31.25 with Afterpay Learn more

Availability

Delivering to:

Estimated arrival:

Around 24 Jul - 5 Aug using International Courier

Description

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.

Release date Australia

July 13th, 2010

Author

Pages

Audience

General (US: Trade)

Dimensions

152x229x4

ISBN-13

9783838383705

Product ID

25710385

Customer reviews

Nobody has reviewed this product yet. You could be the first!

Write a Review

Marketplace listings

There are no Marketplace listings available for this product currently.
Already own it? Create a free listing and pay just 9% commission when it sells!

Sell Yours Here

Get free delivery, exclusive deals, and more^*

Computers & Internet Books:

sBAM in solving Traveling Salesman Problem

By:

Format:

Buy Now, Pay Later with:

Availability

Description

Customer reviews

Marketplace listings

Help & options

Filed under...

Get free delivery, exclusive deals, and more*

Buy Now, Pay Later with:

Get free delivery, exclusive deals, and more^*