By Topic

Training recurrent neural networks for dynamic system identification using parallel tabu search algorithm

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

2 Author(s)
Karaboga, D. ; Dept. of Electron. Eng., Erciyes Univ., Kayseri, Turkey ; Kalinli, A.

There are several modern heuristic optimisation techniques, such as neural networks, genetic algorithms, simulated annealing and tabu search algorithms. Of these algorithms, the tabu search is quite a new, promising search technique for numeric problems, especially for nonlinear problems. However, the convergence speed of the standard tabu search to the global optimum is initial-solution-dependent, since it is a form of iterative search. In this paper, a new model of tabu searching, which has been proposed by the authors to overcome the drawback of a standard tabu search, is tested for training a recurrent neural network to identify dynamic systems

Published in:

Intelligent Control, 1997. Proceedings of the 1997 IEEE International Symposium on

Date of Conference:

16-18 Jul 1997