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

Table 2

MDVRP instances and previous best known solution cost.

𝐼	source	𝑛	𝑄	𝐷	𝑚	GJ	CGW	CGL	𝑐(𝑠^∗)
p08	GJ	249	500	310	2	4832.0	4511.6	4437.68	4437.68
p09	GJ	249	500	310	3	4219.7	3950.9	3900.22	3900.22
p10	GJ	249	500	310	4	3822.0	3727.1	3663.02	3663.02
p11	GJ	249	500	310	5	3754.1	3670.2	3554.18	3554.18
p15	CGW	160	60	0	4	—	2610.3	2505.42	2505.42
p16	CGW	160	60	200	4	—	2605.3	2572.23	2572.23
p17	CGW	160	60	180	4	—	2816.6	2709.09	2709.09
p18	CGW	240	60	0	6	—	3877.4	3702.85	3702.85
p19	CGW	240	60	200	6	—	3863.9	3827.06	3827.06
p20	CGW	240	60	180	6	—	4272.0	4058.07	4058.07
p21	CGW	360	60	0	9	—	5791.5	5474.84	5474.84
p22	CGW	360	60	200	9	—	5857.4	5702.16	5702.16
p23	CGW	360	60	180	9	—	6494.6	6095.46	6095.46
pr04	CGL	192	185	440	4	—	—	2072.52	2072.52
pr05	CGL	240	180	420	4	—	—	2385.77	2385.77
pr06	CGL	288	175	400	4	—	—	2723.27	2723.27
pr09	CGL	216	180	450	6	—	—	2153.1	2153.1
pr10	CGL	288	170	425	6	—	—	2921.85	2921.85