A Hybrid Bat Algorithm with Path Relinking for Capacitated Vehicle Routing Problem

Table 1

Comparison of results for Augerat et al. Set A, E, and P instances.

Instance	Capacity	Tightness	I_BKS	R_BSK	CWS	SR-GCWS	CS-GRASP	HBA-PR
A-n33-k5	100	0.89	661	662.76	712.05	662.11	662.1452	662.1101
A-n33-k6	100	0.9	742	742.83	776.26	742.69	743.5785	742.6933
A-n37-k5	100	0.81	669	672.59	707.26	672.47	672.4652	672.4652
A-n39-k6	100	0.88	831	833.20	863.08	833.20	—	835.2518
E-n23-k3	4500	0.75	569	—	—	—	569.7461	568.5625
E-n22-k4	6000	0.94	375	375.28	388.77	375.28	—	375.2798
E-n33-k4	8000	0.92	839	838.72	843.1	837.67	—	837.9253
E-n51-k5	160	0.97	521	524.94	584.64	524.61	—	524.6111
P-n19-k2	160	0.97	212	212.66	237.90	212.66	212.6569	212.6569
P-n20-k2	160	0.97	216	217.42	234.00	217.42	217.4156	217.4156
P-n22-k2	160	0.96	216	217.85	239.50	217.85	217.8522	217.8522
P-n51-k10	80	0.97	741	742.48	790.97	741.50	—	743.2648