The Travelling Salesman Problem (TSP) is one of the problem, which has been addressed extensively by mathematicians, computer scientists and researchers. Since TSP finds its applications in real world problems viz., VLSI design, Art works, World tours, etc., finding an optimal solution to TSP will be a significant work as it will give better results for many TSP related applications. There are several methods and techniques to solve TSP. One of the best approaches to find an optimal solution to TSP is Genetic Algorithm, which gets the optimal solution from limited search space. Genetic Algorithm is also readily amenable to parallel implementation, which renders them usable in real-time. This book presents the genetic Algorithm method of solving TSP applications. The Genetic Algorithm control parameters namely initial population size, selection methods, crossover operators, mutation operators and repair operators are tuned to find the optimal tour in TSP. The impact of these Genetic Algorithm control parameters are analyzed and tuned to produce optimal results for Travelling Salesman Problem applications viz., VLSI Detailed Routing and National Tour.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Professor and Head(Dept.of Computer Science and Engg.) Rajalakshmi Engineering College, Chennai, India. Ph.D (Computer Science and Engineering). 15 years of experience in teaching and research. Published several technical papers in international journals,conferences and books. Editorial board member for various international journals.
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
Da: Lucky's Textbooks, Dallas, TX, U.S.A.
Condizione: New. Codice articolo ABLING22Oct2817100454407
Quantità: Più di 20 disponibili
Da: PBShop.store US, Wood Dale, IL, U.S.A.
PAP. Condizione: New. New Book. Shipped from UK. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Codice articolo L0-9783639307979
Quantità: Più di 20 disponibili
Da: California Books, Miami, FL, U.S.A.
Condizione: New. Codice articolo I-9783639307979
Quantità: Più di 20 disponibili
Da: PBShop.store UK, Fairford, GLOS, Regno Unito
PAP. Condizione: New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Codice articolo L0-9783639307979
Quantità: Più di 20 disponibili
Da: Ria Christie Collections, Uxbridge, Regno Unito
Condizione: New. In. Codice articolo ria9783639307979_new
Quantità: Più di 20 disponibili
Da: Chiron Media, Wallingford, Regno Unito
Paperback. Condizione: New. Codice articolo 6666-IUK-9783639307979
Quantità: 10 disponibili
Da: moluna, Greven, Germania
Kartoniert / Broschiert. Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Ramani Dr. R. GeethaProfessor and Head(Dept.of Computer Science and Engg.) Rajalakshmi Engineering College, Chennai, India. Ph.D (Computer Science and Engineering). 15 years of experience in teaching and research. Published. Codice articolo 4976184
Quantità: Più di 20 disponibili
Da: AHA-BUCH GmbH, Einbeck, Germania
Taschenbuch. Condizione: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - The Travelling Salesman Problem (TSP) is one of the problem, which has been addressed extensively by mathematicians, computer scientists and researchers. Since TSP finds its applications in real world problems viz., VLSI design, Art works, World tours, etc., finding an optimal solution to TSP will be a significant work as it will give better results for many TSP related applications. There are several methods and techniques to solve TSP. One of the best approaches to find an optimal solution to TSP is Genetic Algorithm, which gets the optimal solution from limited search space. Genetic Algorithm is also readily amenable to parallel implementation, which renders them usable in real-time. This book presents the genetic Algorithm method of solving TSP applications. The Genetic Algorithm control parameters namely initial population size, selection methods, crossover operators, mutation operators and repair operators are tuned to find the optimal tour in TSP. The impact of these Genetic Algorithm control parameters are analyzed and tuned to produce optimal results for Travelling Salesman Problem applications viz., VLSI Detailed Routing and National Tour. Codice articolo 9783639307979
Quantità: 2 disponibili
Da: Mispah books, Redhill, SURRE, Regno Unito
Paperback. Condizione: Like New. Like New. book. Codice articolo ERICA75836393079766
Quantità: 1 disponibili