Algorithm Portfolios, 1st ed. 2021
◆Springer Nature Yellow Sale 開催中!:2024年6月23日(日)ご注文分まで
※上記表示の販売価格は割引適用後の価格です 出版済み 3週間でお届けいたします。 Advances, Applications, and Challenges Series: SpringerBriefs in Optimization Author: Souravlias, Dimitris / Parsopoulos, Konstantinos E. / Kotsireas, Ilias S. / Pardalos, Panos M. Publisher: Springer ISBN: 9783030685133 Cover: PAPERBACK Date: 2021年03月 DESCRIPTION This book covers algorithm portfolios, multi-method schemes that harness optimization algorithms into a joint framework to solve optimization problems. It is expected to be a primary reference point for researchers and doctoral students in relevant domains that seek a quick exposure to the field. The presentation focuses primarily on the applicability of the methods and the non-expert reader will find this book useful for starting designing and implementing algorithm portfolios. The book familiarizes the reader with algorithm portfolios through current advances, applications, and open problems. Fundamental issues in building effective and efficient algorithm portfolios such as selection of constituent algorithms, allocation of computational resources, interaction between algorithms and parallelism vs. sequential implementations are discussed. Several new applications are analyzed and insights on the underlying algorithmic designs are provided. Future directions, new challenges, and open problems in the design of algorithm portfolios and applications are explored to further motivate research in this field. Table of Contents 1. Metaheuristic optimization algorithms.- 2. Algorithm portfolios.- 3. Selection of constituent algorithms.- 4. Allocation of computation resources.- 5. Sequential and parallel models.- 6. Recent applications.- 7. Epilogue.- References. TABLE OF CONTENTS This book covers algorithm portfolios, multi-method schemes that harness optimization algorithms into a joint framework to solve optimization problems. It is expected to be a primary reference point for researchers and doctoral students in relevant domains that seek a quick exposure to the field. The presentation focuses primarily on the applicability of the methods and the non-expert reader will find this book useful for starting designing and implementing algorithm portfolios. The book familiarizes the reader with algorithm portfolios through current advances, applications, and open problems. Fundamental issues in building effective and efficient algorithm portfolios such as selection of constituent algorithms, allocation of computational resources, interaction between algorithms and parallelism vs. sequential implementations are discussed. Several new applications are analyzed and insights on the underlying algorithmic designs are provided. Future directions, new challenges, and open problems in the design of algorithm portfolios and applications are explored to further motivate research in this field.
|