{"title":"在给定计算时间限制的情况下为伪布尔优化自动选择算法","authors":"","doi":"10.1016/j.cor.2024.106836","DOIUrl":null,"url":null,"abstract":"<div><p>Machine learning (ML) techniques have been proposed to automatically select the best solver from a portfolio of solvers. They have been applied to various problems including Boolean Satisfiability, Traveling Salesperson and Graph Coloring. These techniques are used to implement <em>meta-solvers</em> that receive, as input, the instance of a problem, predict the best-performing solver in the portfolio, and execute it to deliver a solution. Typically, the quality of the solution improves with a longer computational time. This has led to the development of <em>anytime meta-solvers</em>, which consider both the instance and a user-prescribed computational time limit. <em>Anytime meta-solvers</em> predict the best-performing solver within the specified time limit. In this study, we focus on designing anytime meta-solvers for the NP-hard optimization problem of <em>Pseudo-Boolean Optimization</em> (PBO), which generalizes Satisfiability and Maximum Satisfiability problems. The effectiveness of our approach is demonstrated via extensive empirical study in which our anytime meta-solver, named PBO_MS, improves dramatically on the performance of Mixed Integer Programming solver Gurobi, which is the best-performing single solver in the portfolio. We generalize the anytime meta-solver by predicting a given number <span><math><mrow><mi>p</mi><mo>≥</mo><mn>1</mn></mrow></math></span> of best solvers in the portfolio and then run these, each with equal share of the specified time limit. This anytime <span><math><mi>p</mi></math></span>-meta-solver is shown here to outperform both the anytime 1-meta-solver as well as a fixed selection of <span><math><mi>p</mi></math></span> solvers by a wide margin.</p></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":null,"pages":null},"PeriodicalIF":4.1000,"publicationDate":"2024-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Automatic algorithm selection for Pseudo-Boolean optimization with given computational time limits\",\"authors\":\"\",\"doi\":\"10.1016/j.cor.2024.106836\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>Machine learning (ML) techniques have been proposed to automatically select the best solver from a portfolio of solvers. They have been applied to various problems including Boolean Satisfiability, Traveling Salesperson and Graph Coloring. These techniques are used to implement <em>meta-solvers</em> that receive, as input, the instance of a problem, predict the best-performing solver in the portfolio, and execute it to deliver a solution. Typically, the quality of the solution improves with a longer computational time. This has led to the development of <em>anytime meta-solvers</em>, which consider both the instance and a user-prescribed computational time limit. <em>Anytime meta-solvers</em> predict the best-performing solver within the specified time limit. In this study, we focus on designing anytime meta-solvers for the NP-hard optimization problem of <em>Pseudo-Boolean Optimization</em> (PBO), which generalizes Satisfiability and Maximum Satisfiability problems. The effectiveness of our approach is demonstrated via extensive empirical study in which our anytime meta-solver, named PBO_MS, improves dramatically on the performance of Mixed Integer Programming solver Gurobi, which is the best-performing single solver in the portfolio. We generalize the anytime meta-solver by predicting a given number <span><math><mrow><mi>p</mi><mo>≥</mo><mn>1</mn></mrow></math></span> of best solvers in the portfolio and then run these, each with equal share of the specified time limit. This anytime <span><math><mi>p</mi></math></span>-meta-solver is shown here to outperform both the anytime 1-meta-solver as well as a fixed selection of <span><math><mi>p</mi></math></span> solvers by a wide margin.</p></div>\",\"PeriodicalId\":10542,\"journal\":{\"name\":\"Computers & Operations Research\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":4.1000,\"publicationDate\":\"2024-09-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Computers & Operations Research\",\"FirstCategoryId\":\"5\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0305054824003083\",\"RegionNum\":2,\"RegionCategory\":\"工程技术\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computers & Operations Research","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0305054824003083","RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0
摘要
有人提出了机器学习(ML)技术,用于从一组求解器中自动选择最佳求解器。这些技术已被应用于各种问题,包括布尔可满足性、旅行推销员和图形着色。这些技术用于实现元求解器,元求解器接收问题实例作为输入,预测组合中性能最佳的求解器,并执行它以提供解决方案。通常情况下,计算时间越长,解决方案的质量就越高。因此,随时元求解器应运而生,它同时考虑了实例和用户规定的计算时间限制。随时元求解器可在指定时限内预测性能最佳的求解器。在本研究中,我们主要针对伪布尔优化(PBO)这一 NP 难优化问题设计随时元求解器。我们的随时元求解器被命名为 PBO_MS,通过广泛的实证研究证明了我们方法的有效性,它显著提高了混合整数编程求解器 Gurobi 的性能,而 Gurobi 是混合整数编程求解器组合中性能最好的单一求解器。我们通过预测组合中最佳求解器的给定数量 p≥1 来推广随时元求解器,然后运行这些求解器,每个求解器在指定时限内的份额相同。这种随时 p 元求解器的性能远远优于随时 1 元求解器和固定选择的 p 求解器。
Automatic algorithm selection for Pseudo-Boolean optimization with given computational time limits
Machine learning (ML) techniques have been proposed to automatically select the best solver from a portfolio of solvers. They have been applied to various problems including Boolean Satisfiability, Traveling Salesperson and Graph Coloring. These techniques are used to implement meta-solvers that receive, as input, the instance of a problem, predict the best-performing solver in the portfolio, and execute it to deliver a solution. Typically, the quality of the solution improves with a longer computational time. This has led to the development of anytime meta-solvers, which consider both the instance and a user-prescribed computational time limit. Anytime meta-solvers predict the best-performing solver within the specified time limit. In this study, we focus on designing anytime meta-solvers for the NP-hard optimization problem of Pseudo-Boolean Optimization (PBO), which generalizes Satisfiability and Maximum Satisfiability problems. The effectiveness of our approach is demonstrated via extensive empirical study in which our anytime meta-solver, named PBO_MS, improves dramatically on the performance of Mixed Integer Programming solver Gurobi, which is the best-performing single solver in the portfolio. We generalize the anytime meta-solver by predicting a given number of best solvers in the portfolio and then run these, each with equal share of the specified time limit. This anytime -meta-solver is shown here to outperform both the anytime 1-meta-solver as well as a fixed selection of solvers by a wide margin.
期刊介绍:
Operations research and computers meet in a large number of scientific fields, many of which are of vital current concern to our troubled society. These include, among others, ecology, transportation, safety, reliability, urban planning, economics, inventory control, investment strategy and logistics (including reverse logistics). Computers & Operations Research provides an international forum for the application of computers and operations research techniques to problems in these and related fields.