The Community for Technology Leaders
2012 ACM/IEEE/SCS 26th Workshop on Principles of Advanced and Distributed Simulation (2010)
Atlanta, GA
May 17, 2010 to May 19, 2010
ISBN: 978-1-4244-7292-5
pp: 1-9
Adelinde M Uhrmacher , Inst. of Comput. Sci., Univ. of Rostock, Rostock, Germany
Rene Schulz , Inst. of Comput. Sci., Univ. of Rostock, Rostock, Germany
Roland Ewald , Inst. of Comput. Sci., Univ. of Rostock, Rostock, Germany
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.
INDEX TERMS
portfolio selection problem, simulation algorithm portfolio, genetic algorithm, adaptive simulation replication
CITATION
Adelinde M Uhrmacher, Rene Schulz, Roland Ewald, "Selecting Simulation Algorithm Portfolios by Genetic Algorithms", 2012 ACM/IEEE/SCS 26th Workshop on Principles of Advanced and Distributed Simulation, vol. 00, no. , pp. 1-9, 2010, doi:10.1109/PADS.2010.5471673
78 ms
(Ver 3.3 (11022016))