Dynamic Routing for Priority Shipments in LTL Service Networks

References

• Akyilmaz M. O. An Algorithmic Framework for Routeing LTL Shipments. J. Oper. Res. Soc. (1994) 45:529–538Crossref, Google Scholar
• Barnhart C., Sheffi Y. A Network-Based Primal–Dual Heuristic for the Solution of Multicommodity Network Flow Problem. Transp. Sci. (1993) 27:102–117Link, Google Scholar
• Bertsekas D., Tsitsiklis J. N. An Analysis of Stochastic Shortest Path Problems. Math. Opns. Res. (1991) 16:580–595Link, Google Scholar
• Crainic T. G., Rousseau J. M. Multicommodity, Multimode Freight Transportation: A General Modeling and Algorithmic Framework for the Service Network Design Problem. Transp. Res. B (1986) 20B:225–242Crossref, Google Scholar
• Crainic T. G., Roy J. Design of Regular Intercity Driver Routes for the LTL Motor Carrier Industry. Transp. Sci. (1992) 26:280–295Link, Google Scholar
• Croucher J. A Note on Stochastic Shortest Route Problem. Naval Res. Logist. Quart. (1978) 25:729–732Crossref, Google Scholar
• Daganzo C. The Break-Bulk Role of Terminals in Many-to-Many Logistic Networks. Opns. Res. (1987) 35:543–555Link, Google Scholar
• Farvolden J. M., Powell W. B. Subgradients for Service Network Design. Transp. Sci. (1994) 28:256–272Link, Google Scholar
• Hall R. W. The Fastest Path Through a Network with Random Time-Dependent Travel Times. Transp. Sci. (1986) 20:182–188Link, Google Scholar
• Hall R. W. Comparison of Strategies for Routing Shipments through Transportation Terminals. Transp. Res. A (1987) 21A:421–429Crossref, Google Scholar
• Kamburowski J., Andreatta G., Mason F., Serafini P. An Overview of the Computational Complexity of the PERT Shortest Route and Maximum Flow Problems in Stochastic Networks. in Stochastics in Combinatorial Optimization (1987) (World Scientific Publishing Co., Singapore) 187–196Google Scholar
• Mirchandani P. B. Shortest Distance and Reliability of Probabilistic Networks. Comput. Opns. Res. (1976) 3:347–355Crossref, Google Scholar
• Polychronopoulos G. H., Tsitsiklis J. N. Stochastic Shortest Path Problems with Recourse. Networks (1996) 27:133–143Crossref, Google Scholar
• Powell W., Sheffi Y. The Load Planning Problem of Motor Carriers: Problem Description and a Proposed Solution Approach. Transp. Res. A (1983) 17A:471–480Crossref, Google Scholar
• Powell W., Sheffi Y. Design and Implementation of an Interactive Optimization System for the Network Design in the Motor Carrier Industry. Opns. Res. (1989) 37:12–29Link, Google Scholar
• Powell W. B. A Stochastic Model of the Dynamic Vehicle Allocation Problem. Transp. Sci. (1986) 20:117–129Link, Google Scholar
• Psaraftis H. N., Tsitsiklis J. N. Dynamic Shortest Paths in Acyclic Networks with Markovian Arc Costs. Opns. Res. (1993) 41:91–101Link, Google Scholar
• Tseng P. Solving H-Horizon, Stationary Markov Decision Problems in Time Proportional to log(H). Opns. Res. Lett. (1990) 9:287–297Crossref, Google Scholar