The road to VEGAS: guiding the search over neutral networks

VEGAS (Varying Evolvability-Guided Adaptive Search) is a new methodology proposed to deal with the neutrality property that frequently appears on combinatorial optimization problems. Its main feature is to consider the whole evaluated solutions of a neutral network rather than the last accepted solution. Moreover, VEGAS is designed to escape from plateaus based on the evolvability of solutions, and on a multi-armed bandit by selecting the more promising solution from the neutral network. Experiments are conducted on NK-landscapes with neutrality. Results show the importance of considering the whole identified solutions from the neutral network and of guiding the search explicitly. The impact of the level of neutrality and of the exploration-exploitation trade-off are deeply analyzed.

[1]  Sébastien Vérel,et al.  Fitness landscape of the cellular automata majority problem: View from the "Olympus" , 2007, Theor. Comput. Sci..

[2]  T. Jukes,et al.  The neutral theory of molecular evolution. , 2000, Genetics.

[3]  Janet Wiles,et al.  A comparison of neutral landscapes - NK, NKp and NKq , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[4]  J. van Leeuwen,et al.  Evolvable Systems: From Biology to Hardware , 2002, Lecture Notes in Computer Science.

[5]  Phil Husbands,et al.  Fitness Landscapes and Evolvability , 2002, Evolutionary Computation.

[6]  Lionel Barnett,et al.  Netcrawling-optimal evolutionary search with neutral networks , 2001, Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546).

[7]  P. Husbands,et al.  Neutral networks in an evolutionary robotics search space , 2001, Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546).

[8]  Sébastien Vérel,et al.  NILS: A Neutrality-Based Iterated Local Search and Its Application to Flowshop Scheduling , 2011, EvoCOP.

[9]  Michèle Sebag,et al.  Adaptive operator selection with dynamic multi-armed bandits , 2008, GECCO '08.

[10]  Jeremy Frank,et al.  When Gravity Fails: Local Search Topology , 1997, J. Artif. Intell. Res..

[11]  Dirk Thierens,et al.  An Adaptive Pursuit Strategy for Allocating Operator Probabilities , 2005, BNAIC.

[12]  Stuart A. Kauffman,et al.  ORIGINS OF ORDER , 2019, Origins of Order.

[13]  Peter Auer,et al.  Finite-time Analysis of the Multiarmed Bandit Problem , 2002, Machine Learning.

[14]  Wolfgang Banzhaf,et al.  Genotype-Phenotype-Mapping and Neutral Variation - A Case Study in Genetic Programming , 1994, PPSN.

[15]  L. Barnett.  Ruggedness and neutrality—the NKp family of fitness landscapes , 1998 .

[16]  Peter F. Stadler,et al.  Towards a theory of landscapes , 1995 .

[17]  Julian Francis Miller,et al.  Neutrality and the Evolvability of Boolean Function Landscape , 2001, EuroGP.

[18]  A. Wagner.  Robustness and Evolvability in Living Systems , 2005 .

[19]  M. Newman,et al.  Effects of neutral selection on the evolution of molecular species , 1997, adap-org/9712005.

[20]  Sébastien Vérel,et al.  On the Neutrality of Flowshop Scheduling Fitness Landscapes , 2011, LION.

[21]  Julian Francis Miller,et al.  The Advantages of Landscape Neutrality in Digital Circuit Evolution , 2000, ICES.

[22]  T. Stewart.  Extrema selection: accelerated evolution on neutral networks , 2001, Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546).

[23]  Inman Harvey,et al.  Through the Labyrinth Evolution Finds a Way: A Silicon Ridge , 1996, ICES.

[24]  Zbigniew Michalewicz,et al.  Parameter Control in Evolutionary Algorithms , 2007, Parameter Setting in Evolutionary Algorithms.

[25]  Michèle Sebag,et al.  Toward comparison-based adaptive operator selection , 2010, GECCO '10.