Vehicle Routing Planning in Dynamic Transportation Network Based on Floating Car Data

The traditional research on vehicle routing planning was mostly on the assumption that link travel time is constant, but the traffic conditions in real road network are often fluctuant. In order to meet the requirements of fast and efficient delivery, it is necessary to study vehicle routing planning in dynamic transportation network. In recent years, time dependent vehicle routing problem (TDVRP) which considers traffic conditions attracted more and more scholar's attention. However, most studies on TDVRP are based on simple test network, and assumed all vehicles depart from the depot at a fix time. In this paper, we studied TDVRP based on floating car data. We gave a mathematical model for TDVRP, and represented the dynamic network as a first in first out (FIFO) network by time dependent function of travel speed. Then, we designed a routing construction algorithm named DTO-NNC algorithm for TDVRP. Moreover, we constructed a test instance of 100 customers based on floating car data in the road network of Shanghai, and solved it in the case of fixed departure time and variable departure time. Through the instance, DTO-NNC algorithm has been proven efficient in real road network.