Mutation by imitation in boolean evolution strategies

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

Volumn 1141, Issue , 1996, Pages 356-365

  Sebag, Michele ^a   Schoenauer, Marc ^b  

^a ECOLE POLYTECHNIQUE   (France)

^b CENTRE DE MATHÉMATIQUES APPLIQUÉES   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EVOLUTIONARY ALGORITHMS; OPTIMIZATION;

ADAPTIVE HEURISTICS; DECEPTIVE PROBLEM; DISCRETE VARIABLES; EVOLUTION STRATEGIES; EXCHANGE OF INFORMATION; KNAPSACK OPTIMIZATION; MUTATION OPERATORS; REAL-VALUED VARIABLES;

PROBLEM SOLVING;

EID: 84958978316     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61723-X_1000     Document Type: Conference Paper

References (28)

1. T. Back and M. Schiitz. Evolution strategies for mixed-integer optimization of optical multi-layer systems. In J. R. McDonnell, R. G. Reynolds, and D. B. Fogel, editors, Proceedings of the 4th Annual Conference on Evolutionary Programming. MIT Press, March 1995.
2. T. Back and H.-P. Schwefel. An overview of evolutionary algorithms for parameter optimization. Evolutionary Computation, l(l):l-23, 1993.
3. K.A. DeJong. The Analysis of the Behavior of a Class of Genetic Adaptive Systems. PhD thesis, University of Michigan, Ann Harbor, 1975. Dissertation Abstract International, 36(10), 5140B. (University Microfilms No 76-9381).
4. D. B. Fogel. An analysis of evolutionary programming. In D. B. Fogel and W. At mar, editors, Proceedings of the 1st Annual Conference on Evolutionary Programming, pages 43-51. Evolutionary Programming Society, 1992.
5. D. B. Fogel. Evolutionary Computation. Toward a New Philosophy of Machine Intelligence. IEEE Press, Piscataway, NJ, 1995.
6. D.B. Fogel and L.C. Stayton. On the effectiveness of crossover in simulated evo­lutionary optimization. BioSystems, 32:171-182, 1994.
7. L. J. Fogel, A. J. Owens, and M. J. Walsh. Artificial Intelligence through Simulated Evolution. New York: John Wiley, 1966.
8. S. Forrest and M. Mitchell. What makes a problem hard for a genetic algorithms: Some anomalous results and their explanation. Machine Learning, pages 285-319, 1993
9. D. E. Goldberg. Genetic algorithms in search, optimization and machine learning. Addison Wesley, 1989.
10. J. Holland. Adaptation in natural and artificial systems. University of Michigan Press, Ann Arbor, 1975.
11. J. Horn, D.E. Goldberg, and K. Deb. Long path problems. In Y. Davidor, H.-P. Schwefel, and R. Manner, editors, Proceedings of the 3rd Conference on Parallel Problems Solving from Nature, page 149:158. Springer Verlag, 1994.
12. C. Z. Janikow and Z. Michalewicz. An experimental comparison of binary and floating point representations in genetic algorithms. In R. K. Belew and L. B. Booker, editors, Proceedings of ICGA’91, pages 31-36. Morgan Kaufmann, 1991.
13. T. Jones. Crossover, macromutation and population-based search. In L. J. Eshel- man, editor, Proceedings of ICG A ’95, pages 73-80. Morgan Kaufmann, 1995.
14. S. Khuri, T. Back, and J. Heitkotter. The 0/1 multiple knapsack problem and genetic algorithms. In Proceedings of the ACM Symposium of Applied Computation, (http:\\www-cgi.cs.cmu.edu \afs\cs.cmu.edu\projet\ai-repository).
15. Y. Kodratoff. Introduction to Machine Learning. Pitman Publishing, London, 1988.
16. Z. Michalewicz. Genetic Algorithms+Data Structures=Evolution Programs. Springer Verlag, New-York, 1996. 3rd edition.
17. R.S. Michalski. A theory and methodology of inductive learning. In R.S Michal- ski, J.G. Carbonell, and T.M. Mitchell, editors, Machine Learning: an artificial intelligence approach, volume 1. Morgan Kaufmann, 1983.
18. M. Mitchell, S. Forrest, and J.H. Holland. The Royal Road for genetic algorithms: Fitness landscapes and GA performance. In F. J. Varela and P. Bourgine, editors, Proceedings of ECAL-93, pages 245-254. MIT Press, 1993.
19. M. Mitchell and J.H. Holland. When will a genetic algorithm outperform hill- climbing ? In S. Forrest, editor, Proceedings of ICG A ’93, pages 647-654. Morgan Kaufmann, 1993.
20. J. Obalek. Rekombinationsoperatoren fur Evolutionsstrategieren. PhD thesis, Uni- versitat Dortmund, Fachbereich Informatik, 1994.
21. C.C. Petersen. Computational experience with variants of the Balas algorithm applied to the selection of R & D projects. Management Science, 13:736-750, 1967.
22. N. J. Radcliffe. Equivalence class analysis of genetic algorithms. Complex Systems, 5:183-20, 1991.
23. I. Rechenberg. Evolutionstrategie: Optimierung Technisher Systeme nach Prinzip- ien des Biologischen Evolution. Fromman-Holzboog Verlag, Stuttgart, 1973.
24. H.-P. Schwefel. Numerical Optimization of Computer Models. John Wiley & Sons, New-York, 1981. 1995 - 2nd edition.
25. M. Sebag, C. Ravise, and M. Schoenauer. Controlling evolution by means of ma­chine learning. In L.J. Fogel, P. J. Angeline, and T. Back, editors, Proceedings of the 5th Annual Conference on Evolutionary Programming. MIT Press, 1996.
26. M. Sebag and M. Schoenauer. Controlling crossover through inductive learning. In Y. Davidor, H.-P. Schwefel, and R. Manner, editors, Proceedings of the 3rd Conference on Parallel Problems Solving from Nature. Springer-Verlag, LNCS 866, 1994.
27. D. Whitley. Fundamental principles of deception in genetic search. In G. J. E. Rawlins, editor, Foundations of Genetic Algorithms. Morgan Kaufmann, 1991.
28. D.H. Wolpert and W.G. Macready. No free lunch theorems for search. Technical report, Santa Fe Institute, 1995.