About: Can deterministic chaos improve differential evolution for the linear ordering problem?     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

AttributesValues
rdf:type
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 methods in 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. In the past, it has been used as a basis for various pseudo-random number generators with interesting properties. Recently, it has been shown that it can be successfully used as a source of stochasticity for nature-inspired algorithms solving a continuous optimization problem. In this work we compare effectiveness of the differential evolution with different pseudo-random number generators and chaotic systems as sources of stochasticity when solving the linear ordering problem.
  • 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 methods in 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. In the past, it has been used as a basis for various pseudo-random number generators with interesting properties. Recently, it has been shown that it can be successfully used as a source of stochasticity for nature-inspired algorithms solving a continuous optimization problem. In this work we compare effectiveness of the differential evolution with different pseudo-random number generators and chaotic systems as sources of stochasticity when solving the linear ordering problem. (en)
Title
  • Can deterministic chaos improve differential evolution for the linear ordering problem?
  • Can deterministic chaos improve differential evolution for the linear ordering problem? (en)
skos:prefLabel
  • Can deterministic chaos improve differential evolution for the linear ordering problem?
  • Can deterministic chaos improve differential evolution for the linear ordering problem? (en)
skos:notation
  • RIV/61989100:27740/14:86092657!RIV15-MSM-27740___
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • P(ED1.1.00/02.0070), P(EE.2.3.20.0072), P(GA13-08195S), S
http://linked.open...vai/riv/dodaniDat
http://linked.open...aciTvurceVysledku
http://linked.open.../riv/druhVysledku
http://linked.open...iv/duvernostUdaju
http://linked.open...titaPredkladatele
http://linked.open...dnocenehoVysledku
  • 6120
http://linked.open...ai/riv/idVysledku
  • RIV/61989100:27740/14:86092657
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • linear ordering problem; evolution; differential; deterministic (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...ontrolniKodProRIV
  • [5719549757C1]
http://linked.open...v/mistoKonaniAkce
  • Beijing
http://linked.open...i/riv/mistoVydani
  • New York
http://linked.open...i/riv/nazevZdroje
  • Proceedings of the 2014 IEEE Congress on Evolutionary Computation, CEC 2014
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...vavai/riv/projekt
http://linked.open...UplatneniVysledku
http://linked.open...iv/tvurceVysledku
  • Krömer, Pavel
  • Snášel, Václav
  • Zelinka, Ivan
http://linked.open...vavai/riv/typAkce
http://linked.open.../riv/zahajeniAkce
number of pages
http://bibframe.org/vocab/doi
  • 10.1109/CEC.2014.6900589
http://purl.org/ne...btex#hasPublisher
  • Institute of Electrical and Electronics Engineers
https://schema.org/isbn
  • 978-1-4799-1488-3
http://localhost/t...ganizacniJednotka
  • 27740
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 77 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software