Description

Book 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.



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.

The Traveling Salesman Problem: Optimization with

    Product form

    £31.49

    Includes FREE delivery

    RRP £34.99 – you save £3.50 (10%)

    Order before 4pm today for delivery by Sat 4 Jul 2026.

    A Hardback by Weiqi Li

    1 in stock

      Trusted by thousands of customers. See 2,385+ Customer Reviews

      View other formats and editions of The Traveling Salesman Problem: Optimization with by Weiqi Li

      Publisher: Springer International Publishing AG
      Publication Date: 09/07/2023
      ISBN13: 9783031357183, 978-3031357183
      ISBN10: 3031357183
      Also in:
      Operational research Applied mathematics Optimization

      Description

      Book 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.



      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.

      Recently viewed products

      © 2026 Book Curl

        • American Express
        • Apple Pay
        • Diners Club
        • Discover
        • Google Pay
        • Maestro
        • Mastercard
        • PayPal
        • Shop Pay
        • Union Pay
        • Visa

        Login

        Forgot your password?

        Don't have an account yet?
        Create account