Note---An Improved Conditional Monte Carlo Technique for the Stochastic Shortest Path Problem

Veena G. Adlakha
Additional contact information
Veena G. Adlakha: School of Business, University of Baltimore, Baltimore, Maryland 21201

Management Science, 1986, vol. 32, issue 10, 1360-1367

Abstract: This paper describes a simulation procedure for estimating the distribution function of the shortest path length in a network with random arc lengths. The method extends the concept of conditional Monte Carlo utilizing special properties of the Uniformly Directed Cutsets and the unique arcs. The objective here is to reduce the sampling effort and utilize known probability information to derive multivariate integrals of lower dimension. The experimental results show that the proposed method is substantially cost effective and performs better than traditional Monte Carlo and conditional methods.

Keywords: stochastic networks; shortest path; Monte Carlo methods; variance reduction (search for similar items in EconPapers)
Date: 1986
References: Add references at CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.32.10.1360 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:32:y:1986:i:10:p:1360-1367

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().