Data for Single-Picker-Cobot Routing with decoupling Problem

However, due to the fact that the optimal travel distance in the SPRP can correspond to multiple optimal paths, it directly affects the path planning of the cobot. Thus, a special optimistic bi-level optimization model was established to solve it. In order to improve efficiency and accuracy, we build an algorithm framework with a three-level structure for solving.

To evaluate the performance of the algorithm, we conducted numerical experiments on SPCRDP based on the instances proposed by Theys et al. (2007). We integrate these instances and their detailed solutions into benchmarks for future research method validation.Besides, we adopted the two-stage planning to quickly obtain feasible solutions to improve computing efficiency, and compared it with the bi-level programming algorithm.

Due to the author using a computer from ten years ago for computing, the algorithm performance has been affected. Hope to receive funding support as soon as possible.