Solving the MAXSAT problem using a multivariate EDA based on Markov networks

Markov Networks (also known as Markov Random Fields) have been proposed as a new approach to probabilistic modelling in Estimation of Distribution Algorithms (EDAs). An EDA employing this approach called Distribution Estimation Using Markov Networks (DEUM) has been proposed and shown to work well on a variety of problems, using a unique fitness modelling approach. Previously DEUM has only been demonstrated on univariate and bivariate complexity problems. Here we show that it can be extended to a difficult multivariate problem and is capable of accurately modelling a fitness function and locating an optimum with a very small number of function evaluations.

[1]  David E. Goldberg,et al.  A Survey of Optimization by Building and Using Probabilistic Models , 2002, Comput. Optim. Appl..

[2]  J. E. Glynn,et al.  Numerical Recipes: The Art of Scientific Computing , 1989 .

[3]  David E. Goldberg,et al.  Hierarchical BOA Solves Ising Spin Glasses and MAXSAT , 2003, GECCO.

[4]  J. Laurie Snell,et al.  Markov Random Fields and Their Applications , 1980 .

[5]  John McCall,et al.  Updating the probability vector using MRF technique for a Univariate EDA , 2004 .

[6]  Thomas Stützle,et al.  SATLIB: An Online Resource for Research on SAT , 2000 .

[7]  Siddhartha Shakya,et al.  Solving the Ising Spin Glass Problem using a Bivariate EDA based on Markov Random Fields , 2006, 2006 IEEE International Conference on Evolutionary Computation.

[8]  David S. Johnson.  Approximation algorithms for combinatorial problems , 1973, STOC '73.

[9]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[10]  J. A. Lozano,et al.  Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation , 2001 .

[11]  Qingfu Zhang,et al.  An evolutionary algorithm with guided mutation for the maximum clique problem , 2005, IEEE Transactions on Evolutionary Computation.

[12]  Siddhartha Shakya,et al.  DEUM : a framework for an estimation of distribution algorithm based on Markov random fields , 2006 .

[13]  John A. W. McCall,et al.  Markov Random Field Modelling of Royal Road Genetic Algorithms , 2001, Artificial Evolution.

[14]  David S. Johnson,et al.  Approximation algorithms for combinatorial problems , 1973, STOC.