Contributions to Arc Routing

In this dissertation, mainly two problems are considered, both of which are routing problems. The first part of the dissertation explores the Capacitated Arc Routing Problem (CARP), which was first suggested by Golden and Wond 1981 [1]. This is the problem of servicing a set og edges in a graph, using a fleet of capacity-constrained vehicles. The problem occurs in practice in situations where streets need to be serviced, for example in refuse collection, street sweeping, snow removal, or mail delivery. In the second part of the dissertation, a version of the CARP is considered, where each demand edge has an associated time window within which the service of that edge must begin. This problem is called the Capacitated Arc Routing Problem with Time Windows (CARP-TW), and has only been studied in the acadamic literature in few papers. The third part of the dissertation contains material that is related to the first two parts, but which does not fit into those parts. This includes an online varsion of the CARP and a setup with several Depots and fixed vehicle costs.