Editore: Springer Nature Switzerland, 2023
ISBN 10: 3031357183 ISBN 13: 9783031357183
Lingua: Inglese
Da: Buchpark, Trebbin, Germania
Condizione: Hervorragend. Zustand: Hervorragend | Seiten: 156 | Sprache: Englisch | Produktart: Bücher.
Da: Buchpark, Trebbin, Germania
Condizione: Hervorragend. Zustand: Hervorragend | Seiten: 155 | Sprache: Englisch | Produktart: Bücher.
Da: Ria Christie Collections, Uxbridge, Regno Unito
EUR 55,16
Convertire valutaQuantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. In.
Da: Revaluation Books, Exeter, Regno Unito
EUR 54,39
Convertire valutaQuantità: 1 disponibili
Aggiungi al carrelloHardcover. Condizione: Brand New. 155 pages. 9.45x6.61x0.55 inches. In Stock.
Editore: Springer Nature Switzerland, Springer Nature Switzerland, 2024
ISBN 10: 3031357213 ISBN 13: 9783031357213
Lingua: Inglese
Da: AHA-BUCH GmbH, Einbeck, Germania
EUR 53,49
Convertire valutaQuantità: 1 disponibili
Aggiungi al carrelloTaschenbuch. 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.
Editore: Springer Nature Switzerland, Springer Nature Switzerland, 2023
ISBN 10: 3031357183 ISBN 13: 9783031357183
Lingua: Inglese
Da: AHA-BUCH GmbH, Einbeck, Germania
EUR 53,49
Convertire valutaQuantità: 1 disponibili
Aggiungi al carrelloBuch. 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.