Remote park-and-ride network equilibrium model and its applications

Abstract

Existing park-and-ride (P&R) sites are usually located near a train/bus station where construction and operation costs are considerably high. Thus, this paper proposes a new P&R service mode, “Remote P&R (RPR)”, where the car park locates in a suburban area with lower land value. Dedicated express bus service is used to connect this site and a nearby train station. To quantitatively evaluate the impacts of RPR on the network flows, a combined modal split and traffic assignment model (CMSTA) is developed, where a cross-nested logit (CNL) model is adopted to cope with the mode similarity. The problem is formulated as a convex programming model and solved by the Evans algorithm, and then extended to asymmetric path-based cases, where a variational inequality (VI) model is built and solved by a self-adaptive gradient projection (SAGP) algorithm. Taking the CMSTA as the lower level and multimodal stochastic system optimum (MSSO) as the objective, we further develop a mathematical programming model with equilibrium constraints (MPEC) for the optimal network design of RPR. Based on an origin-based reformulation of the MPEC model, an exact solution method based on the nonlinear valid inequalities (NVI) is applied. Numerical examples demonstrate that the RPR services can significantly influence network users’ travel decisions, promote the usage of public transportation and mitigate traffic congestion in the congested area of metropolitan cities.