Fitness Landscape-Based Characterisation of Nature-Inspired Algorithms

@inproceedings{Crossley2012FitnessLC,
  title={Fitness Landscape-Based Characterisation of Nature-Inspired Algorithms},
  author={Matthew Crossley and Andy Nisbet and Martyn Amos},
  booktitle={International Conference on Adaptive and Natural Computing Algorithms},
  year={2012}
}
A significant challenge in nature-inspired algorithmics is the identification of specific characteristics of problems that make them harder (or easier) to solve using specific methods. The hope is that, by identifying these characteristics, we may more easily predict which algorithms are best-suited to problems sharing certain features. Here, we approach this problem using fitness landscape analysis. Techniques already exist for measuring the “difficulty” of specific landscapes, but these are… 

Performance comparison of metaheuristic algorithms using a modified Gaussian fitness landscape generator

A modified Gaussian fitness landscape generator is proposed based on a probability density function, to make up for the disadvantages of traditional benchmark problems and can be employed to compare the performances of existing optimization algorithms and to evaluate the performance of newly developed algorithms.

Quantifying the Impact of Parameter Tuning on Nature-Inspired Algorithms

A number of different algorithms are examined in a "problem agnostic" fashion by considering their performance on fitness landscapes with varying characteristics, and a number of observations are made on which algorithms may (or may not) benefit from tuning, and in which specific circumstances.

Performance comparison of metaheuristic algorithms using a modified Gaussian fitness landscape generator

A modified Gaussian fitness landscape generator is proposed based on a probability density function, to make up for the disadvantages of traditional benchmark problems and can be employed to compare the performances of existing optimization algorithms and to evaluate the performance of newly developed algorithms.

References

SHOWING 1-10 OF 41 REFERENCES

Quantifying ruggedness of continuous landscapes using entropy

This research aims to analytically characterise individual problems as a first step towards attempting to link problem types with the algorithms best suited to solving them.

Nature-Inspired Algorithms for Optimisation

  • R. Chiong
  • Business
    Nature-Inspired Algorithms for Optimisation
  • 2009
This volume is a collection of the latest state-of-the-art algorithms and important studies for tackling various kinds of optimisation problems, and the contributions stand out through their novelty and clarity of the algorithmic descriptions and analyses.

Fitness landscape analysis and memetic algorithms for the quadratic assignment problem

It is shown that epistasis, as expressed by the dominance of the flow and distance matrices of a QAP instance, the landscape ruggedness in terms of the correlation length of a landscape, and the correlation between fitness and distance of local optima in the landscape together are useful for predicting the performance of memetic algorithms-evolutionary algorithms incorporating local search.

Comparison among five evolutionary-based optimization algorithms

Multidimensional Knapsack Problem: A Fitness Landscape Analysis

Fitness landscape analysis techniques are used to better understand the influence of genetic representations and associated variation operators when solving a combinatorial optimization problem. Five

A general-purpose tunable landscape generator

This paper proposes a landscape (test-problem) generator that can be used to generate optimization problem instances for continuous, bound-constrained optimization problems and analyzes some simple, continuous estimation of distribution algorithms, and gains new insights into the behavior of these algorithms using the landscape generator.

An Overview of Evolutionary Algorithms for Parameter Optimization

Three main streams of evolutionary algorithms (EAs), probabilistic optimization algorithms based on the model of natural evolution, are compared in this article: evolution strategies (ESs),

Genetic Algorithm Difficulty and the Modality of Fitness Landscapes

When Does Dependency Modelling Help? Using a Randomized Landscape Generator to Compare Algorithms in Terms of Problem Structure

This paper extends a previously proposed randomized landscape generator in combination with a comparative experimental methodology to study the behaviour of continuous metaheuristic optimization algorithms, and applies this methodology to investigate the specific issue of explicit dependency modelling in simple continuous Estimation of Distribution Algorithms.

Clever Algorithms: Nature-Inspired Programming Recipes

This book provides a handbook of algorithmic recipes from the fields of Metaheuristics, Biologically Inspired Computation and Computational Intelligence that have been described in a complete,