Mixed models for the analysis of local search components

Authors:
Jørgen Bang-Jensen;Marco Chiarandini;Yuri Goegebeur;Bent Jørgensen
Affiliations:
Department of Mathematics and Computer Science, University of Southern Denmark, Odense, Denmark;Department of Mathematics and Computer Science, University of Southern Denmark, Odense, Denmark;Department of Statistics, University of Southern Denmark, Odense, Denmark;Department of Statistics, University of Southern Denmark, Odense, Denmark
Venue:
SLS'07 Proceedings of the 2007 international conference on Engineering stochastic local search algorithms: designing, implementing and analyzing effective heuristics
Year:
2007

Citing 6
Cited 2

Introduction to Algorithms

Introduction to Algorithms
Experimental Evaluation of Heuristic Optimization Algorithms: A Tutorial

Journal of Heuristics
Statistical Analysis of Computational Tests of Algorithms and Heuristics

INFORMS Journal on Computing
Stochastic Local Search: Foundations & Applications

Stochastic Local Search: Foundations & Applications
Design and Analysis of Experiments

Design and Analysis of Experiments
Edge-Connectivity augmentation and network matrices

WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science

Learning decision trees for the analysis of optimization heuristics

LION'10 Proceedings of the 4th international conference on Learning and intelligent optimization
Design and statistical analysis of a hybrid local search algorithm for course timetabling

Journal of Scheduling

Quantified Score

Hi-index	0.01

Visualization

Abstract

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.