Shortest and Fastest Route for Ambulance Identified by Less Congestion on the Road

Authors

  • Piyush Bansal
  • Lakhan Gupta
  • Prashant Verma
  • Shaili Goyal
  • Harshita Verwani

Keywords:

Dijkstra’s algorithm, Floyd’s algorithm, shortest path, geographic information system, transportation

Abstract

Due to traffic, many people in India have passed away since they were unable to reach the hospital in time. As a result, we are creating a website for an ambulance service that will lessen the need for patients to rush to the hospital. Our main goal is to hasten the arrival of ambulances at their locations in order to save lives. When users go to our website on their smartphones, they can enter a location and search for nearby ambulances. We will also develop an algorithm-based system dubbed Automatic Ambulance Recovery System that looks for shorter routes between two points. The major goal of this project is to create a straightforward flow that will allow ambulances to arrive at hospitals promptly and thereby reduce propitiation. The primary unit, which offers the ambulance's longest scanning path and ensures its safe arrival at the hospital, controls the ambulance. Through car data, the GPS server also determines the position of the accident scene and travels there via ambulance; find the crash site and assist in hastening the patient's arrival at the hospital by using the completely automated system.

Published

2023-02-20

Similar Articles

You may also start an advanced similarity search for this article.