IDEAS home Printed from https://ideas.repec.org/h/spr/lnopch/978-981-96-9697-0_75.html
   My bibliography  Save this book chapter

Application of Hybrid Ant Colony-Genetic Algorithm in Warehouse Robot Path Planning

Author

Listed:
  • Yue Li

    (Beijing Institute of Graphic Communication)

  • Huiqi Zhu

    (LuDong University)

  • Shuihai Dou

    (Beijing Institute of Graphic Communication)

  • Yanping Du

    (Beijing Institute of Graphic Communication)

  • Zhaohua Wang

    (Beijing Institute of Graphic Communication)

  • Yuxia Huang

    (Beijing Institute of Graphic Communication)

Abstract

As the key intelligent equipment in the warehouse operation system, warehouse robots are indispensable in reducing logistics costs and improving logistics efficiency. Path planning is the core technology of warehouse robots, which directly affects the distance traveled by the robot during operation and is crucial for improving the efficiency of warehouse operation. Aiming at the problem of inefficient robot path planning in warehousing scenarios, this paper proposes a path planning model based on multi-robot paths and shortest as the objective function, with the number of robots and robot energy as the constraints. The model optimizes the robot path through an ant colony algorithm and subsequently uses the optimized path as the initial path for the genetic algorithm to improve the quality of the path. In this paper, the proposed algorithm is analyzed in comparison with a single ant colony algorithm and a single genetic algorithm in a warehousing scenario. Experimental results show that the proposed algorithm possesses better robustness and stability, and significantly improves the path planning efficiency of the warehouse robot.

Suggested Citation

  • Yue Li & Huiqi Zhu & Shuihai Dou & Yanping Du & Zhaohua Wang & Yuxia Huang, 2025. "Application of Hybrid Ant Colony-Genetic Algorithm in Warehouse Robot Path Planning," Lecture Notes in Operations Research,, Springer.
  • Handle: RePEc:spr:lnopch:978-981-96-9697-0_75
    DOI: 10.1007/978-981-96-9697-0_75
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    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:spr:lnopch:978-981-96-9697-0_75. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.