Abstract
Major emergencies and disasters such as acts of terrorism, acts of nature, or human-caused accidents may lead to disruptions in traffic flow. Minimizing the negative effects of such disruptions is critical for a nation’s economy and security. A decision support system that is capable of gathering (real-time) information about the traffic conditions following a disaster and utilizing this information to generate alternative routes for vehicles would benefit the government, industry, and the public. For this purpose, we develop a mathematical programming model to minimize the delay for vehicles with communication capabilities following a disaster. Most commercial trucks and public buses utilize QUALCOMM as a communication tool. We also develop a prediction model for vehicles that do not have any communication capabilities. Although the problem is inherently integer we developed a linear program to reduce the computational burden caused by the large size of the problem. An algorithm is proposed to update the parameters of the linear program based on a duality analysis in order to obtain better results. A monotonic speed–density relationship is embedded in the model to capture high traffic congestion that occurs after a disaster. The model and the algorithm are tested using a simulated disaster scenario. The results indicate that the proposed model improves system performance measures such as mobility and average speed.
Similar content being viewed by others
References
Barceló J, Casas J (2002) Dynamic network simulation with aimsum. In: International symposium on transport simulation, Yokohama, Japan
Board TR (1994) Highway capacity manual. National Research Council, Washington, DC
Bureau of Public Roads (1964) Traffic assignment manual. U.S. Department of Commerce, Urban Planning Division, Washington, DC
Chabini I (1998) Discrete dynamic shortest path problems in transportation applications. Transp Res Record, vol 1645
Chabini I, Shan L (2002) Adaptations of the a* algorithm for the computation of fastest paths in deterministic discrete-time dynamic networks. IEEE transactions on ITS 3(1)
Chiu Y, Mahmassani HS (2003) Routing profile updating strategies for online hybrid dynamic traffic assignment operation. Transport Res Record 1857
Chou YL, Romeijn HE, Smith RL (1998) Approximating shortest paths in large-scale networks with an application to intelligent transportation systems. INFORMS J Comput 10(2)
Dafermos SC, Sparrow FT (1969) The traffic assignment problem for a general network. J Res Nat Bureau Stand 73B
Deflorio FP (2003) Evaluation of a reactive dynamic route guidance strategy. Transport Res C Emerg Technol 11(5)
Dijkstra EW (1959) A note on two problems in connection with graphs. Numerische Math 1
Dowling RG, Singh R, Cheng WWK (1998) The accuracy and performance of improved speed–flow curves. Transport Res Record 1646
Eatough CJ, Brich SC, Demetsky MJ (2000) A statewide intermodal freight transportation planning methodology. Transport Res Forum 39(1): 145–155
Edie LC (1961) Car following and steady-state theory for non-congested traffic. Oper Res 9(1)
Ekşioğlu B, Jin M, Çapar I, Zhang Z, Ekşioğlu SD (2008) Highway traffic management in incidents of national significance. J Emerg Manage 6(1):23–26
Fu L, Rilett LR (1996) Expected shortest paths in dynamic and stochastic traffic networks. Transport Res B Methodol 32(7)
Gao S (2005) Optimal adaptive routing and traffic assignment in stochastic time-dependent networks. PhD thesis, Massachusetts Institute of Technology
Garber NJ, Hoel LA (2001) Traffic & highway engineering. 3rd edn. Thomson-Learning, Pacific Grove, CA
Ghiani G, Guerriero F, Laporte G, Musmanno R (2003) Real-time vehicle routing: solution concepts, algorithms and parallel computing strategies. Eur J Oper Res 151(1): 1–11
Greenberg H (1959) An analysis of traffic flow. Oper Res 7
Greenshield BD (1935) A study of traffic capacity. In: Highway Research Board Proceedings, vol 14
Hall FL, Hurdle VF, Banks JH (1992) Synthesis of recent work on the nature of speed–flow and flow-occupancy (or density) relationships on freeways. Transport Res Record 1365
Hawas YE, Mahmassani HS (1996) Comparative analysis of robustness of centralized and distributed network route control systems in incident situations. Transport Res Record 1537
Husdal J (2000) Fastest path problems in dynamic transportation networks. University of Leicester, UK. http://www.husdal.com/mscgis/research.htm
ILOG (2003) CPLEX 9.0 User’s Manual. ILOG
Jahn O, Möhring RH, Schulz AS, Stier-Moses NE (2005) System-optimal routing of traffic flows with user constraints in networks with congestion. Oper Res 53(4): 600–616
Kim S, Lewis ME, White III CC (2005) Optimal vehicle routing with real-time traffic information. IEEE Trans Intell Transport Syst 6(2): 178–188
Knight FH (1924) Some fallacies in the interpretation of social cost. Q J Econ 38
Kockelman KM (2001) Modeling traffic’s flow–density relation: accommodation of multiple flow regimes and traveler types. Transportation 28(4): 363–374
Litman T (2006) Lessons from Katrina and Rita: what major disasters can teach transportation planners. J Transport Eng 132(1): 11–18
Mahmassani HS, Qin X, Zhou X (2004) DYNASMART-X evaluation for real-time time application: Irvine test bed. Tech. rep., Maryland Transportation Initiative
Maryland Transportation Initiative (2003) DYNASMART-X 0.930: USER’S GUIDE. U.S. Department of Transportation, Federal Highway Administration
May A, Coifman B, Cayford R, Merritt G (2004) Automatic diagnostics of loop detectors and the data collection system in the berkeley highway lab. Tech. rep., California PATH
Mohajer K, Mutapcic A, Emami M (2003) Estimation-pruning (ep) algorithm for point-to-point travel cost minimization in a non-fifo dynamic network. In: Proceedings of the IEEE 6th international conference on intelligent transportation systems, Shanghai, China
Owen LE, Zhang Y, Rao L, McHale G (2000) Traffic flow simulation using corsim. In: Joines JA, Barton R, Kang K, Fishwick PA (eds) Proceedings of the 2000 winter simulation conference, pp 1143–1147
Ozbay K, Bartin B, Chien S (2004) South jersey real-time motorist information system technology and practice. Transport Res Record 1886
Pavlis Y, Papageorgiou M (1999) Simple decentralized feedback strategies for route guidance in traffic networks. Transport Sci 33(3): 264–278
Roess RP, Prassas ES, McShane WR (2003) Traffic Engineering, 3rd edn. Prentice-Hall, Engelwood Cliffs, NJ
Roughgarden T (2003) The price of anarchy is independent of the network topology. J Comput Syst Sci 67(2): 341–364
Roughgarden T, Tardos E (2002) How bad is selfish routing. J Assoc Comput Mach 49(2): 236–259
Royce DE, Lee DH, Janson BN, Berka S (1996) Dynamic route choice model of large-scale traffic network. J Transport Eng 123(4)
Tan A (2004) The virtual intermodal transportation system (VITS). Master’s thesis, Mississippi State University
Underwood R (1961) Speed, volume, and density relationships: quality and theory of traffic flow. Yale Bureau of Highway Traffic, New Haven, CT
Wang H, Jin M (2006) Transportation performance measurement system with a case study in mississippi. J Transport Res Forum 45(3)
Wardrop JG (1952) Some theoretical aspects of road traffic research. In: Proceedings of the Institute of Civil Engineering, vol Part II
White House (2006) The Federal Response to Hurricane Katrina: Lessons Learned
Zhang Y, Bowden RO, Allen AJ (2003) Intermodal transportation planning using commodity flow data. Tech. rep., National Center for Intermodal Transportation
Zhao Y (1997) Vehicle location and navigation systems. Artech House Inc, Norwood, MA
Zhou J, Gollege R (1999) A gps-based analysis of household travel behavior. In: WRSA Annual Meeting, Kauai, Hawaii
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Jin, M., Ekşioğlu, B. Optimal routing of vehicles with communication capabilities in disasters. Comput Manag Sci 7, 121–137 (2010). https://doi.org/10.1007/s10287-008-0079-y
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10287-008-0079-y