DYNAMIC SHORTEST PATH IN STOCHASTIC DYNAMIC NETWORKS

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.

AZARON A.; KIANFAR F.

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

Journal Paper

Paper Information

Journal: IRANIAN JOURNAL OF SCIENCE AND TECHNOLOGY TRANSACTION B- ENGINEERING Year:2002 | Volume:26 | Issue:B1 Page(s): 93-106

Download Full-Text

View:

269

Download:

Cites:

Information Journal Paper

Title

DYNAMIC SHORTEST PATH IN STOCHASTIC DYNAMIC NETWORKS

Author(s)

AZARON A. | KIANFAR F.

Keywords

DYNAMIC PROGRAMMING

STOCHASTIC PROCESSES

MARKOV PROCESSES

Abstract

This paper develops an algorithm for finding the dynamic shortest path from the
source node to the sink node in stochastic dynamic networks, in which the arc lengths are
independent random variables with exponential distributions. In each node there is an
environmental variable, which evolves in accordance with a continuous time Markov process.
The parameter of the exponential distribution of the transition time of each arc is also a
function of the state of the environmental variable of its initiating node. It is also assumed
that upon arriving at each node, we know the state of its environmental variable and also the
states of the environmental variables of its adjacent nodes. Upon arriving at each node, we
can move toward the sink node through the best outgoing arc or wait for encountering the
better state of its environmental variable, which reduces the expected transition times of the
outgoing arcs. In this paper, we apply the stochastic DYNAMIC PROGRAMMING for finding the
dynamic shortest path from the source node to the sink node by obtaining the optimal strategy
of movement in each node of the network.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

APA: Copy

AZARON, A., & KIANFAR, F.. (2002). DYNAMIC SHORTEST PATH IN STOCHASTIC DYNAMIC NETWORKS. IRANIAN JOURNAL OF SCIENCE AND TECHNOLOGY TRANSACTION B- ENGINEERING, 26(B1), 93-106. SID. https://sid.ir/paper/528344/en

Vancouver: Copy

AZARON A., KIANFAR F.. DYNAMIC SHORTEST PATH IN STOCHASTIC DYNAMIC NETWORKS. IRANIAN JOURNAL OF SCIENCE AND TECHNOLOGY TRANSACTION B- ENGINEERING[Internet]. 2002;26(B1):93-106. Available from: https://sid.ir/paper/528344/en

IEEE: Copy

A. AZARON, and F. KIANFAR, “DYNAMIC SHORTEST PATH IN STOCHASTIC DYNAMIC NETWORKS,” IRANIAN JOURNAL OF SCIENCE AND TECHNOLOGY TRANSACTION B- ENGINEERING, vol. 26, no. B1, pp. 93–106, 2002, [Online]. Available: https://sid.ir/paper/528344/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops