| Popis: |
The paper presents a methodology for the dispatching of helicopters in a large scale emergency, based on an iterative application of simulation and solution of linear assignment problems. Two examples of different complexity are shown, including sensitivity analyses. The sequential linear assignment problem methodology is especially suitable because it does not rely on the existence of a pre-existing network of routes, and can cope with highly dynamic situations. Because of the efficiency of the solution algorithms, the computation times are small and not a factor in the dispatching procedure. The computer times required for the solution of each LAP depend on the number of helicopters involved in the rescue, and the number of rescue locations, but not on the number of victims to be rescued (which, however, affects the time required for the entire solution). Through sensitivity analyses it is possible to study the effects of one or more design parameters, of one or more helicopters involved in the rescue, on the time required to complete the rescue. The problem proves nonlinear, at least in the design parameters considered in the study. The characteristics of the rescue operation, and the assumptions made in modeling the helicopters and the rescue operations themselves, play a major role. |
