DeciLS-PBO: an Effective Local Search Method for Pseudo-Boolean Optimization (2301.12251v2)
Abstract: Local search is an effective method for solving large-scale combinatorial optimization problems, and it has made remarkable progress in recent years through several subtle mechanisms. In this paper, we found two ways to improve the local search algorithms in solving Pseudo-Boolean Optimization (PBO): Firstly, some of those mechanisms such as unit propagation are merely used in solving MaxSAT before, which can be generalized to solve PBO as well; Secondly, the existing local search algorithms utilize the heuristic on variables, so-called score, to mainly guide the search. We attempt to gain more insights into the clause, as it plays the role of a middleman who builds a bridge between variables and the given formula. Hence, we first extended the combination of unit propagation-based decimation algorithm to PBO problem, giving a further generalized definition of unit clause for PBO problem, and apply it to the existing solver LS-PBO for constructing an initial assignment; then, we introduced a new heuristic on clauses, dubbed care, to set a higher priority for the clauses that are less satisfied in current iterations. Experiments on benchmarks from the most recent PB Competition, as well as three real-world application benchmarks including minimum-width confidence band, wireless sensor network optimization, and seating arrangement problems show that our algorithm DeciLS-PBO has a promising performance compared to the state-of-the-art algorithms.
- A hybrid local search algorithm for minimum dominating set problems. Engineering Applications of Artificial Intelligence, 114:105053, 2022.
- Core-boosted linear search for incomplete maxsat. In Louis-Martin Rousseau and Kostas Stergiou, editors, Integration of Constraint Programming, Artificial Intelligence, and Operations Research - 16th International Conference, CPAIOR 2019, Thessaloniki, Greece, June 4-7, 2019, Proceedings, volume 11494 of Lecture Notes in Computer Science, pages 39–56. Springer, 2019.
- Efficient sat-based encodings of conditional cardinality constraints. In Gilles Barthe, Geoff Sutcliffe, and Margus Veanes, editors, LPAR-22. 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning, Awassa, Ethiopia, 16-21 November 2018, volume 57 of EPiC Series in Computing, pages 181–195. EasyChair, 2018.
- Improved local search for the minimum weight dominating set problem in massive graphs by using a deep optimization mechanism. Artificial Intelligence, 314:103819, 2023.
- Old techniques in new ways: Clause weighting, unit propagation and hybridization for maximum satisfiability. Artificial Intelligence, 287:103354, 2020.
- Improving the performance of stochastic local search for maximum vertex weight clique problem using programming by optimization. Expert Systems with Applications, 213(Part):118913, 2023.
- From decimation to local search and back: A new approach to maxsat. In Carles Sierra, editor, Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, IJCAI 2017, Melbourne, Australia, August 19-25, 2017, pages 571–577. ijcai.org, 2017.
- Using combinatorial benchmarks to probe the reasoning power of pseudo-boolean solvers. In Olaf Beyersdorff and Christoph M. Wintersteiger, editors, Theory and Applications of Satisfiability Testing - SAT 2018 - 21st International Conference, SAT 2018, Held as Part of the Federated Logic Conference, FloC 2018, Oxford, UK, July 9-12, 2018, Proceedings, volume 10929 of Lecture Notes in Computer Science, pages 75–93. Springer, 2018.
- Divide and conquer: Towards faster pseudo-boolean solving. In Jérôme Lang, editor, Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, IJCAI 2018, July 13-19, 2018, Stockholm, Sweden, pages 1291–1299. ijcai.org, 2018.
- Enhancing pigeon-hole based encoding of boolean cardinality constraints. In H. Jaap van den Herik, Ana Paula Rocha, and Joaquim Filipe, editors, Proceedings of the 9th International Conference on Agents and Artificial Intelligence, ICAART 2017, Volume 2, Porto, Portugal, February 24-26, 2017, pages 299–307. SciTePress, 2017.
- Encoding cardinality constraints using multiway merge selection networks. Constraints An International Journal, 24(3-4):234–251, 2019.
- Solving (weighted) partial maxsat by dynamic local search for SAT. In Jérôme Lang, editor, Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, IJCAI 2018, July 13-19, 2018, Stockholm, Sweden, pages 1346–1352. ijcai.org, 2018.
- Nudist: An efficient local search algorithm for (weighted) partial maxsat. The Computer Journal, 63(9):1321–1337, 2020.
- Extended conjunctive normal form and an efficient algorithm for cardinality constraints. In Christian Bessiere, editor, Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, IJCAI 2020, pages 1141–1147. ijcai.org, 2020.
- Efficient local search for pseudo boolean optimization. In Chu-Min Li and Felip Manyà, editors, Theory and Applications of Satisfiability Testing - SAT 2021 - 24th International Conference, Barcelona, Spain, July 5-9, 2021, Proceedings, volume 12831 of Lecture Notes in Computer Science, pages 332–348. Springer, 2021.
- CCEHC: an efficient local search algorithm for weighted partial maximum satisfiability. Artificial Intelligence, 243:26–44, 2017.
- A hybrid-order local search algorithm for set k-cover problem in wireless sensor networks. Frontiers of Computer Science, 17(3):173402, 2023.
- Maxsat evaluations, 2020. https://maxsat-evaluations.github.io/.
- Open-wbo: A modular maxsat solver,. In Carsten Sinz and Uwe Egly, editors, Theory and Applications of Satisfiability Testing - SAT 2014 - 17th International Conference, Held as Part of the Vienna Summer of Logic, VSL 2014, Vienna, Austria, July 14-17, 2014. Proceedings, volume 8561 of Lecture Notes in Computer Science, pages 438–445. Springer, 2014.
- The first evaluation of pseudo-boolean solvers (pb’05). Journal on Satisfiability, Boolean Modeling and Computation, 2(1-4):103–143, 2006.
- An improved master-apprentice evolutionary algorithm for minimum independent dominating set problem. Frontiers of Computer Science, 17(4):174326, 2023.
- Olivier Roussel. Pseudo-boolean competition 2016. http://www.cril.univ-artois.fr/PB16/ Accessed: 23 August 2022.
- Improvements to the implicit hitting set approach to pseudo-boolean optimization. In Kuldeep S. Meel and Ofer Strichman, editors, 25th International Conference on Theory and Applications of Satisfiability Testing, SAT 2022, August 2-5, 2022, Haifa, Israel, volume 236 of LIPIcs, pages 13:1–13:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022.
- Combining max-min ant system with effective local search for solving the maximum set k-covering problem. Knowledge-Based Systems, 239:108000, 2022.