The dataset for the order batching and picker routing problem with category constraint.

Published: 08-09-2020| Version 1 | DOI: 10.17632/kgpyz4cmjg.1
Contributor:
Jun Zhang

Description

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.

Files