dPSO-vis: topology-based visualization of discrete particle swarm optimization

  • Authors:

  • S. Volke;M. Middendorf;M. Hlawitschka;J. Kasten;D. Zeckzer;G. Scheuermann

  • Affiliations:

  • University of Leipzig, Germany;University of Leipzig, Germany;University of Leipzig, Germany;University of Leipzig, Germany;University of Kaiserslautern, Germany;University of Leipzig, Germany

  • Venue:
  • EuroVis '13 Proceedings of the 15th Eurographics Conference on Visualization
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

Particle swarm optimization (PSO) is a metaheuristic that has been applied successfully to many continuous and combinatorial optimization problems, e.g., in the fields of economics, engineering, and natural sciences. In PSO, a swarm of particles moves within a search space in order to find an optimal solution. Unfortunately, it is hard to understand in detail why and how changes in the design of PSO algorithms affect the optimization behavior. Visualizing the particle states could provide substantially better insight into PSO algorithms. Though in case of combinatorial optimization problems, it often raises the problem of illustrating the states within the discrete search space that cannot be embedded spatially. We propose a visualization approach to depict the optimization problem topologically using a landscape metaphor. This visualization is augmented by an illustration of the time-dependent states of the particles. Thus, the user of dPSO-Vis is able to analyze the swarm's behavior within the search space. In principle, our method can be used for any optimization algorithm where a swarm of individuals searches within a discrete search space. Our approach is verified with a case study for the PSO algorithm HelixPSO that predicts the secondary structure of RNA molecules.