Emergency Vehicle Dispatching and Redistribution in Highway Network Based on Bilevel Programming

Xiaohong Duan, Shouxin Song and Jiandong Zhao

Mathematical Problems in Engineering, 2015, vol. 2015, 1-12

Abstract:

Response time is a key factor in the emergency vehicle dispatching problem. Because regional emergency vehicles are limited, vehicle gaps will be created in the rescue station after vehicles are dispatched to several accidents, which affects quick response to the subsequent incidents. To solve this problem, a bilevel programming model for emergency vehicle dispatching and redistribution is established, of which the optimal objectives are the shortest rescue time for current accidents and the shortest time for vehicle redistribution, and the key constraints are emergency vehicle requirements and accident time windows. In the precondition of effective rescue of current accidents, emergency vehicles are redistributed according to the potential risks in the rescue station coverage area. A bilevel shuffled frog leaping algorithm is proposed to solve the bilevel programming model. The dispatching results of examples show that the model conforms to dispatching decision rule and the bilevel shuffled frog leaping algorithm can resolve the bilevel programming model fast and efficiently.

Date: 2015
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2015/731492.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2015/731492.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlmpe:731492

DOI: 10.1155/2015/731492

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().