.png){kind=icon}
.png){kind=icon}
Return
A Task Allocation Framework for Field-Based Mobile Machines with Algorithm Selection and
.png){kind=icon}
PRE
AI
DOI：10.20965/jrm.2026.p0413.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This study proposes a generalizable and extensible framework for task allocation among multiple agricultural machines. Although several previous studies have focused on specific aspects, such as route planning and task scheduling under constrained conditions, have addressed the combined challenges of task division, variability in farmland scale, and algorithm lection with hyperparameter tuning in an integrated manner. To fill this gap, we formulate the problem a split delivery vehicle routing problem, which enables flexible division of field tasks across machines. Based on this formulation, we construct a unified framework that incorporates farmland modeling, machine modeling, and farmer-specific preferences. The proposed framework is designed to accommodate multiple optimization algorithms such as simulated annealing, local search, genetic algorithm, and ant colony optimization under a common structure, allowing flexible applications across diverse agricultural scenarios. We evaluated the performance and sensitivity of the algorithm to the hyperparameters using simulations for varying farmland sizes and computation times. The results demonstrate that the framework effectively supports gorithm selection and parameter tuning according situational needs. This approach offers a versatile foundation for optimizing agricultural tasks, and can be tended to dynamic and real-time environments using real farmland data.
Keywords:
chines
task allocation
optimization
split delivery vehicle
routing problem
Journal
IF:
0.8
Papers:
127
Citations:
1.1K