A collaborative scheduling and planning method for multiple machines in harvesting and transportation operations-Part Ⅰ: Harvester task allocation and sequence optimization

IF 7.7 1区 农林科学 Q1 AGRICULTURE, MULTIDISCIPLINARY
Ning Wang , Shunda Li , Jianxing Xiao , Tianhai Wang , Yuxiao Han , Hao Wang , Man Zhang , Han Li
{"title":"A collaborative scheduling and planning method for multiple machines in harvesting and transportation operations-Part Ⅰ: Harvester task allocation and sequence optimization","authors":"Ning Wang ,&nbsp;Shunda Li ,&nbsp;Jianxing Xiao ,&nbsp;Tianhai Wang ,&nbsp;Yuxiao Han ,&nbsp;Hao Wang ,&nbsp;Man Zhang ,&nbsp;Han Li","doi":"10.1016/j.compag.2025.110060","DOIUrl":null,"url":null,"abstract":"<div><div>In the scenario of harvesting-transportation operation, the collaborative scheduling of harvesters and grain trucks is crucial for addressing the challenge of scheduling different types of agricultural machinery in farm areas. During the harvest, the harvesters and grain trucks must cooperate within a short time window. This study is divided into two parts (Part Ⅰ and Part Ⅱ), focusing on the collaborative scheduling problem of the harvesters, and operation coordination between harvesters and grain trucks, respectively. In this paper (Part I), we focus on addressing the problem of harvester task allocation and path planning. First, the topological map method was used to define the topological structure and construct an electronic map of the farm. Then, a multi-harvester task allocation model was built, and a greedy minimum–maximum load balancing algorithm based on the nearest-neighbor heuristic (GMM-LB-NNH) algorithm was proposed to solve the model and obtain the task sequence for the harvesters. Finally, based on the task sequence, the whole-process path planning for the harvester was completed. We conducted simulation tests of harvester task allocation and whole-process path planning experiments for harvesters using the electronic map we developed. The results demonstrate that the proposed method effectively achieves harvester task allocation and path planning. Additionally, it significantly reduces overall operation time by an average of 29.8 min compared to the Ant Colony Optimization algorithm and by 12.6 min compared to the Genetic Algorithm, providing a novel approach for the scheduling and planning of the same types of agricultural machinery.</div></div>","PeriodicalId":50627,"journal":{"name":"Computers and Electronics in Agriculture","volume":"232 ","pages":"Article 110060"},"PeriodicalIF":7.7000,"publicationDate":"2025-02-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computers and Electronics in Agriculture","FirstCategoryId":"97","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0168169925001668","RegionNum":1,"RegionCategory":"农林科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"AGRICULTURE, MULTIDISCIPLINARY","Score":null,"Total":0}
引用次数: 0

Abstract

In the scenario of harvesting-transportation operation, the collaborative scheduling of harvesters and grain trucks is crucial for addressing the challenge of scheduling different types of agricultural machinery in farm areas. During the harvest, the harvesters and grain trucks must cooperate within a short time window. This study is divided into two parts (Part Ⅰ and Part Ⅱ), focusing on the collaborative scheduling problem of the harvesters, and operation coordination between harvesters and grain trucks, respectively. In this paper (Part I), we focus on addressing the problem of harvester task allocation and path planning. First, the topological map method was used to define the topological structure and construct an electronic map of the farm. Then, a multi-harvester task allocation model was built, and a greedy minimum–maximum load balancing algorithm based on the nearest-neighbor heuristic (GMM-LB-NNH) algorithm was proposed to solve the model and obtain the task sequence for the harvesters. Finally, based on the task sequence, the whole-process path planning for the harvester was completed. We conducted simulation tests of harvester task allocation and whole-process path planning experiments for harvesters using the electronic map we developed. The results demonstrate that the proposed method effectively achieves harvester task allocation and path planning. Additionally, it significantly reduces overall operation time by an average of 29.8 min compared to the Ant Colony Optimization algorithm and by 12.6 min compared to the Genetic Algorithm, providing a novel approach for the scheduling and planning of the same types of agricultural machinery.
收割和运输作业中多台机器的协同调度和计划方法--第Ⅰ部分:收割机任务分配和顺序优化
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Computers and Electronics in Agriculture
Computers and Electronics in Agriculture 工程技术-计算机:跨学科应用
CiteScore
15.30
自引率
14.50%
发文量
800
审稿时长
62 days
期刊介绍: Computers and Electronics in Agriculture provides international coverage of advancements in computer hardware, software, electronic instrumentation, and control systems applied to agricultural challenges. Encompassing agronomy, horticulture, forestry, aquaculture, and animal farming, the journal publishes original papers, reviews, and applications notes. It explores the use of computers and electronics in plant or animal agricultural production, covering topics like agricultural soils, water, pests, controlled environments, and waste. The scope extends to on-farm post-harvest operations and relevant technologies, including artificial intelligence, sensors, machine vision, robotics, networking, and simulation modeling. Its companion journal, Smart Agricultural Technology, continues the focus on smart applications in production agriculture.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信