Opportunity Cost-Based Models for Traffic Incident Response Problems
Publication: Journal of Transportation Engineering
Volume 125, Issue 3
Abstract
Real-time traffic incident response strategies deal with the determination of optimal resource allocation policies in response to traffic incidents occurring on a network. Such strategies also should address the effect of loss in coverage caused by the nonavailability of response vehicles that currently are serving certain primary incidents. In this paper, we first formulate a mixed-integer programming (MIP) model MIMR-1 for the multiple-incident multiple-response (MIMR) problem using standard modeling techniques. The effect of loss in coverage is reflected in the model by including in the objective function a new term related to an opportunity cost for serving future (secondary) incidents that might occur probabilistically on the network. We next present an alternative, equivalent MIP model (MIMR-2) that injects a particular structure into the problem. This is shown to yield a dramatic improvement in the performance of the commercial software package CPLEX-MIP when applied to this revised model in comparison with its application to MIMR-1. Furthermore, for certain special cases of the MIMR problem, efficient polynomial-time solution approaches are prescribed that yield a far superior performance over CPLEX-MIP. An algorithmic module composed of the developed specialized solution procedures, model MIMR-2, and a prescribed heuristic scheme, has been incorporated into a real-time area-wide incident management decision support system.
Get full access to this article
View all available purchase options and get full access to this article.
References
1.
Bazaraa, M. S., Jarvis, J., and Sherali, H. D. ( 1990). Linear programming and network flows, 2nd Ed., Wiley, New York.
2.
Carter, G. M., Chaiken, J. M., and Ignall, E. ( 1972). “Response area for two emergency units.” Operations Res., 20, 571–594.
3.
Church, R., and Roberts, K. L. ( 1983). “Generalized coverage models and public facility location.” Regional Sci. Assoc. Papers, 53, 117–135.
4.
Daskin, M. S. ( 1987). “Location, dispatching, and routing models for emergency services with stochastic travel times.” Spatial analysis and location-allocation models, A. Ghosh and G. Rushton, eds., Van Nostrand, New York, 224–265.
5.
Daskin, M. S., and Haghani, A. ( 1984). “Multiple vehicle routing and dispatching on an emergency scene.” Envir. and Planning, London, 16, 1349–1359.
6.
Dhingra, N. ( 1996). “Incident response and application of Geographical Information Systems (GIS),” MS thesis, Virginia Polytechnic Institute and State University, Blacksburg, Va.
7.
Eaton, D. J., Daskin, M. S., Bulloch, B., and Jansma, G. ( 1985). “Determining emergency medical service vehicle deployment in Austin, Texas.” Interfaces, 15, 96–108.
8.
Glover, F., Klingman, D., and Phillips, N. ( 1985). “A new polynomially bounded shortest path algorithm.” Operations Res., 33(2), 65–73.
9.
Hakimi, S. L. ( 1964). “Optimal locations of switching centers and the absolute centers and medians of a graph.” Operations Res., 12, 450–459.
10.
Jonnalagadda, S. ( 1996). “Integration of a GIS and an expert system for freeway incident management,” MS thesis, Virginia Polytechnic Institute and State University, Blacksburg, Va.
11.
Kolesar, P., and Walker, E. W. ( 1974). “An algorithm for dynamic relocation of fire companies.” Operations Res., 22, 249–274.
12.
Larson, R. C. ( 1974). “A hypercube queuing model for facility location and redistricting in urban emergency services.” Comp. and Operations Res., 1, 67–95.
13.
Mirchandani, P. B., and Odoni, A. R. ( 1979). “Locations of medians on stochastic networks.” Transp. Sci., 13, 85–97.
14.
Pal, R., and Sinha, K. ( 1997). “A framework for locating highway incident response vehicles in urban areas.” INFORMS Nat. Meeting, San Diego, Calif.
15.
Sherali, H. D., Ozbay, K., and Subramanian, S. ( 1998). “The time-dependent shortest pair of disjoint paths problem: Complexity, models and algorithms.” Networks, 31(4), 259–272.
16.
Subramanian, S. ( 1997). “Routing algorithms for dynamic, intelligent transportation networks,” MS thesis, Virginia Polytechnic Institute and State University, Blacksburg, Va.
17.
Torgeas, C., Swain, R., ReVelle, C., and Bergmann, L. ( 1971). “The location of emergency service facilities.” Operations Res., 16, 955–961.
18.
Ziliaskopoulos, A. K., and Mahmassani, H. S. ( 1993). “A time-dependent shortest path algorithm for real-time intelligent vehicle/highway systems applications.” Transp. Res. Rec. 1408, Transportation Research Board, Washington, D.C., 94–100.
19.
Zografos, K. G., Nathanail, T., and Michalopoulos, P. (1993). “Analytical framework for minimizing freeway-incident response time.”J. Transp. Engrg., ASCE, 119, 535–549.
Information & Authors
Information
Published In
History
Received: Apr 7, 1998
Published online: May 1, 1999
Published in print: May 1999
Authors
Metrics & Citations
Metrics
Citations
Download citation
If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download.