Parameterized analysis of bio-inspired computing

The parameterized analysis of bio-inspired computing provides a new way of gaining additional insights into the working behavior of popular approaches such as evolutionary algorithms and ant colony optimization. We give an overview of two important approaches in this area. The area of parameterized runtime analysis studies the runtime of bio-inspired computing with respect to different parameters of the given problem instance and builds on the success of rigorous runtime analysis of bio-inspired computing in the last 20 years. The feature-based analysis of algorithms for a given optimization problem uses statistical methods to figure out which features of a given problem instance lead to a good or bad performance of the algorithm under consideration. It often uses an evolutionary algorithm for evolving problem instances that exhibit performance differences between a given set of solvers and can be used for effective algorithm selection.

[1]  Frank Neumann,et al.  A Parameterized Runtime Analysis of Simple Evolutionary Algorithms for Makespan Scheduling , 2012, PPSN.

[2]  Michael R. Fellows,et al.  Parameterized Complexity , 1998 .

[3]  Wanru Gao,et al.  Feature-Based Diversity Optimization for Problem Instance Classification , 2015, Evolutionary Computation.

[4]  Heike Trautmann,et al.  Understanding Characteristics of Evolved Instances for State-of-the-Art Inexact TSP Solvers with Maximum Performance Difference , 2016, AI*IA.

[5]  Frank Neumann,et al.  Reoptimization times of evolutionary algorithms on linear functions under dynamic uniform constraints , 2017, GECCO.

[6]  Frank Neumann,et al.  Parameterized complexity analysis and more effective construction methods for ACO algorithms and the euclidean traveling salesperson problem , 2013, 2013 IEEE Congress on Evolutionary Computation.

[7]  Bernd Bischl,et al.  A novel feature-based approach to characterize algorithm performance for the traveling salesperson problem , 2012, Annals of Mathematics and Artificial Intelligence.

[8]  Markus Wagner,et al.  Analyzing the Effects of Instance Features and Algorithm Parameters for Max–Min Ant System and the Traveling Salesperson Problem , 2015, Front. Robot. AI.

[9]  Mojgan Pourhassan,et al.  On the Impact of Local Search Operators and Variable Neighbourhood Search for the Generalized Travelling Salesperson Problem , 2015, GECCO.

[10]  Bernd Bischl,et al.  A feature-based comparison of local search and the christofides algorithm for the travelling salesperson problem , 2013, FOGA XII '13.

[11]  A. E. Eiben,et al.  Introduction to Evolutionary Computing , 2003, Natural Computing Series.

[12]  Mojgan Pourhassan,et al.  Improved runtime analysis of RLS and (1+1) EA for the dynamic vertex cover problem , 2017, 2017 IEEE Symposium Series on Computational Intelligence (SSCI).

[13]  Mojgan Pourhassan,et al.  Maintaining 2-Approximations for the Dynamic Vertex Cover Problem Using Evolutionary Algorithms , 2015, GECCO.

[14]  Mojgan Pourhassan,et al.  Parameterized Analysis of Multi-objective Evolutionary Algorithms and the Weighted Vertex Cover Problem , 2016, PPSN.

[15]  Frank Neumann,et al.  Maximizing Submodular Functions under Matroid Constraints by Evolutionary Algorithms , 2015, Evolutionary Computation.

[16]  Kate Smith-Miles,et al.  Generating new test instances by evolving in instance space , 2015, Comput. Oper. Res..

[17]  Jano I. van Hemert,et al.  Understanding TSP Difficulty by Learning from Evolved Instances , 2010, LION.

[18]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[19]  Per Kristian Lehre,et al.  Fixed Parameter Evolutionary Algorithms and Maximum Leaf Spanning Trees: A Matter of Mutation , 2010, PPSN.

[20]  Per Kristian Lehre,et al.  A Parameterised Complexity Analysis of Bi-level Optimisation with Evolutionary Algorithms , 2014, Evolutionary Computation.

[21]  Frank Neumann,et al.  Fixed-Parameter Evolutionary Algorithms and the Vertex Cover Problem , 2012, Algorithmica.

[22]  Frank Neumann,et al.  Parameterized Runtime Analyses of Evolutionary Algorithms for the Planar Euclidean Traveling Salesperson Problem , 2014, Evolutionary Computation.

[23]  S. Griffis.  EDITOR , 1997, Journal of Navigation.

[24]  Thomas Stützle,et al.  Ant Colony Optimization Theory , 2004 .

[25]  Bradley Alexander,et al.  Evolution of artistic image variants through feature based diversity optimisation , 2017, GECCO.