Dynamic Routing for Priority Shipments in LTL Service Networks

Raymond K. Cheung and B. Muralidharan
Additional contact information
Raymond K. Cheung: Department of Industrial Engineering and Engineering Management, Hong Kong University of Science and Technology, Clearwater Bay, Hong Kong
B. Muralidharan: Sabre Decision Technology, Fort Worth, Texas

Transportation Science, 2000, vol. 34, issue 1, 86-98

Abstract: 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 are used to route shipments adaptively. We show that this strategy can be approximated by the problem of finding dynamic shortest paths over a network with random arc 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 real data, we observe that the level of service for priority shipments can be improved significantly.

Date: 2000
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (9)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.34.1.86.12279 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ortrsc:v:34:y:2000:i:1:p:86-98

Access Statistics for this article

More articles in Transportation Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().