Data for Single-Picker-Cobot Routing with decoupling Problem

We studied a Single-Picker-Cobot Routing with decoupling Problem (SPCRDP) in multi block parallel layout warehouses. The picker is responsible for picking up and placing goods, while the cobot replaces the cart for loading and transportation; At the appropriate location, the picker can separate from the cobot, pick a certain amount of goods separately, and then rendezvous with the cobot at the original or new position, placing the goods on the cobot. Thus, it involves dual path optimization for picker and cobot. First of all, the path for the picker in SPCRDP should be optimal. Then, the path of the cobot depends on the path of the picker. 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.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.