Andrew M. Sutton
ABSTRACT
We investigate the MAX-2-SAT problem and study evolutionary algorithms by parameterized runtime analysis. The parameterized runtime analysis of evolutionary algorithms has been initiated recently and reveals new insights into which type of instances of NP-hard combinatorial optimization problems are hard to solve by evolutionary computing methods. We show that a variant of the (1+1) EA is a fixed-parameter evolutionary algorithm with respect to the standard parameterization for MAX-2-SAT. Furthermore, we study how the dependencies between the variables affect problem difficulty and present fixed-parameter evolutionary algorithms for the MAX-(2,3)-SAT problem where the studied parameter is the diameter of the variable graph.
- A. Auger and B. Doerr, editors. Theory of Randomized Search Heuristics: Foundations and Recent Developments. World Scientific, 2011. Google Scholar
Digital Library
- B. Doerr. Analyzing randomized search heuristics: Tools from probability theory. In Auger and DoerrciteBookAugDoe.Google Scholar
- M. Dorigo and T. Stützle. Ant Colony Optimization. MIT Press, 2004. Google ScholarDigital Library
- R. G. Downey and M. R. Fellows. Parameterized Complexity. Springer, 1999. Google ScholarDigital Library
- A. Eiben and J. Smith. Introduction to Evolutionary Computing. Springer, 2nd edition, 2007.Google Scholar
- J. Flum and M. Grohe. Parameterized complexity theory. Springer-Verlag, 2006. Google ScholarDigital Library
- M. R. Garey, D. S. Johnson, and L. J. Stockmeyer. Some simplified NP-complete graph problems. Theoretical Computer Science, 1(3):237--267, 1976.Google ScholarCross Ref
- L. K. Grover. Local search and the local structure of NP-complete problems. Operations Research Letters, 12:235--243, 1992. Google ScholarDigital Library
- S. Kratsch, P. K. Lehre, F. Neumann, and P. S. Oliveto. Fixed parameter evolutionary algorithms and maximum leaf spanning trees: A matter of mutation. In R. Schaefer, C. Cotta, J. Kolodziej, and G. Rudolph, editors, Eleventh International Conference on Parallel Problem Solving from Nature (PPSN XI), volume 6238 of Lecture Notes in Computer Science, pages 204--213. Springer, 2010. Google ScholarDigital Library
- S. Kratsch and F. Neumann. Fixed-parameter evolutionary algorithms and the vertex cover problem. In Proceedings of the Eleventh Annual Conference on Genetic and Evolutionary Computation, GECCO '09, pages 293--300, New York, NY, USA, 2009. ACM. Google ScholarDigital Library
- F. Neumann and C. Witt. Bioinspired Computation in Combinatorial Optimization -- Algorithms and Their Computational Complexity. Springer, 2010. Google ScholarDigital Library
- V. Raman, B. Ravikumar, and S. S. Rao. A simplified NP-complete MAXSAT problem. Information Processing Letters, 65(1):1--6, 1998. Google ScholarDigital Library
- C. M. Reidys and P. F. Stadler. Combinatorial landscapes. SIAM Review, 44:3--54, 2002. Google ScholarDigital Library
- P. F. Stadler. Toward a theory of landscapes. In R. Lopéz-Pena, R. Capovilla, R. García-Pelayo, H. Waelbroeck, and F. Zertruche, editors, Complex Systems and Binary Networks, pages 77--163. Springer Verlag, 1995.Google Scholar
- I. Wegener and C. Witt. On the analysis of a simple evolutionary algorithm on quadratic pseudo-Boolean functions. Journal of Discrete Algorithms, 3(1):61--78, 2005.Google ScholarCross Ref
Index Terms
- A parameterized runtime analysis of evolutionary algorithms for MAX-2-SAT
Recommendations
Parameterized runtime analyses of evolutionary algorithms for the planar euclidean traveling salesperson problem
Parameterized runtime analysis seeks to understand the influence of problem structure on algorithmic runtime. In this paper, we contribute to the theoretical understanding of evolutionary algorithms and carry out a parameterized analysis of evolutionary ...
Runtime analysis for self-adaptive mutation rates
GECCO '18: Proceedings of the Genetic and Evolutionary Computation ConferenceWe propose and analyze a self-adaptive version of the (1, λ) evolutionary algorithm in which the current mutation rate is part of the individual and thus also subject to mutation. A rigorous runtime analysis on the OneMax benchmark function reveals that ...
Towards a Runtime Comparison of Natural and Artificial Evolution
Evolutionary algorithms (EAs) form a popular optimisation paradigm inspired by natural evolution. In recent years the field of evolutionary computation has developed a rigorous analytical theory to analyse the runtimes of EAs on many illustrative ...
Comments