@inproceedings{07e305421b0546dbb0c752995c904862,
title = "Cooperative Parallel SAT Local Search with Path Relinking",
abstract = "In this paper, we propose the use of path relinking to improve the performance of parallel portfolio-based local search solvers for the Boolean Satisfiability problem. In the portfolio-based framework several algorithms explore the search space in parallel, either independently or cooperatively with some communication between the solvers. Path relinking is a method to maintain an appropriate balance between diversification and intensification (and explore paths that aggregate elite solutions) to properly craft a new assignment for the variables to restart from. We present an empirical study that suggest that path relinking outperforms a set of well-known parallel portfolio-based local search algorithms with and without cooperation.",
keywords = "Parallel local search, SAT",
author = "Padraigh Jarvis and Alejandro Arbelaez",
note = "Publisher Copyright: {\textcopyright} 2020, Springer Nature Switzerland AG.; 20th European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP 2020, held as part of Evostar 2020 ; Conference date: 15-04-2020 Through 17-04-2020",
year = "2020",
doi = "10.1007/978-3-030-43680-3\_6",
language = "English",
isbn = "9783030436797",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer",
pages = "83--98",
editor = "Lu{\'i}s Paquete and Christine Zarges",
booktitle = "Evolutionary Computation in Combinatorial Optimization - 20th European Conference, EvoCOP 2020, Held as Part of EvoStar 2020, Proceedings",
address = "Germany",
}