By Topic

Numerical method for global optimisation: dynamic encoding algorithm for searches

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 $33
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

2 Author(s)
J. -W. Kim ; Div. of Electr. & Comput. Eng., Pohang Univ. of Sci. & Technol., Kyungbuk, South Korea ; S. W. Kim

A fast and reliable non-gradient optimisation method is proposed. The basic structure of the proposed numerical method is a binary matrix in which each row represents an encoded string for the corresponding parameter. The operations of adding a binary digit and performing an increment or a decrement to a selected row make successive approximations of the local minima, and the restart is undertaken from an unexplored initial matrix as an escape scheme. To verify the feasibility of the proposed method for global optimisation, several test functions are optimised as a benchmark, and the parameter identification of an induction motor is carried out on experimental data. Both the results of the benchmarking and the parameter identification show that the proposed non-gradient optimisation method is capable of fast and reliable global search for various problems.

Published in:

IEE Proceedings - Control Theory and Applications  (Volume:151 ,  Issue: 5 )