Home // ADVCOMP 2013, The Seventh International Conference on Advanced Engineering Computing and Applications in Sciences // View article

Improving the Performance of Particle Swarm Optimization Algorithm With a Dynamic Search Space

Authors:
Benoit Vallade
Tomoharu Nakashima

Keywords: algorithm of non-deterministic search; particle

Abstract:
This paper addresses an improvement idea for Particle Swarm Optimization Algorithm (PSO). As a search algorithm, the PSO is used to tune a set of parameters and find the best combination of parameter values for this set. These parameters habitually take their values in a static search space. This paper proposes a solution to improve the efficiency of the algorithm with optimization problems using parameters, which take their values in dynamic space. The appreciable experiments’ results prove that this one is an efficient solution to such problems.

Pages: 43 to 48

Copyright: Copyright (c) IARIA, 2013

Publication date: September 29, 2013

Published in: conference

ISSN: 2308-4499

ISBN: 978-1-61208-290-5

Location: Porto, Portugal

Dates: from September 29, 2013 to October 3, 2013