The dataset for the order batching and picker routing problem with category constraint.
收藏资源简介：
The dataset contains the order set of 30 days in an O2O grocery, and the detailed results by solving the order batching and picker routing problem with category constraint. The category constraint means that the products includes two categories: food products and non-food products, and the picker must collect non-food products before food products to maintain food safety. There are 800 SKUs in the grocery. We assume that the number of orders in each day is 4000, and the arrival time ranges from 0~750 mins. (1) "Order set folder" includes 9 .mat files, which represent 9 different storage assignment strategies (SASs): random, a-1, a-2, b-1, b-2, c-1, c-2, d-1, and d-2. Each .mat file contains the information of arrival time of orders, the products ordered, and the storage assignments of non-food and food products. (2) Result. xlsx contains the detailed results under different batch-routing algorithms, such as the FCFS algorithms and seed algorithms.
本数据集涵盖某线上线下融合（O2O）杂货零售场景下30天的订单集合，以及通过求解带品类约束的订单分批与拣货路径规划问题得到的详细结果。品类约束规则为：该零售场景的商品分为食品类与非食品类两类，拣货员需优先拣取非食品类商品，再拣取食品类商品，以此保障食品安全。该杂货铺共设有800个库存保有单位（Stock Keeping Unit, SKU）。本数据集假设每日订单量为4000单，订单到达时间区间为0至750分钟。(1) "Order set folder" 内含9个.mat格式文件，分别对应9种不同的储位分配策略（storage assignment strategies, SASs）：随机、a-1、a-2、b-1、b-2、c-1、c-2、d-1及d-2。每个.mat文件均包含订单到达时间、所购商品信息，以及非食品类与食品类商品的储位分配数据。(2) Result.xlsx 文件收录了不同分批拣货算法下的详细求解结果，例如先到先服务（First-Come, First-Served, FCFS）算法与种子算法。
