Polynomial NARX model structure optimization using multi-objective genetic algorithm

Model structure selection is an important step in system identification which involves the selection of variables and terms of a model. The important issue is choosing a compact model representation where only significant terms are selected among all the possible ones beside good performance. This r...

全面介紹

Saved in:
書目詳細資料
Main Authors: Loghmanian, Sayed Mohammad Reza, Yusof, Rubiyah, Khalid, Marzuki, Ismail, Fatimah Sham
格式: Article
出版: ICIC International 2012
主題:
在線閱讀:http://eprints.utm.my/id/eprint/31140/
http://www.ijicic.org/ijicic-imip0206.pdf
標簽: 添加標簽
沒有標簽, 成為第一個標記此記錄!
id my.utm.31140
record_format eprints
spelling my.utm.311402019-03-25T08:18:13Z http://eprints.utm.my/id/eprint/31140/ Polynomial NARX model structure optimization using multi-objective genetic algorithm Loghmanian, Sayed Mohammad Reza Yusof, Rubiyah Khalid, Marzuki Ismail, Fatimah Sham TK Electrical engineering. Electronics Nuclear engineering Model structure selection is an important step in system identification which involves the selection of variables and terms of a model. The important issue is choosing a compact model representation where only significant terms are selected among all the possible ones beside good performance. This research explores the use of multi-objective optimization to minimize the complexity of a model structure and its predictive error simultaneously. The model structure representation is a polynomial non-linear auto- regressive with exogenous input model. A new modified elitist non-dominated sorting genetic algorithm using clustered crowding distance (CCD) is proposed to find the exact model among non-dominated solutions, using some simulated examples which generate data set by mathematical equations. Simulation results demonstrated that the proposed algorithm can find the correct model with exact terms and values in all cases of problem. Furthermore, the effectiveness of the proposed algorithm is also studied by applying to the real process data sets, and the final model can be chosen from a set of non-dominated solutions referred as Pareto optimal front. The results show that the proposed clustered CD has better performance compared with the basic CD method. ICIC International 2012 Article PeerReviewed Loghmanian, Sayed Mohammad Reza and Yusof, Rubiyah and Khalid, Marzuki and Ismail, Fatimah Sham (2012) Polynomial NARX model structure optimization using multi-objective genetic algorithm. International Journal of Innovative Computing, Information and Control (IJICIC), 8 (10B). pp. 7341-7362. ISSN 1349-4198 http://www.ijicic.org/ijicic-imip0206.pdf
institution Universiti Teknologi Malaysia
building UTM Library
collection Institutional Repository
continent Asia
country Malaysia
content_provider Universiti Teknologi Malaysia
content_source UTM Institutional Repository
url_provider http://eprints.utm.my/
topic TK Electrical engineering. Electronics Nuclear engineering
spellingShingle TK Electrical engineering. Electronics Nuclear engineering
Loghmanian, Sayed Mohammad Reza
Yusof, Rubiyah
Khalid, Marzuki
Ismail, Fatimah Sham
Polynomial NARX model structure optimization using multi-objective genetic algorithm
description Model structure selection is an important step in system identification which involves the selection of variables and terms of a model. The important issue is choosing a compact model representation where only significant terms are selected among all the possible ones beside good performance. This research explores the use of multi-objective optimization to minimize the complexity of a model structure and its predictive error simultaneously. The model structure representation is a polynomial non-linear auto- regressive with exogenous input model. A new modified elitist non-dominated sorting genetic algorithm using clustered crowding distance (CCD) is proposed to find the exact model among non-dominated solutions, using some simulated examples which generate data set by mathematical equations. Simulation results demonstrated that the proposed algorithm can find the correct model with exact terms and values in all cases of problem. Furthermore, the effectiveness of the proposed algorithm is also studied by applying to the real process data sets, and the final model can be chosen from a set of non-dominated solutions referred as Pareto optimal front. The results show that the proposed clustered CD has better performance compared with the basic CD method.
format Article
author Loghmanian, Sayed Mohammad Reza
Yusof, Rubiyah
Khalid, Marzuki
Ismail, Fatimah Sham
author_facet Loghmanian, Sayed Mohammad Reza
Yusof, Rubiyah
Khalid, Marzuki
Ismail, Fatimah Sham
author_sort Loghmanian, Sayed Mohammad Reza
title Polynomial NARX model structure optimization using multi-objective genetic algorithm
title_short Polynomial NARX model structure optimization using multi-objective genetic algorithm
title_full Polynomial NARX model structure optimization using multi-objective genetic algorithm
title_fullStr Polynomial NARX model structure optimization using multi-objective genetic algorithm
title_full_unstemmed Polynomial NARX model structure optimization using multi-objective genetic algorithm
title_sort polynomial narx model structure optimization using multi-objective genetic algorithm
publisher ICIC International
publishDate 2012
url http://eprints.utm.my/id/eprint/31140/
http://www.ijicic.org/ijicic-imip0206.pdf
_version_ 1643648676109746176
score 13.250246