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

Table 11

Case results for larger-scale order sizes (comparison with GA).

Number	Number of orders	GA			LNSGA
		Solution	Objective value:	CPU time (s)	Solution	Objective value:	CPU time (s)
1	2	(84, 22, 10)	18480	566.97	(89, 20, 10)	17800	228.92
2	2	(31, 21, 10)	6510	479.96	(30, 20, 10)	6000	202.35
3	2	(30, 20, 10)	6000	577.57	(30, 20, 10)	6000	244.26
4	4	(50, 20, 10)	10000	684.31	(56, 20, 10)	11200	293.26
5	4	(31, 20, 10)	6200	679.49	(30, 20, 10)	6000	293.41
6	4	(30, 20, 10)	6000	571.58	(30, 20, 10)	6000	254.57
7	6	(25, 30, 10)	7500	657.76	(30, 20, 10)	6000	257.23
8	6	(49, 20, 10)	9800	834.24	(55, 20, 10)	11000	320.07
9	6	(34, 23, 10)	7820	1012.27	(37, 20, 10)	7400	376.72
10	8	(88, 20, 10)	17600	937.61	(88, 20, 10)	17600	386.37
11	8	(78, 20, 10)	15600	703.22	(78, 20, 10)	15600	316.59
12	8	(45, 23, 10)	10350	903.98	(53, 20, 10)	10600	356.51
Average		—	10155	717.41	—	10100	294.19