Multi-shuttle crane scheduling in automated storage and retrieval systems
| Main Authors: | Polten, Lukas, Emde, Simon |
|---|---|
| Format: | info dataset Journal |
| Terbitan: |
, 2020
|
| Online Access: |
https://zenodo.org/record/3933057 |
Daftar Isi:
- The uploaded ".zip"-file contains 6 folders corresponding to the 6 experiments in our working paper "Multi-shuttle crane scheduling in automated storage and retrieval systems". Each of these folders contains a "results.csv" file with the data from the experiments. All but the last two columns contain information about the solved instance, the second to last column contains the objective value and the last column the runtime. Then each folder contains ".txt"-files or several folders with ".txt"-files. Each files contains one instance. Each instance begins with the name of the file in which it is located. Then follows an empty line, a line with the word "VEHICLE" and a new line "NUMBER OF CAPACITY EMPTYING REQUIREMENTS HIGHEST SPEED LONGEST DISTANCE MAXIMUM DISTANCE". It follows a line containing the following integers: the number of vehicles, the capacity of all vehicles, the number of empty slots, the total number of requests, the speed in x dimension, the speed in y dimension, and an upper limit for the maximum distance between the I/O point and each slot. Next follows a line with the text "CUSTOMER" and then a line with the text "CUSTOMER NUMBER". XCOORD. YCOORD." This is followed by lines each containing a relevant slot. Each entry begins with a number that counts the entries, followed by the x-coordinate and then the y-coordinate. The first entry has the number 0 and is the I/O point. Then the customer locations follow, and then we start the restart the numbering at 1 for the following requests.