Vehicle Routing Problem with Transshipment: Mathematical Model and Algorithm

Table 4

Solution comparison for Run 16 of set T instance.

Problem instance	VRPT (Run 16)			VRPOT (Run 16)
	Opt.	Best found	% OFF-OPT.	Opt.	Best found	TD satisfied	% OFF-OPT.
CEN T2G	514	514	0.00	433	433	T1, T2, T3	0.00
CEN T2H	532	539	1.32	437	445	T1	1.83
CEN T2J	483	484	0.21	440	440	T1, T2, T4	0.00
OFF T2G	501	501	0.00	458	458	T1, T2, T3	0.00
OFF T2H	500	507	1.40	423	450	T3	6.38
OFF T2J	501	511	2.00	478	491	T1, T2, T3	2.72