CAI Jimeng,WANG Weibing,QU Jiahao,et al.Optimizing path of sparse planting and transplanting plug seedlings based on genetic-ant colony interactive algorithms[J].Journal of Huazhong Agricultural University,2025,44(04):248-258.
CAI Jimeng,WANG Weibing,QU Jiahao,et al.Optimizing path of sparse planting and transplanting plug seedlings based on genetic-ant colony interactive algorithms[J].Journal of Huazhong Agricultural University,2025,44(04):248-258.DOI: 10.13300/j.cnki.hnlkxb.2025.04.024.
Optimizing path of sparse planting and transplanting plug seedlings based on genetic-ant colony interactive algorithms
The ant colony-genetic optimization algorithm(ACGO) and genetic-ant colony optimization algorithm(GACO) interactive algorithms based on genetic algorithm and ant colony algorithm was proposed to optimize the path of sparse planting transplanting to solve the problem of low efficiency in planning the path of transplanting plug seedlings to low-density plug trays. The fixed sequence method and five other algorithms were used to calculate the length of transplanting path for plug trays with holes from 72-32,72-50,128-50, and 128-32 holes through simulation experiments. Comparative analyses were conducted on the performance of algorithms in optimizing the length of transplanting path and the time of calculation. The stability of the algorithm was evaluated by the relative standard deviation. The results showed that the GACO algorithm reduced the average length of path in transplanting plug tray with 72 to 32 holes by 59.3% compared with the fixed sequence method, with an average time of calculation of 5.15 seconds and a relative standard deviation of approximately 1.5%. The ACGO algorithm reduced the average length of path by 19.2%, with an average time of calculation of 13.50 seconds and a relative standard deviation of approximately 1%. The results of further studies showed that the optimization effect of ACGO algorithm in the scenarios of transplanting from 200 holes to 72 holes and 105 holes was weaker than that of greedy algorithm, while GACO algorithm had higher universality and stability under different combinations of hole numbers and numbers of missed seedling. It is indicated that both interactive algorithms have improved the performance of the original algorithm, but the GACO algorithm performs better in dealing with problems in planning path of complex sparse planting and transplanting plug seedlings. It will provide a strong reference basis for optimizing the path of sparse planting and transplanting plug seedlings.
关键词
Keywords
references
刘蒙滋,姜凯,王秀,等.蔬菜自动移栽机研究现状与展望[J].农机化研究,2024,46(10):1-8.LIU M Z,JIANG K,WANG X,et al.Research status and prospect of vegetable automatic transplanter[J].China industrial economics,2024,46(10):1-8 (in Chinese with English abstract) .
张佳敏,韩孟红,徐强辉,等.蔬菜高效移栽机械化技术探索与优化[J].农机科技推广,2023(4):44-46.ZHANG J M,HAN M H,XU Q H,et al.Exploration and optimization of vegetable efficient transplanting mechanization technology[J].Agriculture machinery technology extension,2023(4):44-46 (in Chinese) .
WU X L,GAO D L.A study on greedy search to improve simulated annealing for large-scale traveling salesman problem[C]//Advances in Swarm Intelligence.Cham:Springer International Publishing,2017:250-257.
BLUM C.Ant colony optimization:introduction and recent trends[J].Physics of life reviews,2005,2(4):353-373.
李腾辉,周德强,何冯光,等.基于遗传算法优化模糊PID的甘蔗收获机切割器控制系统[J].华中农业大学学报,2023,42(2):243-250.LI T H,ZHOU D Q,HE F G,et al.Control system of sugarcane harvester cutter based on fuzzy PID optimized by genetic algorithm[J].Journal of Huazhong Agricultural University,2023, 42(2):243-250 (in Chinese with English abstract) .
IWATA H,NINOMIYA S.AntMap:constructing genetic linkage maps using an ant colony optimization algorithm[J].Breeding science,2006,56(4):371-377.
贺磊盈,杨太玮,武传宇,等.基于贪心遗传算法的穴盘苗补栽路径优化[J].农业机械学报,2017,48(5):36-43. HE L Y,YANG T W,WU C Y,et al.Optimization of replugging tour planning based on greedy genetic algorithm[J].Transactions of the CSAM,2017,48(5):36-43 (in Chinese with English abstract) .
LI X J,WANG W B,LIU G H,et al.Optimizing the path of plug tray seedling transplanting by using the improved A* algorithm[J/OL].Agriculture,2022,12(9):1302[2024-06-30].https://doi.org/10.3390/agriculture12091302.
TONG J H,QIU Z A,ZHOU H L,et al.Optimizing the path of seedling transplanting with multi-end effectors by using an improved greedy annealing algorithm[J/OL].Computers and electronics in agriculture,2022,201:107276[2024-06-30].https://doi.org/10.1016/j.compag.2022.107276.
LEE Z J,SU S F,CHUANG C C,et al.Genetic algorithm with ant colony optimization (GA-ACO) for multiple sequence alignment[J].Applied soft computing,2008,8(1):55-78.
HU J P,YAN X Y,MA J,et al.Dimensional synthesis and kinematics simulation of a high-speed plug seedling transplanting robot[J].Computers and electronics in agriculture,2014,107:64-72.
童俊华,蒋焕煜,武传宇.基于贪心算法的温室钵苗稀植移栽路径优化[J].农业机械学报,2016,47(3):8-13.TONG J H,JIANG H Y,WU C Y.Optimization of seedlings lower density transplanting path based on greedy algorithm[J].Transactions of the CSAM,2016,47(3):8-13 (in Chinese with English abstract) .
TONG J H,WU C Y,JIANG H Y,et al.Optimizing the path of seedling low-density transplanting by using greedy genetic algorithm[J].Computers and electronics in agriculture,2017,142:356-368.
徐守江.基于蚁群算法的穴盘苗自动移钵路径优化[J].江苏农业科学,2015,43(12):475-477. XU S J.Optimization of automatic pot-moving path of plug seedlings based on ant colony algorithm[J].Jiangsu agricultural sciences,2015,43(12):475-477 (in Chinese) .
童俊华,蒋焕煜,周鸣川.基于遗传算法的穴盘苗自动移钵路径优化[J].农业机械学报,2013,44(4):45-49.TONG J H,JIANG H Y,ZHOU M C.Optimization of seedling transplanti ng path based on genetic algorithm[J].Transactions of the CSAM,2013,44(4):45-49 (in Chinese with English abstract) .
冯莉,吕修凯,崔生乐,等.基于双向迪杰斯特拉算法移栽机补栽路径规划及仿真[J].中国农机化学报,2023,44(3):177-182.FENG L,LÜ X K,CUI S L,et al.Path planning and simulation of transplanting machine replenishment based on two-way Dijkstra algorithm[J].Journal of Chinese agricultural mechanization,2023,44(3):177-182 (in Chinese with English abstract) .
SCHMITT L M.Theory of genetic algorithms[J].Theoretical computer science,2001,259(1/2):1-61.
BASEL J,WILLEMAIN T R.Random tours in the traveling salesman problem:analysis and application[J].Computational optimization and applications,2001,20(2):211-217.