Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
156 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

ParLS-PBO: A Parallel Local Search Solver for Pseudo Boolean Optimization (2407.21729v1)

Published 31 Jul 2024 in cs.AI

Abstract: As a broadly applied technique in numerous optimization problems, recently, local search has been employed to solve Pseudo-Boolean Optimization (PBO) problem. A representative local search solver for PBO is LSPBO. In this paper, firstly, we improve LSPBO by a dynamic scoring mechanism, which dynamically strikes a balance between score on hard constraints and score on the objective function. Moreover, on top of this improved LSPBO , we develop the first parallel local search PBO solver. The main idea is to share good solutions among different threads to guide the search, by maintaining a pool of feasible solutions. For evaluating solutions when updating the pool, we propose a function that considers both the solution quality and the diversity of the pool. Furthermore, we calculate the polarity density in the pool to enhance the scoring function of local search. Our empirical experiments show clear benefits of the proposed parallel approach, making it competitive with the parallel version of the famous commercial solver Gurobi.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (36)
  1. Choosing probability distributions for stochastic local search and the role of make versus break. In Alessandro Cimatti and Roberto Sebastiani, editors, Theory and Applications of Satisfiability Testing - SAT 2012 - 15th International Conference, Trento, Italy, June 17-20, 2012. Proceedings, volume 7317 of Lecture Notes in Computer Science, pages 16–29. Springer, 2012. doi:10.1007/978-3-642-31612-8\_3.
  2. Peter Barth. A davis-putnam based enumeration algorithm for linear pseudo-boolean optimization. Technical report, Max Plank Institute for Computer Science, 1995.
  3. Two proof procedures for a cardinality based language in propositional calculus. In Patrice Enjalbert, Ernst W. Mayr, and Klaus W. Wagner, editors, STACS 94, 11th Annual Symposium on Theoretical Aspects of Computer Science, Caen, France, February 24-26, 1994, Proceedings, volume 775 of Lecture Notes in Computer Science, pages 71–82. Springer, 1994. doi:10.1007/3-540-57785-8\_132.
  4. Minimum-width confidence bands via constraint optimization. In International Conference on Principles and Practice of Constraint Programming, pages 443–459. Springer, 2017.
  5. The scip optimization suite 8.0. arXiv preprint arXiv:2112.08872, 2021.
  6. Ccanr: A configuration checking based local search solver for non-random satisfiability. In Marijn Heule and Sean A. Weaver, editors, Theory and Applications of Satisfiability Testing - SAT 2015 - 18th International Conference, Austin, TX, USA, September 24-27, 2015, Proceedings, volume 9340 of Lecture Notes in Computer Science, pages 1–8. Springer, 2015. doi:10.1007/978-3-319-24318-4\_1.
  7. Memetic search for the generalized quadratic multiple knapsack problem. IEEE Trans. Evol. Comput., 20(6):908–923, 2016. doi:10.1109/TEVC.2016.2546340.
  8. Prs: A new parallel/distributed framework for sat. SAT COMPETITION 2023, page 39, 2023.
  9. Nuwls: Improving local search for (weighted) partial maxsat by new weighting techniques. In Brian Williams, Yiling Chen, and Jennifer Neville, editors, Thirty-Seventh AAAI Conference on Artificial Intelligence, AAAI 2023, Thirty-Fifth Conference on Innovative Applications of Artificial Intelligence, IAAI 2023, Thirteenth Symposium on Educational Advances in Artificial Intelligence, EAAI 2023, Washington, DC, USA, February 7-14, 2023, pages 3915–3923. AAAI Press, 2023. URL: https://ojs.aaai.org/index.php/AAAI/article/view/25505.
  10. Towards more efficient local search for pseudo-boolean optimization. In 29th International Conference on Principles and Practice of Constraint Programming (CP 2023). Schloss-Dagstuhl-Leibniz Zentrum für Informatik, 2023.
  11. New ideas for solving covering problems. In Bryan Preas, editor, Proceedings of the 32st Conference on Design Automation, San Francisco, California, USA, Moscone Center, June 12-16, 1995, pages 641–646. ACM Press, 1995. doi:10.1145/217474.217603.
  12. Cutting to the core of pseudo-boolean optimization: Combining core-guided search with cutting planes reasoning. In Thirty-Fifth AAAI Conference on Artificial Intelligence, AAAI 2021, Thirty-Third Conference on Innovative Applications of Artificial Intelligence, IAAI 2021, The Eleventh Symposium on Educational Advances in Artificial Intelligence, EAAI 2021, Virtual Event, February 2-9, 2021, pages 3750–3758. AAAI Press, 2021. URL: https://ojs.aaai.org/index.php/AAAI/article/view/16492.
  13. Translating pseudo-boolean constraints into sat. Journal on Satisfiability, Boolean Modeling and Computation, 2(1-4):1–26, 2006.
  14. 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. doi:10.24963/ijcai.2018/180.
  15. Armin Biere Katalin Fazekas Mathias Fleury and Maximilian Heisinger. Cadical, kissat, paracooba, plingeling and treengeling entering the sat competition 2020. SAT COMPETITION, 2020:50, 2020.
  16. Painless: A framework for parallel SAT solving. In Serge Gaspers and Toby Walsh, editors, Theory and Applications of Satisfiability Testing - SAT 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28 - September 1, 2017, Proceedings, volume 10491 of Lecture Notes in Computer Science, pages 233–250. Springer, 2017. doi:10.1007/978-3-319-66263-3\_15.
  17. LLC Gurobi Optimization. Gurobi optimizer reference manual, 2021.
  18. Oracle-based local search for pseudo-boolean optimization. In Kobi Gal, Ann Nowé, Grzegorz J. Nalepa, Roy Fairstein, and Roxana Radulescu, editors, ECAI 2023 - 26th European Conference on Artificial Intelligence, September 30 - October 4, 2023, Kraków, Poland - Including 12th Conference on Prestigious Applications of Intelligent Systems (PAIS 2023), volume 372 of Frontiers in Artificial Intelligence and Applications, pages 1124–1131. IOS Press, 2023. doi:10.3233/FAIA230387.
  19. Decils-pbo: an effective local search method for pseudo-boolean optimization. CoRR, abs/2301.12251, 2023. arXiv:2301.12251, doi:10.48550/arXiv.2301.12251.
  20. Investigations of graph properties in terms of wireless sensor network optimization. In 2018 IEEE International Conference on Future IoT Technologies (Future IoT), pages 1–8. IEEE, 2018.
  21. Portfolio sat and smt solving of cardinality constraints in sensor network optimization. In 2019 21st International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC), pages 85–91. IEEE, 2019.
  22. The sat4j library, release 2.2. Journal on Satisfiability, Boolean Modeling and Computation, 7(2-3):59–64, 2010.
  23. 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. doi:10.24963/ijcai.2018/187.
  24. 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. doi:10.1007/978-3-030-80223-3\_23.
  25. Chu Min Li and Yu Li. Satisfying versus falsifying in local search for satisfiability - (poster presentation). In Alessandro Cimatti and Roberto Sebastiani, editors, Theory and Applications of Satisfiability Testing - SAT 2012 - 15th International Conference, Trento, Italy, June 17-20, 2012. Proceedings, volume 7317 of Lecture Notes in Computer Science, pages 477–478. Springer, 2012. doi:10.1007/978-3-642-31612-8\_43.
  26. Solving covering problems using lpr-based lower bounds. In Ellen J. Yoffa, Giovanni De Micheli, and Jan M. Rabaey, editors, Proceedings of the 34st Conference on Design Automation, Anaheim, California, USA, Anaheim Convention Center, June 9-13, 1997, pages 117–120. ACM Press, 1997. doi:10.1145/266021.266046.
  27. Smac3: A versatile bayesian optimization package for hyperparameter optimization. Journal of Machine Learning Research, 23(54):1–9, 2022.
  28. Conflict-driven clause learning sat solvers. In Handbook of satisfiability, pages 133–182. 2021.
  29. Exploiting cardinality encodings in parallel maximum satisfiability. In 2011 IEEE 23rd International Conference on Tools with Artificial Intelligence, pages 313–320. IEEE, 2011.
  30. Parallel search for maximum satisfiability. AI Communications, 25(2):75–95, 2012.
  31. 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. doi:10.1007/978-3-319-09284-3\_33.
  32. Lisbon wedding: seating arrangements using maxsat. MaxSAT Evaluation, pages 25–26, 2017.
  33. Pseudo-boolean and cardinality constraints. In Armin Biere, Marijn Heule, Hans van Maaren, and Toby Walsh, editors, Handbook of Satisfiability - Second Edition, volume 336 of Frontiers in Artificial Intelligence and Applications, pages 1087–1129. IOS Press, 2021. doi:10.3233/FAIA201012.
  34. Fiberscip - A shared memory parallelization of SCIP. INFORMS J. Comput., 30(1):11–30, 2018. doi:10.1287/ijoc.2017.0762.
  35. 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. doi:10.4230/LIPIcs.SAT.2022.13.
  36. Hkis, hcad, pakis and painless exmaplelcmdistchronobt in the sc21. SAT COMPETITION, 2021:26, 2021.
Citations (1)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now
X Twitter Logo Streamline Icon: https://streamlinehq.com

Tweets