| Abstract: |  This diploma thesis is focused on evaluating a new promising multi-start optimization algorithm called MetaMax. The main goal is to assess its utility it in the area of black-box continuous parameter optimization, especially in comparison with other strategies commonly used in this area. To achieve this, MetaMax and a selection of traditional restart strategies are thoroughly tested on a large set of benchmark problems and using multiple dierent local search algorithms. Their results are then compared and evaluated. An additional goal is to suggest and implement modi cations of the MetaMax algorithm, in certain areas where it seems that there could be a potential room for improvement.
|
|---|