arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2102.12574cs.AImath.OC
收藏

知识工程混合整数线性规划:约束类型学

Knowledge engineering mixed-integer linear programming: constraint typology

Deakin University(迪肯大学);School of Information Technology(信息技术学院);The University of Melbourne(墨尔本大学);Electrical and Electronic Engineering(电气与电子工程学院)

Vicky Mak-Hau, John Yearwood, William Moran

摘要:

本文研究了混合整数线性规划MILP公式的约束类型。MILP是一种常用的数学编程技术,用于建模和解决现实生活中的调度,路由,规划,资源分配,优化问题,为工业部门提供优化的业务解决方案,例如:制造业,农业,国防,医疗保健,医药,能源,金融和运输。尽管现实生活中发现并解决了许多组合优化问题,还有数百万个问题有待发现和制定,但作为MILP构建模块的约束类型的数量相对要少得多。在搜索一个合适的机器可读的知识表示的MILP,我们提出了一个优化建模树的基础上建立的MILP本体,可以用作自动化系统的指导,以引出一个MILP模型从最终用户对他们的组合业务优化问题。

英文摘要:

In this paper, we investigate the constraint typology of mixed-integer linear programming MILP formulations. MILP is a commonly used mathematical programming technique for modelling and solving real-life scheduling, routing, planning, resource allocation, timetabling optimization problems, providing optimized business solutions for industry sectors such as: manufacturing, agriculture, defence, healthcare, medicine, energy, finance, and transportation. Despite the numerous real-life Combinatorial Optimization Problems found and solved, and millions yet to be discovered and formulated, the number of types of constraints, the building blocks of a MILP, is relatively much smaller. In the search of a suitable machine readable knowledge representation for MILPs, we propose an optimization modelling tree built based upon an MILP ontology that can be used as a guidance for automated systems to elicit an MILP model from end-users on their combinatorial business optimization problems.

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

↑