Information Technology Reference
In-Depth Information
14. Beyer, H.-G.: An alternative explanation for the manner in which genetic algo-
rithms operate. BioSystems 41(1), 1-15 (1997)
15. Beyer, H.-G.: On the performance of (1, λ )-evolution strategies for the ridge
function class. IEEE Transactions on Evolutionary Computation 5(3), 218-235
(2001)
16. Beyer, H.-G.: The Theory of Evolution Strategies. Springer, Berlin (2001)
17. Beyer, H.-G., Meyer-Nieberg, S.: Self-adaptation on the ridge function class: First
results for the sharp ridge. In: Proceedings of the 9th Conference on Parallel
Problem Solving from Nature - PPSN IX, pp. 72-81 (2006)
18. Beyer, H.-G., Schwefel, H.-P.: Evolution strategies - A comprehensive introduc-
tion. Natural Computing 1, 3-52 (2002)
19. Bosman, P.A.N., Thierens, D.: Expanding from discrete to continuous estimation
of distribution algorithms: The idea. In: Schwefel, H.-P., Schoenauer, M., Deb,
K., Rudolph, G., Yao, X., Lutton, E., Merelo, J.J. (eds.) PPSN 2000. LNCS,
vol. 1917, pp. 767-776. Springer, Heidelberg (2000)
20. Bosman, P.A.N., Thierens, D.: Adaptive variance scaling in continuous multi-
objective estimation-of-distribution algorithms. In: Proceedings of the 9th con-
ference on genetic and evolutionary computation - GECCO, pp. 500-507. ACM
Press, New York (2007)
21. Broyden, C.G.: The convergence of a class of double-rank minimization algo-
rithms. I: General considerations. J. Inst. Math. 6, 76-90 (1970)
22. Cai, Y., Sun, X., Xu, H., Jia, P.: Cross entropy and adaptive variance scaling in
continuous eda. In: Proceedings of the 9th conference on genetic and evolutionary
computation - GECCO, pp. 609-616. ACM Press, New York (2007)
23. Coello Coello, C.A.: Treating constraints as objectives for single-objective evolu-
tionary optimization. Engineering Optimization 32(3), 275-308 (2000)
24. Coello Coello, C.A.: Use of a self-adaptive penalty approach for engineering op-
timization problems. Computers in Industry 41(2), 113-127 (2000)
25. Coello Coello, C.A.: Theoretical and numerical constraint handling techniques
used with evolutionary algorithms: A survey of the state of the art. Computer
Methods in Applied Mechanics and Engineering 191(11-12), 1245-1287 (2002)
26. Croes, G.: A method for solving traveling salesman problem. In: Operations Re-
search, pp. 791-812 (1992)
27. Titterington, U.M.D., Smith, A.: Statistical Analysis of Finite Mixture Distribu-
tions. Wiley, Chichester (1986)
28. Darwin, C.: On the Origin of Species. John Murray, London (1859)
29. Davidon, W.: Variable metric methods for minimization. SIAM Journal Opti-
mization 1, 1-17 (1991)
30. Davis, L.: Adapting operator probabilities in genetic algorithms. In: Proceedings
of the 3rd international conference on Genetic algorithms, pp. 61-69. Morgan
Kaufmann Publishers Inc., San Francisco (1989)
31. de Landgraaf, W., Eiben, A., Nannen, V.: Parameter calibration using meta-
algorithms. In: Proceedings of the IEEE Congress on Evolutionary Computation
- CEC, pp. 71-78 (2007)
32. Deb, K.: An ecient constraint handling method for genetic algorithms. Com-
puter Methods in Applied Mechanics and Engineering (2001)
33. Deb, K., Beyer, H.-G.: Self-adaptation in real-parameter genetic algorithms with
simulated binary crossover. In: Banzhaf, W., Daida, J., Eiben, A.E., Garzon,
M.H., Honavar, V., Jakiela, M., Smith, R.E. (eds.) Proceedings of the Genetic and
Evolutionary Computation Conference, vol. 1, pp. 172-179. Morgan Kaufmann
Publishers Inc., San Francisco (1999)
Search WWH ::




Custom Search