Research Article

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

Table 3

Results obtained with the ACO algorithm for the PCARP-CM.

ProblemSolverACO AlgorithmBest
Incumb. SolutionLower BoundGAPObjective ValueIterationsTime (seconds)GAP

19437,0410,997,9%451,031236068,9451,0
39576,0510,398,7%3594,010368085,83594,0
344,0315,08,4344,08936288,4344,0
8525,0447,094,8%2519,044364482,32519,0
14755,0659,095,5%9764,012383293,39764,0
456,0418,08,3456,031236068,3456,0
569,0491,013,7576,032367514,8%569,0
75367,0325,0100,0%22364,04387098,522364,0
70456,0439,099,4%31446,03449298,631446,0
4791,0684,085,7%3801,04383982,03801,0
-411,4-442,01037376,9442,0
545,0469,513,8%536,0306360612,4536,0
620,0620,00,0620,01837040,0620,0
145,0145,00,0149,01237422,7%149,0
144,0137,04,91152,04401088,1%144,0
182,0176,03,3204,02579613,7%182,0
175,0161,08,0183,03496312,0%175,0
9410,0369,096,1%2447,011032284,92447,0
125,0125,00,0131,04536324,6%131,0
14265,0244,098,3%4278,08393994,34278,0
212,0204,03,8222,0540138,1%212,0
482,0423,012,21492,011300171,6%482,0
340,0329,03,2357,01180647,8%340,0
8586,0517,694,0%620,010392716,5620,0
348,0315,09,5370,0127361214,9%348,0
548,0447,018,4573,039360222,0%548,0
723,0639,011,64789,011389886,7%723,0
444,0402,09,5447,030367410,1%444,0
2405,0304,087,43415,03458191,1%2405,0
46441,0375,099,2%25424,03462598,525424,0
4838,0684,085,94906,03462186,1%4838,0
527,0474,010,1536,0208360011,6%527,0
157,0156,00,6158,01336381,3%157,0
120,0117,02,5131,04451210,7%120,0
174,0167,04,0209,02514520,1%174,0
383,0369,03,72479,011378085,1%383,0
1284,0246,080,84284,08396994,3%1284,0
427,0423,00,9525,011689919,4%427,0
338,0329,02,7380,012213713,4%338,0

Average9365,038,6%3507,042,8%3184,8