Hybrid Genetic Algorithms for the Asymmetric Distance-Constrained Vehicle Routing Problem

Table 12

The t-values against GA-ADP and the result about HGAs that found significantly better solutions for the restricted ADVRP.

INST	GA-INS	GA-INV	GA-SWP	Instance	GA-INS	GA-INV	GA-SWP
ftv33.2	0.69	5.72	7.24	ftv55.3	3.85	10.47	3.02
Better	—	GA-ADP	GA-ADP	Better	GA-ADP	GA-ADP	GA-ADP
ftv33.3	2.60	3.39	4.68	ftv64.2	3.70	—	6.62
Better	GA-ADP	GA-ADP	GA-ADP	Better	GA-ADP	—	GA-ADP
ftv35.3	0.73	3.65	4.30	ftv64.3	1.19	6.59	5.27
Better	—	GA-ADP	GA-ADP	Better	—	GA-ADP	GA-ADP
ftv38.3	0.53	—	7.17	ft70.3	2.40	25.04	4.23
Better	—	—	GA-ADP	Better	GA-ADP	GA-ADP	GA-ADP
ftv44.3	−2.37	7.92	2.35	ftv70.2	8.37	27.85	−0.91
Better	GA-INS	GA-ADP	GA-ADP	Better	GA-ADP	GA-ADP	—
ftv47.3	2.04	7.88	4.49	ftv70.3	1.00	20.99	−0.32
Better	GA-ADP	GA-ADP	GA-ADP	Better	—	GA-ADP	—
ry48p.2	4.47	0.03	5.60	kro124p.2	4.16	—	−4.00
Better	GA-ADP	—	GA-ADP	Better	GA-ADP	—	GA-SWP
ry48p.3	4.41	2.73	6.86	kro124p.3	5.80	16.36	−0.70
Better	GA-ADP	GA-ADP	GA-ADP	Better	GA-ADP	GA-ADP	—