sBAM in solving Traveling Salesman Problem
Год выпуска: 2010 Автор: Boshir Ahmed and Abdullah Al Mohammad Издательство: LAP Lambert Academic Publishing Страниц: 64 ISBN: 9783838383705 Описание 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.
Похожие книги
Vivek S. Borkar, Vladimir Ejov, Jerzy A. Filar, Giang T. Nguyen. Hamiltonian Cycle Problem and Markov Chains (International Series in Operations Research & Management Science). – М.: , 2012. – 215 с. Kimball Fisher, Steven Rayner, William Belgard. Tips for Teams: A Ready Reference for Solving Common Team Problems. – М.: McGraw-Hill, 1995. – 234 с. Herbert N. Casson, Forbes P B C. Forbes Publishing Company. Tips for the Traveling Salesman. – М.: , 0. – 0 с. Eva Essa. A Practical Guide to Solving Preschool Behavior Problems, 5E. – М.: , 0. – 0 с. Decision Modeling and Behavior in Complex and Uncertain Environments (Springer Optimization and Its Applications). – М.: , 2008. – 364 с. Gary Harpst. Six Disciplines® Execution Revolution: Solving the One Business Problem That Makes Solving All Other Problems Easier. – М.: , 2008. – 208 с. HARRY WEBNE-BEHRMAN. The Practice of Facilitation: Managing Group Process and Solving Problems (pb) (GPG). – М.: , 2008. – 232 с. Solving Employee Performance Problems: How To Spot Problems Early, Take Appropriate Action, And Bring Out The Best In Everyone. – М.: , 2011. – 256 с. Zong Woo Geem. Optimal Design of Water Distribution Networks Using Harmony Search. – М.: LAP Lambert Academic Publishing, 2010. – 116 с. Muna Ali and Luma Tawfiq. Fast Feed Forward Neural Networks to Solve Boundary Value Problems. – М.: LAP Lambert Academic Publishing, 2012. – 120 с. Khushmeet Kumar. Traveling Salesman Problem (TSP): A Comparative Analysis. – М.: LAP Lambert Academic Publishing, 2012. – 120 с. Syed Tauhid Zuhori. Cloud Computing. – М.: LAP Lambert Academic Publishing, 2012. – 56 с. Nitish Sabharwal and Harshit Sharma. Approximate Algorithms for some NP-hard problems. – М.: LAP Lambert Academic Publishing, 2012. – 56 с. Adolphe Nikwigize. Route Ploblems. – М.: LAP Lambert Academic Publishing, 2012. – 52 с. Syed Tauhid Zuhori. Traveling Salesman Problem. – М.: LAP Lambert Academic Publishing, 2012. – 56 с. Darrell Lochtefeld. Multi-objectivization in Evolutionary Algorithms. – М.: LAP Lambert Academic Publishing, 2011. – 256 с. Boshir Ahmed and Abdullah Al Mohammad. sBAM in solving Traveling Salesman Problem. – М.: LAP Lambert Academic Publishing, 2010. – 64 с. Образцы работ
Задайте свой вопрос по вашей теме
Контакты
Поделиться
Мы в социальных сетях
Реклама
Отзывы
Ольга Мы наконец-то защитили реферат и очень даже успешно: на отлично.Спасибо Вам ещё раз за отличную работу