Pretrained Parameter Configurator for Large Neighborhood Search to Solve Weighted Constraint Satisfaction Problems.

IJCNN(2023)

引用 0|浏览2
暂无评分
摘要
Weighted constraint satisfaction problems (WCSPs) are one of the most important constraint programming models aiming to find a cost-minimal solution. Tree-based Large Neighborhood Search (T-LNS) is an important local search based incomplete algorithm to solve a WCSP. Currently, when solving unseen problem instances, the parameter of T-LNS (i.e., destroy rate t) is obtained by either trying different values or adapting the value that has been shown to be well-performed in a known problem set. However, the best value of the destroy rate t that yields the best performance for T-LNS varies over different problem instances. As a result, tuning the parameter in such a hand-crafted way could either be tedious or hinder the performance of T-LNS. Therefore, to further stabilize and optimize the performance of T-LNS when solving WCSP instances, we propose to build a pretrained algorithm configurator that can recommend a suitable value of t for T-LNS based on the problem instance it will solve, via supervised learning. In more detail, in order to achieve instance-specific parameter prediction, we propose to encode the information such as the size and structure of a WCSP instance into a feature vector, and then leverage the fledged machine learning models to build our first pretrained algorithm configurator. Then, in order to encode a WCSP instance more comprehensively, we propose to use directed tripartite graph to represent a WCSP instance, which can represent the high-dimensional cost values in constrain functions. Then, we use Graph Attention Networks (GATs) to learn the embedding of tripartite graph and then build our second pretrained algorithm configurator. Finally, the experimental results show that our proposed algorithm configurators can effectively recommend suitable parameters for T-LNS in a series problem instances, yielding better performance over other competitors on different benchmark problems.
更多
查看译文
关键词
algorithm configurators,constraint programming models,cost-minimal solution,destroy rate,dimensional cost values,fledged machine learning models,important local search,incomplete algorithm,instance-specific parameter prediction,known problem,local search based incomplete algorithm,neighborhood search,pretrained algorithm configurator,pretrained parameter configurator,problem instance,problem instances,series problem instances,solving unseen problem instances,T-LNS varies,tree-based large neighborhood search,WCSP instance,weighted constraint satisfaction problems
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要