A New Ant Colony Optimization Algorithm to Solve the Periodic Capacitated Arc Routing Problem with Continuous Moves

Table 1

PCARP-CM characteristics and the result obtained with the mathematical model.

Problem	Nodes	Arcs	Nb. of Periodic.	Cars	Req.	Time Horizon	Incumb. Solution	Lower Bound	GAP
	12	22	2	1	32	38	19437,0	410,9	97,9%
	12	26	3	1	44	53	39576,0	510,3	98,7%
	12	22	2	2	31	19	344,0	315,0	8,4%
	11	19	3	2	34	21	8525,0	447,0	94,8%
	13	26	4	2	53	32	14755,0	659,0	95,5%
	12	22	2	3	34	14	456,0	418,0	8,3%
	12	22	3	3	37	45	569,0	491,0	13,7%
	27	46	4	3	67	27	75367,0	325,0	100,0%
	27	51	3	4	78	24	70456,0	439,0	99,4%
	12	25	4	4	70	21	4791,0	684,0	85,7%
	22	45	2	1	50	60	-	411,4	-
	13	23	3	1	33	40	545,0	469,5	13,8%
	10	28	2	2	33	20	620,0	620,0	0,0%
	7	21	3	2	32	20	145,0	145,0	0,0%
	7	21	4	2	48	29	144,0	137,0	4,9%
	8	28	2	3	40	24	182,0	176,0	3,3%
	8	28	3	3	52	21	175,0	161,0	8,0%
	9	36	4	3	81	33	9410,0	369,0	96,1%
	8	11	3	4	29	12	125,0	125,0	0,0%
	11	22	4	4	53	16	14265,0	244,0	98,3%
	11	33	2	5	46	12	212,0	204,0	3,8%
	11	44	4	5	88	22	482,0	423,0	12,2%
	11	55	2	6	82	17	340,0	329,0	3,2%
	12	26	3	1	44	54	8586,0	517,6	94,0%
	12	22	2	2	31	20	348,0	315,0	9,5%
	11	19	3	2	34	24	548,0	447,0	18,4%
	13	26	4	2	50	32	723,0	639,0	11,6%
	12	22	3	3	33	16	444,0	402,0	9,5%
	27	46	4	3	63	30	2405,0	304,0	87,4%
	27	51	3	4	78	24	46441,0	375,0	99,2%
	12	25	4	4	70	24	4838,0	684,0	85,9%
	13	23	3	1	33	42	527,0	474,0	10,1%
	7	21	3	2	36	20	157,0	156,0	0,6%
	7	21	4	2	42	30	120,0	117,0	2,5%
	8	28	3	3	54	24	174,0	167,0	4,0%
	9	36	4	3	81	36	383,0	369,0	3,7%
	11	22	4	4	53	36	1284,0	246,0	80,8%
	11	44	4	5	88	24	427,0	423,0	0,9%
	11	55	2	6	82	18	338,0	329,0	2,7%