Crossover can be constructive when computing unique input–output sequences

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.

[1]  Mark Harman,et al.  Reformulating software engineering as a search problem , 2003 .

[2]  Per Kristian Lehre,et al.  Runtime analysis of (1+l) EA on computing unique input output sequences , 2007, 2007 IEEE Congress on Evolutionary Computation.

[3]  Thomas Jansen,et al.  On the Analysis of Evolutionary Algorithms - A Proof That Crossover Really Can Help , 1999 .

[4]  Thomas Jansen,et al.  On the analysis of the (1+1) evolutionary algorithm , 2002, Theor. Comput. Sci..

[5]  Mark Harman,et al.  Computing Unique Input/Output Sequences Using Genetic Algorithms , 2003, FATES.

[6]  Mark Harman,et al.  Automated Unique Input Output Sequence Generation for Conformance Testing of FSMs , 2006, Comput. J..

[7]  David Lee,et al.  Principles and methods of testing finite state machines-a survey , 1996, Proc. IEEE.

[8]  Martin Dietzfelbinger,et al.  The analysis of a recombinative hill-climber on H-IFF , 2003, IEEE Trans. Evol. Comput..

[9]  Ingo Wegener,et al.  The one-dimensional Ising model: Mutation versus recombination , 2005, Theor. Comput. Sci..

[10]  Benjamin Doerr,et al.  Crossover can provably be useful in evolutionary computation , 2008, GECCO '08.

[11]  Xin Yao,et al.  A study of drift analysis for estimating computation time of evolutionary algorithms , 2004, Natural Computing.

[12]  Pietro Simone Oliveto,et al.  Design and Management of Complex Technical Processes and Systems by Means of Computational Intelligence Methods Theoretical Analysis of Diversity Mechanisms for Global Exploration Theoretical Analysis of Diversity Mechanisms for Global Exploration , 2022 .

[13]  Dirk Sudholt,et al.  Crossover is provably essential for the Ising model on trees , 2005, GECCO '05.

[14]  Thomas Jansen,et al.  Design and Management of Complex Technical Processes and Systems by means of Computational Intelligence Methods Evolutionary Algorithms-How to Cope With Plateaus of Constant Fitness and When to Reject Strings of the Same Fitness , 2001 .

[15]  W. Hoeffding Probability Inequalities for sums of Bounded Random Variables , 1963 .

[16]  Rajeev Motwani,et al.  Randomized Algorithms , 1995, SIGA.

[17]  Ingo Wegener,et al.  Real Royal Road Functions for Constant Population Size , 2003, GECCO.

[18]  Pietro Simone Oliveto,et al.  Simplified Drift Analysis for Proving Lower Bounds in Evolutionary Computation , 2008, Algorithmica.

[19]  Benjamin Doerr,et al.  Improved analysis methods for crossover-based algorithms , 2009, GECCO.

[20]  Thomas H. Cormen,et al.  Introduction to algorithms [2nd ed.] , 2001 .

[21]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[22]  Per Kristian Lehre,et al.  Crossover Can Be Constructive When Computing Unique Input Output Sequences , 2008, SEAL.

[23]  Mark Harman,et al.  Constructing multiple unique input/output sequences using metaheuristic optimisation techniques , 2005, IEE Proc. Softw..

[24]  Pietro Simone Oliveto,et al.  Analysis of population-based evolutionary algorithms for the vertex cover problem , 2008, 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence).