Selecting Simulation Algorithm Portfolios by Genetic Algorithms

  • Authors:
  • Roland Ewald;Rene Schulz;Adelinde M. Uhrmacher

  • Affiliations:
  • Inst. of Comput. Sci., Univ. of Rostock, Rostock, Germany;Inst. of Comput. Sci., Univ. of Rostock, Rostock, Germany;Inst. of Comput. Sci., Univ. of Rostock, Rostock, Germany

  • Venue:
  • PADS '10 Proceedings of the 2010 IEEE Workshop on Principles of Advanced and Distributed Simulation
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

An algorithm portfolio is a set of algorithms that are bundled together for increased overall performance. While being mostly applied to computationally hard problems so far, we investigate portfolio selection for simulation algorithms and focus on their application to adaptive simulation replication. Since the portfolio selection problem is itself hard to solve, we introduce a genetic algorithm to select the most promising portfolios from large sets of simulation algorithms. The effectiveness of this mechanism is evaluated by data from both a realistic performance study and a dedicated test environment.