Design of Heuristic Algorithms for Hard Optimization(Graduate Texts in Operations Research)

用于硬优化的启发式算法设计:使用 Python 代码解决旅行推销员问题

数量经济学

售   价:
442.00
发货周期:国外库房发货,通常付款后3-5周到货!
出  版 社
出版时间
2022年11月13日
装      帧
精装
ISBN
9783031137136
复制
页      码
287
语      种
英文
版      次
1
综合评分
暂无评分
我 要 买
- +
库存 30 本
  • 图书详情
  • 目次
  • 买家须知
  • 书评(0)
  • 权威书评(0)
图书简介
This open access book demonstrates all the steps required to design heuristic algorithms for difficult optimization. The classic problem of the travelling salesman is used as a common thread to illustrate all the techniques discussed. This problem is ideal for introducing readers to the subject because it is very intuitive and its solutions can be graphically represented. The book features a wealth of illustrations that allow the concepts to be understood at a glance. The book approaches the main metaheuristics from a new angle, deconstructing them into a few key concepts presented in separate chapters: construction, improvement, decomposition, randomization and learning methods. Each metaheuristic can then be presented in simplified form as a combination of these concepts. This approach avoids giving the impression that metaheuristics is a non-formal discipline, a kind of cloud sculpture. Moreover, it provides concrete applications of the travelling salesman problem, which illustrate in just a few lines of code how to design a new heuristic and remove all ambiguities left by a general framework. Two chapters reviewing the basics of combinatorial optimization and complexity theory make the book self-contained. As such, even readers with a very limited background in the field will be able to follow all the content.
本书暂无推荐
本书暂无推荐
看了又看
  • 上一个
  • 下一个