A hybrid algorithm for routing optimization of AGVs with multi-task assignment

2018 International Conference on Civil and Hydraulic Engineering

土木建筑工程;水利工程

Liang, Xiaolei^1,3 ; Sun, Yuan^1,3 ; He, Xiao^2

School of Automobile and Traffic Engineering, Wuhan University of Science and Technology, Wuhan, Hubei

430081, China^1

Wuhan Zhong Yuan Electronics Group CO., LTD, Wuhan, Hubei

430081, China^2

Institute of Intelligent Driving and Smart Transportation, Wuhan University of Science and Technology, Wuhan, Hubei

430081, China^3

关键词: Dijkstra method;    Hungarian algorithm;    Hybrid algorithms;    Loading and unloading;    Pre-processing method;    Processing method;    Routing optimization;    Working process;   

Others  :  https://iopscience.iop.org/article/10.1088/1755-1315/189/6/062050/pdf
DOI  :  10.1088/1755-1315/189/6/062050

学科分类：土木及结构工程学

来源: IOP

【 摘 要 】

To solve the multi-task assigement and routing optimizating problem of AGVs, this paper proposed a hybrid algorithm. Based on analysis of a practice case, it divided the working process of AGVs into two stages: loading and unloading. In the first stage, the shorts paths between loading site and unloading site were obtained via Dijkstra method. Then in next stage, a pre-processing method was applied to simplify the path network. Then the unloading travel distance was optimized by Hungarian algorithm. Through the two-section processing method, the optimal of routing design could be obtained. At last, the result of a practice case showed that the method could be used to solve the routing optimization of AGVs with multi-task assignment problems.