请登录 0 购物车
首页 图书 电子图书 期刊 参考文献及会议录 作者,编辑,审稿 A-Z 产品目录
Flexible Automation and Intelligent Manufacturing, 1997:
Proceedings of the Seventh International FAIM Conference

ISBN 打印: 978-1-56700-089-4

ISBN 在线: 978-1-56700-442-7

PLUG AND PLAY FRAMEWORK FOR COMBINATORAL PROBLEM HEURISTICS

Abstract

Combinatorial problems such as the traveling salesperson, assignment and set-covering problems often rear their heads in process optimization. Because these problems are NP-hard, it remains unlikely that they will yield global optima at reasonable computational cost. Therefore, we must rely on heuristic techniques which seek good, albeit sub-optimal, solutions at an acceptable cost. To this end, meta-heuristic search strategies are interesting because they require very little problem specific knowledge. What little they do need to know about a problem can be encapsulated in a neighborhood operator which provides a mechanism for seeking local optima. Unfortunately, these operators can be very difficult to implement and in this paper we define a practical interface for enumerating neighbors. Once a neighborhood operator has been defined, dynamic strategy selection becomes possible. This means that meta-heuristic strategies, such as simulated annealing and tabu search, can be plugged into problem contexts at run-time.
首页 Begell Digital Portal Begell数据库 期刊 图书 电子图书 参考文献及会议录 作者,编辑,审稿 A-Z 产品目录 订购及政策 关于BegellHouse 联系我们 Language English 中文 Русский 日本語 Português Deutsch Français Español