Travelling Salesman Problem(TSP)optimization through Genetic Algorithm

Verfügbarkeit:
Auf Lager.
Artikelnummer:
1170677
  • Produktbeschreibung

    Travelling Salesman Problem(TSP)optimization through Genetic Algorithm

    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.
  • Zusatzinformation

    Autor
    Bindung
    Taschenbuch
    Verlag
    VDM Verlag Dr. Müller
    ISBN / EAN
    9783639307979
  • Sie könnten auch an folgenden Produkten interessiert sein

    Art.Nr. 1028277

    Reiß:Praxisbuch IT-Dokumentation

    46,30
    Art.Nr. 1479181

    Ramirez Molina:Diseño de una arquitectu

    71,00
    Art.Nr. 1459513

    Seibert,J.:Anwend.v.Semantic-Web Techn.

    50,40
  • 0 Kundenmeinungen

    Schreiben Sie selbst eine Rezension

    Ihre Meinung interessiert uns – und hilft anderen Kunden bei der Auswahl.

    Wenn Sie dieses Eingabefeld sehen sollten, lassen Sie es leer!