Arc routing vehicle routing problems with vehicle/site dependencies

Abstract

In this paper, an algorithm is discussed for solving the Vehicle Arc Routing Problem when there exists the constraints of Vehicle/Site Dependencies. The traditional Capacitated Arc Routing Problem assumes a homogeneous fleet mix of vehicles available to service the arcs in the network. In essence, any vehicle in the vehicle fleet mix can travel or service any of the arcs in the network and all vehicles in the vehicle fleet mix have the same capacity. In actuality, most real world applications of the Capacitated Arc Routing Problems do not use a homogeneous fleet mix. Solid waste collection tends to utilize a heterogeneous rather than a homogeneous fleet mix. A city may have many different sized trash vehicles which pick up the garbage on the streets. As a result of the vehicles being of different sizes, the capacities of the vehicles will be different. More important is that the different size vehicles may not be able to travel on the same streets. For example, larger vehicles may not be able to travel on small alleys in the middle of the city. This second issue, where certain vehicles can not travel on certain streets is what is referred to as Vehicle/Site Dependencies. This paper analyzes and presents a practical solution to the Capacitated Arc Routing Problem while satisfying Vehicle/Site Dependencies with a heterogeneous fleet mix.