The Variance-Constrained Shortest Path Problem

Raj A. Sivakumar and Rajan Batta
Additional contact information
Raj A. Sivakumar: Corporate Research and Development, United Airlines, Elk Grove Village, Illinois 60007
Rajan Batta: Department of Industrial Engineering, State University of New York at Buffalo, Buffalo, New York 14260

Transportation Science, 1994, vol. 28, issue 4, 309-316

Abstract: This paper discusses the variance-constrained shortest path problem. This problem can be used to model any application in which the travel costs on a link are not deterministic, but follow a distribution that has possible correlation with travel cost on other links. Exact solution methods are proposed, and results are reported from computational experiments on data sets derived from a real-life routine scenario involving the transportation of liquefied-gas hazardous materials.

Date: 1994
References: Add references at CitEc
Citations: View citations in EconPapers (29)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.28.4.309 (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:ortrsc:v:28:y:1994:i:4:p:309-316

Access Statistics for this article

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