<title>A<sc>bstract</sc> </title> This paper proposes a model for assessing the effects of the integrated implementation of en-route transit information systems (ETIS) and time-varying transit pricing systems (TTPS). The proposed model reveals the interaction between ETIS and TTPS, and the potential benefit of the...

Different from traditional methods, this paper formulates the logit-based stochastic dynamic user optimal (SDUO) route choice problem as a fixed point (FP) problem in terms of intersection movement choice probabilities, which contain travelers’ route information so that the realistic effects...

Turning restriction is one of the commonest traffic management techniques and an effective low cost traffic improvement strategy in urban road networks. However, the literature has not paid much attention to the turning restriction design problem (TRDP), which aims to determine a set of...

In the research area of dynamic traffic assignment, link travel times can be derived from link cumulative inflow and outflow curves which are generated by dynamic network loading. In this paper, the profiles of cumulative flows are piecewise linearized. Both the step function (SF) and linear...

This paper develops a distributionally robust joint chance constrained optimization model for a dynamic network design problem (NDP) under demand uncertainty. The major contribution of this paper is to propose an approach to approximate a joint chance-constrained Cell Transmission Model (CTM)...

This paper introduces a bi-objective turning restriction design problem (BOTRDP), which aims to simultaneously improve network traffic efficiency and reduce environmental pollution by implementing turning restrictions at selected intersections. A bi-level programming model is proposed to...

In this paper, we propose a max-flow-min-cost (MFMC) problem to obtain the upper bound of network capacity and develop an efficient packet routing strategy. The MFMC problem is formulated as two linear programs (LP). The optimal solutions of the two LPs are the upper bound of network capacity...