Přístupnostní navigace
E-přihláška
Vyhledávání Vyhledat Zavřít
Detail publikačního výsledku
SKLENÁŘ, J.; POPELA, P.
Originální název
Integer simulation based optimization by local search
Anglický název
Druh
Článek recenzovaný mimo WoS a Scopus
Originální abstrakt
Simulation-based optimization combines simulation experiments used to evaluate the objective and/or constraint functions with an optimization algorithm. Compared with classical optimization, simulation based optimization brings its specific problems and restrictions. These are discussed in the paper. Evaluation of the objective function is based on time consuming, typically repeated simulation experiments. So we believe that the main objective in selecting the optimization algorithm is minimization of the number of objective function evaluations. In this paper we concentrate on integer optimization that is typical in simulation context. Local search algorithms that try to minimize the number of objective function evaluations are described. Examples with both analytical and simulationbased objective functions are used to demonstrate the performance of the algorithms.
Anglický abstrakt
Klíčová slova
Integer optimization; Local search; Simulation
Klíčová slova v angličtině
Autoři
Rok RIV
2016
Vydáno
30.05.2010
ISSN
1877-0509
Periodikum
Procedia Computer Science
Svazek
1
Číslo
Stát
Nizozemsko
Strany od
1341
Strany do
1348
Strany počet
8
BibTex
@article{BUT124192, author="Jaroslav {Sklenář} and Pavel {Popela}", title="Integer simulation based optimization by local search", journal="Procedia Computer Science", year="2010", volume="1", number="1", pages="1341--1348", issn="1877-0509" }