Shortest route optimization for emergency cases using Integer Linear Programming

Emergency cases require efficient route planning to minimize response times and ensure timely access to critical care. This study presents an optimization model for determining the shortest route in emergency cases using Integer Linear Programming (ILP). The model aims to efficiently allocate resources such as ambulances or private vehicles by optimizing their routes while considering the road networks. This study considers six cities and six hospitals in Seremban, with key nodes representing cities, hospitals, and major intersections, whiles edges representing the connecting roads. 36 case studies are conducted using real-world road network data, and the solution is obtained using QM for Windows and Excel Solver. Results demonstrate that the distance from each city to Hospital Tuanku Ja’afar which is the government hospital is in the range of 4.8km to 8.2km. However, for alternatives, the results show that the nearest hospital to Seremban is CMH Specialist Hospital. For Oakland and Seremban 2, the closest hospital is Columbia Asia Hospital. Mawar Medical Centre serves as the nearest hospital for Seremban 3 and Taman Rahang. Meanwhile, residents of Ampangan have CMH Specialist Hospital and SALAM Senawang Specialist Hospital as their nearest medical facilities. This study contributes to development of intelligent decision-support systems for emergency management, enhancing rapid response capabilities and overall public safety.