Articoli correlati a The Traveling Salesman Problem: Optimization with the...
Sinossi
This book presents a new search paradigm for solving the Traveling Salesman Problem (TSP). The intrinsic difficulty of the TSP is associated with the combinatorial explosion of potential solutions in the solution space. The author introduces the idea of using the attractor concept in dynamical systems theory to reduce the search space for exhaustive search for the TSP. Numerous examples are used to describe how to use this new search algorithm to solve the TSP and its variants including: multi-objective TSP, dynamic TSP, and probabilistic TSP. This book is intended for readers in the field of optimization research and application.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Informazioni sull?autore
Weiqi Li, PhD, is an Associate Professor at the University of Michigan – Flint and an affiliated faculty in the Michigan Institute for Data Science at the University of Michigan. His research interests include combinatorial optimization, heuristics, supply chain management, and artificial intelligence. Specifically, Dr. Li’s research focuses on new search methods to solve the traveling salesman problem (TSP).
Dalla quarta di copertina
This book presents a new search paradigm for solving the Traveling Salesman Problem (TSP). The intrinsic difficulty of the TSP is associated with the combinatorial explosion of potential solutions in the solution space. The author introduces the idea of using the attractor concept in dynamical systems theory to reduce the search space for exhaustive search for the TSP. Numerous examples are used to describe how to use this new search algorithm to solve the TSP and its variants including: multi-objective TSP, dynamic TSP, and probabilistic TSP. This book is intended for readers in the field of optimization research and application.
In addition, this book:
- Provides a complete understanding of the attractor concept in heuristic local searches
- Presents a new search paradigm for solving a NP-complete combinatorial problem
- Introduces the use of the attractor concept in dynamical systems theory to reduce the search space for TSP
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
Compra nuovo
Visualizza questo articolo
EUR 48,74
EUR 9,70 per la spedizione da Germania a Italia
Destinazione, tempi e costiAltre edizioni note dello stesso titolo
Risultati della ricerca per The Traveling Salesman Problem: Optimization with the...
Foto dell'editore
The Traveling Salesman Problem: Optimization with the Attractor-Based Search System (Synthesis Lectures on Operations Research and Applications)
Da: Buchpark, Trebbin, Germania
Valutazione del venditore 5 su 5 stelle
Condizione: Hervorragend. Zustand: Hervorragend | Seiten: 155 | Sprache: Englisch | Produktart: Bücher. Codice articolo 42822703/1
Quantità: 1 disponibili
Immagini fornite dal venditore
The Traveling Salesman Problem
Print on DemandDa: moluna, Greven, Germania
Valutazione del venditore 5 su 5 stelle
Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Codice articolo 1780998328
Quantità: Più di 20 disponibili
Immagini fornite dal venditore
The Traveling Salesman Problem
ISBN 10: 3031357213
ISBN 13: 9783031357213
Nuovo
Taschenbuch
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -This book presents a new search paradigm for solving the Traveling Salesman Problem (TSP). The intrinsic difficulty of the TSP is associated with the combinatorial explosion of potential solutions in the solution space. The author introduces the idea of using the attractor concept in dynamical systems theory to reduce the search space for exhaustive search for the TSP. Numerous examples are used to describe how to use this new search algorithm to solve the TSP and its variants including: multi-objective TSP, dynamic TSP, and probabilistic TSP. This book is intended for readers in the field of optimization research and application. 156 pp. Englisch. Codice articolo 9783031357213
Quantità: 2 disponibili
Immagini fornite dal venditore
The Traveling Salesman Problem : Optimization with the Attractor-Based Search System
Editore:
Springer Nature Switzerland, Springer Nature Switzerland, 2024
ISBN 10: 3031357213
ISBN 13: 9783031357213
Nuovo
Taschenbuch
Da: AHA-BUCH GmbH, Einbeck, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - This book presents a new search paradigm for solving the Traveling Salesman Problem (TSP). The intrinsic difficulty of the TSP is associated with the combinatorial explosion of potential solutions in the solution space. The author introduces the idea of using the attractor concept in dynamical systems theory to reduce the search space for exhaustive search for the TSP. Numerous examples are used to describe how to use this new search algorithm to solve the TSP and its variants including: multi-objective TSP, dynamic TSP, and probabilistic TSP. This book is intended for readers in the field of optimization research and application. Codice articolo 9783031357213
Quantità: 1 disponibili
Immagini fornite dal venditore
The Traveling Salesman Problem
ISBN 10: 3031357213
ISBN 13: 9783031357213
Nuovo
Taschenbuch
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: Neu. Neuware -This book presents a new search paradigm for solving the Traveling Salesman Problem (TSP). The intrinsic difficulty of the TSP is associated with the combinatorial explosion of potential solutions in the solution space. The author introduces the idea of using the attractor concept in dynamical systems theory to reduce the search space for exhaustive search for the TSP. Numerous examples are used to describe how to use this new search algorithm to solve the TSP and its variants including: multi-objective TSP, dynamic TSP, and probabilistic TSP. This book is intended for readers in the field of optimization research and application.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 156 pp. Englisch. Codice articolo 9783031357213
Quantità: 2 disponibili
Foto dell'editore
The Traveling Salesman Problem: Optimization with the Attractor-Based Search System (Synthesis Lectures on Operations Research and Applications)
Print on DemandDa: Biblios, Frankfurt am main, HESSE, Germania
Valutazione del venditore 5 su 5 stelle
Condizione: New. PRINT ON DEMAND pp. 156. Codice articolo 18403442690
Quantità: 4 disponibili