An analysis of the XOR dynamic problem generator based on the dynamical system

Authors:
Renato Tinós;Shengxiang Yang
Affiliations:
Department of Physics and Mathematics, FFCLRP, University of São Paulo, Ribeirão Preto, S.P., Brazil;Department of Information Systems and Computing, Brunel University, Uxbridge, Middlesex, U.K.
Venue:
PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part I
Year:
2010

Citing 9
Cited 2

Cyclic attractors and quasispecies adaptability

Theoretical aspects of evolutionary computing
Genetic algorithms in time-dependent environments

Theoretical aspects of evolutionary computing
The Simple Genetic Algorithm: Foundations and Theory

The Simple Genetic Algorithm: Foundations and Theory
Evolutionary Optimization in Dynamic Environments

Evolutionary Optimization in Dynamic Environments
Random Dynamics Optimum Tracking with Evolution Strategies

PPSN VII Proceedings of the 7th International Conference on Parallel Problem Solving from Nature
Genetic Algorithms: Principles and Perspectives: A Guide to GA Theory

Genetic Algorithms: Principles and Perspectives: A Guide to GA Theory
Experimental study on population-based incremental learning algorithms for dynamic optimization problems

Soft Computing - A Fusion of Foundations, Methodologies and Applications
Dynamic evolutionary optimisation: an analysis of frequency and magnitude of change

Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Analysis of the (1+1) EA for a dynamically bitwise changing ONEMAX

GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartI

Analysing fitness landscape changes in evolutionary robots

Proceedings of the 14th annual conference companion on Genetic and evolutionary computation
Evolutionary computation for dynamic optimization problems

Proceedings of the 15th annual conference companion on Genetic and evolutionary computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we use the exact model (or dynamical system approach) to describe the standard evolutionary algorithm (EA) as a discrete dynamical system for dynamic optimization problems (DOPs). Based on this dynamical system model, we analyse the properties of the XOR DOP Generator, which has been widely used by researchers to create DOPs from any binary encoded problem. DOPs generated by this generator are described as DOPs with permutation, where the fitness vector is changed according to a permutation matrix. Some properties of DOPs with permutation are analyzed, which allows explaining some behaviors observed in experimental results. The analysis of the properties of problems created by the XOR DOP Generator is important to understand the results obtained in experiments with this generator and to analyze the similarity of such problems to real world DOPs.