An Evaluation of Methods for Estimating the Number of Local Optima in Combinatorial Optimization Problems

The solution of many combinatorial optimization problems is carried out by metaheuristics, which generally make use of local search algorithms. These algorithms use some kind of neighborhood structure over the search space. The performance of the algorithms strongly depends on the properties that the neighborhood imposes on the search space. One of these properties is the number of local optima. Given an instance of a combinatorial optimization problem and a neighborhood, the estimation of the number of local optima can help not only to measure the complexity of the instance, but also to choose the most convenient neighborhood to solve it. In this paper we review and evaluate several methods to estimate the number of local optima in combinatorial optimization problems. The methods reviewed not only come from the combinatorial optimization literature, but also from the statistical literature. A thorough evaluation in synthetic as well as real problems is given. We conclude by providing recommendations of methods for several scenarios.

[1]  Bernard Harris,et al.  Determining Bounds on Integrals with Applications to Cataloging Problems , 1959 .

[2]  Alden H. Wright,et al.  Stability of Vertex Fixed Points and Applications , 1994, FOGA.

[3]  K. Burnham,et al.  Estimation of the size of a closed population when capture probabilities vary among animals , 1978 .

[4]  B. Lindsay,et al.  A Penalized Nonparametric Maximum Likelihood Approach to Species Richness Estimation , 2005 .

[5]  É. Taillard Some efficient heuristic methods for the flow shop sequencing problem , 1990 .

[6]  Christian Bierwirth,et al.  A search space analysis of the Job Shop Scheduling Problem , 1999, Ann. Oper. Res..

[7]  A. Chao,et al.  Estimating the Number of Classes via Sample Coverage , 1992 .

[8]  Christian Bierwirth,et al.  Production Scheduling and Rescheduling with Genetic Algorithms , 1999, Evolutionary Computation.

[9]  S. Kirkpatrick,et al.  Configuration space analysis of travelling salesman problems , 1985 .

[10]  Sébastien Vérel,et al.  Complex-network analysis of combinatorial spaces: The NK landscape case , 2008, Physical review. E, Statistical, nonlinear, and soft matter physics.

[11]  Ji-ping Wang,et al.  Estimating species richness by a Poisson-compound gamma model. , 2010, Biometrika.

[12]  Kathleen Steinhöfel,et al.  Combinatorial landscape analysis for k-SAT instances , 2008, 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence).

[13]  Alexander Mendiburu,et al.  A review on estimation of distribution algorithms in permutation-based combinatorial optimization problems , 2012, Progress in Artificial Intelligence.

[14]  Rich Caruana,et al.  Estimating the Number of Local Minima in Big, Nasty Search Spaces , 1999 .

[15]  G. Seber A Review of Estimating Animal Abundance II , 1992 .

[16]  John Bunge,et al.  Estimating the Number of Species in a Stochastic Abundance Model , 2002, Biometrics.

[17]  Anton V. Eremeev,et al.  Non-parametric Estimation of Properties of Combinatorial Landscapes , 2002, EvoWorkshops.

[18]  S. T. Buckland,et al.  Estimating Animal Abundance , 2002 .

[19]  Colin R. Reeves,et al.  Estimating the Number of Solutions for SAT Problems , 2004, PPSN.

[20]  W. Link Nonidentifiability of Population Size from Capture‐Recapture Data with Heterogeneous Detection Probabilities , 2003, Biometrics.

[21]  Bruce G. Lindsay,et al.  An exponential partial prior for improving nonparametric maximum likelihood estimation in mixture models , 2008 .

[22]  Panos M. Pardalos,et al.  On the number of local minima for the multidimensional assignment problem , 2006, J. Comb. Optim..

[23]  R. Beaver,et al.  Estimation of the Number of Classes in a Population , 2007 .

[24]  J. Bunge,et al.  Estimating the Number of Species: A Review , 1993 .

[25]  Colin R. Reeves The "Crossover Landscape" and the Hamming Landscape for Binary Search Spaces , 2002, FOGA.

[26]  Anton V. Eremeev,et al.  Statistical analysis of local search landscapes , 2004, J. Oper. Res. Soc..

[27]  Brigitte Jaumard,et al.  Local Optima Topology for the k-Coloring Problem , 1991, Discret. Appl. Math..

[28]  Kathleen Steinhöfel,et al.  Analysis of Local Search Landscapes for k-SAT Instances , 2010, Math. Comput. Sci..

[29]  Colin R. Reeves Statistical Properties of Combinatorial Landscapes: An Application to Scheduling Problems , 2001 .

[30]  Cyril Fonlupt,et al.  18 FITNESS LANDSCAPES AND PERFORMANCE OF METAHEURISTICS , 1999 .

[31]  L. Kallel,et al.  How to detect all maxima of a function , 2001 .

[32]  A. Chao Nonparametric estimation of the number of classes in a population , 1984 .

[33]  A. Chao,et al.  Stopping rules and estimation for recapture debugging with unequal failure rates , 1993 .

[34]  Toby Walsh,et al.  The TSP Phase Transition , 1996, Artif. Intell..

[35]  G. Seber,et al.  Estimating Animal Abundance: Review III , 1999 .

[36]  I. Good THE POPULATION FREQUENCIES OF SPECIES AND THE ESTIMATION OF POPULATION PARAMETERS , 1953 .

[37]  Anton V. Eremeev,et al.  On Confidence Intervals for the Number of Local Optima , 2003, EvoWorkshops.

[38]  G. Seber A review of estimating animal abundance. , 1986, Biometrics.