Time filter

Source Type

Tallahassee, FL, United States

Zhou Z.,Citilabs | Chen A.,Utah State University | Bekhor S.,Technion - Israel Institute of Technology
Transportmetrica | Year: 2012

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. © 2011 Copyright Taylor and Francis Group, LLC. Source

Chen A.,Utah State University | Zhou Z.,Citilabs | Xu X.,Utah State University
Computers and Operations Research | Year: 2012

Gradient projection (GP) algorithm has been shown as an efficient algorithm for solving the traditional traffic equilibrium problem with additive route costs. Recently, GP has been extended to solve the nonadditive traffic equilibrium problem (NaTEP), in which the cost incurred on each route is not just a simple sum of the link costs on that route. However, choosing an appropriate stepsize, which is not known a priori, is a critical issue in GP for solving the NaTEP. Inappropriate selection of the stepsize can significantly increase the computational burden, or even deteriorate the convergence. In this paper, a self-adaptive gradient projection (SAGP) algorithm is proposed. The self-adaptive scheme has the ability to automatically adjust the stepsize according to the information derived from previous iterations. Furthermore, the SAGP algorithm still retains the efficient flow update strategy that only requires a simple projection onto the nonnegative orthant. Numerical results are also provided to illustrate the efficiency and robustness of the proposed algorithm. © Published by Elsevier Ltd. Source

Xu X.,Utah State University | Chen A.,Utah State University | Zhou Z.,Citilabs | Bekhor S.,Technion - Israel Institute of Technology
Transportation Research Record | Year: 2012

This paper develops path-based algorithms to solve the C-logit stochastic user equilibrium (SUE) problem on the basis of an adaptation of the gradient projection method. The algorithms' strategies for step size determination differ. Three strategies are investigated: (a) predetermined step size, (b) Armijo line search, and (c) self-adaptive line search. The algorithms are tested on the well-known Winnipeg (Manitoba, Canada) network. Two sets of experiments are conducted: (a) a computational comparison of different line search strategies and (b) the impact of different modeling specifications for route overlapping (a flow-independent or a flow-dependent commonality factor). The results indicate that the path-based algorithm with the self-adaptive step size strategy performs better than the other step size strategies. The paper shows that, depending on the model parameters, particularly the commonality factor parameter, the C-logit SUE flows may be quite different from the multinomial logit SUE flows. Source

Chen A.,Utah State University | Zhou Z.,Citilabs | Ryu S.,Utah State University
International Journal of Sustainable Transportation | Year: 2011

The traffic equilibrium problem plays an important role in urban transportation planning and management. It predicts vehicular flows on the transportation network by assigning travel demands given in terms of an origin-destination trip table to routes in a network according to some behavioral route choice rules. In this paper, we enhance the realism of the traffic equilibrium problem by explicit modeling various physical and environment restrictions as side constraints. These side constraints are a useful means for describing queuing and congestion effects, restraining traffic flows to limit the amount of emissions, and modeling different traffic control policies. A generalized side-constrained traffic equilibrium (GSCTE) model is presented and some characterizations of the equilibrium solutions are discussed. The model is formulated as a variational inequality problem and solved by a predictor-corrector decomposition algorithm. Two numerical experiments are conducted to demonstrate some properties of the GSCTE model and the convergence properties of the decomposition algorithm. © Taylor & Francis Group, LLC. Source

Chen A.,Utah State University | Chen A.,Tongji University | Xu X.,Utah State University | Xu X.,Nanjing Southeast University | And 2 more authors.
Transportmetrica A: Transport Science | Year: 2013

Stepsize determination is an important component of algorithms for solving several mathematical formulations. In this article, a self-adaptive Armijo strategy is proposed to determine an acceptable stepsize in a more efficient manner. Instead of using a fixed initial stepsize in the original Armijo strategy, the proposed strategy allows the starting stepsize per iteration to be self-adaptive. Both the starting stepsize and the acceptable stepsize are thus allowed to decrease as well as increase by making use of the information derived from previous iterations. This strategy is then applied to three well-known algorithms for solving three traffic equilibrium assignment problems with different complexity. Specifically, we implement this self-adaptive strategy in the link-based Frank-Wolfe algorithm, the route-based disaggregate simplicial decomposition algorithm and the route-based gradient projection algorithm for solving the classical user equilibrium problem, the multinomial logit-based stochastic user equilibrium (MNL SUE) and the congestion-based C-logit SUE problem, respectively. Some numerical results are also provided to demonstrate the efficiency and applicability of the proposed self-adaptive Armijo stepsize strategy implemented in traffic assignment algorithms. © 2013 Hong Kong Society for Transportation Studies Limited. Source

Discover hidden collaborations