Abstract
We introduce an adaptive routing strategy (ARS) for transportation networks. In this strategy, the route choice is made adaptively based on the real-time information of the whole system. An efficient optimization-based heuristic is proposed to support such real-time decision-making process. Numerical results show that our ARS outperforms both the static routing method and the original dynamic routing method.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Andreatta G and Romeo L (1988). Stochastic shortest paths with recourse . Networks 18(3): 193–204.
Azaron A and Kianfar F (2003). Dynamic shortest path in stochastic dynamic networks: Ship routing problem . Eur J Opl Res 144: 138–156.
Bander J and White C (2002). A heuristic search approach for a nonstationary stochastic shortest path problem with terminal cost . Transport Sci 36: 218–230.
Bellman R (1958). On a routing problem . Quart Appl Math 16: 88–90.
Bertsekas D (2001). Dynamic Programming and Optimal Control: 2nd edn, Vol. 1–2, Athena Scientific: Belmont, MA.
Cheung R (1998). Iterative methods for dynamic stochastic shortest path problems . Nav Res Log 45: 769–789.
Cheung R and Muralidharan B (2000). Dynamic routing for priority shipments in LTL service networks . Transport Sci 34(1): 86–98.
Cheung R and Powell W (2000). SHAPE—a stochastic hybrid approximation procedure for two-stage stochastic programs . Opns Res 48(1): 73–79.
Croucher J (1978). A note on the stochastic shortest route problem . Nav Res Log Quart 25: 729–732.
Hall R (1986). The fastest path through a network with random time-dependent travel times . Transport Sci 20: 182–188.
Ioannou G, Kritikos M and Prastacos G (2002). Map-route: A GIS-based decision support system for intra-city vehicle routing with time windows . J Opl Res Soc 53: 842–854.
Pattanamekar P, Park D, Rilett L, Lee J and Lee C (2003). Dynamic and stochastic shortest path in transportation networks with two components of travel time uncertainty . Transport Res Part C 11: 331–354.
Polychronopoulos G and Tsitsiklis J (1996). Stochastic shortest path problems with recourse . Networks 27(2): 133–143.
Pope J, Terry R, Rees L and Crouch W (1995). A network simulation of high-congestion road-traffic flows in cities with marine container terminals . J Opl Res Soc 46: 1090–1101.
Provan J (2003). A polynomial-time algorithm to find shortest paths with recourse . Networks 41(2): 115–125.
Psaraftis H and Tsitsiklis J (1993). Dynamic shortest paths in acyclic networks with Markovian arc costs . Opns Res 41: 91–101.
Acknowledgements
This work was partly supported by the National Natural Sciences Foundation of China under Grants NSFC70802063, NSFC70801029, by Sun Yat-Sen University under Social Science Young Researcher Fund 0809025 and by the Guangdong Natural Science Fund Committee under Grant GNSF8451027501001466. This support is gratefully acknowledged. Thanks are also due to Cheung Yuk Wai and Gil Law for their help with programming. We are also grateful to the referees for their valuable comments.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Shi, N., Cheung, R., Xu, H. et al. An adaptive routing strategy for freight transportation networks. J Oper Res Soc 62, 799–805 (2011). https://doi.org/10.1057/jors.2010.7
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1057/jors.2010.7