.png){kind=icon}
返回
Enhancing constraint programming via supervised learning for job shop scheduling
.png){kind=icon}
OA
AI
DOI：10.1016/j.knosys.2024.111698.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Constraint programming (CP) is a powerful technique for solving constraint satisfaction and optimization problems. In CP solvers, the variable ordering strategy used to select which variable to explore first in the solving process has a significant impact on solver effectiveness. To address this issue, we propose a novel variable ordering strategy based on supervised learning, which we evaluate in the context of job shop scheduling problems. Our learning -based methods predict the optimal solution of a problem instance and use the predicted solution to order variables for CP solvers. Unlike traditional variable ordering methods, our methods can learn from the characteristics of each problem instance and customize the variable ordering strategy accordingly, leading to improved solver performance. Our experiments demonstrate that training machine learning models is highly efficient and can achieve high accuracy. Furthermore, our learned variable ordering methods perform competitively compared to four existing methods. Finally, we showcase the benefits of integrating machine learning -based variable ordering methods with conventional domain -based approaches through tie -breaking.
Keyword:
Constraint programming
Supervised learning
Variable ordering
Job shop scheduling problem
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
K
IF:
7.6
论文数:
1.3W
被引数:
4.5W
机构
引用论文
.png){kind=icon}
分享收藏Online Vehicle Routing With Neural Combinatorial Optimization and Deep Reinforcement Learning基于神经组合优化和深度强化学习的在线车辆路径选择
PREAI
分享收藏
查看更多内容