arXivDaily arXiv每日学术速递 周一至周五更新
北美退伍军人节(Veterans Day),12 日无更新
arXiv cs/9812017cs.AI
收藏

用近似推理求解组合问题的可重用迭代优化软件库

A reusable iterative optimization software library to solve combinatorial problems with approximate reasoning

Andreas Raggl, Wolfgang Slany

摘要:

现实世界的组合优化问题,如调度,通常太复杂,无法用精确的方法来解决。此外,问题往往要观察模糊指定的不同重要性的约束,可用的数据可能是不确定的,和对立的标准之间的妥协可能是必要的。我们提出了一个组合的近似推理为基础的约束和迭代优化为基础的算法,帮助建模和解决这些问题的框架中的C++软件库称为StarFLIP++。虽然最初开发的调度连铸机单位在钢铁厂,我们在本文中提出的结果,从重用库组件的轮班调度系统的劳动力的工业生产工厂。

英文摘要:

Real world combinatorial optimization problems such as scheduling are typically too complex to solve with exact methods. Additionally, the problems often have to observe vaguely specified constraints of different importance, the available data may be uncertain, and compromises between antagonistic criteria may be necessary. We present a combination of approximate reasoning based constraints and iterative optimization based heuristics that help to model and solve such problems in a framework of C++ software libraries called StarFLIP++. While initially developed to schedule continuous caster units in steel plants, we present in this paper results from reusing the library components in a shift scheduling system for the workforce of an industrial production plant.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑