Advertisement

Tuning an Algorithm Using Design of Experiments

  • Enda RidgeEmail author
  • Daniel KudenkoEmail author
Chapter

Abstract

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.

Keywords

Tuning Parameter Central Composite Design Solution Time Prediction Interval Full Factorial Design 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Applegate D, Bixby R, Chvatal V, Cook W (2003) Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems. Mathematical Programming Series B 97(1-2):91-153zbMATHMathSciNetGoogle Scholar
  2. Croarkin C, Tobias P (eds) (2006) NIST/SEMATECH e-Handbook of Statistical Methods. National Institute of Standards and Technology, URL http://www.itl.nist.gov/div898/handbook/
  3. Czarn A, MacNish C, Vijayan K, Turlach B, Gupta R (2004) Statistical Exploratory Analysis of Genetic Algorithms. IEEE Transactions on Evolutionary Computation 8(4):405-421CrossRefGoogle Scholar
  4. Derringer G, Suich R (1980) Simultaneous Optimization of Several Response Variables.Journal of Quality Technology 12(4):214-219Google Scholar
  5. Dorigo M, Stützle T (2004) Ant Colony Optimization. The MIT Press, MAzbMATHCrossRefGoogle Scholar
  6. Goldwasser M, Johnson DS, McGeoch CC (eds) (2002) Proceedings of the Fifth and Sixth DIMACS Implementation Challenges. American Mathematical SocietyzbMATHGoogle Scholar
  7. Lawler EL, Lenstra JK, Kan AHGR, Shmoys DB (eds) (1995) The Traveling Salesman Problem - A Guided Tour of Combinatorial Optimization. Wiley Series in Discrete Mathematics and Optimization, NYGoogle Scholar
  8. Montgomery DC (2005) Design and Analysis of Experiments, 6th edn. WileyzbMATHGoogle Scholar
  9. Nelder J, Mead R (1965) A simplex method for function minimization. The Computer Journal 7Google Scholar
  10. Ostle B (1963) Statistics in Research, 2nd edn. Iowa State University PressGoogle Scholar
  11. Rardin RL, Uzsoy R (2001) Experimental Evaluation of Heuristic Optimization Algorithms:A Tutorial. Journal of Heuristics 7(3):261-304zbMATHCrossRefGoogle Scholar
  12. Ridge E (2007) Design of Experiments for the Tuning of Optimisation Algorithms.Phd thesis, Department of Computer Science, The University of YorkGoogle Scholar
  13. Ridge E, Kudenko D (2007) Analyzing Heuristic Performance with Response Surface Models: Prediction, Optimization and Robustness. In: Proceedings of the Genetic and Evolutionary Computation Conference, ACM, pp 150-157Google Scholar
  14. Wu J, Hamada M (2000) Experiments: Planning, analysis, and parameter design optimization. Wiley, NYzbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  1. 1.The Technology Innovation Group, Detica Ltd.LondonUK
  2. 2.Department of Computer ScienceThe University of YorkYorkUK

Personalised recommendations