In this paper we discuss stochastic optimal path problems where the goal is to find a path that has minimal expected cost and at the same time is less risky (in terms of travel time) than a given benchmark path. The model is suitable for a risk-averse traveler, who prefers a path with a more guaranteed travel time to another path which could be faster but could also be slower. Such risk attitude is incorporated using the concept of second order stochastic dominance constraints. Recently developed theory for optimization problems with stochastic dominance constraints ensures that the resulting problem can be written as a large linear integer program with binary variables; for networks of realistic size, however, such a direct approach is not practical due to the size of the resulting optimization problem. Moreover, the solution returned by the model may contain cycles, which is clearly undesirable from a practical perspective. A number of strategies are explored to solve the problem. First, we prove that cycles can be prevented by a simple modification of the model if the arc travel times are mutually independent. We then propose a sample average approximation (SAA) approach to the problem using samples from the distribution of travel times. Because of the randomness resulting from sampling, it is important that statistical guarantees for the solution returned by algorithm be given, and we provide heuristic procedures to deal with stochastic constraints. We also incorporate a branch-and-cut approach that exploits the structure of the problem in order to deal with the integrality constraints more efficiently. We present some numerical experiments for a 1,522-arc system that corresponds to a large portion of the Chicago area network. The results show that our approach can solve the problem very effectively, producing solutions with statistical guarantees of optimality within reasonable computational time.

## Citation

Manuscript, School of Business, Universidad Adolfo Ibanez, Santiago, Chile