Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Univariate marginal distribution algorithms for non-stationary optimization problems

Univariate marginal distribution algorithms for non-stationary optimization problems The present work is an attempt to show an way of applying the univariate marginal distribution algorithm to non-stationary environments. The main idea used for this purpose is to introduce mutation (to increase diversity) as and when the environment or the optimization function changes. Simulation study is done on different time dependent versions of a function having simple but difficult landscape. Empirical studies reveal that for smaller shift in position of the optimum, the algorithm can trace this change almost instantaneously. But if the position of the optimum changes by a larger amount, the present algorithm cannot trace it. We also discuss the issue of performance measure for non-stationary environment, and propose a new measure called tractability in this respect. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png International Journal of Knowledge-Based and Intelligent Engineering Systems IOS Press

Univariate marginal distribution algorithms for non-stationary optimization problems

Loading next page...
 
/lp/ios-press/univariate-marginal-distribution-algorithms-for-non-stationary-D6opPDv4c3

References

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Publisher
IOS Press
Copyright
Copyright © 2004 by IOS Press, Inc
ISSN
1327-2314
eISSN
1875-8827
Publisher site
See Article on Publisher Site

Abstract

The present work is an attempt to show an way of applying the univariate marginal distribution algorithm to non-stationary environments. The main idea used for this purpose is to introduce mutation (to increase diversity) as and when the environment or the optimization function changes. Simulation study is done on different time dependent versions of a function having simple but difficult landscape. Empirical studies reveal that for smaller shift in position of the optimum, the algorithm can trace this change almost instantaneously. But if the position of the optimum changes by a larger amount, the present algorithm cannot trace it. We also discuss the issue of performance measure for non-stationary environment, and propose a new measure called tractability in this respect.

Journal

International Journal of Knowledge-Based and Intelligent Engineering SystemsIOS Press

Published: Jan 1, 2004

There are no references for this article.