  The capacitated Vehicle Routing Problem with structured Time Windows
(cVRPsTW) is concerned with finding optimal tours for vehicles with given
capacity constraints to deliver goods to customers within assigned time
windows. In our problem variant these time windows have a special structure,
namely they are non-overlapping and each time window holds several customers.
This is a reasonable assumption for Attended Home Delivery services. Sweep
algorithms are known as simple, yet effective heuristics for the classical
capacitated Vehicle Routing Problem. We propose variants of the sweep algorithm
that are not only able to deal with time windows, but also exploit the
additional structure of the time windows in a cVRPsTW. Afterwards we suggest
local improvement heuristics to decrease our objective function even further. A
carefully constructed benchmark set that resembles real-world data is used to
prove the efficacy of our algorithms in a computational study.
