DEVELOPING A GRAPHICAL ALGORITHM TOFIND THE SHORTEST RESCUE & RELIEF PATHS IN URBAN TRAFFIC NETWORK

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

JALALI SEYED MOHAMMAD ISMAIL; NOROUZI MEHDI; FOROUHANDEH SEYED FAROKH; YASINI MAHYA SADAT

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: Journal of Rescue and Relief Year:2013 | Volume:5 | Issue:1 Page(s): 65-79

Download Full-Text

Persian Verion

View:

944

Download:

Cites:

Information Journal Paper

Title

DEVELOPING A GRAPHICAL ALGORITHM TOFIND THE SHORTEST RESCUE & RELIEF PATHS IN URBAN TRAFFIC NETWORK

Author(s)

JALALI SEYED MOHAMMAD ISMAIL | NOROUZI MEHDI | FOROUHANDEH SEYED FAROKH | YASINI MAHYA SADAT | Issue Writer Certificate

Keywords

RESCUE AND RELIEFQ2

TRAFFICQ1

SHORTEST ACCESSING TIMEQ2

Abstract

Background: Fluid and safe transportation is one of the necessary infrastructures for improvement of industries, enhancement of welfare level and relief services in each country. However, finding optimal routes for emergency relief services in a busy TRAFFIC network has a special significance. In recent years, a great interest for TRAFFIC modeling and determination of optimum route has been created in dynamic TRAFFIC networks for RESCUE AND RELIEF services due to improvement of intelligent transport systems. Methods: In this library research paper, graphical algorithm has been developed in order to find the SHORTEST ACCESSING TIME and its corresponding path between a pair of given points in an urban TRAFFIC network. This algorithm has been composed of the Floyd- Warshall algorithm to find the SHORTEST ACCESSING TIME; the p algorithm to find the shortest path corresponding to the SHORTEST ACCESSING TIME; and also Davidson TRAFFIC function to evaluate necessary time to move from a vertex to next one on a certain path. Then, using field studies and collecting TRAFFIC data, the algorithm is implemented on the TRAFFIC network.Findings: The described algorithm has been implemented on the TRAFFIC network of the downtown part of Shahroud city. Also, the SHORTEST ACCESSING TIME between each pairs of given points and its corresponding paths have been determined in order to rapid dispatch of relief vehicles.Conclusion: according to the results, it is possible to develop intelligent navigation systems with applying the algorithm. Those systems may be particularly used to organize and dispatch rescue vehicles to accident region.

Cites

PROVIDE AN OPTIMUM METHOD FOR RELIEF ROUTING TO TRANSFER POTENTIAL EARTHQUAKE INJURED (CASE STUDY: THE CITY OF TABRIZ)

References

No record.

Cite

APA: Copy

JALALI, SEYED MOHAMMAD ISMAIL, NOROUZI, MEHDI, FOROUHANDEH, SEYED FAROKH, & YASINI, MAHYA SADAT. (2013). DEVELOPING A GRAPHICAL ALGORITHM TOFIND THE SHORTEST RESCUE & RELIEF PATHS IN URBAN TRAFFIC NETWORK. SCIENTIFIC JOURNAL OF RESCUE AND RELIEF, 5(1), 65-79. SID. https://sid.ir/paper/190771/en

Vancouver: Copy

JALALI SEYED MOHAMMAD ISMAIL, NOROUZI MEHDI, FOROUHANDEH SEYED FAROKH, YASINI MAHYA SADAT. DEVELOPING A GRAPHICAL ALGORITHM TOFIND THE SHORTEST RESCUE & RELIEF PATHS IN URBAN TRAFFIC NETWORK. SCIENTIFIC JOURNAL OF RESCUE AND RELIEF[Internet]. 2013;5(1):65-79. Available from: https://sid.ir/paper/190771/en

IEEE: Copy

SEYED MOHAMMAD ISMAIL JALALI, MEHDI NOROUZI, SEYED FAROKH FOROUHANDEH, and MAHYA SADAT YASINI, “DEVELOPING A GRAPHICAL ALGORITHM TOFIND THE SHORTEST RESCUE & RELIEF PATHS IN URBAN TRAFFIC NETWORK,” SCIENTIFIC JOURNAL OF RESCUE AND RELIEF, vol. 5, no. 1, pp. 65–79, 2013, [Online]. Available: https://sid.ir/paper/190771/en

Related Journal Papers