计算机科学
机器人
订单(交换)
人机交互
人机交互
分布式计算
人工智能
财务
经济
作者
Ziyan Zhao,Junzhi Cheng,Jiaqi Liang,Shixin Liu,MengChu Zhou,Yusuf Al‐Turki
标识
DOI:10.1109/jiot.2024.3352658
摘要
With the development of robotics and Internet of Things, robot-assisted goods-to-person order picking systems become popular in smart warehouses. Order picking in such systems is a human-robot collaborative process, where robots carry pods to a picking station with human pickers who pick the demanded goods from them to fulfill orders. In it, pod selection, robot scheduling, and manual picking are highly coupled and together influence the efficiency of order picking. Their joint optimization is the key to enhancing operational efficiency but rarely studied in existing work. In order to fill such a research gap and meet high market demand, this work focuses on a novel human-robot collaborative order picking optimization problem. A mixed integer program is formulated to model it and provide an exact solution method for small-scale instances. To provide large-scale problems with efficient solutions in practical application scenarios, we propose an adaptive large-neighborhood-based tabu search algorithm. Specifically, an adaptive large neighborhood search method is designed and embedded into a tabu search algorithm with two tabu mechanisms. Experimental results indicate that the presented algorithm has significant advantages in solving the newly proposed problem. It substantially outperforms: 1) the independent use of adaptive large neighborhood search or tabu search, 2) Gurobi subject to an hour execution time, and 3) several competitive benchmark and newest well-performing algorithms. Its high performance implies its great potential in solving practical order picking optimization problems for Internet-of-Things-enabled robot-assisted smart warehouses.
科研通智能强力驱动
Strongly Powered by AbleSci AI