Crossover can be constructive when computing unique input–output sequences

Authors:
Per Kristian Lehre;Xin Yao
Affiliations:
The University of Birmingham, The Centre of Excellence for Research in Computational Intelligence and Applications (CERCIA), School of Computer Science, Edgbaston, B15 2TT, Birmingham, UK;The University of Birmingham, The Centre of Excellence for Research in Computational Intelligence and Applications (CERCIA), School of Computer Science, Edgbaston, B15 2TT, Birmingham, UK
Venue:
Soft Computing - A Fusion of Foundations, Methodologies and Applications - Special Issue on Evolutionary Optimization and Learning
Year:
2011

Citing 0
Cited 5

The use of tail inequalities on the probable computational time of randomized search heuristics

Theoretical Computer Science
A study on the extended unique input/output sequence

Information Sciences: an International Journal
Unpacking and understanding evolutionary algorithms

WCCI'12 Proceedings of the 2012 World Congress conference on Advances in Computational Intelligence
Ubiquity symposium: Evolutionary computation and the processes of life: the essence of evolutionary computation

Ubiquity
A theoretical runtime and empirical analysis of different alternating variable searches for search-based testing

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

Unique input–output (UIO) sequences have important applications in conformance testing of finite state machines (FSMs). Previous experimental and theoretical research has shown that evolutionary algorithms (EAs) can compute UIOs efficiently on many FSM instance classes, but fail on others. However, it has been unclear how and to what degree EA parameter settings influence the runtime on the UIO problem. This paper investigates the choice of acceptance criterion in the (1 + 1) EA and the use of crossover in the $$(\mu+1)$$ Steady State Genetic Algorithm. It is rigorously proved that changing these parameters can reduce the runtime from exponential to polynomial for some instance classes of the UIO problem.