| 書目名稱 | Multiobjective Heuristic Search |
| 副標(biāo)題 | An Introduction to i |
| 編輯 | Pallab Dasgupta,P. P. Chakrabarti,S. C. DeSarkar |
| 視頻video | http://file.papertrans.cn/641/640835/640835.mp4 |
| 概述 | This is the first book on multiobjective heuristic search. |
| 叢書名稱 | Computational Intelligence |
| 圖書封面 |  |
| 描述 | A large number of problems require the optimization of multiple criteria. These crite- ria are often non-commensurate and sometimes conflicting in nature making the task of optimization more difficult. In such problems, the task of creating a combined opti- mization function is often not easy. Moreover, the decision procedure can be affected by the sensitivity of the solution space, and the trade-off is often non-linear. In real life we traditionally handle such problems by suggesting not one, but several non-dominated solutions. Finding a set of non-dominated solutions is also useful in multistaged opti- mization problems, where the solution of one stage of optimization is passed on to the next stage. One classic example is that of circuit design, where high-level synthesis, logic synthesis and layout synthesis comprise important stages of optimization of the circuit. Passing a set of non-dominated partial solutions from one stage to the next typically ensures better global optimization. This book presents a new approach to multi-criteria optimization based on heuristic search techniques. Classical multicriteria optimization techniques rely on single criteria optimization algorith |
| 出版日期 | Book 19991st edition |
| 關(guān)鍵詞 | Algorithmen; Computational Intelligence; Multikriterien; Spielb?ume; Suchkriterien; Suchmethoden; Suchmode |
| 版次 | 1 |
| doi | https://doi.org/10.1007/978-3-322-86853-4 |
| isbn_softcover | 978-3-528-05708-4 |
| isbn_ebook | 978-3-322-86853-4Series ISSN 2522-0519 Series E-ISSN 2522-0527 |
| issn_series | 2522-0519 |
| copyright | Friedr. Vieweg & Sohn Verlagsgesellschaft mbH, Braunschweig/Wiesbaden 1999 |
|Archiver|手機(jī)版|小黑屋|
派博傳思國際
( 京公網(wǎng)安備110108008328)
GMT+8, 2025-10-13 19:03
發(fā)表于 2025-3-21 18:20:23
