<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>06019552</id>
  <dt>a</dt>
  <an>06019552</an>
  <augroup>
    <au>Witt, Carsten</au>
  </augroup>
  <ti>Theory of particle swarm optimization.</ti>
  <so>Auger, Anne (ed.) et al., Theory of randomized search heuristics. Foundations and recent developments. Hackensack, NJ: World Scientific (ISBN 978-981-4282-66-6/hbk; 978-981-4282-67-3/ebook). Series on Theoretical Computer Science 1, 197-223 (2011).</so>
  <py>2011</py>
  <pu>Hackensack, NJ: World Scientific</pu>
  <lagroup>
    <la>EN</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
    <li>http://ebooks.worldscinet.com/ISBN/9789814282673/9789814282673_0007.html</li>
  </ligroup>
  <abgroup>
    <ab>Summary: Particle swarm optimization (PSO) is a relatively young bio-inspired search heuristic whose biological ideal is the behavior of bird flocks, fish schools and similar swarms. This chapter elaborates on the theoretical approaches to PSO via convergence analyses and runtime analyses. It is shown how obstacles to rigorous analyses were overcome in recent years and how techniques for the runtime analysis of bio-inspired search heuristics are cross-fertilizing the domain of PSO algorithms.</ab>
    <rv></rv>
  </abgroup>
</item>