Runtime analysis of discrete particle swarm optimization algorithms: A survey

Mühlenthaler M, Raß A (2019)

Publication Type: Journal article, Original article

Publication year: 2019

Journal

it - Information Technology Gesellschaft für Informatik

Book Volume: 61

Pages Range: 177–185

Journal Issue: 4

DOI: 10.1515/itit-2019-0009

Abstract

A discrete particle swarm optimization (PSO) algorithm is a randomized search heuristic for discrete optimization problems. A fundamental question about randomized search heuristics is how long it takes, in expectation, until an optimal solution is found. We give an overview of recent developments related to this question for discrete PSO algorithms. In particular, we give a comparison of known upper and lower bounds of expected runtimes and briefly discuss the techniques used to obtain these bounds.

Authors with CRIS profile

Alexander Raß Professur für Informatik (Effiziente Algorithmen und Kombinatorische Optimierung)

Related research project(s)

Partikelschwarm-Optimierung (PSO) July 24, 2008 - Aug. 28, 2020

Involved external institutions

Technische Universität Dortmund DE Germany (DE)

How to cite

APA:

Mühlenthaler, M., & Raß, A. (2019). Runtime analysis of discrete particle swarm optimization algorithms: A survey. it - Information Technology, 61(4), 177–185. https://dx.doi.org/10.1515/itit-2019-0009

MLA:

Mühlenthaler, Moritz, and Alexander Raß. "Runtime analysis of discrete particle swarm optimization algorithms: A survey." it - Information Technology 61.4 (2019): 177–185.

BibTeX: Download