The Capacitated Arc Routing Problem with Time Windows
(CARP-TW)
The CARP-TW is defined as the CARP with extra restrictions aussed by the time windows.
Problem description:
Given a graph, G = (N,E,C,Q), and a fleet of capacitated vehicles initially located in a special Depot node.
Associate with each edge a time window [a(ij) , b(ij)], in which the service of the edge must begin.
Find a set of tours sch that
1) Each edge with positive demand is serviced by exactly one vehicle,
2) The vehicle capacities are respected,
3) The time windows are respected, and
4) The total routing is minimized.
Test Instances: