Route Planning of A Sanitation Vehicle in A Dynamic Traffic Environment

This paper investigates a new optimal routing problem of a sanitation vehicle. In this planning problem, during the operation times of this vehicle, time-varying properties of traffic flows are considered. We propose a time-space network (TSN) model for capturing the time-varying properties of traffic flows while routing the sanitation vehicle. The model provides a global route to avoid congested sections to ensure the shortest work time of the sanitation vehicle. A calculation case is used to illustrate the advantages of the model. Compared with the traditional time-invariant model, the proposed TSN model can minimize the completion times of all sanitation operations under real time-varying road conditions.