An Improved MULTI-ACS Algorithm for the Waste Collection Vehicle Arc Routing Problem with Turn Constraints

To reduce the route length of MSW collection without intermediate facilities, A Waste Collection Vehicle Arc Routing Problem with turn constraints (WCVARPTC) model was proposed, which considers the actual traffic regulations: some streets can be traversed in only one direction, some turns will be forbidden when the common angle is too narrow. An asymmetric vehicle node routing problem (AVNRP) model was formulated to reduce the scale of the WCVARPTC. And a MULTI-ACS algorithm with Substitution neighborhood, Reinsertion neighborhood and 3-Exchange neighborhood was designed for solving such an asymmetric one. The results of 3 benchmark instances for CVARP indicate that the best solutions has approached the best known solutions for egl-e1-a, egl-s1-a with deviation 0.28% and 0.16% respectively, So we conclude that the more arcs without collection points that instance contains, the better performance for it.