Dynamic routing for priority shipments in LTL service networks

Currently, less-than-truckload (LTL) carriers route both the regular and the priority shipments through, their service networks using some fixed route patterns, known as load plans. In this paper we consider an alternative strategy for routing priority shipments in LTL networks. This strategy exploits the stochasticity and dynamism embedded in the routing process where the real-time information at the current terminal (such as the loading status of trailers and the arrival of shipments) and the expected travel times from its neighboring terminals to the destination al-e used to route shipments adaptively. We shore that this strategy can be approximated by the problem of finding dynamic shortest paths over a network with random are costs. We develop an, efficient algorithm to compute the expected travel times of these paths. These times can then be used when we implement the proposed strategy. In the numerical testing with read data, we observe that the level of service for priority shipments can be improved significantly.