Exploiting the Combinatorial Structures Found in Constraint Programming Models as Multivariate Distributions

利用约束规划模型中的组合结构作为多元分布

• 批准号: RGPIN-2017-05783
• 负责人: Pesant, Gilles
• 金额: $ 3.06万
• 依托单位: École Polytechnique de Montréal
• 依托单位国家: 加拿大
• 项目类别: Discovery Grants Program - Individual
• 财政年份: 2019
• 资助国家: 加拿大
• 起止时间: 2019-01-01 至 2020-12-31
• 项目状态: 已结题
• 来源: https://www.nserc-crsng.gc.ca/ase-oro/Details-Detailles_eng.asp?id=688467
• 关键词: Exploiting; Combinatorial; Structures; Found; Constraint

Many sectors of the economy rely on our ability to solve complex combinatorial problems in order to plan, organize, or schedule their activities in the best way possible. For example: scheduling nurses in a hospital according to their individual skills and preferences so that they cover the forecast demand in patient care, and assigning patients to them so as to achieve a balanced workload; or planning the construction of a forest road network in order to harvest and then transport the lumber, designing truck routes between harvesting sites and mills, and building synchronized schedules for trucks and loaders. Among the computerized methods to accomplish this, Constraint Programming represents the problem using a formalism that exposes much of its structure. This research proposes to use that structure in a deeper way in order to improve our ability to solve combinatorial problems. Any progress towards that general goal can apply to each of these sectors and therefore can have a significant impact on our productivity and well being. **

许多经济部门都依赖于我们解决复杂组合问题的能力，以便以最佳方式计划，组织或安排其活动。举例来说：根据护士的个人技能和偏好安排医院的护士，使他们能够满足病人护理的预测需求，并将病人分配给他们，以实现平衡的工作量;或者规划森林道路网的建设，以便收获然后运输木材，设计收获地点和米尔斯之间的卡车路线，并为卡车和装载机建立同步的时间表。在实现这一目标的计算机化方法中，约束编程使用暴露其大部分结构的形式主义来表示问题。本研究建议更深入地使用该结构，以提高我们解决组合问题的能力。在实现这一总体目标方面取得的任何进展都适用于上述每个部门，因此可能对我们的生产力和福祉产生重大影响。**