Unit bit importance evolutionary algorithm

Soft Computing

Volumn 11, Issue 2, 2007, Pages 115-122

  Hong, Yi ^a   Ren, Qingsheng ^a   Zeng, Jin ^a  

^a SHANGHAI JIAO TONG UNIVERSITY   (China)

Author keywords

Bit importance; Convergent order of bit; Genetic algorithms; Weighted probability

Indexed keywords

EID: 33748362659     PISSN: 14327643     EISSN: 14337479     Source Type: Journal    
DOI: 10.1007/s00500-006-0057-7     Document Type: Article

References (15)

1. Holland JH (1992) Adaptation in nature and artificial system. MIT Press, Cambridge
2. Goldberg DE (1989) Genetic algorithms in search, optimization, and machine learning. Addison-Wesley, Reading
3. Fogel DB (1995) Evolutionary computation: Toward a new philosophy of machine intelligence. IEEE Press, Piscatway, New Jersey
4. Larranãga P, Lozano JA (2002) Estimation of distribution algoriothms. Kluwer, Dordrecht
5. Baluja S (1994) Population-based incremental learning: A method for intergrating genetic search based function optimization and competitive learning. Technical Report CMU-CS-94-163, Carnegie Mellon University, Pittsburg
6. Muhlenbein H, Mahnig T (1999) FDA - a scalable evolutionary algorithm of the optimization of additively decomposed functions. Evol Comput 7(4): 353-376
7. Harik G, Lobo FG, Goldberg DE (1998) The compacted genetic algorithms. In: Proceedings of the IEEE conference on evolutionary computation, pp 523-528
8. Muhlenbein H (1998) The equation for response to selection and its use for prediction. Evol Comput 5(3): 303-346
9. Muhlenbein H, Mahing T (2000) Evolutionary algorithms: From recombination to search distributions. In: Kallel L, Nandts B, Rogers A (eds) Theoretical aspects of evolutionary computation. Springer, Natural Computing, pp 137-176
10. Rudnick M (1992) Genetic algorithms and fitness variance with an application to automated design of artificial nueral networks. PhD thesis, Oregon Graduate Institute of Science and Technology.
11. Thierens D, Goldberg DE, Pereira AG (1998) Domino convergence, drift, and the temporal-salience structure of problems. In: Proceedings of the 1998 International conference on evolutionary computation, pp 535-540
12. Michalski RS (2000) Learnable evolutionaty model: Evolutionary processes guided by machine learning. Kluwer, Dordrecht, pp 9-40
13. Mühlenbein H, Mahnig T (2001) Comparing the adaptive Boltzmann selection schedule SDS to truncation selection systems. In: Proceedings of the Third International Symposium on Adaptive Systems, Havanna, pp 121-128
14. Hong Y, Ren Q, Zeng J (2005) Genetic drift in univariate marginal distribution algorithm. In: Genetic and evolutionary computation conference (GECCO2005), Washington, USA, pp 735-736
15. Shapiro L (2005) Drift and scaling in estimation of distribution algorithms. Evol Comput 13(1): 99-123