English

中国农机化学报

中国农机化学报 ›› 2024, Vol. 45 ›› Issue (10): 184-192.DOI: 10.13733/j.jcam.issn.2095-5553.2024.10.027

• 农业信息化工程 • 上一篇    下一篇

带时间窗的多目标农机跨区协同作业调度方法研究

郭亚倩1,张璠1,2,姚竟发3,常淑惠1,2,孟宇4,于春辉1   

  1. (1. 河北农业大学信息科学与技术学院,河北保定,071000; 2. 河北省农业大数据重点实验室,
    河北保定,071000; 3. 河北软件职业技术学院软件工程系,河北保定,071000; 
    4. 河北农业大学继续教育学院,河北保定,071000)
  • 出版日期:2024-10-15 发布日期:2024-09-30
  • 基金资助:
    河北省重点研发项目(21327407D);河北省高等学校科学研究项目(QN2023062);河北省自然科学基金项目(C2023204069)

Research on multi⁃objective cross‑area collaborative operation scheduling method of agricultural machinery with time window

Guo Yaqian1, Zhang Fan1, 2, Yao Jingfa3, Chang Shuhui1, 2, Meng Yu4, Yu Chunhui1   

  1. (1. College of Information Science and Technology, Hebei Agricultural University, Baoding, 071000, China; 
    2. Key Laboratory of Agricultural Big Data of Hebei Province, Baoding, 071000, China; 
    3. Software Engineering Department, Hebei Software Institute, Baoding, 071000, China; 
    4. College of Continuing Education, Hebei Agricultural University, Baoding, 071000, China)
  • Online:2024-10-15 Published:2024-09-30

摘要: 由于缺少科学合理的优化调度策略,在农收季节多机跨区作业常常出现作业成本高、作业效率低、无法在适宜作业的时间内完成农田任务等情况。针对此问题,在作业时间窗的约束下,以农机作业转移距离最短、调度总成本最低为目标,构建多机多目标跨区协同作业调度模型,设计基于优先级策略的多目标自适应优化调度算法(APRMOGA)。采用双层编码方式对基因进行编码,按照时间窗优先级规则依次分配联合收割机进行作业,产生初始种群;设计基于双层编码的时间窗优先级顺序交叉方法,优先保留开始作业时间早的基因,结合自适应变异概率和精英策略对个体进行选择变换,得到全局最优的Pareto解集。选取河北省内某地区24块农田进行试验验证,结果表明:APRMOGA算法运行效率要高于NSGA-Ⅱ算法;通过APRMOGA算法计算得到的联合收割机作业转移距离和调度总成本比NSGA-Ⅱ算法分别下降23.60%、13.72%。

关键词: 农机, 时间窗优先级策略, 多目标优化, 路径规划

Abstract: Due to the lack of scientific and reasonable optimization and scheduling strategies, multi‑machine cross‑regional operations during the agricultural harvest season often result in high operational costs, low operation efficiency and the inability to complete field tasks within the optimal time frame. In order to address this issue, a multi‑machine and multi‑objective cross‑regional collaborative operation scheduling model was constructed, targeting the shortest transfer distance for agricultural machinery and the lowest total scheduling cost under the constraint of operation time windows. A multi‑objective adaptive priority‑based optimization scheduling algorithm (APRMOGA) was designed. The genes were encoded by  dual‑layer encoding method, the combine harvesters were assigned successively for operation according to time window priority rules to generate the initial population. A time window priority sequence crossover method based on dual‑layer encoding was designed to preferentially retain genes with earlier start times. This is combined with adaptive mutation probability and elitism strategies to select and transform individuals, and obtain the globally optimal Pareto solution set. An experiment was conducted by using 24 fields in a certain region of Hebei Province for verification. The results indicated that the operational efficiency of the APRMOGA algorithm was higher than that of the NSGA-II algorithm. The transfer distance and total scheduling cost of combine harvesters calculated by the APRMOGA algorithm were reduced by 23.60% and 13.72%, respectively, compared to the NSGA-II algorithm.

Key words: agricultural machinery, time window prioritization strategy, multi?objective optimization, path planning

中图分类号: