Optimal paths in probabilistic networks: A case with temporary preferences

@article{Mirchandani1985OptimalPI,
  title={Optimal paths in probabilistic networks: A case with temporary preferences},
  author={Pitu B. Mirchandani and Hossein Soroush},
  journal={Computers & OR},
  year={1985},
  volume={12},
  pages={365-381}
}
The classical shortest route problem in networks assumes deterministic arc weights and a utility (or cost) function that is linear over path weights for route evaluation. 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. We review the concepts of remporary and ~r~u~e~r prcfcences for ~rn~ring a traveler’s preference for available subpaths. It has been shown before that when… CONTINUE READING
Highly Cited
This paper has 68 citations. REVIEW CITATIONS

9 Figures & Tables

Topics

Statistics

0510'96'98'00'02'04'06'08'10'12'14'16'18
Citations per Year

68 Citations

Semantic Scholar estimates that this publication has 68 citations based on the available data.

See our FAQ for additional information.