Stochastic Shortest Path Problems with Piecewise-Linear Concave Utility Functions

This paper considers a stochastic shortest path problem where the arc lengths are independent random variables following a normal distribution. In this problem, the optimal path is one that maximizes the expected utility, with the utility function being piecewise-linear and concave. Such a utility function can be used to approximate nonlinear utility functions that capture risk averse behaviour for a wide class of problems. The principal contribution of this paper is the development of exact algorithms to solve large problem instances. Two algorithms are developed and incorporated in labelling procedures. Computational testing is done to evaluate the performance of the algorithms. Overall, both algorithms are very effective in solving large problems quickly. The relative performance of the two algorithms is found to depend on the "curvature" of the piecewise linear utility function.

[1]  F. Glover,et al.  A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees , 1979, Networks.

[2]  Suresh Chand,et al.  Planning Horizon Procedures for Machine Replacement Models , 1979 .

[3]  Suresh Chand,et al.  Planning Horizon Procedures for Machine Replacement Models with Several Possible Replacement Alternatives , 1982 .

[4]  Ronald Prescott Loui,et al.  Optimal paths in graphs with stochastic or multidimensional weights , 1983, Commun. ACM.

[5]  Simon French,et al.  Modern Decision Making: A Guide to Modelling with Decision Support Systems , 1984 .

[6]  Hossein Soroush,et al.  Optimal paths in probabilistic networks: A case with temporary preferences , 1985, Comput. Oper. Res..

[7]  M. Desrochers,et al.  A Generalized Permanent Labelling Algorithm For The Shortest Path Problem With Time Windows , 1988 .

[8]  H. Moskowitz,et al.  Generalized dynamic programming for multicriteria optimization , 1990 .

[9]  Chelsea C. White,et al.  Multiobjective A* , 1991, JACM.

[10]  A mean-variance serial replacement decision model the independent case , 1991 .

[11]  Jonathan F. Bard,et al.  ARC reduction and path preference in stochastic acyclic networks , 1991 .

[12]  Ishwar Murthy,et al.  Solving min‐max shortest‐path problems on a network , 1992 .

[13]  J. C. Bean,et al.  Parallel replacement under capital rationing constraints , 1994 .

[14]  Sumit Sarkar,et al.  A Relaxation-Based Pruning Technique for a Class of Stochastic Shortest Path Problems , 1996, Transp. Sci..