Polynomial modeling in dynamic environment based on a particle swarm optimization

Abstract

In this chapter, a particle swarm optimization (PSO) is proposed for polynomial modeling in a dynamic environment. The basic operations of the proposed PSO are identical to the ones of the original PSO except that elements of particles represent arithmetic operations and polynomial variables of polynomial models. The performance of the proposed PSO is evaluated by polynomial modeling based on a set of dynamic benchmark functions in which their optima are dynamically moved. Results show that the proposed PSO can find significantly better polynomial models than genetic programming (GP) which is a commonly used method for polynomial modeling.