IDEAS home Printed from https://ideas.repec.org/a/gam/jagris/v15y2025i3p233-d1573352.html
   My bibliography  Save this article

Research on Traversal Path Planning and Collaborative Scheduling for Corn Harvesting and Transportation in Hilly Areas Based on Dijkstra’s Algorithm and Improved Harris Hawk Optimization

Author

Listed:
  • Huanyu Liu

    (Institute of Modern Agricultural Equipment, Xihua University, Chengdu 610039, China)

  • Jiahao Luo

    (Institute of Modern Agricultural Equipment, Xihua University, Chengdu 610039, China)

  • Lihan Zhang

    (Institute of Modern Agricultural Equipment, Xihua University, Chengdu 610039, China)

  • Hao Yu

    (Institute of Modern Agricultural Equipment, Xihua University, Chengdu 610039, China)

  • Xiangnan Liu

    (Institute of Modern Agricultural Equipment, Xihua University, Chengdu 610039, China)

  • Shuang Wang

    (Institute of Modern Agricultural Equipment, Xihua University, Chengdu 610039, China)

Abstract

This study addresses the challenges of long traversal paths, low efficiency, high fuel consumption, and costs in the collaborative harvesting of corn by harvesters and grain transport vehicles in hilly areas. A path-planning and collaborative scheduling method is proposed, combining Dijkstra’s algorithm with the Improved Harris Hawk Optimization (IHHO) algorithm. A field model based on Digital Elevation Model (DEM) data is created for full coverage path planning, reducing traversal path length. A field transfer road network is established, and Dijkstra’s algorithm is used to calculate distances between fields. A multi-objective collaborative scheduling model is then developed to minimize fuel consumption, scheduling costs, and time. The IHHO algorithm enhances search performance by introducing quantum initialization to improve the initial population, integrating the slime mold algorithm for better exploration, and applying an average differential mutation strategy and nonlinear energy factor updates to strengthen both global and local search. Non-dominated sorting and crowding distance techniques are incorporated to enhance solution diversity and quality. The results show that compared to traditional HHO and HHO algorithms, the IHHO algorithm reduces average scheduling costs by 4.2% and 14.5%, scheduling time by 4.5% and 8.1%, and fuel consumption by 3.5% and 3.2%, respectively. This approach effectively reduces transfer path costs, saves energy, and improves operational efficiency, providing valuable insights for path planning and collaborative scheduling in multi-field harvesting and transportation in hilly areas.

Suggested Citation

  • Huanyu Liu & Jiahao Luo & Lihan Zhang & Hao Yu & Xiangnan Liu & Shuang Wang, 2025. "Research on Traversal Path Planning and Collaborative Scheduling for Corn Harvesting and Transportation in Hilly Areas Based on Dijkstra’s Algorithm and Improved Harris Hawk Optimization," Agriculture, MDPI, vol. 15(3), pages 1-33, January.
  • Handle: RePEc:gam:jagris:v:15:y:2025:i:3:p:233-:d:1573352
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2077-0472/15/3/233/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2077-0472/15/3/233/
    Download Restriction: no
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jagris:v:15:y:2025:i:3:p:233-:d:1573352. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.