Instances and detailed results for the whole testbed of "The Storage Location Assignment and Picker Routing Problem: A Generic Branch-Cut-and-Price Algorithm"

This repository contains the instances and detailed results used for the computational experiments in the article "The Storage Location Assignment and Picker Routing Problem: A Generic Branch-Cut-and-Price Algorithm". Two sets of instances are used: <br> The first set of instances comes from the paper "Integrating storage location and order picking problems in warehouse planning" authored by Allyson Silva, Leandro C. Coelho, Maryzam Darvish and Jacques Renaud.<br> https://doi.org/10.1016/j.tre.2020.102003<br> Their instances are available on the following website: https://www.leandro-coelho.com/slot-assignment-and-order-picking/ <br> The second set of instances comes from the paper "Storage assignment for newly arrived items in forward picking areas with limited open locations" authored by Xiaolong Guo, Ran Chen, Shaofu Du and Yugang Yu.<br> https://doi.org/10.1016/j.tre.2021.102359<br> The set of small instances is made available on this repository, with the kind permission of the authors.本仓库收录了论文《储位分配与拣货员路径问题：一种通用分支-切割-定价算法（Branch-Cut-and-Price）》中计算实验所用的算例与详细结果。该论文的计算实验共采用两组算例集： 第一组算例源自Allyson Silva、Leandro C. Coelho、Maryzam Darvish与Jacques Renaud发表的论文《仓库规划中储位与订单拣选问题的集成》，其DOI链接为：https://doi.org/10.1016/j.tre.2020.102003；该组算例可通过以下网址获取：https://www.leandro-coelho.com/slot-assignment-and-order-picking/。 第二组算例源自Xiaolong Guo、Ran Chen、Shaofu Du与Yugang Yu发表的论文《有限开放货位的前置拣选区新到货品储位分配》，其DOI链接为：https://doi.org/10.1016/j.tre.2021.102359。经作者许可，本仓库已收录该组小型算例。