Theory and practice of cellular UMDA for discrete optimization

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4193 LNCS, Issue , 2006, Pages 242-251

  Alba, E ^a   Madera, J ^b   Dorronsoro, B ^a   Ochoa, A ^c   Soto, M ^c  

^a UNIVERSITY OF MÁLAGA   (Spain)

^b UNIVERSIDAD DE CAMAGÜEY   (Cuba)

^c INSTITUTO DE CIBERNÉTICA   (Cuba)

Author keywords

[No Author keywords available]

Indexed keywords

DISCRETE TIME CONTROL SYSTEMS; OPTIMIZATION; PARAMETER ESTIMATION; PROBABILITY DISTRIBUTIONS; PROBLEM SOLVING;

CELLULAR UNIVARIATE MARGINAL DISTRIBUTION ALGORITHM (CUMDA); ESTIMATION OF DISTRIBUTION ALGORITHMS (EDA); NEIGHBORING SUBPOPULATIONS;

EVOLUTIONARY ALGORITHMS;

EID: 33750261477     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11844297_25     Document Type: Conference Paper

References (20)

1. Back, T., Fogel, D., Michalewicz, Z., eds.: Handbook of Evolutionary Computation. Oxford University Press (1997)
2. Alba, E., Dorronsoro, B.: The exploration/exploitation tradeoff in dynamic cellular evolutionary algorithms. IEEE TEC 9(2) (2005) 126-142
3. Mühlenbein, H., Paab, G.: From recombination of genes to the estimation of distributions I. Binary parameters. In: PPSN IV, Springer (1996) 178-187
4. Larrañaga, P., Lozano, J.A., eds.: Estimation of Distribution Algorithms. A New Tool for Evolutionary Computation. Kluwer Academic Publishers (2002)
5. Cantú-Paz, E.: Feature subset selection by estimation of distribution algorithms. In: GECCO, San Francisco, CA, Morgan Kaufmann (2002) 303-310
6. Pelikan, M., Mühlenbein, H.: The bivariate marginal distribution algorithm. Advances in Soft Computing-Engineering Design and Manufacturing (1999) 521-535
7. Alba, E., Troya, J.: Improving flexibility and efficiency by adding parallelism to genetic algorithms. Statistics and Computing 12(2) (2002) 91-114
8. Madera, J., Alba, E., Ochoa, A.: Parallel Estimation of Distribution Algorithms. In Alba, E., ed.: Parallel Metaheuristics: A New Class of Algorithms, John Wiley & Sons (2005) 203-222
9. Ochoa, A., Soto, M., Alba, E.: Cellular estimation of distribution algorithms. In preparation (2006)
10. Bosman, P., Thierens, D.: Advancing continuous IDEAs with mixture distributions and factorization selection metrics. In: OBUPM. (2001) 208-212
11. Spiessens, P., Manderick, B.: A massively parallel genetic algorithm. In Belew, R., Booker, L., eds.: 4th ICGA, Morgan Kaufmann (1991) 279-286
12. Baluja, S.: Structure and performance of fine-grain parallelism in genetic search. In Forrest, S., ed.: 6th ICGA, Morgan Kaufmann (1993) 155-162
13. Mühlenbein, H., Schomish, M., Born, J.: The parallel genetic algorithm as a function optimizer. Parallel Computing 17 (1991) 619-632
14. Manderick, B., Spiessens, P.: Fine-grained parallel genetic algorithm. In: 3rd ICGA. (1989) 428-433
15. Giacobini, M., Alba, E., Tomassini, M.: Selection intensity in asynchronous cellular evolutionary algorithms. In: GECCO, Springer Verlag (2003) 955-966
16. Schaffer, J., Eshelman, L.: On crossover as an evolutionary viable strategy. In: 4th ICGA, Morgan Kaufmann (1991) 61-68
17. Mühlenbein, H., Schlierkamp-Voosen, D.: The science of breeding and its application to the breeder genetic algorithm (BGA). Evol. Comp. 1 (1993) 335-360
18. Mahnig, T., Mühlenbein, H.: Comparing the adaptive Boltzmann selection schedule SDS to truncation selection. In: CIMAF. (1999) 121-128
19. Jong, K.D., Potter, M., Spears, W.: Using problem generators to explore the effects of epistasis. In: 7th ICGA, Morgan Kaufman (1997) 338-345
20. Stinson, D.: An Introduction to the Design and Analysis of Algorithms. The Charles Babbage Research Center, Canada (1985 (second edition, 1987))