首页> 外文期刊>RAIRO Operation Research >SOLVING THE CROP ALLOCATION PROBLEM USING HARD AND SOFT CONSTRAINTS
【24h】

SOLVING THE CROP ALLOCATION PROBLEM USING HARD AND SOFT CONSTRAINTS

机译:使用硬约束解决农作物分配问题

获取原文
获取原文并翻译 | 示例
       

摘要

Application tools for the crop allocation problem (CAP) are required for agricultural advisors to design more efficient fanning systems. Despite the extensive treatment of this issue by agronomists in the past, few methods tackle the crop allocation problem considering both the spatial and the temporal aspects of the CAP. In this paper, we precisely propose an original formulation addressing the crop allocation planning problem while taking farmers' management choices into account. These choices are naturally represented by hard and soft constraints in the Weighted CSP formalism. We illustrate our proposition by solving a medium-size virtual farm using either a WCSP solver (toulbar2) or an ILP solver (Number Jack/SCIP). This preliminary work foreshadows the development of a decision-aid tool for supporting farmers in their crop allocation strategies.
机译:农业顾问需要使用针对作物分配问题(CAP)的应用工具来设计更有效的扇形系统。尽管过去农学家对此问题进行了广泛的处理,但考虑到CAP的时空方面,很少有方法可以解决作物分配问题。在本文中,我们精确地提出了解决农作物分配计划问题的原始方案,同时考虑了农民的管理选择。这些选择自然由加权CSP形式主义中的硬约束和软约束表示。我们通过使用WCSP求解器(toulbar2)或ILP求解器(Number Jack / SCIP)求解中型虚拟服务器场来说明我们的建议。这项初步工作预示着将开发一种决策辅助工具来支持农民的作物分配策略。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号