Path Preferences and Optimal Paths in Probabilistic Networks

Amir Eiger, Pitu B. Mirchandani and Hossein Soroush
Additional contact information
Amir Eiger: Rensselaer Polytechnic Institute, Troy, New York
Pitu B. Mirchandani: Rensselaer Polytechnic Institute, Troy, New York
Hossein Soroush: Rensselaer Polytechnic Institute, Troy, New York

Transportation Science, 1985, vol. 19, issue 1, 75-84

Abstract: The classical shortest route problem in networks assumes deterministic link weights, and route evaluation by a utility (or cost) function that is linear over path weights. When the environment is stochastic and the “traveler’s” utility function for travel attributes is nonlinear, we define “optimal paths” that maximize the expected utility. In this setting, the concept of temporary and permanent preferences for route choices is introduced. It is shown that when the utility function is linear or exponential (constant risk averseness), permanent preferences prevail and an efficient Dijkstra-type algorithm can be used.

Date: 1985
References: Add references at CitEc
Citations: View citations in EconPapers (21)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.19.1.75 (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:19:y:1985:i:1:p:75-84

Access Statistics for this article

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