Article ID: | iaor1997908 |
Country: | United States |
Volume: | 30 |
Issue: | 3 |
Start Page Number: | 220 |
End Page Number: | 236 |
Publication Date: | Aug 1996 |
Journal: | Transportation Science |
Authors: | Murthy Ishwar, Sarkar Sumit |
Keywords: | networks: path |
In this paper a form of the stochastic shortest path problem is considered where the optimal path is one that maximizes the expected utility which is concave and quadratic. The principal contribution of this paper is the development of a relaxation based pruning technique which is incorporated into a label setting procedure. The basic label setting procedure solves the problem by generating all Pareto-optimal paths. However, the number of such paths can grow exponentially with the size of the problem. The relaxation based pruning technique developed here is able to recognize and discard most of the Pareto-optimal paths that do not contribute to the optimal path. The present computational results show that the label setting procedure that incorporates the pruning technique consistently outperforms the basic label setting procedure, and is able to solve large problems very quickly.