Most densely populated urban cities do not cater to efficient navigation of ambulances due to traffic congestion and delayed red traffic signals. Only a few of these cities have dedicated lanes for emergency vehicles. On the contrary, the rest do not have such lanes making congestion a major factor in delayed emergency responses. This paper presents an algorithmic structure to assist ambulance routing during emergencies by depicting green corridors. It evaluates heuristic search algorithms, A and Dijkstra’s, a combination of the Bellman-Ford and Held-Karp algorithms, and a hybrid approach combining A with a swarm-based metaheuristic algorithm called Bee Colony Optimization (BCO). The performance of each algorithm is evaluated based on travel time, path distance and variable traffic, using Simulation of Urban Mobility (SUMO) as the environment. The main goal of this research is to facilitate the steady movement of ambulances by turning traffic signals green simultaneously along the chosen path. The results compare and demonstrate the performance of all algorithms in terms of their suitability for prompt and timely routing of ambulances during emergencies.