Abstract

Aiming at the operational efficiency of small farm machinery groups in cooperative operations in hilly areas, this study proposes a static task allocation model. This method combines the optimal gene fragment retention method based on a genetic algorithm (OGFR-GA) and the method for generating multi-loop weighted connected graphs based on Prim’s algorithm (MLW-Prim). The collaborative objective function for the harvester group was established by considering factors such as operation time, fuel consumption, and distance. The OGFR-GA was designed and applied multiple times to obtain several optimal gene fragments corresponding to the number of farm machines. These fragments were used as critical paths in the weighted connected graph generated based on farm machinery performance parameters and task parameters. The MLW-Prim method was proposed to construct this weighted connected graph and realize the static task allocation model for multi-machine cooperative operations. Simulation experiments showed that the model combining OGFR-GA and MLW-Prim achieved optimal values with fewer iterations, and reduced both group cost and cost variance compared to traditional algorithms. This method meets the static task allocation needs for multi-machine cooperative operations in agricultural production and can be integrated with intelligent operations in mountainous and hilly regions, laying a theoretical foundation for improving efficiency.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.