| 书目名称 | Handbook of Metaheuristics | | 编辑 | Fred Glover,Gary A. Kochenberger | | 视频video | http://file.papertrans.cn/422/421649/421649.mp4 | | 丛书名称 | International Series in Operations Research & Management Science | | 图书封面 |  | | 描述 | Metaheuristics, in their original definition, are solution methods that orchestrate an interaction between local improvement procedures and higher level strategies to create a process capable of escaping from local optima and performing a robust search of a solution space. Over time, these methods have also come to include any procedures that employ strategies for overcoming the trap of local optimality in complex solution spaces, especially those procedures that utilize one or more neighborhood structures as a means of defining admissible moves to transition from one solution to another, or to build or destroy solutions in constructive and destructive processes. The degree to which neighborhoods are exploited varies according to the type of procedure. In the case of certain population-based procedures, such as genetic al- rithms, neighborhoods are implicitly (and somewhat restrictively) defined by reference to replacing components of one solution with those of another, by variously chosen rules of exchange popularly given the name of “crossover. ” In other population-based methods, based on the notion of path relinking, neighborhood structures are used in their full generality, in | | 出版日期 | Book 20031st edition | | 关键词 | Constraint satisfaction; algorithms; combinatorial optimization; genetic algorithms; genetic programming | | 版次 | 1 | | doi | https://doi.org/10.1007/b101874 | | isbn_ebook | 978-0-306-48056-0Series ISSN 0884-8289 Series E-ISSN 2214-7934 | | issn_series | 0884-8289 | | copyright | Springer-Verlag US 2003 |
The information of publication is updating
|
|
|Archiver|手机版|小黑屋|
派博传思国际
( 京公网安备110108008328)
GMT+8, 2025-8-6 07:19
发表于 2025-3-21 19:13:54
