Local Meta-models for ASM-MOMA

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F11%3A10105978" target="_blank" >RIV/00216208:11320/11:10105978 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Local Meta-models for ASM-MOMA

Original language description

Abstract. Evolutionary algorithms generally require a large number of objec- tive function evaluations which can be costly in practice. These evaluations can be replaced by evaluations of a cheaper meta-model of the objective functions. In this paper wedescribe a multiobjective memetic algorithm utilizing local distance based meta-models. This algorithm is evaluated and compared to standard multiobjective evolutionary algorithms as well as a similar algorithm with a global meta-model. The number of objective function evaluations is considered, and also the conditions under which the algorithm actually helps to reduce the time needed to ?nd a solution are analyzed.

Czech name

—

Czech description

—

Type

J_x - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

CEP classification

IN - Informatics

OECD FORD branch

—

Project

<a href="/en/project/GD201%2F09%2FH057" target="_blank" >GD201/09/H057: Res Informatica</a><br>

Continuities

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

Publication year

2011

Confidentiality

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

Name of the periodical

Lecture Notes in Computer Science

ISSN

0302-9743

e-ISSN

—

Volume of the periodical

Neuveden

Issue of the periodical within the volume

6838

Country of publishing house

DE - GERMANY

Number of pages

6

Pages from-to

147-152

UT code for WoS article

—

EID of the result in the Scopus database

—