In this project we simulated a scenario of a natural disaster, more specifically a volcanic eruption in Pompeii.
During a natural disaster, delivering essential supplies to affected areas is a critical priority. These areas vary in population density and accessibility, from heavily populated zones to remote regions. Our task was to develop a distribution strategy that maximizes coverage, minimizes resource waste, and ensures the most critical areas are served within a limited timeframe.
More technically speaking in our scenario, there are two types of nodes and two types of vehicles. The nodes can be Refueling Stations or Critical Zones, and the vehicles can be Trucks or Helicopters. The goal is for the Vehicles to reach all critical zones before their critical window (time before the zone becomes unreachable) reaches 0.
The graph we developed looks like this:
Legend: A: Naples, B: Pompeii, C: Partenio, D: Maddaloni, E: Portici, F: Afragola
G: Bagnoli, H: Bacoli, I: Vico Equense, J: Sarno, K: Cava de' Tirreni, L: Montesarchio
We implemented 7 algorithms divided into 2 categories which we denominated "Real Time" and "A priori".
"Real Time" algorithms calculate the next node the vehicle goes to as the vehicle moves.
"A priori" are algorithms where the whole path the vehicle is calculated from the get-go and only then does the vehicle start movinf.
Here is a list of the implemented algorithms:
| Real Time | A Priori | |----------------------|-----------------------| | Lowest Cost | Depth-First Search | | Greedy | Breadth-First Search | | Greedy + Lowest Cost | A* | | | Uniform Cost |
For a full report and project files check out this projects repository at https://github.com/luis25franca/Trabalho-IA-2024_2025.