This benchmark includes the input instances and results shown in the paper Exploring Utility for a Real-World Warehouse Optimization Problem: Formulation Based on Quantun Annealers and Preliminary Results.INPUTIn order to properly find feasible solutions to the Warehouse Optimization Problem, the information is provided through a text file, considering the main information about i) the pool of locations available, ii) the amount of items per category, and iii) the characteristics of each item type.OUTPUTSFor each result, the following information is provided: i) the solution itself, in which the location and the height are provided for each item; ii) a list representing the types of all items; iii) the cumulated storing time of all the solutions; iv) the number of items that remain unstacked (it should always be 0); and v) the remaining surface in the available locations.Contact Eneko Osaba (eneko.osaba@tecnalia.com) for further information about the format of the data and the results.

THIS DATASET IS ARCHIVED AT DANS/EASY, BUT NOT ACCESSIBLE HERE. TO VIEW A LIST OF FILES AND ACCESS THE FILES IN THIS DATASET CLICK ON THE DOI-LINK ABOVE