Mixed Models for the Analysis of Local Search Components

  • Jørgen Bang-Jensen
  • Marco Chiarandini
  • Yuri Goegebeur
  • Bent Jørgensen
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4638)


We consider a possible scenario of experimental analysis on heuristics for optimization: identifying the contribution of local search components when algorithms are evaluated on the basis of solution quality attained.

We discuss the experimental designs with special focus on the role of the test instances in the statistical analysis. Contrary to previous practice of modeling instances as a blocking factor, we treat them as a random factor. Together with algorithms, or their components, which are fixed factors, this leads naturally to a mixed ANOVA model. We motivate our choice and illustrate the application of the mixed model on a study of local search for the 2-edge-connectivity problem.


Local Search Test Instance Local Search Algorithm Blocking Factor Geometric Random Graph 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Hoos, H., Stützle, T.: Stochastic Local Search: Foundations and Applications. Morgan Kaufmann, San Francisco (2004)Google Scholar
  2. 2.
    Barr, R., Golden, B., Kelly, J., Resende, M., Stewart, W.: Designing and reporting on computational experiments with heuristic methods. Journal of Heuristics 1(1), 9–32 (1995)zbMATHCrossRefGoogle Scholar
  3. 3.
    McGeoch, C.C.: Toward an experimental method for algorithm simulation. INFORMS Journal on Computing 8(1), 1–15 (1996)zbMATHMathSciNetGoogle Scholar
  4. 4.
    Rardin, R.L., Uzsoy, R.: Experimental evaluation of heuristic optimization algorithms: A tutorial. Journal of Heuristics 7(3), 261–304 (2001)zbMATHCrossRefGoogle Scholar
  5. 5.
    Coffin, M., Saltzman, M.J.: Statistical analysis of computational tests of algorithms and heuristics. INFORMS Journal on Computing 12(1), 24–44 (2000)zbMATHCrossRefGoogle Scholar
  6. 6.
    Hooker, J.N.: Testing heuristics: We have it all wrong. Journal of Heuristics 1, 32–42 (1996)Google Scholar
  7. 7.
    Molenberghs, G., Verbeke, G. (eds.): Linear Mixed Models in Practice - A SAS-Oriented Approach. Springer, Heidelberg (1997)zbMATHGoogle Scholar
  8. 8.
    Montgomery, D.C.: Design and Analysis of Experiments, 6th edn. John Wiley & Sons, Chichester (2005)zbMATHGoogle Scholar
  9. 9.
    Zemel, E.: Measuring the quality of approximate solutions to zero-one programming problems. Mathematics of operations research 6(3), 319–332 (1981)zbMATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    Birattari, M.: On the estimation of the expected performance of a metaheuristic on a class of instances. how many instances, how many runs? Tech. Rep. TR/IRIDIA/2004-01, IRIDIA, Université Libre de Bruxelles, Brussels, Belgium (2004)Google Scholar
  11. 11.
    Molenberghs, G., Verbeke, G.: Models for Discrete Longitudinal Data. Springer, Heidelberg (2005)zbMATHGoogle Scholar
  12. 12.
    Bang-Jensen, J., Chiarandini, M., Morling, P.: A computational investigation on heuristics for 2-edge connectivity augmentation. Submitted to journal (2007)Google Scholar
  13. 13.
    Diestel, R.: Graph Theory, 2nd edn. electronic edn. Springer-Verlag, New York, Berlin (2000)Google Scholar
  14. 14.
    Conforti, M., Galluccio, A., Proietti, G.: Edge-connectivity augmentation and network matrices. In: Hromkovič, J., Nagl, M., Westfechtel, B. (eds.) WG 2004. LNCS, vol. 3353, pp. 355–364. Springer, Heidelberg (2004)Google Scholar
  15. 15.
    Raidl, G.R., Ljubic, I.: Evolutionary local search for the edge-biconnectivity augmentation problem. Information Processing Letters 82(1), 39–45 (2002)zbMATHCrossRefMathSciNetGoogle Scholar
  16. 16.
    Cormen, T., Leiserson, C., Rivest, R.: Introduction to algorithms, 2nd edn. MIT Press, Cambridge (2001)zbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Jørgen Bang-Jensen
    • 1
  • Marco Chiarandini
    • 1
  • Yuri Goegebeur
    • 2
  • Bent Jørgensen
    • 2
  1. 1.Department of Mathematics and Computer Science, University of Southern Denmark, OdenseDenmark
  2. 2.Department of Statistics, University of Southern Denmark, OdenseDenmark

Personalised recommendations