Skip to Main Content
ASME Press Select Proceedings

International Conference on Information Technology and Computer Science, 3rd (ITCS 2011)

Editor
V. E. Muhin
V. E. Muhin
National Technical University of Ukraine
Search for other works by this author on:
W. B. Hu
W. B. Hu
Wuhan University
Search for other works by this author on:
ISBN:
9780791859742
No. of Pages:
656
Publisher:
ASME Press
Publication date:
2011

This paper investigates a shortest path problem on a network in which a stochastic number is assigned to each arc length. The stochastic optimization models of the shortest path are constructed according to expected value and chance-constrained programming. An efficient method is proposed to conversion of the stochastic optimization problems to their respective deterministic equivalents, and Dijkstra's algorithm is used to deal with the problems. Finally, a numerical experiment is given to show the effectiveness of the proposed method.

Abstract
Keywords
Introduction
Problem Formulation
Equivalent Formulation
Dijkstra's Algorithm
An Illustrative Example
Conclusion
Acknowledgments
References
This content is only available via PDF.
Close Modal
This Feature Is Available To Subscribers Only

Sign In or Create an Account

Close Modal
Close Modal