Dataset for "Inventory Routing in a Warehouse: The Storage Replenishment Routing Problem"

This dataset relates to testing of a heuristic approach using operational research techniques for a specific routing problem in a warehouse, defined as the Storage Replenishment Routing Problem. There are a total of 620 instances, stored as .dat or .txt files, classified into two groups depending on the sizes of the instances. The 300 smaller instances consist of different settings ranging from 25 to 150 pick items and from 3 to 15 replenishment periods. Each setting consists of 10 instances randomly generated by changing the items to be picked in the warehouse, their locations in the warehouse, initial inventory levels, and maximum storage capacities in the forward storage area. The 320 larger instances involve 450 pick items and 15 replenishment periods, with each setting including 10 random instances generated by changing the items to be picked in the warehouse, their locations in the warehouse, initial inventory levels, maximum storage capacities in the forward storage area, and the skewness of the demand (ranging from uniform to 20-80 skewness).

To use any of the instances, the user needs to read the data given in the corresponding text file into the optimisation software or the platform where their heuristic is coded in.

The target audience for this dataset is operational researchers working on developing heuristic approaches for similar routing problems in warehouses.

本数据集旨在测试一种基于运筹学（operational research）技术的启发式方法（heuristic approach），以解决仓库中的特定路径问题——仓储补货路径问题（Storage Replenishment Routing Problem）。共有620个实例，以.dat或.txt文件格式存储，并根据实例规模分为两组。其中300个较小实例包含多种设置，涉及25至150件拣选物品及3至15个补货周期；每种设置下通过改变仓库内待拣选物品、物品位置、初始库存水平及前置存储区的最大存储容量，随机生成10个实例。320个较大实例则固定为450件拣选物品和15个补货周期，每种设置下除上述变量外，还通过调整需求偏度（skewness of the demand，范围从均匀分布至20-80偏度）随机生成10个实例。使用任一实例时，用户需将对应文本文件中的数据导入优化软件或其启发式方法编码所在的平台。本数据集的目标用户为致力于开发仓库类似路径问题启发式方法的运筹学研究者。