Picking Path Planning of Container Robots Based on Improved Genetic Algorithm

Authors

Yuwen Wu, 1.School of Information, Beijing Wuzi University, Beijing 101149, China;Follow
Zhiyue Niu, 2.AI Research Institute, Geekplus, Beijing 100012, China;
Zhenping Li, 1.School of Information, Beijing Wuzi University, Beijing 101149, China;Follow

Abstract

Abstract: Under the new "container-to-person" picking mode in intelligent warehouses, a new optimization model and its improved genetic algorithm are proposed to solve the picking path planning problem of multiple container robots. According to the picking mode and characteristics of container robots, the picking path planning problem is transformed into an asymmetric vehicle routing problem, and a mixed integer programming model is established with bi-objectives of the shortest total picking path and the least completion time. A hybrid genetic algorithm is designed to solve this model, and the effectiveness and stability of the algorithm are verified through large-scale examples. The computational results demonstrate that the picking efficiency of container robots is improved by the proposed model and its algorithm, and their total picking cost is reduced.

Recommended Citation

Wu, Yuwen; Niu, Zhiyue; and Li, Zhenping (2023) "Picking Path Planning of Container Robots Based on Improved Genetic Algorithm," Journal of System Simulation: Vol. 35: Iss. 5, Article 16.
DOI: 10.16182/j.issn1004731x.joss.22-0084
Available at: https://dc-china-simulation.researchcommons.org/journal/vol35/iss5/16

First Page

1086

Revised Date

2022-04-17

DOI Link

https://doi.org/10.16182/j.issn1004731x.joss.22-0084

Last Page

1097

CLC

TP242

Recommended Citation

Yuwen Wu, Zhiyue Niu, Zhenping Li. Picking Path Planning of Container Robots Based on Improved Genetic Algorithm[J]. Journal of System Simulation, 2023, 35(5): 1086-1097.

Corresponding Author

Zhenping Li,lizhenping66@163.com

DOI

10.16182/j.issn1004731x.joss.22-0084