"Counting-Based Search in Constraint Programming: Ongoing Design, Analysis, and Application to Solve Practical Combinatorial Satisfaction and Optimization Problems"

“约束规划中基于计数的搜索：持续设计、分析和应用，以解决实际的组合满足和优化问题”

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

Many planning and scheduling problems arising in industry and public services are challenging to solve satisfactorily, especially if we have limited time to solve them. The solutions actually implemented could typically be improved to achieve better services, higher efficiency, or increased profit. This research is about one computational approach to solve such problems, called Constraint Programming. By improving the way we search for solutions, we may reach better solutions in reasonable time.

在工业和公共服务中出现的许多计划和调度问题具有挑战性，难以令人满意地解决，特别是如果我们有有限的时间来解决它们。实际实施的解决方案通常可以改进，以实现更好的服务，更高的效率或增加的利润。本研究是关于一种计算方法来解决这些问题，称为约束规划。通过改进我们寻找解决方案的方式，我们可以在合理的时间内找到更好的解决方案。