A novel sexual adaptive genetic algorithm based on two-step evolutionary scenario of baldwin effect and analysis of global convergence
Pages 737 - 744
Abstract
This work presents a novel sexual adaptive genetic algorithm (NSAGA) based on two-step evolutionary scenario of Baldwin effect to overcome the shortcomings of traditional genetic algorithms, such as premature convergence, stochastic roaming, and poor capabilities in local exploring. NSAGA simulates sexual reproduction in nature and utilizes an effective gender determination method to divide the evolutionary population into two different gender subgroups. Based on the competition, cooperation, and innate differences between two gender subgroups, NSAGA adaptively adjusts the sexual genetic operators. To guide the individuals' evolution, NSAGA adopts a two-step evolutionary scenario: NSAGA guides individuals in niche to forward or reverse evolutionary learning inspired by the acquired reinforcement learning theory based on Baldwin effect, and enables the transmission of fitness information between parents and offspring to supervise the offspring's evolution. Then, the global convergence analysis of NSAGA is presented in detail. It is theoretically proved that NSAGA can converge to the global optimum and the epsilon-optimal solution with probability one. Moreover, numerical simulations are conducted for a set of benchmark test functions, and the performance of NSAGA is compared with that of some evolutionary algorithms published recently. Experiments results show that the proposed algorithm is effective and advantageous.
References
[1]
Allen A. O. 1990. Probability statistics and queuing theory with computer science applications (2nd Ed). Boston, MA: Academic Press.
[2]
Anderson R. W. 1995. Learning and evolution: a quantitative genetics approach. J THEOR BIOL, 175(1): 89--101.
[3]
Andersson M. 1994. Sexual Selection. Princeton. Princeton University.
[4]
B?ck T. 1996. Evolutionary Algorithms in Theory and Practice. New York: Oxford University Press.
[5]
Baldwin J. M. 1896. A new factor in evolution. AM NAT, 30(3): 441--451.
[6]
Boers E. J. W., Borst M. V., and Sprinkhuizen-Kuyper I. G. 1995. Evolving artificial neural networks using the "Baldwin effect". In Proceedings of International Conference on Artificial Neural Nets and Genetic Algorithms. Al'es, France, pages 333--336.
[7]
Bull L. 1999. On the Baldwin Effect. ARTIF LIFE, 5(3): 241--246.
[8]
De Jong K. A. 1975. Analysis of the Behavior of a Class of Genetic Adaptive Systems {Dissertation}. Michigan: University of Michigan.
[9]
Dennis C., Gallagher R. 2001. The Human Genome. London: Nature Publishing Group.
[10]
Depew D. 2000. The Baldwin effect: an archaeology. Cybernetics & Human Knowing, 7(1): 7--20.
[11]
Gadagkar R. 1997. Survival Strategies Cooperation and Conflict in Animal Societies. Cambridge: Harvard University Press.
[12]
Goh K. S., Lim A., and Rodrigues B. 2003. Sexual selection for genetic algorithms. ARTIF INTELL REV, 19(2): 123--152.
[13]
Gruau F., Whitley D. 1993. Adding learning to the cellular development of neural networks: evolution and the Baldwin effect. EVOL COMPUT, 1(3): 213--233.
[14]
Herrera F., Lozano M. 2001. Adaptive genetic operators based on coevolution with fuzzy behaviors. IEEE T EVOLUT COMPUT, 5(2): 149--165.
[15]
Hinton G. E., Nowlan S. J. 1987. How learning can guide evolution. Complex Systems, 1: 495--502.
[16]
Holland J. H. 1975. Adaptation in Natural and Artificial Systems. Ann Arbor: The University of Michigan Press.
[17]
Kennedy J., Eberhart R. C. 1997. A discrete binary version of the particle swarm algorithm. In Proceedings of IEEE International Conference on Systems, Man, and Cybernetics. Orlando, USA, pages 4104--4108.
[18]
Ku K. W. C. 2006. Enhance the Baldwin effect by strengthening the correlation between genetic operators and learning methods. In Proceedings of IEEE Congr Evol Comput. Vancouver, Canada, pages 3302--3308.
[19]
Lee S., Soak S., Oh S., et al. 2008. Modified binary particle swarm optimization. PROG NAT SCI, 18(9): 1161--1166.
[20]
Lis J., Eiben A. E. 1997. A multi-sexual genetic algorithm for multiobjective optimization. In Proceedings of IEEE International Conference on Evolutionary Computation. Indianapolis, USA, pages 59--64.
[21]
Nolfi S., Elman J. L., and Parisi D. 1994. Learning and evolution in neural networks. ADAPT BEHAV, 3: 5--28.
[22]
Pampará G., Engelbrecht A. P., and Franken N. 2006. Binary differential evolution. In Proceedings of IEEE Congr Evol Comput. Vancouver, Canada, pages 1873--1879.
[23]
Pampará G., Franken N., and Engelbrecht A. P. 2005. Combining particle swarm optimisation with angle modulation to solve binary problems. In Proceedings of IEEE Congr Evol Comput. Edinburgh, UK, pages 89--96.
[24]
Raghuwanshi M. M., Kakde O. G. 2006. Genetic algorithm with species and sexual selection. In Proceedings of IEEE Conference on Cybernetics and Intelligent Systems. Bangkok, Thailand, pages 1--8.
[25]
Sanchez-Velazco J., Bullinaria J. A. 2003. Sexual selection with competitive/co-operative operators for genetic algorithms. In Proceedings of IASTED International Conference on Neural Networks and Computational Intelligence. Cancun, Mexico, pages 191--196.
[26]
Srinivas M., Patnaik L. M. 1994. Adaptive probabilities of crossover and mutation in genetic algorithm. IEEE T SYST MAN CYB, 24(4): 656--667.
[27]
Stearns S. C, Hoekstra R. F. 2001, Evolution. Oxford: Oxford University Press.
[28]
Suzuki R., Arita T. 2004. Interactions between learning and evolution: outstanding strategy generated by the Baldwin effect. BIOSYSTEMS, 77(1--3): 57--71.
[29]
Suzuki R., Arita T. 2007. The dynamic changes in roles of learning through the Baldwin effect. ARTIF LIFE, 13(1): 31--43.
[30]
Tsoulos I. G. 2008. Modifications of real code genetic algorithm for global optimization. APPL MATH COMPUT, 203(2): 598--607.
[31]
Vrajitoru D. 2002. Simulating gender separation with genetic algorithms. In Proceedings of Genetic and Evolutionary Computation Conference (GECCO2002). ACM Press, New York, USA, pages 634--641.
[32]
Wang Y. P., Dang C. 2007. An evolutionary algorithm for global optimization based on level-set evolution and Latin squares. IEEE T EVOLUT COMPUT, 11(5): 579--595.
[33]
Whitley D., Gordon V. S., and Mathias K. 1994. Lamarckian evolution, the Baldwin effect and function optimization. In: Parallel Problem Solving from Nature -- PPSN III. Berlin: Springer-Verlag, pages 6--15.
[34]
Zhao W. H., Wang W., and Wang Y. P. 2008. A novel evolutionary algorithm for global numerical optimization with continuous variables. PROG NAT SCI, 18(3): 345--351.
Index Terms
- A novel sexual adaptive genetic algorithm based on two-step evolutionary scenario of baldwin effect and analysis of global convergence
Recommendations
Niche Genetic Algorithm Based on Sexual Reproduction and Multimodal Function Optimization Problem
In this paper, a genetic algorithm with sexual reproduction and niche selection technology is proposed. Simple genetic algorithm has been successfully applied to many evolutionary optimization problems. But there is a problem of premature convergence for ...
A hybrid self-adaptive genetic algorithm based on sexual reproduction and Baldwin effect for global optimization
CEC'09: Proceedings of the Eleventh conference on Congress on Evolutionary ComputationGlobal optimization problems with numerous local and global optima are difficult to solve, which can trap traditional genetic algorithms. To solve the problems, a hybrid self-adaptive genetic algorithm based on sexual reproduction and Baldwin effect is ...
The baldwin effect on a memetic differential evolution for constrained numerical optimization problems
GECCO '17: Proceedings of the Genetic and Evolutionary Computation Conference CompanionThis paper analyzes the Baldwin effect on a memetic algorithm that solves constrained numerical optimization problems (CNOPS). For this study the canonical Differential Evolution (DE) enhanced with the Hooke-Jeeves method (HJ) as local search operator ...
Comments
Information & Contributors
Information
Published In
June 2009
1112 pages
ISBN:9781605583266
DOI:10.1145/1543834
- General Chairs:
- Lihong Xu,
- Erik D. Goodman,
- Program Chairs:
- Guoliang Chen,
- Darrell Whitley,
- Yongsheng Ding
Copyright © 2009 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 12 June 2009
Check for updates
Author Tags
Qualifiers
- Research-article
Conference
GEC '09: GEC '09 - ACM/SIGEVO Genetic and Evolutionary Computation Summit
June 12 - 14, 2009
Shanghai, China
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 175Total Downloads
- Downloads (Last 12 months)2
- Downloads (Last 6 weeks)0
Reflects downloads up to 02 Sep 2024
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in