Scheduling of Collaborative Vegetable Harvesters and Harvest-Aid Vehicles on Farms

Transporting harvested vegetables in the field or greenhouse is labor-intensive. The utilization of small harvest-aid vehicles can reduce non-productive time for farmers and improve harvest efficiency. This paper models the process of harvesting vegetables in response to non-productive waiting delays caused by the scheduling of harvest-aid vehicles. Taking into consideration harvesting speed, harvest-aid vehicle capacity, and scheduling conflicts, a harvest-aid vehicle scheduling model is constructed to minimize non-production waiting time and coordination costs. Subsequently, to meet the collaborative needs of harvesters, this paper develops a discrete multi-objective Jaya optimization algorithm (DMO-Jaya), which combines an opposition-based learning mechanism and a long-term memory library to obtain scheduling schemes suitable for agricultural environments. Experiments show that the studied model can schedule harvest-aid vehicles without conflicts. Compared to the NSGA-II algorithm and the MMOPSO, the DMO-Jaya algorithm demonstrates a better diversity of solutions, resulting in a shorter non-productive waiting time for harvesters. This research provides a reference model for improving the efficiency of vegetable harvesting and transportation.

Authors

Institutions

Publication Details

Journal
Agriculture
Published
2024-09-13
DOI
https://doi.org/10.3390/agriculture14091600
Citations
2
Primary Topic
Vehicle Routing Optimization Methods
Type
article
Field-Weighted Citation Impact
0.70

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Scheduling of Collaborative Vegetable Harvesters and Harvest-Aid Vehicles on Farms

Yisheng Miao, Xiao Han, Huarui Wu, Huaji Zhu et al.
2 citations
Agriculture
Vehicle Routing Optimization Methods
0.70
article

Scheduling of Collaborative Vegetable Harvesters and Harvest-Aid Vehicles on Farms

Yisheng Miao, Xiao Han, Huarui Wu, Huaji Zhu, Jingqiu Gu, Wei Guo
article en
2 citations

Abstract

Transporting harvested vegetables in the field or greenhouse is labor-intensive. The utilization of small harvest-aid vehicles can reduce non-productive time for farmers and improve harvest efficiency. This paper models the process of harvesting vegetables in response to non-productive waiting delays caused by the scheduling of harvest-aid vehicles. Taking into consideration harvesting speed, harvest-aid vehicle capacity, and scheduling conflicts, a harvest-aid vehicle scheduling model is constructed to minimize non-production waiting time and coordination costs. Subsequently, to meet the collaborative needs of harvesters, this paper develops a discrete multi-objective Jaya optimization algorithm (DMO-Jaya), which combines an opposition-based learning mechanism and a long-term memory library to obtain scheduling schemes suitable for agricultural environments. Experiments show that the studied model can schedule harvest-aid vehicles without conflicts. Compared to the NSGA-II algorithm and the MMOPSO, the DMO-Jaya algorithm demonstrates a better diversity of solutions, resulting in a shorter non-productive waiting time for harvesters. This research provides a reference model for improving the efficiency of vegetable harvesting and transportation.

AgricultureVol. 14(9)
Ministry of Agriculture and Rural Affairs (CN), National Engineering Research Center for Information Technology in Agriculture (CN)
Beijing Academy of Agricultural and Forestry Sciences, National Key Research and Development Program of China
Openalex Percentile: Top 26%
Vehicle Routing Optimization Methods
0.70
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.