Please use this identifier to cite or link to this item: http://hdl.handle.net/1893/31768
Appears in Collections:Computing Science and Mathematics Conference Papers and Proceedings
Author(s): Ochoa, Gabriela
Chicano, Francisco
Tomassini, Marco
Title: Global Landscape Structure and the Random MAX-SAT Phase Transition
Editor(s): Bäck, Thomas
Preuss, Mike
Deutz, André
Wang, Hao
Doerr, Carola
Emmerich, Michael
Trautmann, Heike
Citation: Ochoa G, Chicano F & Tomassini M (2020) Global Landscape Structure and the Random MAX-SAT Phase Transition. In: Bäck T, Preuss M, Deutz A, Wang H, Doerr C, Emmerich M & Trautmann H (eds.) Parallel Problem Solving from Nature. Lecture Notes in Computer Science. PPSN 2020: Conference on Parallel Problem Solving from Nature, Leiden, The Netherlands, 05.09.2020-09.09.2020. Cham, Switzerland: Springer International Publishing, pp. 125-138. https://doi.org/10.1007/978-3-030-58115-2_9
Issue Date: 2020
Date Deposited: 30-Sep-2020
Series/Report no.: Lecture Notes in Computer Science
Conference Name: PPSN 2020: Conference on Parallel Problem Solving from Nature
Conference Dates: 2020-09-05 - 2020-09-09
Conference Location: Leiden, The Netherlands
Abstract: We revisit the fitness landscape structure of random MAX-SAT instances, and address the question: what structural features change when we go from easy underconstrained instances to hard overconstrained ones? Some standard techniques such as autocorrelation analysis fail to explain what makes instances hard to solve for stochastic local search algorithms, indicating that deeper landscape features are required to explain the observed performance differences. We address this question by means of local optima network (LON) analysis and visualisation. Our results reveal that the number, size, and, most importantly, the connectivity pattern of local and global optima change significantly over the easy-hard transition. Our empirical results suggests that the landscape of hard MAX-SAT instances may feature sub-optimal funnels, that is, clusters of sub-optimal solutions where stochastic local search methods can get trapped.
Status: AM - Accepted Manuscript
Rights: This is a post-peer-review, pre-copyedit version of a paper published in Bäck T, Preuss M, Deutz A, Wang H, Doerr C, Emmerich M & Trautmann H (eds.) Parallel Problem Solving from Nature. Lecture Notes in Computer Science. PPSN 2020: Conference on Parallel Problem Solving from Nature, Leiden, The Netherlands, 05.09.2020-09.09.2020. Cham, Switzerland: Springer International Publishing, pp. 125-138 The final authenticated version is available online at: https://doi.org/10.1007/978-3-030-58115-2_9
Licence URL(s): https://storre.stir.ac.uk/STORREEndUserLicence.pdf

Files in This Item:
File Description SizeFormat 
LONs_MAX_SAT_Phase_Transitions.pdfFulltext - Accepted Version842.78 kBAdobe PDFView/Open



This item is protected by original copyright



Items in the Repository are protected by copyright, with all rights reserved, unless otherwise indicated.

The metadata of the records in the Repository are available under the CC0 public domain dedication: No Rights Reserved https://creativecommons.org/publicdomain/zero/1.0/

If you believe that any material held in STORRE infringes copyright, please contact library@stir.ac.uk providing details and we will remove the Work from public display in STORRE and investigate your claim.