Abstract
Hub‐and‐spoke freight transportation networks use consolidation as a means to achieve the economies of scale. The operations and rules in such networks are very complex. This paper considers the tactical planning for these networks and the study is driven by the emerging new information technology that allows us to use real‐time information to guide decision making. First, we develop a comprehensive simulation system that can capture the relationships between the network configuration, load planning, complicated work rules, trailer-closing policies, day of the week effects, and service commitment. Through the simulation study, we highlight the effects on costs and services if we add the time dimension in the tactical planning and if we change some parameters that govern the trailer closing process. The simulation results suggest that if we can dynamically change the shipment routes and the trailer‐closing rules, the service levels can be improved substantially. Based on the results, we further formulate the trailer‐closing policy as a dynamic programming model. We consider a framework for developing solution methods and discuss issues and possible research directions under this framework.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
M.O. Akyilmaz, An algorithmic framework for routing LTL shipments, Journal of the Operational Research Society 45(1994)529-538.
C. Barnhart and Y. Sheffi, A network-based primal-dual heuristic for the solution of multicommodity network flow problem, Transportation Science 27(1993)102-117.
J.F. Campbell, Continuous and discrete demand hub location problems, Transportation Research 27B(1993)473-482.
R.K. Cheung and W.B. Powell, An algorithm for multistage dynamic networks with random arc capacities, with an application to dynamic fleet management, Operations Research 44(1996)951-963.
T.G. Crainic and J. Leal, A model for the strategic planning of national freight transportation by rail, Transportation Science 24(1990)1-24.
T.G. Crainic and J.M. Rousseau, Multicommodity, multimode freight transportation: A general modeling and algorithmic framework for the service network design problem, Transportation Research 20B(1986)225-242.
T.G. Crainic and J. Roy, Design of regular intercity driver routes for the LTL motor carrier industry, Transportation Science 26(1992)280-295.
C.F. Daganzo, The break-bulk role of terminals in many to many logistic networks, Operations Research 35(1987)543-555.
R. Deb and C. Schmidt, Optimal average cost policies for the two-terminal shuttle, Management Science 33(1987)662-669.
Y. Du and R. Hall, Fleet sizing and empty equipment redistribution for center-terminal transportation networks, Management Science 43(1997)145-157.
Yu. Ermoliev, Stochastic quasi-gradient methods in numerical techniques for stochastic optimization, in: Numerical Techniques for Stochastic Optimization, eds. Yu. Ermoliev and R.J-B Wets, Springer, 1988.
J.M. Farvolden, and W.B. Powell, Subgradients for service network design, Transportation Science 28(1994)256-272.
M.L. Fisher, Vehicle routing, in: Handbooks in Operations Research and Management Science, volume on Network Routing, eds. M. Ball, T. Magnanti, C. Monma and G. Nemhauser, 1995, pp. 1-33.
L.F. Frantzeskakis and W.B. Powell, A successive linear approximation procedure for stochastic dynamic vehicle allocation problems, Transportation Science 24(1990)40-57.
J. Guelat, M. Florian and T.G. Crainic, A multimode multiproduct network assignment model for strategic planning of freight flows, Transportation Science 24(1990)25-39.
R.W. Hall, Comparison of strategies for routing shipments through transportation terminals, Transportation Research 21A(1987)421-429.
M.H. Keaton, Are there economies of traffic density in the less-than-truckload motor carrier industry? An operations planning analysis, Transportation Research 27A(1993)343-358.
B. McKnight, R.L. Miskewicz and Y. Liu, Asia Supply Chains: The Hong Kong China Connection, Transportation and Distribution 38(1997)79-82.
P. Nansakumar and T. Morton, Near myopic heuristics for the fixed-life perishable problem, Management Science 39(1993)1490-1498.
W. Powell and Y. Sheffi, The load planning problem of motor carriers: Problem description and a proposed solution approach, Transportation Research 17A(1983)471-480.
W. Powell and H.P. Simao, Numerical simulation of transient bulk queues with general vehicle dispatching strategies, Transportation Research 20(1986)477-490.
W. Powell, W. Snow and R. Cheung, Adaptive labeling algorithms for the dynamic assignment problem, Technical Report, Department of Civil Engineering and Operations Research, Princeton University, 1997.
J. Papastavrou and A. Kleywegt, Acceptance and dispatching policies for a distribution problem, Transportation Science (1997) to appear.
J. Papastavrou, S. Rajagopalan and A. Kleywegt, The dynamic and stochastic knapsack problem with deadlines, Management Science 42(1996)1706-1718
W. Powell and Y. Sheffi, Design and implementation of an interactive optimization system for the network design in the motor carrier industry, Operations Research 37(1989)12-29.
U.S. Department of Transportation, Motor Freight Transportation and Warehousing Survey, National Transportation Library, Bureau of Transportation Statistics, 1997.
Rights and permissions
About this article
Cite this article
Cheung, R., Muralidharan, B. Impact of dynamic decision making on hub‐and‐spoke freight transportationnetworks. Annals of Operations Research 87, 49–71 (1999). https://doi.org/10.1023/A:1018909825336
Issue Date:
DOI: https://doi.org/10.1023/A:1018909825336