A Variable Neighborhood Search Algorithm for the Leather Nesting Problem

Table 3

Evaluating the impact of the parameters 𝑞^𝑗_𝑖 (number of times the best layout is found with the corresponding strategy).

Inst.	𝑞^2𝑖=3	𝑞^2𝑖=5
Car model 1
1; 1	1	2
1; 2	1	2
1; 3	2	1
2; 1	0	3
2; 2	2	1
2; 3	3	0
3; 1	3	0
3; 2	1	2
3; 3	3	0
4; 1	1	2
4; 2	3	0
4; 3	2	1
Total	22	14
Car model 2
1	2	1
2	1	2
3	1	2
4	2	1
5	2	1
6	1	2
7	3	0
8	2	1
9	2	1
10	1	2
11	2	1
12	2	1
Total	21	15