By Topic

Optimizing reserve size in genetic algorithms with reserve selection using reinforcement learning

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

4 Author(s)
Yang Chen ; Graduate School of Information, Production and Systems, Waseda University, Kitakyushu, Japan ; Jinglu Hu ; Kotaro Hirasawa ; Songnian Yu

Recently, an improved genetic algorithm with a reserve selection mechanism (GARS) has been proposed to prevent premature convergence, where a parameter called reserve size plays an important role in optimization performance. In this paper, we propose an approach to the learning of an optimal reserve size in GARS based on the technique of reinforcement learning, where the learning model and algorithm are presented respectively. The experimental results demonstrate the effectiveness of learning algorithm in discovering the optimal reserve size accurately and efficiently.

Published in:

SICE, 2007 Annual Conference

Date of Conference:

17-20 Sept. 2007