A Hybrid Ant Colony Optimization Algorithm for Multi-Compartment Vehicle Routing Problem

Table 2

Comparison results of IHACO and four algorithms.

Inst.		ACS		HAC		HAVNS		HABC		IHACO
		Obj.	t(s)	Obj.	T(s)	Obj.	T(s)	Obj.	t(s)	Obj.	T(s)
vrpnc1a	50	569.564	16	550.70	5	550.7	4	550.42	5	550.70	6
vrpnc1b	50	569.118	17	551.94	5	506.18	4	502.83	6	548.77	7
vrpnc2a	75	957.525	36	890.68	15	881.84	14	890.68	17	873.57	13
vrpnc2b	75	954.856	35	918.96	14	918.96	14	914	17	888.38	15
vrpnc3a	100	964.132	122	874.07	40	878.83	21	875.24	27	870.11	35
vrpnc3b	100	959.327	122	895.26	44	898.64	20	895.39	25	871.22	16
vrpnc4a	150	1253.86	345	1126.12	146	1126.12	103	1126.12	110	1110.06	33
vrpnc4b	150	1254.51	336	1159.48	151	1159.48	120	1159.48	142	1134.90	116
vrpnc5a	199	1587.02	688	1444.29	257	1408.86	230	1385.71	345	1423.11	414
vrpnc5b	199	1640.59	676	1525.87	236	1515.25	218	1492.02	212	1456.16	125
vrpnc11a	120	1133.88	281	1110.45	75	1110.45	70	1110.45	82	1110.45	75
vrpnc11b	120	1247.49	280	1221.73	87	1221.73	77	1220.43	95	1218.66	71
vrpnc12a	100	911.861	105	912.64	15	901.22	13	901.15	35	907.73	42
vrpnc12b	100	970.833	100	950.79	30	935.62	22	923.25	43	961.74	51
Average		1069.612	225.64	1009.5	80	1000.99	66.43	996.23	82.93	994.68	72.79