Abstract
Unlike evaluation strategy (ES) and evaluation programming (EP), clonal selection algorithm (CSA) strongly depends on the given search space for the optimal solution problem. The interval of existing optimal solution is unknown in most practical problem, then the suitable search space can not be given and the performance of CSA are influence greatly. In this study, a self-adaptive search space expansion scheme and the clonal selection algorithm are integrated to form a new algorithm, Self Adaptive Clonal Selection Algorithm, termed as SACSA. It is proved that SACSA converges to global optimum with probability 1.Qualitative analyzes and experiments show that, compared with the standard genetic algorithm using the same search space expansion scheme, SACSA has a better performance in many aspects including the convergence speed, the solution precision and the stability. Then, we study more about the new algorithm on optimizing the time-variable function. SACSA has been confirmed that it is competent for solving global function optimization problems which the initial search space is unknown.
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
Zhong, W.C., Liu, J., Xue, M.Z., Jiao, L.C.: A Multiagent Genetic Algorithm for Global Numerical Optimization [J]. IEEE Trans. on Syst., Man, Cybern. A 34(2), 1136 (2004)
Cheng, S., Hwang, C.: Optimal Approximation of Linear Systems by a Differential Evolution Algorithm [J]. IEEE Trans. on Syst., Man, Cybern. A 31(6), 698–707 (2001)
Deb, K., Beyer, H.G.: Self-Adaptive Genetic Algorithm with Simulated Binary Crossover [J]. Evolutionary Computation 9(2), 137–221 (2001)
Cooper, K.D., Hall, M.W., Kennedy, K.: Procedure cloning[C]. In: Proceedings of the 1992 International Conference on Computer Languages, pp. 96–105 (1992)
Zhang, Z.K., Chen, H.C.: Stochastic Process (in Chinese), pp. 140–193. Xidian University Press, Xi’an (2003)
Swinburne, R.: Bayes’s Theorem. Oxford University Press, Oxford (2002)
Du, H.F., Jiao, L.C., Liu, R.C.: Adaptive Polyclonal Programming Algorithm with Applications. In: Proceedings of the Fifth International Conference on Computational Intelligence and Multimedia Applications (ICCIMA 2003), IEEE, Los Alamitos (2003)
Du, H.F., Jiao, L.C., Gong, M.G., Liu, R.C.: Adaptive Dynamic Clone Selection Algorithms. In: Zdzislaw, P., Lotfi, Z. (eds.) Proceedings of the Fourth International Conference on Rough Sets and Current Trends in Computing, Uppsala, Sweden, pp. 768–773 (2004)
Lydyard, P.M., Whelan, A., Fanger, M.W.: Instant notes in immunology. BIOS Scientific Publishers Limited, Beijing (2000)
Balazinska, M., Merlo, E., Dagenais, M., et al.: Advanced clone-analysis to support object-oriented system refactoring [C]. In: Proceedings Seventh Working Conference on Reverse Engineering, pp. 98–107 (2000)
Smaili, N.E., Sammut, C., Shirazi, G.M.: Behavioural cloning in control of a dynamic system[C]. In: IEEE International Conference on Systems, Man and Cybernetics Intelligent Systems for the 21st Century, March 1995, pp. 2904–2909 (1995)
Hybinette, M., Fujimoto, R.: Cloning: A Novel Method for Interactive Parallel Simulation[C]. In: Proceedings of the 1997 Winter Simulation Conference, pp. 444–451 (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sun, Y., Gong, M., Hao, L., Jiao, L. (2006). Clonal Selection Algorithm with Search Space Expansion Scheme for Global Function Optimization. In: Jiao, L., Wang, L., Gao, Xb., Liu, J., Wu, F. (eds) Advances in Natural Computation. ICNC 2006. Lecture Notes in Computer Science, vol 4221. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11881070_111
Download citation
DOI: https://doi.org/10.1007/11881070_111
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-45901-9
Online ISBN: 978-3-540-45902-6
eBook Packages: Computer ScienceComputer Science (R0)