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.