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”

Inter-particle communication and search-dynamics of lbest particle swarm optimizers: An analysis

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F12%3A86092955" target="_blank" >RIV/61989100:27240/12:86092955 - isvavai.cz</a>

  • Result on the web

    <a href="http://dx.doi.org/10.1016/j.ins.2010.10.015" target="_blank" >http://dx.doi.org/10.1016/j.ins.2010.10.015</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1016/j.ins.2010.10.015" target="_blank" >10.1016/j.ins.2010.10.015</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Inter-particle communication and search-dynamics of lbest particle swarm optimizers: An analysis

  • Original language description

    Particle Swarm Optimization (PSO) is arguably one of the most popular nature-inspired algorithms for real parameter optimization at present. The existing theoretical research on PSO focuses on the issues like stability, convergence, and explosion of theswarm. However, all of them are based on the gbest (global best) communication topology, which usually is susceptible to false or premature convergence over multi-modal fitness landscapes. The present standard PSO (SPSO 2007) uses an lbest (local best) topology, where a particle is stochastically attracted not towards the best position found in the entire swarm, but towards the best position found by any particle in its topological neighborhood. This article presents a first step towards a probabilisticanalysis of the particle interaction and information exchange in an lbest PSO with variable random neighborhood topology (as found in SPSO 2007). It addresses issues like the distribution of particles over neighborhoods, the probability

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

  • CEP classification

    IN - Informatics

  • OECD FORD branch

Result continuities

  • Project

    <a href="/en/project/GA201%2F09%2F0990" target="_blank" >GA201/09/0990: XML data processing</a><br>

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Others

  • Publication year

    2012

  • 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

  • Name of the periodical

    Information sciences

  • ISSN

    0020-0255

  • e-ISSN

  • Volume of the periodical

    182

  • Issue of the periodical within the volume

    1

  • Country of publishing house

    NL - THE KINGDOM OF THE NETHERLANDS

  • Number of pages

    13

  • Pages from-to

    156-168

  • UT code for WoS article

    000297403300012

  • EID of the result in the Scopus database