Dynamic optimization of cooperative operation path for agricultural machinery fleet
-
摘要: 随着我国农业机械化不断发展,智能农机应运而生,其作业路径被农机大数据中心实时监测、调控。合理的作业路径不仅可以提高作业效率,而且当车队运行状态或农田环境改变后,能实现精准作业,因此,研究如何动态优化车队协同作业具有十分重要的理论意义和实用价值。以总作业时间和作业时长综合最短为优化目标,同时避免作业冲突,构建机群协同作业路径动态优化模型,设计冲突检测规则,提出一种机群协同作业路径动态优化(DOFOP)算法。试验结果表明,当有农机发生故障时,重新优化后的作业时长、总作业时间比并排作业均减少2.52%,平均作业农田能力AEFC、农田效率FE比并排作业平均提高2.63%、2.59%;当有农机作业速率发生改变时,重新优化后的作业时长、总作业时间比原作业分别降低7.22%、2.73%,AEFC、FE比原作业分别提高7.99%、2.82%;当农田面积发生改变时,重新优化后的作业时长、总作业时间比原作业降低6.26%、0.1%,AEFC、FE比原作业分别提高6.48%、0.1%。当机群作业状态发生改变时,DOFOP算法能有效动态优化机群作业路径,提高机群作业效率,实现机群精准作业。Abstract: With the development of agricultural mechanization, intelligent agricultural machinery emerges as time requires. The operation path of the fleet is monitored and regulated by a big data center of agricultural machinery in real-time. A reasonable operation path can improve the efficiency of operation and achieve accurate operation when the fleet operation state or farmland environment changes. Therefore, it is of great theoretical significance and practical value to study how to optimize the cooperative operation of the fleet dynamically. In this paper, the optimization aims to minimize the total time and completion time of operation and avoid job conflicts. Firstly, a dynamic optimization model of the fleet cooperative operation path is constructed, and the conflict detection rules are designed. Then, a dynamic optimization algorithm, DOFOP, is proposed. The test results showed that when there was a failure of agricultural machinery, the completion time and total time of the re-optimized operation were reduced by 2.52% compared to the parallel operation, and the AEFC and FE were increased by 2.63% and 2.59% on average compared to the parallel operation. When there was a change in the operation rate of agricultural machinery, the operation time and total operation time of the re-optimized operation were reduced by 7.22% and 2.73%, respectively, and the AEFC and FE were lower than the original operation. When the farmland area changed, the operation time and total operation time decreased by 6.26% and 0.1%, and the AEFC and EF increased by 6.48% and 0.1%, respectively. When the operation status of the fleet changes, the DOFOP algorithm can effectively and dynamically optimize the operation path of the fleet, improve the efficiency of the fleet operation, and achieve the precise operation of the fleet.
-
-
[1] Hunt D.Farm power and machinery management [M].Ames,Iowa:Blackwell Pub Professional,1995.
[2] Oksanen T,Visala A.Coverage path planning algorithms for agricultural field machines [J].Journal of Field Robotics,2009,26(8):651-668.
[3] Hameed I A.,Bochtis D D,S⌀rensen C G,et al.Automated generation of guidance lines for operational field planning [J].Biosystems Engineering,2010,107(4):294-306.
[4] 孟志军,刘卉,王华,等.农田作业机械路径优化方法[J].农业机械学报,2012,43(6):147-152. Meng Zhijun,Liu Hui,Wang Hua,et al.Optimal path planning for agricultural machinery [J].Transactions of the Chinese Society for Agricultural Machinery,2010,43(6):147-152.
[5] Bochtis D D,Vougioukas S G.Minimising the non-working distance travelled by machines operating in a headland field pattern [J].Biosystems Engineering,2008,101(1):1-12.
[6] Bochtis D D,S⌀rensen C G.The vehicle routing problem in field logistics part I [J].Biosystems Engineering,2009,104(4):447-457.
[7] Hamza M A,Anderson W K.Soil compaction in cropping systems:A review of the nature,causes and possible solutions [J].Soil and tillage research,2005,82(2):121-145.
[8] Bochtis D D,S⌀rensen C G,Green O.A DSS for planning of soil-sensitive field operations [J].Decision Support Systems,2012,53(1):66-75.
[9] Bochtis D D,S⌀rensen C G,Busato P.Advances in agricultural machinery management:A review [J].Biosystems Engineering,2014,126:69-81.
[10] Seyyedhasani H,Dvorak J S.Using the vehicle routing problem to reduce field completion times with multiple machines [J].Computers and Electronics in Agriculture,2017,134:142-150.
[11] Li Junjun,Xu Bowei,Octavian P,et al.Impact analysis of travel time uncertainty on AGV catch-up conflict and the associated dynamic adjustment [J].Mathematical Problems in Engineering,2018:1-11.
[12] 张素云,杨勇生,梁承姬,等.自动化码头多AGV路径冲突的优化控制研究[J].交通运输系统工程与信息,2017,17(2):83-89. Zhang Suyun,Yang Yongsheng,Liang Chengji,et al.Optimal control of multiple AGV path conflict in automated terminals [J].Journal of Transportation Systems Engineering and Information Technology,2017,17(2):83-89.
[13] Seyyedhasani H,Dvorak J S.Dynamic rerouting of a fleet of vehicles in agricultural operations through a dynamic multiple depot vehicle routing problem representation [J].Biosystems Engineering,2018,171:63-77.
[14] Yu B,Ma N,Cai W,et al.Improved ant colonyoptimization for the dynamic multi-depot vehicle routing problem [J].International Journal of Logistics Research and Applications,2013,16(2):144-157.
[15] Luo J,Chen M R.Multi-phase modified shuffled frog leaping algorithm with extremal optimization for the MDVRP and the MDVRPTW [J].Computers & Industrial Engineering,2014,72:84-97.
[16] Tang X,An H,Wang C.Conflict-avoidance-oriented airport surface-taxiing guidance lights system model [J].Journal of Guidance Control and Dynamics,2012,35(2):674-681.
[17] Kharchenko V,Vasyliev D,Vasyliev V.Synthesis of conflict-free aircraft flight trajectories using multi-criteria dynamic programming [J].Aviation,2017,21(2):35-41.
[18] Zhang Z,Guo Q,Chen J,et al.Collision-free route planning for multiple AGVs in automated warehouse based on collision classification [J].IEEE Access,2018,6(99):26022-26035.
[19] Juan A A,Pascual I,Guimarans D,et al.Combining biased randomization with iterated local search for solving the multidepot vehicle routing problem [J].International Transactions in Operational Research,2014,22(4):647-667.
[20] Levin A,Yovel U.Local search algorithms for multiple-depot vehicle routing and for multiple traveling salesman problems with proved performance guarantees [J].Journal of Combinatorial Optimization,2014,28(4):726-747.
[21] Ghilas V,Demir E,Woensel T V.A scenario-based planning for the pickup and delivery problem with time windows,scheduled lines and stochastic demands [J].Transportation Research Part B:Methodological,2016,91:34-51.
[22] Chen Z L,Li S,Tirupati D.A scenario-based stochastic programming approach for technology and capacity planning [J].Computers & Operations Research,2002,29(7):781-806.
[23] Ouaddi K,Benadada Y,Mhada F Z.Ant colony system for dynamic vehicle routing problem with overtime [J].International Journal of Advanced Computer Science and Applications,2018,9(6):306-315.
[24] Mohammed M A,Ghani M K A,Hamed R I,et al.Solving vehicle routing problem by using improved K-nearest neighbor algorithm for best solution [J].Journal of Computational Science,2017,21:232-240.
[25] Azadeh A,Farrokhi-Asl H.The close-open mixed multi depot vehicle routing problem considering internal and external fleet of vehicles [J].Transportation Letters,2017,11(2):78-92.
[26] Shao S,Guan W,Bi J.Electric vehicle-routing problem with charging demands and energy consumption [J].IET Intelligent Transport Systems,2018,12(3):202-212.
-
期刊类型引用(3)
1. 王力. 基于大数据的农作物精准管理与农机协同作业研究. 河北农机. 2025(02): 22-24 . 百度学术
2. 满忠贤 ,何杰 ,刘善琪 ,岳孟东 ,胡炼 ,黄培奎 ,汪沛 ,罗锡文 . 智能农机多机协同收获作业控制方法与试验. 农业工程学报. 2024(01): 17-26 . 百度学术
3. 邓文乾,赖颖杰,张世昂,朱立学. 面向农田环境的农业多机器人协同技术研究进展. 中国农机化学报. 2024(10): 289-297 . 本站查看
其他类型引用(2)
计量
- 文章访问数: 0
- HTML全文浏览量: 0
- PDF下载量: 0
- 被引次数: 5