Polynomial modeling for time-varying systems based on a particle swarm optimization algorithm

  • Authors:

  • Kit Yan Chan;Tharam S. Dillon;C. K. Kwong

  • Affiliations:

  • Digital Ecosystem and Business Intelligence Institute, Curtin University of Technology, Perth, Western Australia, Australia;Digital Ecosystem and Business Intelligence Institute, Curtin University of Technology, Perth, Western Australia, Australia;Department of Industrial and Systems Engineering, The Hong Kong Polytechnic University, Hung Hom, Hong Kong

  • Venue:
  • Information Sciences: an International Journal
  • Year:
  • 2011

Quantified Score

Hi-index 0.07

Visualization

Abstract

In this paper, an effective particle swarm optimization (PSO) is proposed for polynomial models for time varying systems. The basic operations of the proposed PSO are similar to those of the classical PSO except that elements of particles represent arithmetic operations and variables of time-varying models. The performance of the proposed PSO is evaluated by polynomial modeling based on various sets of time-invariant and time-varying data. Results of polynomial modeling in time-varying systems show that the proposed PSO outperforms commonly used modeling methods which have been developed for solving dynamic optimization problems including genetic programming (GP) and dynamic GP. An analysis of the diversity of individuals of populations in the proposed PSO and GP reveals why the proposed PSO obtains better results than those obtained by GP.