Abstract
In this paper, a parallel self-adaptive subspace searching algorithm is proposed for solving dynamic function optimization problems. The new algorithm called DSSSEA uses a re-initialization strategy for gathering global information of the landscape as the change of fitness is detected, and a parallel subspace searching strategy for maintaining the diversity and speeding up the convergence in order to find the optimal solution before it changes. Experimental results show that DSSSEA can be used to track the moving optimal solutions of dynamic function optimization problems efficiently.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Tan, K.C., Goh, C.K.: Handing uncertainties in evolutionary multi-objective optimization. In: Zurada, J.M., Yen, G.G., Wang, J. (eds.) Computational Intelligence: Research Frontiers. LNCS, vol. 5050, pp. 262–292. Springer, Heidelberg (2008)
Grefenstette, J.J.: Genetic algorithms for changing environments. In: Maenner, R., Manderichk, B. (eds.) Parallel Problem Solving from Nature2, pp. 137–144. North-Holland, Amsterdam (1992)
Cobb, H.G.: An investigation into the use of hypermutation as an adaptive operator in genetic algorithms having continuous, time-dependent nonstationary environments. Technical Report AIC-90-001, Naval Research Laboratory, Washington, USA (1990)
Grefenstette, J.J.: Evolvability in Dynamic Fitness Landscapes: A Genetic Algorithm Approach. In: Proceedings of the Congress on Evolutionary Computation, CEC 1999, pp. 2031–2038. IEEE, Los Alamitos (1999)
Deb, K., Udaya Bhaskara Rao, N., Karthik, S.: Dynamic Multi-Objective Optimization and Decision-Making Using Modified NSGA II: A Case Study on Hydro-Thermal Power Scheduling. Kanpur Genetic Algorithm Lab(KanGAL), Indian Institute of Technology, Kanpur, India, Technical Report 2006008 (2006)
Bosman, P.A.N., Poutre, H.L.: Learning and Anticipation in Online Dynamic Optimization with Evolutionary Algorithms: The Stochastic Case. In: Proceedings of the Congress on Evolutionary Computation, CEC 2007, pp. 1165–1172. IEEE Press, Los Alamitos (2007)
Yu, X., Tang, K., Yao, X.: An immigrants scheme based on environmental information for genetic algorithms in changing environments. In: 2008 IEEE World Congress on Computational intelligence (CEC 2008), pp. 1141–1147. IEEE Press, Los Alamitos (2008)
Branke, J.: Evolutionary Optimization in Dynamic Environments. Kluwer Academic Publishers, Dordrecht (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Li, Y., Kang, Z., Kang, L. (2008). A Parallel Self-adaptive Subspace Searching Algorithm for Solving Dynamic Function Optimization Problems. In: Kang, L., Cai, Z., Yan, X., Liu, Y. (eds) Advances in Computation and Intelligence. ISICA 2008. Lecture Notes in Computer Science, vol 5370. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-92137-0_4
Download citation
DOI: https://doi.org/10.1007/978-3-540-92137-0_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-92136-3
Online ISBN: 978-3-540-92137-0
eBook Packages: Computer ScienceComputer Science (R0)