-
Anglický jazyk
Traveling Salesman Problem (TSP): A Comparative Analysis
Autor: Khushmeet Kumar
In the traveling salesman problem (TSP), we have a network of cities connected by roads. We need to find a tour that visits each of the cities exactly once, minimizing the total distaThe TSP has several applications even in its purest formulation, such... Viac o knihe
Na objednávku, dodanie 2-4 týždne
44.35 €
bežná cena: 50.40 €
O knihe
In the traveling salesman problem (TSP), we have a network of cities connected by roads. We need to find a tour that visits each of the cities exactly once, minimizing the total distaThe TSP has several applications even in its purest formulation, such as planning, logistics, and the manufacture of microchips. Slightly modified, it appears as a sub-problem in many areas, such as genome sequencing. nce traveled. The work in this book has been focused on to solve the TSP of large size heuristically for optimization by thorough study of the various solution finding approaches (Genetic Algorithm, Tabu Search and Nearest Neighbor Approach) and to apply these approaches on selected TSP to find the optimal solution. Then analyze (compare) the obtained solutions and find the most efficient approach depending on the problem size.
- Vydavateľstvo: LAP LAMBERT Academic Publishing
- Rok vydania: 2012
- Formát: Paperback
- Rozmer: 220 x 150 mm
- Jazyk: Anglický jazyk
- ISBN: 9783659226700
Nemecký jazyk 