The Traveling Salesman Problem(Synthesis Lectures on Operations Research and Applications)

旅行商问题:基于吸引子的搜索系统优化

数学史

原   价:
676.00
售   价:
507.00
优惠
平台大促 低至8折优惠
发货周期:国外库房发货,通常付款后3-5周到货!
作      者
出  版 社
出版时间
2023年07月26日
装      帧
精装
ISBN
9783031357183
复制
页      码
141
语      种
英文
版      次
1
综合评分
暂无评分
我 要 买
- +
库存 30 本
  • 图书详情
  • 目次
  • 买家须知
  • 书评(0)
  • 权威书评(0)
图书简介
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 searchesPresents a new search paradigm for solving a NP-complete combinatorial problemIntroduces the use of the attractor concept in dynamical systems theory to reduce the search space for TSP
本书暂无推荐
本书暂无推荐