AN ALGORITHM FOR THE CYCLED SHORTEST PATH PROBLEM

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.

AINI ASGHAR; SALEHI POUR AMIR

Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: JOURNAL OF INDUSTRIAL MANAGEMENT STUDIES Year:2011 | Volume:8 | Issue:21 Page(s): 167-180

Download Full-Text

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

Persian Verion

View:

1,950

Download:

Cites:

Information Journal Paper

Title

AN ALGORITHM FOR THE CYCLED SHORTEST PATH PROBLEM

Author(s)

AINI ASGHAR | SALEHI POUR AMIR | Issue Writer Certificate

Keywords

THE SHORTEST PATH PROBLEMQ2

SHORTEST PATH NETWORK WITH CYCLEQ2

FLOYD- WAR SHALL ALGORITHMQ2

RECTANGULAR ALGORITHMQ2

Abstract

For a network with cycle, where at least one cycle exists, the Floyd-War shall algorithm is probably the most used algorithm to determine the least cost path between every pair of nodes on this network, i.e. the solution for THE SHORTEST PATH PROBLEM with cycle.In this paper, a new algorithm for this problem which requires less computational effort than the FLOYD- WAR SHALL ALGORITHM has been developed Furthermore, it can be shown that the basis of our algorithm is much easier to be learnt and understood which might be an advantage for educational purposes. A small example validates our algorithm and shows its implementation.

Cites

No record.

References

No record.

Cite

APA: Copy

AINI, ASGHAR, & SALEHI POUR, AMIR. (2011). AN ALGORITHM FOR THE CYCLED SHORTEST PATH PROBLEM. JOURNAL OF INDUSTRIAL MANAGEMENT STUDIES, 8(21), 167-180. SID. https://sid.ir/paper/213181/en

Vancouver: Copy

AINI ASGHAR, SALEHI POUR AMIR. AN ALGORITHM FOR THE CYCLED SHORTEST PATH PROBLEM. JOURNAL OF INDUSTRIAL MANAGEMENT STUDIES[Internet]. 2011;8(21):167-180. Available from: https://sid.ir/paper/213181/en

IEEE: Copy

ASGHAR AINI, and AMIR SALEHI POUR, “AN ALGORITHM FOR THE CYCLED SHORTEST PATH PROBLEM,” JOURNAL OF INDUSTRIAL MANAGEMENT STUDIES, vol. 8, no. 21, pp. 167–180, 2011, [Online]. Available: https://sid.ir/paper/213181/en

Related Journal Papers