Learning variable ordering heuristics for solving constraint satisfaction problems
Backtracking search algorithms are often used to solve the Constraint Satisfaction Problem (CSP), which is widely applied in various domains such as automated planning and scheduling. The efficiency of backtracking search depends greatly on the variable ordering heuristics. Currently, the most commo...
Saved in:
Main Authors: | , , , , |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2022
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/8070 https://ink.library.smu.edu.sg/context/sis_research/article/9073/viewcontent/LEARNING_VARIABLE.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
id |
sg-smu-ink.sis_research-9073 |
---|---|
record_format |
dspace |
spelling |
sg-smu-ink.sis_research-90732023-09-07T07:58:52Z Learning variable ordering heuristics for solving constraint satisfaction problems SONG, Wen CAO, Zhiguang ZHANG, Jie XU, Chi LIM, Andrew Backtracking search algorithms are often used to solve the Constraint Satisfaction Problem (CSP), which is widely applied in various domains such as automated planning and scheduling. The efficiency of backtracking search depends greatly on the variable ordering heuristics. Currently, the most commonly used heuristics are hand-crafted based on expert knowledge. In this paper, we propose a deep reinforcement learning based approach to automatically discover new variable ordering heuristics that are better adapted for a given class of CSP instances, without the need of relying on hand-crafted features and heuristics. We show that directly optimizing the search tree size is not convenient for learning, and propose to optimize the expected cost of reaching a leaf node in the search tree. To capture the complex relations among the variables and constraints, we design a representation scheme based on Graph Neural Network that can process CSP instances with different sizes and constraint arities. Experimental results on random CSP instances show that on small and medium sized instances, the learned policies outperform classical hand-crafted heuristics with smaller search tree (up to 10.36% reduction). Moreover, without further training, our policies directly generalize to instances of larger sizes and much harder to solve than those in training, with even larger reduction in the search tree size (up to 18.74%). 2022-03-01T08:00:00Z text application/pdf https://ink.library.smu.edu.sg/sis_research/8070 info:doi/10.1016/j.engappai.2021.104603 https://ink.library.smu.edu.sg/context/sis_research/article/9073/viewcontent/LEARNING_VARIABLE.pdf http://creativecommons.org/licenses/by-nc-nd/4.0/ Research Collection School Of Computing and Information Systems eng Institutional Knowledge at Singapore Management University Constraint Satisfaction Problem;Variable ordering;Deep reinforcement learning;Graph Neural Network Artificial Intelligence and Robotics |
institution |
Singapore Management University |
building |
SMU Libraries |
continent |
Asia |
country |
Singapore Singapore |
content_provider |
SMU Libraries |
collection |
InK@SMU |
language |
English |
topic |
Constraint Satisfaction Problem;Variable ordering;Deep reinforcement learning;Graph Neural Network Artificial Intelligence and Robotics |
spellingShingle |
Constraint Satisfaction Problem;Variable ordering;Deep reinforcement learning;Graph Neural Network Artificial Intelligence and Robotics SONG, Wen CAO, Zhiguang ZHANG, Jie XU, Chi LIM, Andrew Learning variable ordering heuristics for solving constraint satisfaction problems |
description |
Backtracking search algorithms are often used to solve the Constraint Satisfaction Problem (CSP), which is widely applied in various domains such as automated planning and scheduling. The efficiency of backtracking search depends greatly on the variable ordering heuristics. Currently, the most commonly used heuristics are hand-crafted based on expert knowledge. In this paper, we propose a deep reinforcement learning based approach to automatically discover new variable ordering heuristics that are better adapted for a given class of CSP instances, without the need of relying on hand-crafted features and heuristics. We show that directly optimizing the search tree size is not convenient for learning, and propose to optimize the expected cost of reaching a leaf node in the search tree. To capture the complex relations among the variables and constraints, we design a representation scheme based on Graph Neural Network that can process CSP instances with different sizes and constraint arities. Experimental results on random CSP instances show that on small and medium sized instances, the learned policies outperform classical hand-crafted heuristics with smaller search tree (up to 10.36% reduction). Moreover, without further training, our policies directly generalize to instances of larger sizes and much harder to solve than those in training, with even larger reduction in the search tree size (up to 18.74%). |
format |
text |
author |
SONG, Wen CAO, Zhiguang ZHANG, Jie XU, Chi LIM, Andrew |
author_facet |
SONG, Wen CAO, Zhiguang ZHANG, Jie XU, Chi LIM, Andrew |
author_sort |
SONG, Wen |
title |
Learning variable ordering heuristics for solving constraint satisfaction problems |
title_short |
Learning variable ordering heuristics for solving constraint satisfaction problems |
title_full |
Learning variable ordering heuristics for solving constraint satisfaction problems |
title_fullStr |
Learning variable ordering heuristics for solving constraint satisfaction problems |
title_full_unstemmed |
Learning variable ordering heuristics for solving constraint satisfaction problems |
title_sort |
learning variable ordering heuristics for solving constraint satisfaction problems |
publisher |
Institutional Knowledge at Singapore Management University |
publishDate |
2022 |
url |
https://ink.library.smu.edu.sg/sis_research/8070 https://ink.library.smu.edu.sg/context/sis_research/article/9073/viewcontent/LEARNING_VARIABLE.pdf |
_version_ |
1779157137719558144 |