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

Proceedings of GECCO 2007: Genetic and Evolutionary Computation Conference, Companion Material

Volumn , Issue , 2007, Pages 2423-2428

  Brownlee, Alexander E I ^a   McCall, John A W ^a   Brown, Deryck F ^a  

^a ROBERT GORDON UNIVERSITY   (United Kingdom)

Author keywords

Estimation of distribution algorithms; Evolutionary algorithms; Probabilistic modelling

Indexed keywords

COMPUTATIONAL COMPLEXITY; EVOLUTIONARY ALGORITHMS; FUNCTION EVALUATION; PROBABILISTIC LOGICS; PROBLEM SOLVING;

DISTRIBUTION ALGORITHMS; FITNESS MODELING; PROBABILISTIC MODELING;

PARALLEL ALGORITHMS;

EID: 34548094843     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1274000.1274005     Document Type: Conference Paper

References (14)

1. BROWN, D.F., GARMENDIA-DOVAL, A.B. AND MCCALL, J.A.W. 2002. Markov Random Field Modelling of Royal Road Genetic Algorithms. In Selected Papers from the 5th European Conference on Artificial Evolution, Springer-Verlag, 65-76.
2. HOOS, H.H. AND STÜTZLE, T. 2000. SATLIB: An Online Resource for Research on SAT. In SAT 2000, I.P. GENT, H. V. MAAREN AND T. WALSH, Eds. IOS Press, 283-292.
3. JOHNSON, D.S. 1973. Approximation algorithms for combinatorial problems. In STOC '73: Proceedings of the fifth annual ACM symposium on Theory of computing, Austin, Texas, United States, ACM Press, New York, NY, USA, 38-49.
4. KINDERMANN, R. AND SNELL, J.L. 1980. Markov Random Fields and their Applications. AMS Press, Providence, RI, USA.
5. KIRKPATRICK, S., GERLATT, CD. AND VECCHI, M.P. 1983. Optimization by Simulated Annealing. Science 220, 671-680.
6. LARRAÑAGA, P. AND LOZANO, J.A. 2002. Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation. Kluwer Academic Publishers, Boston.
7. LUCEY, T. 1984. Quantatitive Techniques: An Instructional Manual. D. P. Publications, Eastleigh, Hampshire, UK.
8. PELIKAN, M., GOLDBERG, DE. AND LOBO, F. 1999. A Survey of Optimization by Building and Using Probabilistic Models. Technical Report IlliGAL Report 99018, University of Illinois at Urbana-Champaing
9. PELIKAN, M. AND GOLDBERG, D. 2003. Hierarchical BOA solves Ising spin glasses and MAXSAT. In Proceedings of the Genetic and Evolutionary Computation Conference 2003 (GECCO-2003), 2003, Springer-Verlag, 1271-1282.
10. PRESS, W.H., FLANNERY, B.P., TEUKOLSKY, S.A. AND VETTERLING, W.T. 1986. Numerical Recipes: The Art of Scientific Computing. Cambridge University Press, Cambridge, UK.
11. SHAKYA, S., MCCALL, J. AND BROWN, D. 2004. Updating the Probability Vector using MRF Technique for a Univariate EDA. In Proceedings of STAIRS 2004, IOS Press, 15-25.
12. SHAKYA, S.K. 2006. DEUM: A framework for an Estimation of Distribution Algorithm based on Markov Random Fields. PhD Thesis, The Robert Gordon University, Aberdeen, UK.
13. SHAKYA, S.K., MCCALL, J.A.W. AND BROWN, D.F. 2006. Solving the Ising Spin Glass Problem using a bivariate EDA based on Markov Random Fields. In Proceedings of IEEE Congress on Evolutionary Computation (IEEE CEC 2006), Vancouver, Canada, 16-21 July 2006, IEEE Press,
14. ZHANG, Q., SUN, J. AND TSANG, E. 2005. An evolutionary algorithm with guided mutation for the maximum clique problem IEEE Trans. Evolutionary Computation, vol 9, issue 2. Pp 192-200.