Discrete Location Problems  Benchmarks Library

Home Benchmarks Library Automated Warehouse Scheduling Problem

Benchmarks

4 classes of instances with the following properties:
Class 1 - lines loaded unequally (real-life scenario), number of boxes per order meets normal distribution;
Class 2 - lines loaded equally, number of boxes per order meets normal distribution;
Class 3 - lines loaded unequally, an equal number of boxes per order;
Class 4 - lines loaded equally, an equal number of boxes per order.

Each class includes 10 instances generated based on real data.

The dimension of the instances is 200 orders.
The number of boxes depends on the class of the instance (about 400 on average).
The boxes are processed in four production lines A, B, E, T.

The time interval between the start of the first box from the order at the picking stage
and the end of packing of the last box from the same order cannot exceed the given threshold 6 hours.

Automated guided vehicles service all transportation processes between storage and picking zone.
Each AGV can bring one pallet only. The transportation time is 10 minuts and the same for all pallets.
The fleet of AGV’s is 40 and common for all production lines.

 

Each example contains 5 files:  A_boxes_gen,  B_boxes_gen,  E_boxes_gen,  T_boxes_gen,   gen_inp_time

The first 4 files have a similar structure and correspond to production lines A, B, E, T.
In each file, string j contains the following information about box j:

1) minimal (without delays) picking time (in seconds) of all items for box j  
2) packing time (in seconds) of the box j
3) order number of the box j
4) vector of the box j content: i component shows  the number of items of type i in this box.

The file gen_inp_time is a vector with picking times (in seconds) for all items;  the picking time of an item of type i is i component of the vector.

 

Class 1. Lines loaded unequally (real-life scenario),
number of boxes per order meets normal distribution.                                        (All instances Class 1  200_Class1.zip 136 Kb)

Instance	Input data	Makespan lower bound	The best found value
200 - 10 - 1	200_10_1.zip	13500	13529
200 - 11 - 1	200_11_1.zip	13941	13965
200 - 12 - 1	200_12_1.zip	14558	14637
200 - 13 - 1	200_13_1.zip	16403	16439
200 - 14 - 1	200_14_1.zip	14296	14344
200 - 15 - 1	200_15_1.zip	10890	10925
200 - 16 - 1	200_16_1.zip	16253	16345
200 - 17 - 1	200_17_1.zip	13928	13968
200 - 18 - 1	200_18_1.zip	12892	13092
200 - 19 - 1	200_19_1.zip	19877	19914

 

Class 2. Lines loaded equally, number of boxes per order meets normal distribution.    (All instances Class 2  200_Class2.zip 133 Kb)

Instance	Input data	Makespan lower bound	The best found value
200 - 10 - 2	200_10_2.zip	13608	15123
200 - 11 - 2	200_11_2.zip	13941	13981
200 - 12 - 2	200_12_2.zip	14558	14611
200 - 13 - 2	200_13_2.zip	16403	16441
200 - 14 - 2	200_14_2.zip	17764	17998
200 - 15 - 2	200_15_2.zip	10890	10937
200 - 16 - 2	200_16_2.zip	16253	16455
200 - 17 - 2	200_17 _2.zip	13928	13966
200 - 18 - 2	200_18_2.zip	12892	12924
200 - 19 - 2	200_19_2.zip	19877	19894

    Class 3.  Lines loaded unequally, an equal number of boxes per order.     (All instances Class 3  200_Class3.zip 105 Kb)

Instance	Input data	Makespan lower bound	The best found value
200 - 10 - 3	200_10_3.zip	13500	13531
200 - 11 - 3	200_11_3.zip	13941	13968
200 - 12 - 3	200_12_3.zip	14558	14620
200 - 13 - 3	200_13_3.zip	16403	16441
200 - 14 - 3	200_14_3.zip	14296	14343
200 - 15 - 3	200_15_3.zip	10890	10919
200 - 16 - 3	200_16_3.zip	16253	16285
200 - 17 - 3	200_17_3.zip	13928	13963
200 - 18 - 3	200_18_3.zip	12892	12950
200 - 19 - 3	200_19_3.zip	19877	19916

 

Class 4. Lines loaded equally, an equal number of boxes per order.    (All instances Class 4  200_Class4.zip 134 Kb)

Instance	Input data	Makespan lower bound	The best found value
200 - 10 - 4	200_10_4.zip	13608	14698
200 - 11 - 4	200_11_4.zip	13941	13964
200 - 12 - 4	200_12_4.zip	14558	14622
200 - 13 - 4	200_13_4.zip	16403	16428
200 - 14 - 4	200_14_4.zip	17764	17934
200 - 15 - 4	200_15_4.zip	10890	10920
200 - 16 - 4	200_16_4.zip	16253	16543
200 - 17 - 4	200_17_4.zip	13928	13956
200 - 18 - 4	200_18_4.zip	12892	12921
200 - 19 - 4	200_19_4.zip	19877	19912

      Home Benchmarks Library Automated Warehouse Scheduling Problem