A modeling framework is proposed for the freight network assignment problem with recourse, network travel time and cost disruptions, and link flow capacity constraints. “Recourse” is defined as the ability of a user to reconsider and adapt his or her routing decisions in response to newly acquired information about network disruption. When real-time tracking and monitoring of network shipments allow companies a routing recourse, network capacity must be simultaneously considered. If a disruption significantly alters network flows, the capacity of alternative or secondary routes may be quickly reached. A new freight mathematical model with a capacitated network and adaptive routing was developed and solved. Results showed that simultaneous consideration of recourse and capacity constraints was superior to benchmark results obtained with nonadaptive deterministic behavior.
Get full access to this article
View all access options for this article.
References
1.
PeckH.Drivers of Supply Chain Vulnerability: An Integrated Framework. International Journal of Physical Distribution & Logistics Management, Vol. 35, No. 4, 2005, pp. 210–232.
2.
ChristopherM.Logistics and Supply Chain Management: Creating Value-Adding Networks, FT Prentice-Hall, Harlow, United Kingdom, 2005.
3.
PiteraK., and GoodchildA.Interpreting Resilience: An Examination of the Use of Resiliency Strategies. Presented at Transportation Research Forum 2009, Portland, Ore., 2009.
4.
SuarezP., AndersonW., MahalV., and LakshmananT. R.Impacts of Flooding and Climate Change on Urban Transportation: A System Wide Performance Assessment of the Boston Metro Area. Transportation Research Part D, Vol. 10, No. 3, 2005, pp. 231–244.
WhiteK., and GrenzebackL.Understanding Freight Bottlenecks. Public Roads, Vol. 70, No. 5, 2007.
7.
SmallK. A., NolandR., ChuX., and LewisD.NCHRP Report 431: Valuation of Travel-Time Savings and Predictability in Congested Conditions for Highway User Cost Estimation.TRB, National Research Council, Washington, D.C., 1999.
8.
KawamuraK.Perceived Value of Time for Truck Operators. In Transportation Research Record: Journal of the Transportation Research Board, No. 1725, TRB, National Research Council, Washington, D.C., 2000, pp. 31–36.
9.
WheelerN., and FigliozziM.Multicriteria Freeway Performance Measures for Trucking in Congested Corridors. In Transportation Research Record: Journal of the Transportation Research Board, No. 2224, Transportation Research Board of the National Academies, Washington, D.C., 2011, pp. 82–93.
10.
TregoT., and MurrayD.An Analysis of the Operational Costs of Trucking. Presented at 89th Annual Meeting of Transportation Research Board, Washington, D.C., 2010.
11.
RodrigueJ.-P., ComtoisC., and SlackB.The Geography of Transport Systems.Routledge, New York, 2009.
12.
CaputoA. C., PelagaggeP. M., and ScacchiaF.Integrating Transport Systems in Supply Chain Management Software Tools. Industrial Management and Data Systems, Vol. 103, 2003, pp. 503–515.
13.
ElangoV. V., BlaiklockP. M., and GuenslerR.Visualization of Freight Movement with GT Freight Data Collector and Real-Time Cargo Tracking. Presented at 87th Annual Meeting of the Transportation Research Board, Washington, D.C., 2008.
14.
UnnikrishnanA., and FigliozziM.Online Freight Network Assignment Model with Transportation Disruptions and Recourse. In Transportation Research Record: Journal of the Transportation Research Board, No. 2224, Transportation Research Board of the National Academies, Washington, D.C., 2011, pp. 17–25.
15.
CroucherJ. A.Note on the Stochastic Shortest-Route Problem. Naval Research Logistics Quarterly, Vol. 25, 1978, pp. 729–732.
16.
AndreattaG., and RomeoL.Stochastic Shortest Paths with Recourse. Networks, Vol. 18, No. 3, 1988, pp. 193–204.
17.
PolychronopoulosG. H., and TsitsiklisJ. N.Stochastic Shortest Path Problems with Recourse. Networks, Vol. 27, No. 2, 1996, pp. 133–143.
18.
WallerS. T., and ZiliaskopoulosA. K.On the Online Shortest Path Problem with Limited Arc Cost Dependencies. InNetworks, Vol. 40, No. 4, 2002, pp. 216–227.
19.
HallR. W.The Fastest Path Through a Network with Random Time-Dependent Travel Times. Transportation Science, Vol. 20, No. 3, 1986, pp. 182–188.
20.
PretolaniD.A Directed Hyperpath Model for Random Time Dependent Shortest Paths. European Journal of Operational Research, Vol. 123, No. 1, 2000, pp. 315–324.
21.
Miller-HooksE.Adaptive Least-Expected Time Paths in Stochastic, Time-Varying Transportation and Data Networks. Networks, Vol. 37, No. 1, 2001, pp. 35–52.
22.
HarksT., HeinzS., and PfetschM. E.Competitive Online Multicommodity Routing. Theory of Computer Systems, Vol. 45, No. 3, 2009, pp. 533–554.
23.
UnnikrishnanA., and WallerS. T.User Equilibrium with Recourse. Networks and Spatial Economics, Vol. 9, No. 4, 2009, pp. 575–593.
24.
AhujaR. K., MagnantiT. L., and OrlinJ. B.Network Flows: Theory, Algorithms and Applications, Prentice Hall, Englewood Cliffs, N.J., 1993.
25.
AssadA.Multicommodity Network Flows: A Survey. Networks, Vol. 8, No. 1, 1978, pp. 37–91.
26.
KenningtonJ. L.A Survey of Linear Cost Multicommodity Network Flows, Operations Research, Vol. 26, No. 2, 1978, pp. 209–236.
27.
BarnhartC., HaneC. A., and VanceP.Using Branch-and-Price-and-Cut to Solve Origin-Destination Integer Multicommodity Flow Problems. Operations Research, Vol. 48, No. 2, 2000, pp. 318–326.
28.
HolmbergK., JobornM., and MelinM.Lagrangian Based Heuristics for the Multicommodity Network Flow Problem with Fixed Costs on Paths. European Journal of Operation Research, Vol. 188, No. 1, 2008, pp. 101–108.
29.
FisherM. L.The Lagrangian Relaxation Method for Solving Integer Programming Problems. Management Science, Vol. 27, No. 1, 1981, pp. 1–18.
30.
LarssonT., and LiuZ.A Lagrangean Relaxation Scheme for Structured Linear Programs with Application to Multicommodity Networks Flows. Optimization, Vol. 40, No. 3, 1997, pp. 247–284.
31.
CrainicT. G., FrangionniA., and GendronB.Bundle-Based Relaxation Methods for Multicommodity Capacitated Fixed Charge Network Design Problems. Discrete Applied Mathematics, Vol. 112, No. 1–3, 2001, pp. 73–99.
32.
CastelliL., LongoG., PessentiR., and UkovichW.Two Player Non-Cooperative Game over a Freight Transportation Network. Transportation Science, Vol. 38, No. 2, 2004, pp. 149–159.
33.
ZhangZ., and FigliozziM. A.A Survey of China's Logistics Industry and the Impact of Transport Delays on Importers and Exporters. Transport Reviews, Vol. 30, No. 2, 2010, pp. 179–194.
