The Traveling Salesman Problem: Optimization with the Attractor-Based Search System
暫譯: 旅行推銷員問題：基於吸引子搜尋系統的最佳化

Li, Weiqi

The Traveling Salesman Problem: Optimization with the Attractor-Based Search System
  • 出版商: Springer
  • 出版日期: 2024-07-27
  • 售價: $2,030
  • 貴賓價: 9.5 折 $1,929
  • 語言: 英文
  • 頁數: 141
  • 裝訂: Quality Paper - also called trade paper
  • ISBN: 3031357213
  • ISBN-13: 9783031357213

    • 海外代購書籍(需單獨結帳)

相關主題

商品描述

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.

商品描述(中文翻譯)

本書提出了一種新的搜尋範式來解決旅行推銷員問題（Traveling Salesman Problem, TSP）。TSP的內在難度與解決方案空間中潛在解決方案的組合爆炸有關。作者引入了在動態系統理論中使用吸引子概念的想法，以減少對TSP進行全面搜尋的搜尋空間。書中使用了許多範例來描述如何使用這種新的搜尋演算法來解決TSP及其變體，包括：多目標TSP、動態TSP和概率TSP。本書旨在為優化研究和應用領域的讀者提供參考。

作者簡介

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

作者簡介(中文翻譯)

韋奇·李（Weiqi Li），博士，是密西根大學-弗林特校區的副教授，並且是密西根大學數據科學研究所的附屬教員。他的研究興趣包括組合優化、啟發式方法、供應鏈管理和人工智慧。具體而言，李博士的研究專注於解決旅行推銷員問題（Traveling Salesman Problem, TSP）的新搜尋方法。

類似商品