Abstract: This paper deals with a fuzzy path problem for emergency systems in which a deadline is given. When arc lengths are symmetric triangular fuzzy numbers (STFNs), there usually does not exist the shortest path in a network because fuzzy numbers may be incomparable. While the satisfaction factor function is introduced, the paths then become comparable (based on satisfaction factor). And we consider the problem of finding a path through which the retrieve vehicle can reach the destination vt from the start node vs in a given deadline t with the maximum satisfaction factor. This kind of problem can be regarded as the minimum ratio path problem known as a strong NP-complete problem. However, an algorithm is proposed to solve this problem by repeatedly using the shortest path approach.