ACPT A Mathematical Model for the Periodic Capacitated Arc Routing Problem with Time Windows

Abstract

The Periodic Capacitated Arc Routing Problem with Time Windows for the undirected case is introduced, a mathematical model is presented and tested on a set of generated instances. In the modeling it is considered that during the routes, the vehicles can pass and/or perform the services on the streets more slowly, or even, to park and wait the opening of the next time window, leaving the problem less restrictive. For each period, the arcs can be traversed at most only once by the same vehicle. A Hybrid Algorithm (HA) with an alternative mathematical model is used to find an initial feasible solution for the original problem. Computational results show that this approach is efficient in instances with up to 20 nodes, 31 edges, 31 required edges which require 125 services in a period of 7 days for a waste collection problem. Furthermore, it is considered a heterogeneous fleet with up to 3 vehicles.