Black-box complexities of combinatorial problems

Black-box complexity, counting the number of queries needed to find the optimum of a problem without having access to an explicit problem description, was introduced by Droste, Jansen, and Wegener [S. Droste, T. Jansen, I. Wegener, Upper and lower bounds for randomized search heuristics in black-box optimization, Theory of Computing Systems 39 (2006) 525-544] to measure the difficulty of solving an optimization problem via generic search heuristics such as evolutionary algorithms, simulated annealing or ant colony optimization. Since then, a number of similar complexity notions were introduced. However, so far these new notions were only analyzed for artificial test problems. In this paper, we move a step forward and analyze the different black-box complexity notions for two classic combinatorial problems, namely the minimum spanning tree and the single-source shortest path problem. Besides proving bounds for their black-box complexities, our work reveals that the choice of how to model the optimization problem has a significant influence on its black-box complexity. In addition, when regarding the unbiased (symmetry-invariant) black-box complexity of combinatorial problems, it is important to choose a meaningful definition of unbiasedness.

[1]  Benjamin Doerr,et al.  Too fast unbiased black-box algorithms , 2011, GECCO '11.

[2]  Benjamin Doerr,et al.  Towards a Complexity Theory of Randomized Search Heuristics: Ranking-Based Black-Box Complexity , 2011, CSR.

[3]  Martin Skutella,et al.  On the size of weights in randomized search heuristics , 2009, FOGA '09.

[4]  Rajeev Motwani,et al.  Randomized algorithms , 1996, CSUR.

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

[6]  Dirk Sudholt,et al.  Simple max-min ant systems and the optimization of linear pseudo-boolean functions , 2010, FOGA '11.

[7]  Martin Skutella,et al.  Evolutionary algorithms and matroid optimization problems , 2007, GECCO.

[8]  Michael D. Vose,et al.  Unbiased black box search algorithms , 2011, GECCO '11.

[9]  Per Kristian Lehre,et al.  Faster black-box algorithms through higher arity operators , 2010, FOGA '11.

[10]  Thomas Jansen,et al.  UNIVERSITY OF DORTMUND REIHE COMPUTATIONAL INTELLIGENCE COLLABORATIVE RESEARCH CENTER 531 Design and Management of Complex Technical Processes and Systems by means of Computational Intelligence Methods Upper and Lower Bounds for Randomized Search Heuristics in Black-Box Optimization , 2004 .

[11]  Frank Neumann,et al.  Design and Management of Complex Technical Processes and Systems by Means of Computational Intelligence Methods Runtime Analysis of a Simple Ant Colony Optimization Algorithm Runtime Analysis of a Simple Ant Colony Optimization Algorithm , 2022 .

[12]  Carsten Witt,et al.  Bioinspired Computation in Combinatorial Optimization , 2010, Bioinspired Computation in Combinatorial Optimization.

[13]  Ingo Wegener,et al.  Randomized local search, evolutionary algorithms, and the minimum spanning tree problem , 2004, Theor. Comput. Sci..

[14]  Petr Kovár,et al.  Factorizations of Complete Graphs into Spanning Trees with All Possible Maximum Degrees , 2009, IWOCA.

[15]  Benjamin Doerr,et al.  Crossover can provably be useful in evolutionary computation , 2012, Theor. Comput. Sci..

[16]  Andrew Chi-Chih Yao,et al.  Probabilistic computations: Toward a unified measure of complexity , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[17]  I. Wegener,et al.  The Analysis of Evolutionary Algorithms on Sorting and Shortest Paths Problems , 2004 .

[18]  Benjamin Doerr,et al.  Edge-based representation beats vertex-based representation in shortest path problems , 2010, GECCO '10.

[19]  Frank Neumann,et al.  Bioinspired computation in combinatorial optimization: algorithms and their computational complexity , 2012, GECCO '12.

[20]  Benjamin Doerr,et al.  Black-box complexities of combinatorial problems , 2011, GECCO '11.

[21]  Frank Neumann,et al.  Computing single source shortest paths using single-objective fitness , 2009, FOGA '09.

[22]  Frank Neumann,et al.  More effective crossover operators for the all-pairs shortest path problem , 2013, Theor. Comput. Sci..

[23]  Ingo Wegener,et al.  Fitness Landscapes Based on Sorting and Shortest Paths Problems , 2002, PPSN.

[24]  A. Hora,et al.  Distance-Regular Graphs , 2007 .

[25]  Benjamin Doerr,et al.  Tight Analysis of the (1+1)-EA for the Single Source Shortest Path Problem , 2011, Evolutionary Computation.

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

[27]  Ingo Wegener,et al.  Methods for the Analysis of Evolutionary Algorithms on Pseudo-Boolean Functions , 2003 .