Abstract
In this paper we present an experimental evaluation of an algorithm for time-dependent vehicle routing problems using real-world traffic information. Vehicle routing problems (VRPs) have been extensively studied in the literature, mostly with constant travel times. In the time-dependent case travel times depend on the time of the day. For vehicle routing purposes travel time information is provided as time-dependent distance matrices, which are calculated using Dijkstra's label-setting algorithm. Therefore, Dijkstra's algorithm was adopted to integrate time-dependent travel times and to use efficient data structures in order to minimize its runtimes. The computational performance of the implementation was tested with the street network of Vienna and shows promising results. To solve the time-dependent vehicle routing problem with time windows (TD-VRPTW) a Variable Neighborhood Search (VNS) algorithm was applied. The experiment shows, that knowing time-dependent travel times during the tour planning process, it improves the solution quality of the resulting tours significantly.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
