Research Article
Emergency Vehicle Dispatching and Redistribution in Highway Network Based on Bilevel Programming
Table 8
The comparison of two optimum strategies of example I obtained by using S-B-M and SF-M.
| | | The optimal solution | The optimal dispatching and redistribution strategy | Total rescue time for current accidents (min) | Total punishment for the time window constraints | Total punishment for current accidents requirements | Total punishment for potential incidents requirements | Total time for vehicle redistribution (min) |
| | S-B-M | | ,
,
,
,
| 19 | 0 | 0 | 27 | 6 |
| | SF-M | | ,
,
,
,
| 20 | 0 | 0 | 35 | 6 |
|
|
