Optimizers Derived from Human Opinion Formation

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F11%3A00186233" target="_blank" >RIV/68407700:21230/11:00186233 - isvavai.cz</a>

Výsledek na webu

<a href="http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=6089618&tag=1" target="_blank" >http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=6089618&tag=1</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1109/NaBIC.2011.6089618" target="_blank" >10.1109/NaBIC.2011.6089618</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Optimizers Derived from Human Opinion Formation

Popis výsledku v původním jazyce

The human opinion formation can be understood as a social approach to optimization. In the real world, the opinions encode a candidate solution, which is evaluated by a complex and unknown fitness function. The computer models of such processes can be slightly modified by introducing a fitness value, which leads to novel family of optimization techniques. This paper demonstrates how the novel algorithms can be derived from opinion formation models and empirically proves their usability in the area of binary optimization. Particularly, it introduces a general SITO algorithmic framework and describes three algorithms based on this general framework - the previously proposed original distance-based (oSITO), the simplified (sSITO) and the Galam inspired (gSITO) algorithm.

Název v anglickém jazyce

Optimizers Derived from Human Opinion Formation

Popis výsledku anglicky

The human opinion formation can be understood as a social approach to optimization. In the real world, the opinions encode a candidate solution, which is evaluated by a complex and unknown fitness function. The computer models of such processes can be slightly modified by introducing a fitness value, which leads to novel family of optimization techniques. This paper demonstrates how the novel algorithms can be derived from opinion formation models and empirically proves their usability in the area of binary optimization. Particularly, it introduces a general SITO algorithmic framework and describes three algorithms based on this general framework - the previously proposed original distance-based (oSITO), the simplified (sSITO) and the Galam inspired (gSITO) algorithm.

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 2011 Third World Congress on Nature and Biologically Inspired Computing

ISBN

978-1-4577-1123-7

ISSN

—

e-ISSN

—

Počet stran výsledku

6

Strana od-do

359-364

Název nakladatele

IEEE - Systems, Man, and Cybernetics Society

Místo vydání

New York

Místo konání akce

Salamanca

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

—