Cart (Loading....) | Create Account
Close category search window
 

A Method to Control Parameters of Evolutionary Algorithms by 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
$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

4 Author(s)
Sakurai, Y. ; Sch. of Inf. Environ., Tokyo Denki Univ., Chiba, Japan ; Takada, K. ; Kawabe, T. ; Tsuruta, S.

A search method using an evolutionary algorithm such as a genetic algorithm (GA) is very effective if the parameter is appropriately set. However, the optimum parameter setting was so difficult that each optimal method depending on each problem pattern must be developed one by one. Therefore, this has required special expertise and large amounts of verification experiment. In order to solve this problem, a new method called "adaptive parameter control" is proposed, which adaptively controls parameters of an evolutionary algorithm. However, since this method just increases the selection probability of a search operator that generated a well evaluated individual, this is apt to be a shortsighted optimization method. On the contrary, a method is proposed to realize longsighted optimal parameter control of GA using reinforcement learning. However, this method does neither consider the calculation cost of search operators nor multipoint search characteristics of GA. This paper proposes a method to efficiently control parameters of an evolutionary algorithm by using the reinforcement learning where the reward decision rules are elaborately incorporated under the consideration of GA's multipoint search characteristics and calculation cost of the search operator. It is expected that this method can efficiently learn parameters to optimally select search operators of GA for approximately solving Travelling Salesman Problems (TSPs).

Published in:

Signal-Image Technology and Internet-Based Systems (SITIS), 2010 Sixth International Conference on

Date of Conference:

15-18 Dec. 2010

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.