IDEAS home Printed from https://ideas.repec.org/a/plo/pone00/0321616.html
   My bibliography  Save this article

Optimization of multi-AGV task allocation based on an improved PSO algorithm

Author

Listed:
  • Yazhen Zhu
  • Qing Song
  • Meng Li

Abstract

Research on task allocation for multiple automated guided vehicles (AGVs) in factory environments is a key topic in intelligent manufacturing. Existing studies often struggle to balance fairness and priority in task allocation, leading to low AGV utilization and high no-load distances. Moreover, the stability and applicability of task allocation algorithms in real-world production environments face significant challenges. To address these issues, a mathematical model is formulated with the objective of minimizing the no-load distances of all AGVs in material delivery tasks. The model is subsequently enhanced by incorporating task allocation balance and priority. To solve the optimization model, an improved particle swarm optimization algorithm is proposed, and extensive simulation experiments are conducted based on a real factory environment. By comparing the optimization results of the proposed algorithm with those of the latest multi-population genetic algorithm (MGA) and the market-based bundle task allocation method (MBTA), it is evident that both the proposed algorithm and MGA achieve higher AGV utilization and shorter total task completion times than MBTA, while also optimizing no-load distances. Although the running time of the proposed algorithm is slightly higher than that of MBTA, it is significantly lower than that of MGA, and its overall performance in reducing no-load distances and enhancing AGV utilization is superior to that of MGA. The proposed method can be applied to guide multiple AGVs in multi-material delivery tasks in real factory environments.

Suggested Citation

  • Yazhen Zhu & Qing Song & Meng Li, 2025. "Optimization of multi-AGV task allocation based on an improved PSO algorithm," PLOS ONE, Public Library of Science, vol. 20(6), pages 1-19, June.
  • Handle: RePEc:plo:pone00:0321616
    DOI: 10.1371/journal.pone.0321616
    as

    Download full text from publisher

    File URL: https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0321616
    Download Restriction: no

    File URL: https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0321616&type=printable
    Download Restriction: no

    File URL: https://libkey.io/10.1371/journal.pone.0321616?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    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:plo:pone00:0321616. 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: plosone (email available below). General contact details of provider: https://journals.plos.org/plosone/ .

    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.