Dispatching ambulances is a demanding and stressful task for dispatchers. This is especially true in case of mass-casualty incidents. Therefore, the aim of this work was to investigate if and to what extent the dispatch operation of the Red Cross Salzburg can be optimized on such occasions with a computerized system. The basic problem of a dynamic multi-vehicle Dial-a-Ride Problem with time windows was enhanced according to the requirements of the Red Cross Salzburg. The general objective was to minimize the total mileage covered by ambulances and the waiting time of patients. Furthermore, in case of emergencies suitable adaptions to a plan should be carried out automatically. Consequently, the problem is solved by using the Adaptive Large Neighborhood Search. Evaluation results indicate that the system outperforms a human dispatcher by between 2.5% and 36% within 1 minute of runtime concerning total costs. Moreover, the system's response time in case that a plan has to be updated is less than 1 minute on average.