Publ3 search

Z6_60GI02O0O8IDC0QEJUJ26TJDI4

> Publ3 search

Error:

Javascript is disabled in this browser. This page requires Javascript. Modify your browser's settings to allow Javascript to execute. See your browser's documentation for specific instructions.

Publikační činnost

Probíhá načítání, čekejte prosím...

Typ záznamu:	kapitola v odborné knize (C)
Domácí pracoviště:	Katedra matematiky (31100)
Název:	Competing Heuristics in Evolutionary Algorithms
Citace	Tvrdík, J., Mišík, L. a Křivý, I. Competing Heuristics in Evolutionary Algorithms. In: Intelligent Technologies-Theory and Applications. 1. vyd. Amsterdam, The Netherlands: IOS Press, 2002. s. 159-165. ISBN 978-1-58603-256-2.

Podnázev
Rok vydání:	2002
Obor:	Obecná matematika
Forma vydání:
Kód ISBN:	978-1-58603-256-2
Název knihy v originálním jazyce:	Intelligent Technologies-Theory and Applications
Název edice a číslo svazku:	Neuveden
Místo vydání:	Amsterdam, The Netherlands
Název nakladatele:	IOS Press
Označení vydání (číslo vydání):	1:
Vydáno:	v zahraničí
Autor zdrojového dokumentu:
Počet stran:	6
Počet stran knihy:
Strana od:	159
Strana do:	165
Počet výtisků knihy:
EID:

Klíčová slova anglicky:	Global optimization; evolutionary algorithms; heuristics; convergence; self-adaptation of algorithm
Popis v původním jazyce:	The paper deals with a class of evolutionary algorithms (EAs) for the global optimization. The special attention is paid to the controlled random search (CRS). A~generalization of the EA is proposed with several heuristics competing with each other when generating new trial points. The condition for asymptotic convergence of the algorithm are briefly discussed. Two instances of the EA with competing heuristics were implemented and the experimental results obtained on several test functions are presented.
Popis v anglickém jazyce:	The paper deals with a class of evolutionary algorithms (EAs) for the global optimization. The special attention is paid to the controlled random search (CRS). A~generalization of the EA is proposed with several heuristics competing with each other when generating new trial points. The condition for asymptotic convergence of the algorithm are briefly discussed. Two instances of the EA with competing heuristics were implemented and the experimental results obtained on several test functions are presented.

Seznam ohlasů

Ohlas

R01:	RIV/61988987:17310/02:00000014

Complementary Content

${loading}