TY - JOUR
T1 - C-logit stochastic user equilibrium model
T2 - formulations and solution algorithm
AU - Zhou, Zhong
AU - Chen, Anthony
AU - Bekhor, Shlomo
N1 - Funding Information: The work described in this article was supported by a CAREER grant from the National Science Foundation of the United States (CMS-0134161). Constructive comments and suggestions provided by two anonymous referees are highly appreciated.
PY - 2012/1
Y1 - 2012/1
N2 - This article considers the stochastic user equilibrium (SUE) problem with the route choice model based on the C-logit function. The C-logit model has a simple closed-form analytical probability expression and requires relatively lower calibration efforts and represents a more realistic route choice behaviour compared with the multinomial logit model. This article proposes two versions of the C-logit SUE model that captures the route similarity using different attributes in the commonality factors. The two versions differ with respect to the independence assumption between cost and flow. The corresponding stochastic traffic equilibrium models are called the length-based and congestion-based C-logit SUE models, respectively. To formulate the length-based C-logit SUE model, an equivalent mathematical programming formulation is proposed. For the congestion-based C-logit SUE model, we provide two equivalent variational inequality formulations. To solve the proposed formulations, a new self-adaptive gradient projection algorithm is developed. The proposed formulations and new solution algorithm are tested in two well-known networks. Numerical results demonstrate the validity of the formulations and solution algorithm.
AB - This article considers the stochastic user equilibrium (SUE) problem with the route choice model based on the C-logit function. The C-logit model has a simple closed-form analytical probability expression and requires relatively lower calibration efforts and represents a more realistic route choice behaviour compared with the multinomial logit model. This article proposes two versions of the C-logit SUE model that captures the route similarity using different attributes in the commonality factors. The two versions differ with respect to the independence assumption between cost and flow. The corresponding stochastic traffic equilibrium models are called the length-based and congestion-based C-logit SUE models, respectively. To formulate the length-based C-logit SUE model, an equivalent mathematical programming formulation is proposed. For the congestion-based C-logit SUE model, we provide two equivalent variational inequality formulations. To solve the proposed formulations, a new self-adaptive gradient projection algorithm is developed. The proposed formulations and new solution algorithm are tested in two well-known networks. Numerical results demonstrate the validity of the formulations and solution algorithm.
KW - C-logit
KW - gradient projection
KW - mathematical program
KW - stochastic user equilibrium
KW - variational inequality
UR - http://www.scopus.com/inward/record.url?scp=84859412765&partnerID=8YFLogxK
U2 - 10.1080/18128600903489629
DO - 10.1080/18128600903489629
M3 - مقالة
SN - 1812-8602
VL - 8
SP - 17
EP - 41
JO - Transportmetrica
JF - Transportmetrica
IS - 1
ER -