A Genetic Algorithm with Lower Neighborhood Search for the Three-Dimensional Multiorder Open-Size Rectangular Packing Problem

Table 9

Case results for large-scale order sizes (comparison with Gurobi).

Number	Number of orders	Gurobi		LNSGA		CPU time (s)	Optimization of LNSGA over Gurobi (%)
		Solution	Objective value:	Solution	Objective value:
1	12	(57, 20, 20)	22800	(89, 20, 10)	17800	228.92	21.93
2	12	(32, 30, 22)	21120	(30, 20, 10)	6000	202.35	71.59
3	12	(30, 28, 24)	20160	(30, 20, 10)	6000	244.26	70.24
4	14	(32, 28, 25)	22400	(56, 20, 10)	11200	293.26	50.00
5	14	(30, 28, 24)	20160	(30, 20, 10)	6000	293.41	70.24
6	14	(30, 30, 21)	18900	(30, 20, 10)	6000	254.57	68.25
7	16	(31, 27, 23)	19251	(30, 20, 10)	6000	257.23	68.83
8	16	(44, 30, 18)	23760	(55, 20, 10)	11000	320.07	53.70
9	16	(36, 30, 20)	21600	(37, 20, 10)	7400	376.72	65.74
10	18	(30, 30, 20)	18000	(88, 20, 10)	17600	386.37	2.22
11	18	(30, 27, 23)	18630	(78, 20, 10)	15600	316.59	16.26
12	18	(32, 29, 20)	18560	(53, 20, 10)	10600	356.51	42.89
Average		—	20445	—	10100	294.19	50.16