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 67 citations. REVIEW CITATIONS
38 Citations
7 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 38 extracted citations

68 Citations

0510'95'00'06'12'18
Citations per Year
Semantic Scholar estimates that this publication has 68 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-7 of 7 references

Decisions with ~~1tiFle Objectives: Pwferecncoj and V&e Trudeofi

  • R. L. Keeny, H. Raiffa
  • Comm. ACM
  • 1976

A note on two problems in connection with graphs

  • E. W. Dijkstra
  • Numerische Muthematik .
  • 1959

Sabounchi, Utility functions for route attributes and their role in travel-choice models

  • S.P.B. Mirchandani
  • Tech. Rep. TRS-8202,
  • 1959

Similar Papers

Loading similar papers…