TY - JOUR

T1 - Modeling and optimizing a fare incentive strategy to manage queuing and crowding in mass transit systems

AU - Tang, Yili

AU - Jiang, Yu

AU - Yang, Hai

AU - Nielsen, Otto Anker

PY - 2020/8/31

Y1 - 2020/8/31

N2 - This paper solves the problem of optimizing a surcharge-reward scheme and analyzes equilibrium properties incorporating commuters’ departure time choice to relieve crowding and queuing congestion in mass transit systems. The surcharge-reward scheme incentivizes commuters to switch departure times from a pre-specified central period to shoulder periods. We formulate a bilevel model to design and optimize the surcharge-reward scheme. The upper-level problem minimizes the total equilibrium costs by determining the refundable surcharges, the rewards, and the corresponding central charging period. The lower-level problem determines the equilibrium of commuters’ departure times with respect to generalized travel costs. Equilibrium properties are analyzed and a sequential iterative solution algorithm is developed. We found that the existence of an optimal solution depends on the scheme design and there exists a lower bound on the surcharge to achieve the system optimum. Numerical studies are conducted on a commuting rail line in Copenhagen. The proposed algorithm converges efficiently, and the fare incentive scheme can simultaneously reduce the individual trip costs, total crowding costs, and total queuing time costs. The performance of the scheme increases with the rewards and surcharges up to a point and beyond which it stays unchanged.

AB - This paper solves the problem of optimizing a surcharge-reward scheme and analyzes equilibrium properties incorporating commuters’ departure time choice to relieve crowding and queuing congestion in mass transit systems. The surcharge-reward scheme incentivizes commuters to switch departure times from a pre-specified central period to shoulder periods. We formulate a bilevel model to design and optimize the surcharge-reward scheme. The upper-level problem minimizes the total equilibrium costs by determining the refundable surcharges, the rewards, and the corresponding central charging period. The lower-level problem determines the equilibrium of commuters’ departure times with respect to generalized travel costs. Equilibrium properties are analyzed and a sequential iterative solution algorithm is developed. We found that the existence of an optimal solution depends on the scheme design and there exists a lower bound on the surcharge to achieve the system optimum. Numerical studies are conducted on a commuting rail line in Copenhagen. The proposed algorithm converges efficiently, and the fare incentive scheme can simultaneously reduce the individual trip costs, total crowding costs, and total queuing time costs. The performance of the scheme increases with the rewards and surcharges up to a point and beyond which it stays unchanged.

UR - https://orbit.dtu.dk/en/publications/c57fc463-cdaf-4692-887e-90a4472cb061

U2 - 10.1016/j.trb.2020.05.006

DO - 10.1016/j.trb.2020.05.006

M3 - Journal article

VL - 138

SP - 247

EP - 267

JO - Transportation Research Part B: Methodological

JF - Transportation Research Part B: Methodological

SN - 0191-2615

ER -