IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v12y2024i3p479-d1332234.html
   My bibliography  Save this article

Research on Path Planning Method of Solid Backfilling and Pushing Mechanism Based on Adaptive Genetic Particle Swarm Optimization

Author

Listed:
  • Lei Bo

    (School of Artificial Intelligence, China University of Mining and Technology (Beijing), Beijing 100083, China)

  • Zihang Zhang

    (School of Mechanical Electronic & Information Engineering, China University of Mining and Technology (Beijing), Beijing 100083, China)

  • Yang Liu

    (School of Mechanical Electronic & Information Engineering, China University of Mining and Technology (Beijing), Beijing 100083, China)

  • Shangqing Yang

    (School of Artificial Intelligence, China University of Mining and Technology (Beijing), Beijing 100083, China)

  • Yanwen Wang

    (School of Mechanical Electronic & Information Engineering, China University of Mining and Technology (Beijing), Beijing 100083, China)

  • Yiying Wang

    (School of Mechanical and Equipment Engineering, Hebei University of Engineering, Handan 056038, China)

  • Xuanrui Zhang

    (School of Electrical and Electronic Engineering, Guangdong Technology College, Zhaoqing 526100, China)

Abstract

This paper investigates the path planning problem of the coal mine solid-filling and pushing mechanism and proposes a hybrid improved adaptive genetic particle swarm algorithm (AGAPSO). To enhance the efficiency and accuracy of path planning, the algorithm combines a particle swarm optimization algorithm (PSO) and a genetic algorithm (GA), introducing the sharing mechanism and local search capability of the particle swarm optimization algorithm. The path planning of the pushing mechanism for the solid-filling scenario is optimized by dynamically adjusting the algorithm parameters to accommodate different search environments. Subsequently, the proposed algorithm’s effectiveness in the filling equipment path planning problem is experimentally verified using a simulation model of the established filling equipment path planning scenario. The experimental findings indicate that the improved hybrid algorithm converges three times faster than the original algorithm. Furthermore, it demonstrates approximately 92% and 94% better stability and average performance, respectively, than the original algorithm. Additionally, AGAPSO achieves a 27.59% and 19.16% improvement in path length and material usage optimization compared to the GA and GAPSO algorithms, showcasing superior efficiency and adaptability. Therefore, the AGAPSO method offers significant advantages in the path planning of the coal mine solid-filling and pushing mechanism, which is crucial for enhancing the filling effect and efficiency.

Suggested Citation

  • Lei Bo & Zihang Zhang & Yang Liu & Shangqing Yang & Yanwen Wang & Yiying Wang & Xuanrui Zhang, 2024. "Research on Path Planning Method of Solid Backfilling and Pushing Mechanism Based on Adaptive Genetic Particle Swarm Optimization," Mathematics, MDPI, vol. 12(3), pages 1-27, February.
    • Handle: RePEc:gam:jmathe:v:12:y:2024:i:3:p:479-:d:1332234
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/12/3/479/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/12/3/479/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Lei Bo & Shangqing Yang & Yang Liu & Zihang Zhang & Yiying Wang & Yanwen Wang, 2023. "Coal Mine Solid Waste Backfill Process in China: Current Status and Challenges," Sustainability, MDPI, vol. 15(18), pages 1-46, September.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.

      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:jmathe:v:12:y:2024:i:3:p:479-:d:1332234. 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.

      If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.