research-article

A parameterized runtime analysis of evolutionary algorithms for MAX-2-SAT

Authors:

Andrew M. Sutton,

Frank NeumannAuthors Info & Claims

GECCO '12: Proceedings of the 14th annual conference on Genetic and evolutionary computation

Pages 433 - 440

https://doi.org/10.1145/2330163.2330225

Published: 07 July 2012 Publication History

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.

References

[1]

A. Auger and B. Doerr, editors. Theory of Randomized Search Heuristics: Foundations and Recent Developments. World Scientific, 2011.

Digital Library

[2]

B. Doerr. Analyzing randomized search heuristics: Tools from probability theory. In Auger and DoerrciteBookAugDoe.

[3]

M. Dorigo and T. Stützle. Ant Colony Optimization. MIT Press, 2004.

Digital Library

[4]

R. G. Downey and M. R. Fellows. Parameterized Complexity. Springer, 1999.

Digital Library

[5]

A. Eiben and J. Smith. Introduction to Evolutionary Computing. Springer, 2nd edition, 2007.

[6]

J. Flum and M. Grohe. Parameterized complexity theory. Springer-Verlag, 2006.

Digital Library

[7]

M. R. Garey, D. S. Johnson, and L. J. Stockmeyer. Some simplified NP-complete graph problems. Theoretical Computer Science, 1(3):237--267, 1976.

[8]

L. K. Grover. Local search and the local structure of NP-complete problems. Operations Research Letters, 12:235--243, 1992.

Digital Library

[9]

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.

Digital Library

[10]

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.

Digital Library

[11]

F. Neumann and C. Witt. Bioinspired Computation in Combinatorial Optimization -- Algorithms and Their Computational Complexity. Springer, 2010.

Digital Library

[12]

V. Raman, B. Ravikumar, and S. S. Rao. A simplified NP-complete MAXSAT problem. Information Processing Letters, 65(1):1--6, 1998.

Digital Library

[13]

C. M. Reidys and P. F. Stadler. Combinatorial landscapes. SIAM Review, 44:3--54, 2002.

Digital Library

[14]

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.

[15]

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.

Cited By

Neumann FSutton AEsparcia-Alcázar A(2015)Parameterized Complexity Analysis of Evolutionary AlgorithmsProceedings of the Companion Publication of the 2015 Annual Conference on Genetic and Evolutionary Computation10.1145/2739482.2756562(435-450)Online publication date: 11-Jul-2015
https://dl.acm.org/doi/10.1145/2739482.2756562
Zhou YLai XLi K(2015)Approximation and Parameterized Runtime Analysis of Evolutionary Algorithms for the Maximum Cut ProblemIEEE Transactions on Cybernetics10.1109/TCYB.2014.235434345:8(1491-1498)Online publication date: Aug-2015
https://doi.org/10.1109/TCYB.2014.2354343
Neumann FSutton AArnold D(2014)Parameterized complexity analysis of evolutionary algorithmsProceedings of the Companion Publication of the 2014 Annual Conference on Genetic and Evolutionary Computation10.1145/2598394.2605351(607-622)Online publication date: 12-Jul-2014
https://dl.acm.org/doi/10.1145/2598394.2605351
Show More Cited By

Index Terms

A parameterized runtime analysis of evolutionary algorithms for MAX-2-SAT
1. Theory of computation
  1. Design and analysis of algorithms

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 ...
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 ...
The choice of the offspring population size in the (1,λ) evolutionary algorithm

We extend the theory of non-elitist evolutionary algorithms (EAs) by considering the offspring population size in the (1,@l) EA. We establish a sharp threshold at @l=log"e"e"-"1n~5log"1"0n between exponential and polynomial running times on OneMax. For ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

GECCO '12: Proceedings of the 14th annual conference on Genetic and evolutionary computation

July 2012

1396 pages

ISBN:9781450311779

DOI:10.1145/2330163

Editor:
Terence Soule
University of Idaho, USA
,
General Chair:
Jason H. Moore
Dartmouth College, USA

Copyright © 2012 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGEVO: ACM Special Interest Group on Genetic and Evolutionary Computation

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 07 July 2012

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

GECCO '12

Sponsor:

SIGEVO

GECCO '12: Genetic and Evolutionary Computation Conference

July 7 - 11, 2012

Pennsylvania, Philadelphia, USA

Acceptance Rates

Overall Acceptance Rate 1,669 of 4,410 submissions, 38%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4
Total Citations
View Citations
132
Total Downloads

Downloads (Last 12 months)2
Downloads (Last 6 weeks)0

Reflects downloads up to 16 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Neumann FSutton AEsparcia-Alcázar A(2015)Parameterized Complexity Analysis of Evolutionary AlgorithmsProceedings of the Companion Publication of the 2015 Annual Conference on Genetic and Evolutionary Computation10.1145/2739482.2756562(435-450)Online publication date: 11-Jul-2015
https://dl.acm.org/doi/10.1145/2739482.2756562
Zhou YLai XLi K(2015)Approximation and Parameterized Runtime Analysis of Evolutionary Algorithms for the Maximum Cut ProblemIEEE Transactions on Cybernetics10.1109/TCYB.2014.235434345:8(1491-1498)Online publication date: Aug-2015
https://doi.org/10.1109/TCYB.2014.2354343
Neumann FSutton AArnold D(2014)Parameterized complexity analysis of evolutionary algorithmsProceedings of the Companion Publication of the 2014 Annual Conference on Genetic and Evolutionary Computation10.1145/2598394.2605351(607-622)Online publication date: 12-Jul-2014
https://dl.acm.org/doi/10.1145/2598394.2605351
Sutton ANeumann F(2012)A parameterized runtime analysis of simple evolutionary algorithms for makespan schedulingProceedings of the 12th international conference on Parallel Problem Solving from Nature - Volume Part I10.1007/978-3-642-32937-1_6(52-61)Online publication date: 1-Sep-2012
https://dl.acm.org/doi/10.1007/978-3-642-32937-1_6

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents