Can deterministic chaos improve differential evolution for the linear ordering problem?

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F14%3A86092657" target="_blank" >RIV/61989100:27240/14:86092657 - isvavai.cz</a>

Nalezeny alternativní kódy

RIV/61989100:27740/14:86092657

Výsledek na webu

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

DOI - Digital Object Identifier

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

Jazyk výsledku

angličtina

Název v původním jazyce

Can deterministic chaos improve differential evolution for the linear ordering problem?

Popis výsledku v původním jazyce

Linear ordering problem is a popular NP-hard combinatorial optimization problem attractive for its complexity, rich library of test data, and variety of real world applications. It has been solved by a number of heuristic as well as metaheuristic methodsin the past. The implementation of nature-inspired metaheuristic optimization and search methods usually depends on streams of integer and floating point numbers generated in course of their execution. The pseudo-random numbers are utilized for an in-silico emulation of probability-driven natural processes such as arbitrary modification of genetic information (mutation, crossover), partner selection, and survival of the fittest (selection, migration) and environmental effects (small random changes in particle motion direction and velocity). Deterministic chaos is a well known mathematical concept that can be used to generate sequences of seemingly random real numbers within selected interval in a predictable and well controllable way.

Název v anglickém jazyce

Can deterministic chaos improve differential evolution for the linear ordering problem?

Popis výsledku anglicky

Linear ordering problem is a popular NP-hard combinatorial optimization problem attractive for its complexity, rich library of test data, and variety of real world applications. It has been solved by a number of heuristic as well as metaheuristic methodsin the past. The implementation of nature-inspired metaheuristic optimization and search methods usually depends on streams of integer and floating point numbers generated in course of their execution. The pseudo-random numbers are utilized for an in-silico emulation of probability-driven natural processes such as arbitrary modification of genetic information (mutation, crossover), partner selection, and survival of the fittest (selection, migration) and environmental effects (small random changes in particle motion direction and velocity). Deterministic chaos is a well known mathematical concept that can be used to generate sequences of seemingly random real numbers within selected interval in a predictable and well controllable way.

Druh

D - Stať ve sborníku

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

Výsledek vznikl pri realizaci vícero projektů. Více informací v záložce Projekty.

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2014

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 2014 IEEE Congress on Evolutionary Computation, CEC 2014

ISBN

978-1-4799-1488-3

ISSN

—

e-ISSN

—

Počet stran výsledku

6

Strana od-do

1443-1448

Název nakladatele

Institute of Electrical and Electronics Engineers

Místo vydání

New York

Místo konání akce

Beijing

Datum konání akce

6. 7. 2014

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

WRD - Celosvětová akce

Kód UT WoS článku

—