By Topic

On tracking-ability of a stochastic genetic algorithm to changing environments

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)
M. Munetomo ; Inf. & Data Analysis, Hokkaido Univ., Sapporo, Japan ; Y. Takai ; Y. Sato

A stochastic genetic algorithm (StGA) effectively searches an optimal action which maximizes the probability to have reward payoffs in stochastic environments by employing stochastic learning automata and genetic algorithms. This paper discusses the tracking ability of the StGA to environmental changes from theoretical and empirical points of view. In the theoretical investigation, we employ an inhomogeneous Markov chain to formulate state transition of the probability for a population of actions to have an optimal one. We perform theoretical investigations on change of the probability to create an optimal action and of the probability to lose all the optimal ones. Simulation experiments are performed to show the effectiveness of the StGA in changing environments whose penalty probability vectors gradually or suddenly change

Published in:

Systems, Man, and Cybernetics, 1996., IEEE International Conference on  (Volume:1 )

Date of Conference:

14-17 Oct 1996