TY - JOUR
T1 - Optimal Path Problems with Second-Order Stochastic Dominance Constraints
AU - Nie, Yu Marco
AU - Wu, Xing
AU - Homem-de-Mello, Tito
N1 - Funding Information:
This research was partially supported by National Science Foundation (CMMI-0928577 and CMMI-1033051) and Northwestern’s Center for Commercialization and Innovative Transportation Technology.
PY - 2012/12
Y1 - 2012/12
N2 - This paper studies optimal path problems integrated with the concept of second order stochastic dominance. These problems arise from applications where travelers are concerned with the trade off between the risks associated with random travel time and other travel costs. Risk-averse behavior is embedded by requiring the random travel times on the optimal paths to stochastically dominate that on a benchmark path in the second order. A general linear operating cost is introduced to combine link- and path-based costs. The latter, which is the focus of the paper, is employed to address schedule costs pertinent to late and early arrival. An equivalent integer program to the problem is constructed by transforming the stochastic dominance constraint into a finite number of linear constraints. The problem is solved using both off-the-shelf solvers and specialized algorithms based on dynamic programming (DP). Although neither approach ensures satisfactory performance for general large-scale problems, the numerical experiments indicate that the DP-based approach provides a computationally feasible option to solve medium-size instances (networks with several thousand links) when correlations among random link travel times can be ignored.
AB - This paper studies optimal path problems integrated with the concept of second order stochastic dominance. These problems arise from applications where travelers are concerned with the trade off between the risks associated with random travel time and other travel costs. Risk-averse behavior is embedded by requiring the random travel times on the optimal paths to stochastically dominate that on a benchmark path in the second order. A general linear operating cost is introduced to combine link- and path-based costs. The latter, which is the focus of the paper, is employed to address schedule costs pertinent to late and early arrival. An equivalent integer program to the problem is constructed by transforming the stochastic dominance constraint into a finite number of linear constraints. The problem is solved using both off-the-shelf solvers and specialized algorithms based on dynamic programming (DP). Although neither approach ensures satisfactory performance for general large-scale problems, the numerical experiments indicate that the DP-based approach provides a computationally feasible option to solve medium-size instances (networks with several thousand links) when correlations among random link travel times can be ignored.
KW - Dynamic programming
KW - Integer programming
KW - Optimal path problem
KW - Stochastic dominance
UR - http://www.scopus.com/inward/record.url?scp=84871150512&partnerID=8YFLogxK
U2 - 10.1007/s11067-011-9167-6
DO - 10.1007/s11067-011-9167-6
M3 - Article
AN - SCOPUS:84871150512
VL - 12
SP - 561
EP - 587
JO - Networks and Spatial Economics
JF - Networks and Spatial Economics
SN - 1566-113X
IS - 4
ER -