Genetic Algorithms in Structure Identification for NARX Models
Genetic algorithms have been recently applied to model both linear and non-linear systems. Different methods of coding the problem solutions were proposed and were claimed to have good performance. This paper presents a comparative study of three of the methods with their strengths and weaknesses highlighted.
KeywordsGenetic Algorithm Hill Climber String Length Genetic Search NARX Model
Unable to display preview. Download preview PDF.
- J.E. Baker. Adaptive Selection Methods for Genetic Algorithms. In J.J. Grefenstette (editor), Proceedings ICGA’85, pages 101–111, Lawrence Erlbaum Associates, 1985.Google Scholar
- C.M. Fonseca, E.M. Mendes, P.J. Fleming, and S.A. Billings. Non-linear model term selection with genetic algorithms. Technical report, University of Sheffield, 1993.Google Scholar
- C.K.S. Ho. Tree structured GA in system identification. Technical report, University of Sunderland, 1995.Google Scholar
- C.J. Li and Y.C. Jeon. Genetic algorithms in identifying nonlinear auto regressive with exogenous inputs models for nonlinear systems. In Proc. Am Control Conf., pages 2305–2309. IEEE Press, 1993.Google Scholar
- B. McKay, M.J. Willis, and G.W. Barton. Using a tree structured genetic algorithm to perform symbolic regression. In GALESIA’95, pages 487–492. IEE, 1995.Google Scholar
- M.C. South. The Application of Genetic Algorithms to Rule Finding in Data Analysis. PhD thesis, University of Newcastle upon Tyne, UK. 1994.Google Scholar