Traveling Salesman Problem

Optimization with the Attractor-Based Search System

AvWeiqi Li

Häftad, Engelska, 2024

Del i serien Synthesis Lectures on Operations Research and Applications

534 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Fler format och utgåvor

Inbunden

532 kr

Beskrivning

This book presents a new search paradigm for solving the Traveling Salesman Problem (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.

Produktinformation

Utgivningsdatum:2024-07-27
Mått:168 x 240 x 9 mm
Vikt:274 g
Format:Häftad
Språk:Engelska
Serie:Synthesis Lectures on Operations Research and Applications
Antal sidor:141
Upplaga:2024
Förlag:Springer International Publishing AG
ISBN:9783031357213

Utforska kategorier

Mer om författaren

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

Innehållsförteckning

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.