When does dependency modelling help? using a randomized landscape generator to compare algorithms in terms of problem structure

Authors:
Rachael Morgan;Marcus Gallagher
Affiliations:
School of Information Technology and Electrical Engineering, University of Queensland, Australia;School of Information Technology and Electrical Engineering, University of Queensland, Australia
Venue:
PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part I
Year:
2010

Citing 10
Cited 1

Lipschitzian optimization without the Lipschitz constant

Journal of Optimization Theory and Applications
Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation

Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation
A Survey of Optimization by Building and Using Probabilistic Models

Computational Optimization and Applications
Experimental Evaluation of Heuristic Optimization Algorithms: A Tutorial

Journal of Heuristics
Algorithm 829: Software for generation of classes of test functions with known local and global minima for global optimization

ACM Transactions on Mathematical Software (TOMS)
Towards unbiased benchmarking of evolutionary and hybrid algorithms for real-valued optimisation

Connection Science - Evolutionary Learning and Optimisation
Enhancing the Performance of Maximum---Likelihood Gaussian EDAs Using Anticipated Mean Shift

Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X
Convergence analysis of UMDAC with finite populations: a case study on flat landscapes

Proceedings of the 11th Annual conference on Genetic and evolutionary computation
A general-purpose tunable landscape generator

IEEE Transactions on Evolutionary Computation
Evolving Problems to Learn About Particle Swarm Optimizers and Other Search Algorithms

IEEE Transactions on Evolutionary Computation

Using landscape topology to compare continuous metaheuristics: A framework and case study on edas and ridge structure

Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we extend a previously proposed randomized landscape generator in combination with a comparative experimental methodology to study the behaviour of continuous metaheuristic optimization algorithms. In particular, we generate landscapes with parameterised, linear ridge structure and perform pairwise comparisons of algorithms to gain insight into what kind of problems are easy and difficult for one algorithm instance relative to another. We apply this methodology to investigate the specific issue of explicit dependency modelling in simple continuous Estimation of Distribution Algorithms. Experimental results reveal specific examples of landscapes (with certain identifiable features) where dependency modelling is useful, harmful or has little impact on average algorithm performance. The results are related to some previous intuition about the behaviour of these algorithms, but at the same time lead to new insights into the relationship between dependency modelling in EDAs and the structure of the problem landscape. The overall methodology is quite general and could be used to examine specific features of other algorithms.