Research on Intelligent Book Sorting AGV Task Scheduling Based on Firefly Algorithm

DOI

10.2991/978-94-6463-570-6_118How to use a DOI?

Keywords

Firefly algorithm; Task scheduling; Book sorting; Colored traveling salesman

Abstract

Addressing the challenges of task scheduling algorithms for book sorting AGVs in vast and intricate settings, a refined task scheduling model tailored for book sorting AGV systems has been devised, leveraging the colored traveling salesman problem (CTSP). Additionally, a firefly algorithm is introduced for seamless coordination. Initially, the problem is outlined as a CTSP. Subsequently, the firefly algorithm is employed to tackle it effectively. The strategy is then validated and analyzed through rigorous case studies, ten in total. The findings reveal that this strategy excels in efficiency, accuracy, and consistently provides optimized solutions across varying task scales.

Copyright

© 2024 The Author(s)

Open Access

Open Access This chapter is licensed under the terms of the Creative Commons Attribution-NonCommercial 4.0 International License (http://creativecommons.org/licenses/by-nc/4.0/), which permits any noncommercial use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license and indicate if changes were made.

Download article (PDF)

TY  - CONF
AU  - Yijun Tang
AU  - Hongyuan Wang
PY  - 2024
DA  - 2024/11/22
TI  - Research on Intelligent Book Sorting AGV Task Scheduling Based on Firefly Algorithm
BT  - Proceedings of the 2024 5th International Conference on Management Science and Engineering Management (ICMSEM 2024)
PB  - Atlantis Press
SP  - 1178
EP  - 1189
SN  - 2352-5428
UR  - https://doi.org/10.2991/978-94-6463-570-6_118
DO  - 10.2991/978-94-6463-570-6_118
ID  - Tang2024
ER  -