By Topic

A fast optimization method of using nondominated sorting genetic algorithm (NSGA-II) and 1-nearest neighbor (1NN) classifier for numerical model calibration

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Y. Liu ; Dept. of Eng., Exeter Univ., UK ; C. Zhou ; W. J. Ye

Practical experience with numerical model calibration suggests that no single objective is adequate to measure the ways in which the model fails to match the important characteristics of the observed data. The multiobjective genetic algorithm (MOGA) is used as automatic calibration method for a wide range of numerical models. The task of estimating the entire Pareto set requires a large number of fitness evaluations in a standard MOGA optimization process. However, it's very time consuming to obtain a value of objective functions in many real-world engineering problems. The NSGA-II-1NN algorithm, an effective and efficient methodology to reduce the number of actual fitness evaluations for solving the multiple-objective global optimization problem, is presented in this paper. The test results for multiobjective calibration show that the proposed method only requires about 38 percent of actual fitness evaluations of the NSGA-II.

Published in:

2005 IEEE International Conference on Granular Computing  (Volume:2 )

Date of Conference:

25-27 July 2005