Integer simulation based optimization by local search

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26210%2F10%3APU118872" target="_blank" >RIV/00216305:26210/10:PU118872 - isvavai.cz</a>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Integer simulation based optimization by local search

Popis výsledku v původním jazyce

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 andrestrictions. 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.

Název v anglickém jazyce

Integer simulation based optimization by local search

Popis výsledku anglicky

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 andrestrictions. 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.

Druh

J_x - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)

CEP obor

BB - Aplikovaná statistika, operační výzkum

OECD FORD obor

—

Projekt

<a href="/cs/project/ED0002%2F01%2F01" target="_blank" >ED0002/01/01: NETME Centre (Nové technologie pro strojírenství)</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2010

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

Procedia Computer Science

ISSN

1877-0509

e-ISSN

—

Svazek periodika

1

Číslo periodika v rámci svazku

1

Stát vydavatele periodika

NL - Nizozemsko

Počet stran výsledku

8

Strana od-do

1341-1348

Kód UT WoS článku

—

EID výsledku v databázi Scopus

—