Hybrid Genetic Programming for Optimal Approximation of High Order and Sparse Linear Systems

  • Authors:
  • Jing Liu;Wenlong Fu;Weicai Zhong

  • Affiliations:
  • Institute of Intelligent Information Processing, Xidian University Email: neouma@163.com, Xi'an, China;Institute of Intelligent Information Processing, Xidian University Email: neouma@163.com, Xi'an, China;Institute of Intelligent Information Processing, Xidian University Email: neouma@163.com, Xi'an, China

  • Venue:
  • SEAL '08 Proceedings of the 7th International Conference on Simulated Evolution and Learning
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

A Hybrid Genetic Programming (HGP) algorithm is proposed for optimal approximation of high order and sparse linear systems. With the intrinsic property of linear systems in mind, an individual in HGP is designed as an organization that consists of two cells. The nodes of the cells include a function and a terminal. All GP operators are designed based on organizations. In the experiments, three kinds of linear system approximation problems, namely stable, unstable, and high order and sparse linear systems, are used to test the performance of HGP. The experimental results show that HGP obtained a good performance in solving high order and sparse linear systems.