Sequential parameter optimization applied to self-adaptation for binary-coded evolutionary algorithms

Studies in Computational Intelligence

Volumn 54, Issue , 2007, Pages 91-119

  Preuss, Mike ^a   Bartz Beielstein, Thomas ^a  

^a TU DORTMUND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 34147145566     PISSN: 1860949X     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-3-540-69432-8_5     Document Type: Article

References (82)

1. Anne Auger and Nikolaus Hansen. Performance Evaluation of an Advanced Local Search Evolutionary Algorithm. In B. McKay et al., editors, Proc. 2005 Congress on Evolutionary Computation (CEC'05), Piscataway NJ, 2005. IEEE Press.
2. T. Bäck. Evolutionary Algorithms in Theory and Practice. Oxford University Press, New York NY, 1996.
3. T. Bäck and M. Schütz. Evolution strategies for mixed-integer optimization of optical multilayer systems. In J. R. McDonnell, R. G. Reynolds, and D. B. Fogel, editors,Evolutionary Programming IV: Proceedings of the Fourth Annual Conference on Evolutionary Programming pages 33-51. MIT Press, Cambridge, MA, 1995.
4. Th. Bäck. Self-adaptation in genetic algorithms. In FJ Varela and P Bourgine, editors, Toward a Practice of Autonomous Systems: proceedings of the first European conference on Artificial Life, pages 263-271. MIT Press, 1992.
5. R. Barr and B. Hickman. Reporting computational experiments with parallel algorithms: Issues, measures, and experts' opinions. ORSA Journal on Computing, 5(1):2-18, 1993.
6. Thomas Bartz-Beielstein. Evolution strategies and threshold selection. In M. J. Blesa Aguilera, C. Blum, A. Roli, and M. Sampels, editors, Proceedings Second International Workshop Hybrid Metaheuristics (HM'05) volume 3636 of Lecture Notes in Computer Science, pages 104-115, Berlin, Heidelberg, New York, 2005. Springer.
7. Thomas Bartz-Beielstein. Experimental Research in Evolutionary Computation - The New Experimentalism. Springer, Berlin, Heidelberg, New York, 2006.
8. Thomas Bartz-Beielstein, Daniel Blum, and Jürgen Branke. Particle swarm optimization and sequential sampling in noisy environments. In Richard Hartl and Karl Doerner, editors, Proceedings 6th Metaheuristics International Conference (MIC2005), pages 89-94, Vienna, Austria, 2005.
9. Thomas Bartz-Beielstein, Marcel de Vegt, Konstantinos E. Parsopoulos, and Michael N. Vrahatis. Designing particle swarm optimization with regression trees. Interner Bericht des Sonderforschungsbereichs 531 Computational Intelligence CI-173/04, Universität Dortmund, Germany, Mai 2004.
10. Thomas Bartz-Beielstein, Christian Lasarczyk, and Mike Preuß. Sequential parameter optimization. In B. McKay et al., editors, Proceedings 2005 Congress on Evolutionary Computation (CEC'05), Edinburgh, Scotland, volume 1, pages 773-780, Piscataway NJ, 2005. IEEE Press.
11. Thomas Bartz-Beielstein and Boris Naujoks. Tuning multicriteria evolutionary algorithms for airfoil design optimization. Interner Bericht des Sonderforschungsbereichs 531 Computational Intelligence CI-159/04, Universität Dortmund, Germany, Februar 2004.
12. Thomas Bartz-Beielstein, Konstantinos E. Parsopoulos, and Michael N. Vrahatis. Design and analysis of optimization algorithms using computational statistics. Applied Numerical Analysis & Computational Mathematics (ANACM), 1(2):413-433, 2004.
13. Thomas Bartz-Beielstein, Mike Preuß, and Sandor Markon. Validation and optimization of an elevator simulation model with modern search heuristics. In SPO Applied to Self-Adaptation for Binary-Coded EAs 115 T. Ibaraki, K. Nonobe, and M. Yagiura, editors, Metaheuristics: Progress as Real Problem Solvers, Operations Research/Computer Science Interfaces, pages 109-128. Springer, Berlin, Heidelberg, New York, 2005.
14. Regina Berretta, Carlos Cotta, and Pablo Moscato. Enhancing the performance of memetic algorithms by using a matching-based recombination algorithm. In Metaheuristics: Computer decision-making pages 65-90. Kluwer Academic Publishers, Norwell, MA, 2004.
15. Regina Berretta and Pablo Moscato. The number partitioning problem: An open challenge for evolutionary computation? In New ideas in optimization, pages 261-278. McGraw-Hill Ltd., Maidenhead, UK, 1999.
16. H.-G. Beyer and H.-P. Schwefel. Evolution strategies - A comprehensive introduction. Natural Computing, 1:3-52, 2002.
17. Marcel de Vegt. Einfluss verschiedener Parametrisierungen auf die Dynamik des Partikel-Schwarm-Verfahrens: Eine empirische Analyse. Interner Bericht der Systems Analysis Research Group SYS-3/05, Universität Dortmund, Fachbereich Informatik, Germany, Dezember 2005.
18. Camil Demetrescu and Giuseppe F. Italiano. What do we learn from experimental algorithmics? In MFCS '00: Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science pages 36-51, Berlin, Heidelberg, New York, 2000. Springer.
19. N. R. Draper and H. Smith. Applied Regression Analysis. Wiley, New York NY, 3rd edition, 1998.
20. S. Droste, T. Jansen, and I. Wegener. A natural and simple function which is hard for all evolutionary algorithms. In IEEE International Conference on Industrial Electronics, Control, and Instrumentation (IECON 2000), pages 2704-2709, Piscataway, NJ, 2000. IEEE Press.
21. A. E. Eiben, R. Hinterding, and Z. Michalewicz. Parameter control in evolutionary algorithms. IEEE Transactions on Evolutionary Computation, 3(2):124-141, 1999.
22. A. E. Eiben and J. E. Smith. Introduction to Evolutionary Computing Springer, Berlin, Heidelberg, New York, 2003.
23. A.E. Eiben and M. Jelasity. A critical note on experimental research methodology in EC. In Proceedings of the 2002 Congress on Evolutionary Computation (CEC'2002), pages 582-587, Piscataway NJ, 2002. IEEE.
24. Robert Feldt and Peter Nordin. Using factorial experiments to evaluate the effect of genetic programming parameters. In Riccardo Poli et al., editors, Genetic Programming, Proceedings of EuroGP'2000, volume 1802 of Lecture Notes in Computer Science, pages 271-282, Berlin, Heidelberg, New York, 15-16 April 2000. Springer.
25. D. B. Fogel. Evolving Artificial Intelligence. PhD thesis, University of California, San Diego, 1992.
26. O. François and C. Lavergne. Design of evolutionary algorithms - a statistical perspective. IEEE Transactions on Evolutionary Computation, 5(2):129-148, April 2001.
27. Mario Giacobini, Mike Preuß, and Marco Tomassini. Effects of scale-free and small-world topologies on binary coded self-adaptive CEA. In 6th European Conf. Evolutionary Computation in Combinatorial Optimization, Proc. (Evo-COP'06), Lecture Notes in Computer Science, pages 86-98, Berlin, 2006. Springer.
28. D. E. Goldberg, K. Deb, and J. Horn. Massively multimodality, deception and genetic algorithms. In R. Männer and B. Manderick, editors, Parallel Prob. Solving from Nature II, pages 37-46. North-Holland, 1992.
29. Garrison W. Greenwood. Adapting mutations in genetic algorithms using gene flow principles. In R. Sarker et al., editors, Proc. 2003 Congress on Evolutionary Computation (CEC'03), Canberra, pages 1392-1397, Piscataway NJ, 2003. IEEE Press.
30. N. Hansen and A. Ostermeier. Completely derandomized self-adaptation in evolution strategies. Evolutionary Computation, 9(2):159-195, 2001.
31. N. Hansen, A. Ostermeier, and A. Gawelczyk. On the adaptation of arbitrary normal mutation distributions in evolution strategies: The generating set adaptation. In L. J. Eshelman, editor, Proc. 6th Int'l Conf. on Genetic Algorithms, pages 57-64, San Francisco, CA, 1995. Morgan Kaufmann Publishers, Inc.
32. J. Hooker. Testing heuristics: We have it all wrong. Journal of Heuristics, 1(1):33-42, 1996.
33. Christian Igel and Martin Kreutz. Operator adaptation in evolutionary computation and its application to structure optimization of neural networks. Neurocomputing, 55(1-2):347-361, 2003.
34. E. H. Isaaks and R. M. Srivastava. An Introduction to Applied Geostatistics. Oxford University Press, Oxford, U.K., 1989.
35. Thomas Jansen, Kenneth A. De Jong, and Ingo Wegener. On the choice of the offspring population size in evolutionary algorithms. Evolutionary Computation, 13(4):413-440, 2005.
36. Thomas Jansen and Dirk Sudholt. Design and analysis of an asymmetric mutation operator. In B. McKay et al., editors, Proc. 2005 Congress on Evolutionary Computation (CEC'05), Edinburgh, Scotland, volume 1, pages 190-197, Piscataway NJ, 2005. IEEE Press.
37. Mark Jelasity. A wave analysis of the subset sum problem. In Thomas Bäck, editor, Proceedings of the Seventh International Conference on Genetic Algorithms (ICGA97), pages 89-96, San Francisco, CA, 1997. Morgan Kaufmann.
38. Márk Jelasity, Mike Preuß, and Agoston E. Eiben. Operator learning for a problem class in a distributed peer-to-peer environment. In J. J. Merelo Guervós, P. Adamidis, H.-G. Beyer, J.L. Fernández-Villacañas, and H.-P. Schwefel, editors, Parallel Problem Solving from Nature - PPSN VII, Proc. Seventh Int'l Conf., Granada, pages 172-183, Berlin, 2002. Springer.
39. David S. Johnson. A theoretician's guide to the experimental analysis of algorithms. In M. H. Goldwasser, D. S. Johnson, and C. C. McGeoch, editors, Data Structures, Near Neighbor Searches, and Methodology: Fifth and Sixth DIMACS Implementation Challenges, pages 215-250, Providence, 2002. American Mathematical Society.
40. D.R. Jones, M. Schonlau, and W.J. Welch. Efficient global optimization of expensive black-box functions. Journal of Global Optimization, 13:455-492, 1998.
41. Kenneth A. De Jong, Michael A. Potter, and William M. Spears. Using problem generators to explore the effects of epistasis. In T. Bäck, editor, Proceedings of the Seventh ICGA, pages 338-345. Morgan Kaufmann, 1997.
42. Bryant A. Julstrom. Adaptive operator probabilities in a genetic algorithm that applies three operators. In SAC '97: Proceedings of the 1997 ACM symposium on Applied computing, pages 233-238, New York, NY, 1997. ACM Press.
43. J. P. C. Kleijnen. Statistical Tools for Simulation Practitioners. Marcel Dekker, New York NY, 1987.
44. J. P. C. Kleijnen. Experimental design for sensitivity analysis, optimization, and validation of simulation models. In J. Banks, editor, Handbook of Simulation. Wiley, New York NY, 1997.
45. F. Kursawe. Grundlegende empirische Untersuchungen der Parameter von Evolutionsstrategien - Metastrategien. Dissertation, Fachbereich Informatik, Universität Dortmund, Germany, 1999.
46. A.M. Law and W.D. Kelton. Simulation Modeling and Analysis. McGraw-Hill, New York NY, 3rd edition, 2000.
47. S.N. Lophaven, H.B. Nielsen, and J. Søndergaard. Aspects of the Matlab Toolbox DACE. Technical Report IMM-REP-2002-13, Informatics and Mathematical Modelling, Technical University of Denmark, Copenhagen, Denmark, 2002.
48. S.N. Lophaven, H.B. Nielsen, and J. Søndergaard. DACE - A Matlab Kriging Toolbox. Technical Report IMM-REP-2002-12, Informatics and Mathematical Modelling, Technical University of Denmark, Copenhagen, Denmark, 2002.
49. Sandor Markon, Hajime Kita, Hiroshi Kise, and Thomas Bartz-Beielstein, editors. Modern Supervisory and Optimal Control with Applications in the Control of Passenger Traffic Systems in Buildings. Springer, Berlin, Heidelberg, New York, 2006.
50. Catherine C. McGeoch. Experimental Analysis of Algorithms. PhD thesis, Carnegie Mellon University, Pittsburgh PA, 1986.
51. M. D. McKay, R. J. Beckman, and W. J. Conover. A comparison of three methods for selecting values of input variables in the analysis of output from a computer code. Technometrics, 21(2):239-245, 1979.
52. Jörn Mehnen, Thomas Michelitsch, Thomas Bartz-Beielstein, and Nadine Henkenjohann. Systematic analyses of multi-objective evolutionary algorithms applied to real-world problems using statistical design of experiments. In R. Teti, editor, Proceedings Fourth International Seminar Intelligent Computation in Manufacturing Engineering (CIRP ICME'04), volume 4, pages 171-178, Naples, Italy, 2004.
53. Jörn Mehnen, Thomas Michelitsch, Thomas Bartz-Beielstein, and Christian W. G. Lasarczyk. Multiobjective evolutionary design of mold temperature control using DACE for parameter optimization. In H. Pfützner and E. Leiss, editors, Proceedings Twelfth International Symposium Interdisciplinary Electromagnetics, Mechanics, and Biomedical Problems (ISEM 2005), volume L11-1, pages 464-465, Vienna, Austria, 2005. Vienna Magnetics Group Reports.
54. Silja Meyer-Nieberg and Hans-Georg Beyer. Self-adaptation in evolutionary algorithms. In Fernando Lobo, Claudio Lima, and Zbigniew Michalewicz, editors, Parameter Setting in Evolutionary Algorithms Studies in Computational Intelligence. Springer, Berlin Heidelberg New York, 2006.
55. D. C. Montgomery. Design and Analysis of Experiments. Wiley, New York NY, 5th edition, 2001.
56. B. M. E. Moret. Towards a discipline of experimental algorithmics. In M.H. Goldwasser, D.S. Johnson, and C.C. McGeoch, editors, Data Structures, Near Neighbor Searches, and Methodology: Fifth and Sixth DIMACS Implementation Challenges, DIMACS Monographs 59, pages 197-213, Providence RI, 2002. American Mathematical Society.
57. Bernard M. Moret and Henry D. Shapiro. Algorithms and experiments: The new (and old) methodology. Journal of Universal Computer Science, 7(5):434-446, 2001.
58. R. Myers and E.R. Hancock. Empirical modelling of genetic algorithms. Evolutionary Computation, 9(4):461-493, 2001.
59. Martin Pelikan, David E. Goldberg, and Erick Cantú-Paz. Linkage problem, distribution estimation, and bayesian networks. Evolutionary Computation, 8(3):311-340, 2000.
60. F. Pukelsheim. Optimal Design of Experiments. Wiley, New York NY, 1993.
61. Iloneide C. O. Ramos, Marco C. Goldbarg, Elizabeth G. Goldbarg, and Adrião D. Dória Neto. Logistic Regression for Parameter Tuning on an Evolutionary Algorithm. In B. McKay et al., editors, Proc. 2005 Congress on Evolutionary Computation (CEC'05), volume 2, pages 1061-1068, Piscataway NJ, 2005. IEEE Press.
62. Ronald L. Rardin and Reha Uzsoy. Experimental evaluation of heuristic optimization algorithms: A tutorial. J. Heuristics, 7(3):261-304, 2001.
63. I. Rechenberg. Evolutionsstrategie: Optimierung technischer Systeme nach Prinzipien der biologischen Evolution. Frommann-Holzboog Verlag, Stuttgart, 1973.
64. I. Rechenberg. Evolutionsstrategien. In B. Schneider and U. Ranft, editors, Simulationsmethoden in der Medizin und Biologie, pages 83-114. Springer-Verlag, Berlin, 1978.
65. J. Sacks, W. J. Welch, T. J. Mitchell, and H. P. Wynn. Design and analysis of computer experiments. Statistical Science, 4(4):409-435, 1989.
66. T. J. Santner, B. J. Williams, and W. I. Notz. The Design and Analysis of Computer Experiments. Springer, Berlin, Heidelberg, New York, 2003.
67. J. D. Schaffer, R. A. Caruana, L. Eshelman, and R. Das. A study of control parameters affecting online performance of genetic algorithms for function optimization. In J. D. Schaffer, editor, Proceedings of the Third International Conference on Genetic Algorithms, pages 51-60, San Mateo CA, 1989. Morgan Kaufman.
68. M. Schonlau. Computer Experiments and Global Optimization. PhD thesis, University of Waterloo, Ontario, Canada, 1997.
69. Matthias Schonlau, William J. Welch, and Ronald R. Jones. Global versus local search in constrained optimization of computer models. In New Development and Applications in Experimental Design, number 34 in IMS Lecture Notes, pages 11-25. Institute of Mathematical Statistics, Beachwood, OH, 1998.
70. Martin Schütz. Eine Evolutionsstrategie für gemischt-ganzzahlige Optimierprobleme mit variabler Dimension. Interner Bericht der Systems Analysis Research Group SYS-1/96, Universität Dortmund, Fachbereich Informatik, August 1996.
71. H.-P. Schwefel. Adaptive Mechanismen in der biologischen Evolution und ihr Einfluß auf die Evolutionsgeschwindigkeit. Technical report, Technical University of Berlin, 1974. Abschlußbericht zum DFG-Vorhaben Re 215/2.
72. H.-P. Schwefel. Numerical Optimization of Computer Models. Wiley, Chichester, 1981.
73. H.-P. Schwefel, I. Wegener, and K. Weinert, editors. Advances in Computational Intelligence - Theory and Practice. Springer, Berlin, Heidelberg, New York, 2003.
74. J. Smith and T. C. Fogarty. Self-adaptation of mutation rates in a steady state genetic algorithm. In Proceedings of 1996 IEEE Int'l Conf. on Evolutionary Computation (ICEC '96), pages 318-323. IEEE Press, NY, 1996. SPO Applied to Self-Adaptation for Binary-Coded EAs 119
75. J. E. Smith. Modelling gas with self adaptive mutation rates. In L. Spector and et al., editors, Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2001), pages 599-606, San Francisco, California, USA, 7-11 July 2001. Morgan Kaufmann.
76. Catalin Stoean, Mike Preuss, Ruxandra Gorunescu, and Dan Dumitrescu. Elitist Generational Genetic Chromodynamics - a New Radii-Based Evolutionary Algorithm for Multimodal Optimization. In B. McKay et al., editors, Proc. 2005 Congress on Evolutionary Computation (CEC'05), volume 2, pages 1839 - 1846, Piscataway NJ, 2005. IEEE Press.
77. Ch. Stone and J. E. Smith. Strategy parameter variety in self-adaptation of mutation rates. In W. B. Langdon and et al., editors, GECCO, pages 586-593. Morgan Kaufmann, 2002.
78. Dirk Thierens. An adaptive pursuit strategy for allocating operator probabilities. In GECCO '05: Proceedings of the 2005 conference on Genetic and evolutionary computation, pages 1539-1546, New York, NY, 2005. ACM Press.
79. Marko Tosic. Evolutiooäre Kreuzungsminimierung. Diploma thesis, University of Dortmund, Germany, January 2006.
80. Klaus Weinert, Jörn Mehnen, Thomas Michelitsch, Karlheinz Schmitt, and Thomas Bartz-Beielstein. A multiobjective approach to optimize temperature control systems of moulding tools. Production Engineering Research and Development, Annals of the German Academic Society for Production Engineering, XI(1):77-80, 2004.
81. Darrell Whitley, Soraya B. Rana, John Dzubera, and Keith E. Mathias. Evaluating evolutionary algorithms. Artificial Intelligence, 85(1-2):245-276, 1996.
82. D.H. Wolpert and W.G. Macready. No free lunch theorems for optimization. IEEE Transactions on Evolutionary Computation, 1(1):67-82, 1997.