Abstract

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.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.