Optimizing Ambulance Paths: Case Study of Red Cross Tripoli Branch

Abstract

Red Cross, an international humanitarian organization, is involved in helping people suffering from hunger, war, diseases, or other problems. Reaching people who need help in using the own ambulances of the Red Cross. Due to congestion problems in Lebanon, the ambulances are sometimes late which threatens people's life. This paper aims to help the ambulances of the Red Cross in Tripoli Branch to promptly reach their urgencies in case of congestion and not. The problem is solved using Wolfram Mathematica 8.0 where the shortest path, in duration, is found. In the end, the shortest path is selected to be used by the Red Cross when there is congestion and another one is selected when there is not.