论文信息 - Tuning an Algorithm Using Design of Experiments

Tuning an Algorithm Using Design of Experiments

This chapter is a tutorial on using a design of experiments approach for tuning the parameters that affect algorithm performance. A case study illustrates the application of the method and interpretation of its results.

Daniel Kudenko | Enda Ridge | D. Kudenko | Enda Ridge

[1] Reha Uzsoy,et al. Experimental Evaluation of Heuristic Optimization Algorithms: A Tutorial , 2001, J. Heuristics.

[2] Ritu Gupta,et al. Statistical exploratory analysis of genetic algorithms , 2004, IEEE Transactions on Evolutionary Computation.

[3] William J. Cook,et al. Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems , 2003, Math. Program..

[4] J. Wishart,et al. Statistics in Research. , 1956 .

[5] Eugene L. Lawler,et al. The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization , 1985 .

[6] John A. Nelder,et al. A Simplex Method for Function Minimization , 1965, Comput. J..

[7] UzsoyReha,et al. Experimental Evaluation of Heuristic Optimization Algorithms , 2001 .

[8] C. F. Jeff Wu,et al. Experiments: Planning, Analysis, and Parameter Design Optimization , 2000 .

[9] Thomas Stützle,et al. Ant Colony Optimization , 2009, EMO.

[10] G. Derringer,et al. Simultaneous Optimization of Several Response Variables , 1980 .

[11] Daniel Kudenko,et al. Analyzing heuristic performance with response surface models: prediction, optimization and robustness , 2007, GECCO '07.