The Nested Genetic Agorithms for Distributed Optimization Problems

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26210%2F11%3APU95151" target="_blank" >RIV/00216305:26210/11:PU95151 - isvavai.cz</a>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

The Nested Genetic Agorithms for Distributed Optimization Problems

Popis výsledku v původním jazyce

Firstly, we review basic principles of the distributed modeling approach in optimization and present introduction to the formal framework based on the concept of a distributed optimization program. The framework is a general one and may be utilized for various classes of decision problems. The DOPs (distributed optimization programs) are introduced as syntactical entities containing certain optimization elements and based on composition rules. They may describe both basic and advanced mathematical programs (e.g., dynamic, stochastic, multistage, and hierarchical) and also game theory models. In addition, more complicated models can be derived from these building stones and further transformed in the syntactical correct way. Although the introduced descriptions are particularly designed for manipulations of programs structures, semantics for certain DOPs can also be defined. Hence, the next challenge is to search promising solutions in the feasible sets of optimization elements of DOPs.

Název v anglickém jazyce

The Nested Genetic Agorithms for Distributed Optimization Problems

Popis výsledku anglicky

Firstly, we review basic principles of the distributed modeling approach in optimization and present introduction to the formal framework based on the concept of a distributed optimization program. The framework is a general one and may be utilized for various classes of decision problems. The DOPs (distributed optimization programs) are introduced as syntactical entities containing certain optimization elements and based on composition rules. They may describe both basic and advanced mathematical programs (e.g., dynamic, stochastic, multistage, and hierarchical) and also game theory models. In addition, more complicated models can be derived from these building stones and further transformed in the syntactical correct way. Although the introduced descriptions are particularly designed for manipulations of programs structures, semantics for certain DOPs can also be defined. Hence, the next challenge is to search promising solutions in the feasible sets of optimization elements of DOPs.

Druh

D - Stať ve sborníku

CEP obor

JC - Počítačový hardware a software

OECD FORD obor

—

Projekt

—

Návaznosti

Z - Vyzkumny zamer (s odkazem do CEZ)

Rok uplatnění

2011

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 statě ve sborníku

Proceedings of The World Congress on Engineering and Computer Science 2011

ISBN

978-988-18210-9-6

ISSN

—

e-ISSN

—

Počet stran výsledku

5

Strana od-do

480-484

Název nakladatele

Neuveden

Místo vydání

Neuveden

Místo konání akce

San Francisco

Datum konání akce

19. 10. 2011

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

—