Algorithm Portfolios

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, andopen problems in the design of algorithm portfolios and applications are explored to further motivate research in this field.

• optimization algorithms
• inventory routing
• lot sizing
• facility location
• combinatorics
• metaheuristics
• open problems
• efficient algorithm portfolios
• trading-based budget allocation
• market-based algorithms
• Circulant weighing matrices
• sequential models
• parallel models
• algorithm portfolios
• constituent algorithms
• metaheuristic optimization algorithms

• Logistics Management Department, Helmut-Schmidt University, Hamburg, Germany

  Dimitris Souravlias

• Department of Computer Science & Engineering, University of Ioannina, Ioannina, Greece

  Konstantinos E. Parsopoulos

• Department of Physics & Computer Science, Wilfrid Laurier University, Waterloo, Canada

  Ilias S. Kotsireas

• Industrial and Systems Engineering, University of Florida, Gainesville, USA

  Panos M. Pardalos

Policies and ethics