Items related to The Traveling Salesman Problem: Optimization with the...
The Traveling Salesman Problem: Optimization with the Attractor-Based Search System (Synthesis Lectures on Operations Research and Applications) - Softcover
Synopsis
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.
"synopsis" may belong to another edition of this title.
About the Author
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).
From the Back Cover
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
"About this title" may belong to another edition of this title.
- PublisherSpringer
- Publication date2024
- ISBN 10 3031357213
- ISBN 13 9783031357213
- BindingPaperback
- LanguageEnglish
- Number of pages155
Buy New
View this item
£ 46.43
£ 9.27 shipping from Germany to United Kingdom
Destination, rates & speedsOther Popular Editions of the Same Title
Search results for The Traveling Salesman Problem: Optimization with the...
Stock Image
The Traveling Salesman Problem: Optimization with the Attractor-Based Search System (Synthesis Lectures on Operations Research and Applications)
Seller: Buchpark, Trebbin, Germany
Seller rating 5 out of 5 stars
Condition: Hervorragend. Zustand: Hervorragend | Seiten: 155 | Sprache: Englisch | Produktart: Bücher. Seller Inventory # 42822703/1
Quantity: 1 available
Seller Image
The Traveling Salesman Problem
Published by
Springer Nature Switzerland, Springer Nature Switzerland Jul 2024, 2024
ISBN 10: 3031357213
ISBN 13: 9783031357213
New
Taschenbuch
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: 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. Seller Inventory # 9783031357213
Quantity: 2 available
Seller Image
The Traveling Salesman Problem : Optimization with the Attractor-Based Search System
Published by
Springer Nature Switzerland, Springer Nature Switzerland, 2024
ISBN 10: 3031357213
ISBN 13: 9783031357213
New
Taschenbuch
Seller: AHA-BUCH GmbH, Einbeck, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: 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. Seller Inventory # 9783031357213
Quantity: 1 available
Seller Image
The Traveling Salesman Problem
Print on DemandSeller: moluna, Greven, Germany
Seller rating 5 out of 5 stars
Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Seller Inventory # 1780998328
Quantity: Over 20 available
Stock Image
The Traveling Salesman Problem
Seller: Majestic Books, Hounslow, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # 410760151
Quantity: 4 available
Seller Image
The Traveling Salesman Problem
Published by
Springer Nature Switzerland, Springer Nature Switzerland Jul 2024, 2024
ISBN 10: 3031357213
ISBN 13: 9783031357213
New
Taschenbuch
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: 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. Seller Inventory # 9783031357213
Quantity: 2 available
Stock Image
The Traveling Salesman Problem
Seller: Biblios, Frankfurt am main, HESSE, Germany
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # 18403442690
Quantity: 4 available