Günter Kiechle

Learn More
In this paper we first provide a thorough performance comparison of the three main Ant Colony Optimization (ACO) paradigms for the Vehicle Routing Problem (VRP), namely the Rank based Ant System, the Max-Min Ant System and the Ant Colony System. Based on the results of this comparison we then implement a parallelization strategy to increase computational(More)
In this paper a model and several solution procedures for a novel type of vehicle routing problems where time windows for the pickup of perishable goods depend on the dispatching policy used in the solution process are presented. This problem is referred to as Vehicle Routing Problem with multiple interdependent time windows (VRPmiTW) and is motivated by a(More)
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(More)
For regular patient transportation and emergency transportation with ambulance vehicles a dynamic dial-a-ride (DARP) problem has to be solved. We analyze two scheduling strategies for the regular dial-a-ride orders in order to minimize routing costs and to maximize transportation quality. Furthermore, we review practical requirements and suggest a(More)
  • 1