The Traveling Salesman Problem - Li, Weiqi; - Prospero Internet Bookshop
Basket (0)
Wishlist (0)
Your personal newsletter
__

The Traveling Salesman Problem: Optimization with the Attractor-Based Search System
 
Product details:
ISBN13:9783031357183
ISBN10:3031357183
Binding:Hardback
No. of pages:141 pages
Size:240x168 mm
Weight:450 g
Language:English
Illustrations: 58 Illustrations, black & white; 8 Illustrations, color
527
Category:

The Traveling Salesman Problem

Optimization with the Attractor-Based Search System
 
Edition number: 2024
Publisher: Springer
Date of Publication:
Number of Volumes: 1 pieces, Book
 
Normal price:
Publisher's listprice:
EUR 53.49
Estimated price in HUF:
22 690 HUF (21 609 HUF + 5% VAT)
Why estimated?
 
Your price:
20 874 (19 880 HUF + 5% VAT )
discount is: 8% (approx 1 815 HUF off)
The discount is only available for 'Alert of Favourite Topics' newsletter recipients.
Click here to subscribe.
 
Availability:
Estimated delivery time: In stock at the publisher, but not at Prospero's office. Delivery time approx. 3-5 weeks.
Not in stock at Prospero.
Can't you provide more accurate information?
 
Add to basket
  Piece(s)

 
Short description:

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

Long description:

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.

Table of Contents:

Introduction.- The Traveling Salesman Problem (TSP).- The Nature of Heuristic Local Search.- he Attractor-Based Search System.- Solving Multi-objective TSP.- Solving Dynamic TSP.- Solving Probabilistic TSP.- Conclusion.