Incident dispatching, clearance and delay
This paper models response times and delays for highway incidents, accounting for spacing between interchanges and the time penalty for changing directions, enabling a response vehicle to reach an incident on the opposite side of the highway. A fundamental question in dispatching incident crews is whether to send the closest vehicle that is currently available or to wait for another vehicle to become available that is even closer. Waiting for a closer vehicle is advantageous because service time is effectively reduced, adding to capacity and providing stability at higher levels of utilization. But waiting for a vehicle to become available adds uncertainty, which contributes to expected traffic delay. As a consequence, any reasonably robust dispatch strategy must provide for a hybridization of the two objectives, trading-off greater certainty in response time against stability at higher utilization levels.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Volume (Year): 36 (2002)
Issue (Month): 1 (January)
|Contact details of provider:|| Web page: http://www.elsevier.com/wps/find/journaldescription.cws_home/547/description#description|
|Order Information:|| Postal: http://www.elsevier.com/wps/find/supportfaq.cws_home/regional|
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Nam, Doohee & Mannering, Fred, 2000. "An exploratory hazard-based analysis of highway incident duration," Transportation Research Part A: Policy and Practice, Elsevier, vol. 34(2), pages 85-102, February.
- Prawit Ittimakin & Edward P. C. Kao, 1991. "Stationary Waiting Time Distribution of a Queue in Which Customers Require a Random Number of Servers," Operations Research, INFORMS, vol. 39(4), pages 633-638, August.
- Richard C. Larson & Mark A. Mcknew, 1982. "Police Patrol-Initiated Activities Within a Systems Queueing Model," Management Science, INFORMS, vol. 28(7), pages 759-774, July.
- Linda Green & Peter Kolesar, 1989. "Testing the Validity of a Queueing Model of Police Patrol," Management Science, INFORMS, vol. 35(2), pages 127-148, February.
- Linda Green, 1984. "A Multiple Dispatch Queueing Model of Police Patrol Operations," Management Science, INFORMS, vol. 30(6), pages 653-664, June.
- Linda Green & Peter Kolesar, 1984. "A Comparison of the Multiple Dispatch and M/M/c Priority Queueing Models of Police Patrol," Management Science, INFORMS, vol. 30(6), pages 665-670, June.
- Jan M. Chaiken & Peter Dormont, 1978. "A Patrol Car Allocation Model: Capabilities and Algorithms," Management Science, INFORMS, vol. 24(12), pages 1291-1300, August.