Using Fuzzy dynamic programming in determining the shortest path and the least time for the performance of civil defense teams to reach the accident site in Suwaira District / Wasit Governorate

Abstract

The research includes building a network using fuzzy dynamic programming to find the shortest path that includes the least possible time. This model was applied in the Essaouira district in general and the Civil Defense Center in particular, as data was collected regarding the time of the civil defense team’s arrival to the residential neighborhoods in the district, as the number of these neighborhoods reached (12) neighborhoods, and each neighborhood has more than one road to reach it, and thus the idea was formed. Fuzziness in this research was treated using the trapezoidal member function, as it included solving the model using dynamic programming using forward calculations (26 nodes). Thus, seven leading paths were reached. The seventh path was adopted because it gives the shortest possible access time, and one path was also adopted. For each residential neighborhood.