基于张量学习约束的人员排班自动化
Automating Personnel Rostering by Learning Constraints Using Tensors
摘要:
运筹学中的许多问题要求在模型中指定约束。确定正确的约束条件是一项艰巨的任务。我们提出了一种方法来自动化这个过程中使用人工智能和机器学习原则。到目前为止,只有很少的工作在运筹学界的学习约束。我们专注于人员排班和调度问题,其中往往有过去的时间表,并表明,它是可以自动学习的限制,从这样的例子。为了实现这一点,我们采用了一些技术,从约束编程社区,我们已经扩展它们,以应付多维的例子。该方法使用张量表示的例子,这有助于捕获的维度以及结构的例子,并应用张量操作,以找到的约束条件,满足的例子。为了评估所提出的算法,我们使用了护士排班比赛的约束条件,并生成满足这些约束条件的解决方案;然后将这些解决方案作为示例来学习约束条件。实验表明,该算法能够产生人类可读的约束,捕捉的例子的基本特征。
英文摘要:
Many problems in operations research require that constraints be specified in the model. Determining the right constraints is a hard and laborsome task. We propose an approach to automate this process using artificial intelligence and machine learning principles. So far there has been only little work on learning constraints within the operations research community. We focus on personnel rostering and scheduling problems in which there are often past schedules available and show that it is possible to automatically learn constraints from such examples. To realize this, we adapted some techniques from the constraint programming community and we have extended them in order to cope with multidimensional examples. The method uses a tensor representation of the example, which helps in capturing the dimensionality as well as the structure of the example, and applies tensor operations to find the constraints that are satisfied by the example. To evaluate the proposed algorithm, we used constraints from the Nurse Rostering Competition and generated solutions that satisfy these constraints; these solutions were then used as examples to learn constraints. Experiments demonstrate that the proposed algorithm is capable of producing human readable constraints that capture the underlying characteristics of the examples.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。