Measuring the Searched Space to Guide Efficiency: The Principle and Evidence on Constraint Satisfaction

Authors:
Jano I. van Hemert;Thomas Bäck
Affiliations:
-;-
Venue:
PPSN VII Proceedings of the 7th International Conference on Parallel Problem Solving from Nature
Year:
2002

Citing 4
Cited 3

A genetic local search algorithm for random binary constraint satisfaction problems

SAC '00 Proceedings of the 2000 ACM symposium on Applied computing - Volume 1
Graph Coloring with Adaptive Evolutionary Algorithms

Journal of Heuristics
The GENITOR Algorithm and Selection Pressure: Why Rank-Based Allocation of Reproductive Trials is Best

Proceedings of the 3rd International Conference on Genetic Algorithms
Global Convergence of Genetic Algorithms: A Markov Chain Analysis

PPSN I Proceedings of the 1st Workshop on Parallel Problem Solving from Nature

A study of ACO capabilities for solving the maximum clique problem

Journal of Heuristics
Solving real school timetabling problems with meta-heuristics

AMCOS'05 Proceedings of the 4th WSEAS International Conference on Applied Mathematics and Computer Science
Reactive stochastic local search algorithms for the genomic median problem

EvoCOP'08 Proceedings of the 8th European conference on Evolutionary computation in combinatorial optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we present a new tool to measure the efficiency of evolutionary algorithms by storing the whole searched space of a run, a process whereby we gain insight into the number of distinct points in the state space an algorithm has visited as opposed to the number of function evaluations done within the run. This investigation demonstrates a certain inefficiency of the classical mutation operator with mutation-rate 1/l, where l is the dimension of the state space. Furthermore we present a model for predicting this inefficiency and verify it empirically using the new tool on binary constraint satisfaction problems.