Abstract
We design a new Genetic Algorithm based on Independent Component Analysis for unconstrained global optimization of continuous function. We use Independent Component Analysis to linearly transform the original dimensions of the problem into new components which are independent from each other with respect to the fitness. We project the population on the independent components and obtain corresponding sub-populations. We apply genetic operators on the sub-populations to generate new sub-populations, and combine them as a new population. In other words, we use Genetic Algorithm to find the optima on the independent components, and combine the optima as the global optimum for the problem. As we actually reduce the original high-dimensional problem into sub-problems of much fewer dimensions, the solution space decreases exponentially and thus the problem becomes easier for Genetic Algorithm to solve. The experiment results verified that our algorithm produced optimal or close-to-optimal solutions better than or comparable to those produced by some of other Genetic Algorithms and it required much less fitness evaluations of individuals.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Goldberg, D.E.: Genetic Algorithms in Search, Optimization & Machine Learning. Addison-Wesley, Reading (1989)
Holland, J.H.: Adaptation in Natural and Artificial Systems, 2nd edn. MIT Press, Cambridge, Mass (1992)
Hyvaerinen, A.: Fast and robust fixed-point algorithms for independent component analysis. IEEE-NNÂ 10(3), 626 (1999)
Hyvärinen, A., Oja, E.: Independent component analysis: Algorithms and applications. Neural Networks 13(4-5), 411–430 (2000)
Larranaga, P., Etxeberria, R., Lozano, J.A., Pena, J.M.: Optimization in continuous domains by learning and simulation of gaussian networks. In: Optimization By Building and Using Probabilistic, Las Vegas, Nevada, USA, July 8, 2000, pp. 201–204 (2000)
Larrañaga, P., Lozano, J.A.: Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation. Kluwer Academic Publishers, Norwell (2001)
Leung, Y.-W., Wang, Y.: An orthogonal genetic algorithm with quantization for global numerical optimization. IEEE-EC 5, 41–53 (2001)
Takahashi, M., Kita, H.: A crossover operator using independent component analysis for real-coded genetic algorithms. In: Proceedings of the 2001 Congress on Evolutionary Computation CEC 2001, COEX, World Trade Center, 159 Samseong-dong, Gangnam-gu, Seoul, Korea, May 27-30, 2001, pp. 643–649. IEEE Press, Los Alamitos (2001)
Yao, X., Liu, Y.: Fast evolution strategies. In: Angeline, P.J., McDonnell, J.R., Reynolds, R.G., Eberhart, R. (eds.) EP 1997. LNCS, vol. 1213, pp. 151–161. Springer, Heidelberg (1997)
Zhang, Q., Allinson, N.M., Yin, H.: Population optimization algorithm based on ICA. In: IEEE Symposium on Combinations of Evolutionary Computation and Neural Networks, May 02, 2000, pp. 33–36 (2000)
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
Li, G., Lee, K.H., Leung, K.S. (2006). Genetic Algorithm Based on Independent Component Analysis for Global Optimization. In: Runarsson, T.P., Beyer, HG., Burke, E., Merelo-Guervós, J.J., Whitley, L.D., Yao, X. (eds) Parallel Problem Solving from Nature - PPSN IX. PPSN 2006. Lecture Notes in Computer Science, vol 4193. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11844297_18
Download citation
DOI: https://doi.org/10.1007/11844297_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-38990-3
Online ISBN: 978-3-540-38991-0
eBook Packages: Computer ScienceComputer Science (R0)