Local Optima Networks, Landscape Autocorrelation and Heuristic Search Performance

10/15/2012
by   Francisco Chicano, et al.
0

Recent developments in fitness landscape analysis include the study of Local Optima Networks (LON) and applications of the Elementary Landscapes theory. This paper represents a first step at combining these two tools to explore their ability to forecast the performance of search algorithms. We base our analysis on the Quadratic Assignment Problem (QAP) and conduct a large statistical study over 600 generated instances of different types. Our results reveal interesting links between the network measures, the autocorrelation measures and the performance of heuristic search algorithms.

READ FULL TEXT
research
04/29/2020

Multi-layer local optima networks for the analysis of advanced local search-based algorithms

A Local Optima Network (LON) is a graph model that compresses the fitnes...
research
05/14/2019

Homotopic Convex Transformation: A New Method to Smooth the Landscape of the Traveling Salesman Problem

This paper proposes a novel landscape smoothing method for the symmetric...
research
06/19/2019

Does Diversity Improve the Test Suite Generation for Mobile Applications?

In search-based software engineering we often use popular heuristics wit...
research
02/14/2013

An analysis of NK and generalized NK landscapes

Simulated landscapes have been used for decades to evaluate search strat...
research
05/24/2013

Integrating tabu search and VLSN search to develop enhanced algorithms: A case study using bipartite boolean quadratic programs

The bipartite boolean quadratic programming problem (BBQP) is a generali...
research
07/19/2012

Clustering of Local Optima in Combinatorial Fitness Landscapes

Using the recently proposed model of combinatorial landscapes: local opt...

Please sign up or login with your details

Forgot password? Click here to reset