A Framing Link Based Tabu Search Algorithm for Large-Scale Multidepot Vehicle Routing Problems

Table 3

Sensitivity data of parameters 𝐿_min and 𝐿_max.

𝐼	𝑛	𝑚	[𝐿^∗min,𝐿^∗max]	Solution value % gap	CPU time % gap
p08	249	2	[3,7]	3.37	403.23
p09	249	3	[3,6]	4.6	476.87
p10	249	4	[3,6]	7.62	322.33
p11	249	5	[3,5]	6.26	398.74
p15	160	4	[2,4]	5.06	366.86
p16	160	4	[2,4]	3.01	485.78
p17	160	4	[2,4]	3.1	573.27
p18	240	6	[2,4]	6.53	397.2
p19	240	6	[2,4]	4.61	676.61
p20	240	6	[2,4]	7.85	238.97
p21	360	9	[2,4]	8.18	291.3
p22	360	9	[2,4]	6.76	334.59
p23	360	9	[2,4]	6.14	618.93
pr04	192	4	[2,5]	7.57	474.76
pr05	240	4	[3,6]	3.17	356.43
pr06	288	4	[3,6]	4.31	649.79
pr09	216	6	[2,4]	7.55	414.62
pr10	288	6	[2,4]	3.62	689.48