Conference Proceeding

Local Optima Network Analysis for MAX-SAT

Citation

Ochoa G & Chicano F (2019) Local Optima Network Analysis for MAX-SAT. In: López-Ibáñez M (ed.) GECCO '19: Proceedings of the Genetic and Evolutionary Computation Conference Companion. GECCO '19 - Genetic and Evolutionary Computation Conference, Prague, Czech Republic, 13.07.2019-17.07.2019. New York: Association for Computing Machinery, pp. 1430-1437. https://doi.org/10.1145/3319619.3326855

Abstract
Local Optima Networks (LONs) are a valuable tool to understand fitness landscapes of optimization problems observed from the perspective of a search algorithm. Local optima of the optimization problem are linked by an edge in LONs when an operation in the search algorithm allows one of them to be reached from the other. Previous work analyzed several combinatorial optimization problems using LONs and provided a visual guide to understand why the instances are difficult or easy for the search algorithms. In this work we analyze for the first time the MAX-SAT problem. Given a Boolean formula in Conjunctive Normal Form, the goal of the MAX-SAT problem is to find an assignment maximizing the number of satistified clauses. Several random and industrial instances of MAX-SAT are analyzed using Iterated Local Search to sample the search space.

Keywords
Local Optima Networks; MAX-SAT; Combinatorial Optimization; Funnels

StatusPublished
Publication date31/12/2019
Publication date online31/07/2019
URLhttp://hdl.handle.net/1893/31635
PublisherAssociation for Computing Machinery
Place of publicationNew York
ISBN978-1-4503-6748-6
ConferenceGECCO '19 - Genetic and Evolutionary Computation Conference
Conference locationPrague, Czech Republic
Dates