All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

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

The result's identifiers

  • Result code in 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>

  • Alternative codes found

    RIV/61989100:27740/14:86092657

  • Result on the web

    <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>

Alternative languages

  • Result language

    angličtina

  • Original language name

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

  • Original language description

    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.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

    IN - Informatics

  • OECD FORD branch

Result continuities

  • Project

    Result was created during the realization of more than one project. More information in the Projects tab.

  • Continuities

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

Others

  • Publication year

    2014

  • Confidentiality

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

Data specific for result type

  • Article name in the collection

    Proceedings of the 2014 IEEE Congress on Evolutionary Computation, CEC 2014

  • ISBN

    978-1-4799-1488-3

  • ISSN

  • e-ISSN

  • Number of pages

    6

  • Pages from-to

    1443-1448

  • Publisher name

    Institute of Electrical and Electronics Engineers

  • Place of publication

    New York

  • Event location

    Beijing

  • Event date

    Jul 6, 2014

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article