Theoretical and practical aspects of ant colony optimization
著者
書誌事項
Theoretical and practical aspects of ant colony optimization
（Dissertationen zur Künstlichen Intelligenz, Bd. 282）
Infix, c2004
- Aka
- IOS Press
- タイトル別名
-
Theoretical and practical aspects of ACO
大学図書館所蔵 件 / 全1件
-
該当する所蔵館はありません
- すべての絞り込み条件を解除する
注記
"infix is a joint imprint of Akademische Verlagsgesellschaft Aka GmbH and IOS Press BV (Amsterdam)" -- T.p. verso
Includes bibliographical references (p. 257-280)
内容説明・目次
内容説明
Combinatorial optimization problems are of high academical and practical importance. Unfortunately, many of them belong to the class of NP-hard problems and are therefore intractable. In other words, as their dimension increases, the time needed by exact methods to find an optimal solution grows exponentially. Metaheuristics are approximate methods for attacking these problems. An approximate method is a technique that is applied in order to find a good enough solution in a reasonable amount of time. Examples of metaheuristics are simulated annealing, tabu search, evolutionary computation, and ant colony optimization (ACO), the subject of this book. The contributions of this book to ACO research are twofold. First, some new theoretical results are proven that improve our understanding of how ACO works. Second, a new framework for ACO algorithms is proposed that is shown to perform at the state-of-the-art level on some important combinatorial optimization problems such as the k-cardinality tree problem and the group shop scheduling problem, which is a general shop scheduling problem that includes among others the well-known job shop scheduling and the open shop scheduling problems.
「Nielsen BookData」 より