Multi-AGVs scheduling and path planning algorithm in automated sorting warehouse

被引：0

作者：

Yu N. ^{[1
,2
]}

Li T. ^{[1
,2
]}

Wang B. ^{[1
,2
]}

Yuan S. ^{[1
,2
]}

机构：

[1] Donlinks School of Economics and Management, University of Science and Technology Beijing, Beijing

[2] Engineering Research Center of MES Technology for Iron & Steel Production, Ministry of Education, Beijing

来源：

Jisuanji Jicheng Zhizao Xitong/Computer Integrated Manufacturing Systems, CIMS | 2020年 / 26卷 / 01期

基金：

中国国家自然科学基金;

关键词：

Automated guided vehicle; Automated sorting warehouse; Differential evolution algorithm; Path planning; Scheduling;

D O I：

10.13196/j.cims.2020.01.018

中图分类号：

学科分类号：

摘要：

The automated sorting warehouses are operated by multiple AGVs simultaneously, which can quickly sort a large number of packages. How to determine the handling package sequence for AGVs and plan the conflict-free path is the key to the sorting operation. In order to improve sorting efficiency, aiming at minimizing the maximum handling completion time, firstly, the priority of the conflicting AGVs is defined and a path planning algorithm for generating a conflict-free path is proposed. Furthermore, considering the AGV scheduling and path planning comprehensively, an improved differential evolution algorithm is proposed, the algorithm generates the initial population based on the opposition-based learning, uses adaptive mutation and crossover probabilities to evolve individuals, a dynamic differential evolution strategy is designed to improve the convergence speed, the exchange neighborhood and the insertion neighborhood based on the key AGV are designed for local search. The effectiveness of the algorithm is verified by data experiments, and the key parameters are analyzed. © 2020, Editorial Department of CIMS. All right reserved.

引用

页码：171 / 180

页数：9

共 19 条

[11]

Xiao H., Lou P., Collision avoidance and cycle-deadlock control method for automated guided vehicle system, Computer Integrated Manufacturing Systems, 21, 5, pp. 1244-1252, (2015)

[12]

Zhang D., Sun X., Fu S., Et al., Cooperative path planning in multi-robots for intelligent warehouse, Computer Integrated Manufacturing Systems, 24, 2, pp. 410-418, (2018)

[13]

Malopolski W., A sustainable and conflict-free operation of AGVs in a square topology, Computers & Industrial Engineering, 126, pp. 472-481, (2018)

[14]

Fanjulpeyro L., Ruiz R., Perea F., Reformulations and an exact algorithm for unrelated parallel machine scheduling problems with setup times, Computers and Operations Research, 101, pp. 173-182, (2019)

[15]

Sels V., Coelho J., Dias A.M., Hybrid tabu search and a truncated branch-and-bound for the unrelated parallel machine scheduling problem, Computers & Operations Research, 53, pp. 107-117, (2015)

[16]

Wu C., Wang L., Zheng X., An adaptive estimation of distribution algorithm for solving the unrelated parallel machine scheduling, Control and Decision, 31, 12, pp. 2177-2182, (2016)

[17]

Liu B., Wang L., Jin Y., Advances in differential evolution, Control and Decision, 22, 7, pp. 721-729, (2007)

[18]

Mahdavi S., Rahnamayan S., Deb K., Opposition based learning: A literature review, Swarm and Evolutionary Computation, 39, pp. 1-23, (2018)

[19]

Zhang J.Q., Sanderson A.C., JADE: Adaptive differential evolution with optional external archive, IEEE Transactions on Evolutionary Computation, 13, 5, pp. 945-958, (2009)

← 1 2 →