A new transit assignment model based on line and node strategies

Abstract Passengers traveling on transit networks involve two kinds of decision-making strategies: deciding which lines are attractive at an origin or transfer node (denoted line strategy, LS), or deciding which node to transfer at when riding a line (denoted node strategy, NS). Combining these two strategies, this paper proposes a novel variational inequality formulation for the user equilibrium passenger assignment problem. The inclusion of the NS eliminates the need for passenger assignment on a large augmented graph, reducing the modeling complexity and making it easier to track all passengers’ travel routes. Moreover, constraints on the maximal number of transfers—which are crucial in practical decision-making on transit networks—are explicitly included, further drastically reducing the set of passengers’ feasible strategies. Furthermore, some extant strategy-based transit assignment models are shown to be a special case of the proposed model when the transfer constraint is removed. Finally, the properties of the proposed model are illustrated on a small network, and the model and algorithm exhibit huge advantages on the chosen transit subnetwork of Beijing.

[1]  W. Y. Szeto,et al.  Trial-and-error operation schemes for bimodal transport systems , 2020 .

[2]  Robert B Dial,et al.  TRANSIT PATHFINDER ALGORITHM , 1967 .

[3]  Hong Kam Lo,et al.  Modeling transfer and non-linear fare structure in multi-modal network , 2003 .

[4]  Michael Florian,et al.  Optimal strategies: A new assignment model for transit networks , 1989 .

[5]  M. Florian.  A Traffic Equilibrium Model of Travel by Car and Public Transit Modes , 1977 .

[6]  Navid Kalantari,et al.  Bus fleet optimization using genetic algorithm a case study of Mashhad , 2013 .

[7]  José R. Correa,et al.  Common-Lines and Passenger Assignment in Congested Transit Networks , 2001, Transp. Sci..

[8]  W. Y. Szeto,et al.  Reliability-based stochastic transit assignment: Formulations and capacity paradox , 2016 .

[9]  P. Robillard,et al.  Common Bus Lines , 1975 .

[10]  M. Florian,et al.  On Binary Mode Choice/Assignment Models , 1983 .

[11]  Pan Liu,et al.  Optimal transit fare and service frequency of a nonlinear origin-destination based fare structure , 2016 .

[12]  Esteve Codina,et al.  A heuristic method for a congested capacitated transit assignment model with strategies , 2017 .

[13]  Roberto Cominetti,et al.  A frequency-based assignment model for congested transit networks with strict capacity constraints: characterization and computation of equilibria , 2006 .

[14]  W. Y. Szeto,et al.  Transit assignment: Approach-based formulation, extragradient method, and paradox , 2014 .

[15]  Renato Oliveira Arbex,et al.  Efficient transit network design and frequencies setting multi-objective optimization by alternating objective genetic algorithm , 2015 .

[16]  Christoph E. Mandl,et al.  Evaluation and optimization of urban public transportation networks , 1980 .

[17]  Stefano Pallottino,et al.  Equilibrium traffic assignment for large scale transit networks , 1988 .

[18]  Jia Hao Wu,et al.  Transit Equilibrium Assignment: A Model and Solution Algorithms , 1994, Transp. Sci..

[19]  Fitsum Teklu.  A Stochastic Process Approach for Frequency-based Transit Assignment with Strict Capacity Constraints , 2008 .

[20]  S Nguyen,et al.  An equilibrium-fixed point model for passenger assignment in congested transit networks , 1995 .

[21]  Yu Jiang,et al.  Reliability-Based Transit Assignment for Congested Stochastic Transit Networks , 2011, Comput. Aided Civ. Infrastructure Eng..

[22]  W. Lampkin,et al.  The Design of Routes, Service Frequencies, and Schedules for a Municipal Bus Undertaking: A Case Study , 1967 .

[23]  Matthias H Rapp,et al.  INTERACTIVE GRAPHICS SYSTEM FOR TRANSIT ROUTE OPTIMIZATION , 1976 .

[24]  Fang Zhao,et al.  Simulated Annealing-Genetic Algorithm for Transit Network Optimization , 2006 .

[25]  William H. K. Lam,et al.  A simulation-based reliability assessment approach for congested transit network , 2004 .

[26]  Hani S. Mahmassani,et al.  AN AI-BASED APPROACH FOR TRANSIT ROUTE SYSTEM PLANNING AND DESIGN , 1991 .

[27]  Hai Yang,et al.  A stochastic user equilibrium assignment model for congested transit networks , 1999 .

[28]  Michel Gendreau,et al.  PASSENGER ASSIGNMENT IN CONGESTED TRANSIT NETWORKS: A HISTORICAL PERSPECTIVE. , 1998 .

[29]  Yu Nie,et al.  Finding optimal hyperpaths in large transit networks with realistic headway distributions , 2015, Eur. J. Oper. Res..

[30]  Marie Schmidt,et al.  Line planning with user-optimal route choice , 2017, Eur. J. Oper. Res..

[31]  Huijun Sun,et al.  A continuous equilibrium network design model and algorithm for transit systems , 2004 .

[32]  Rob van Nes,et al.  DESIGN OF PUBLIC TRANSPORT NETWORKS , 1988 .

[33]  B. Horváth.  A New Public Transport Assignment Model , 2008 .

[34]  Enrique Fernández,et al.  Transit Assignment for Congested Public Transport Systems: An Equilibrium Model , 1993, Transp. Sci..

[35]  W. Y. Szeto,et al.  An Intersection-Movement-Based Dynamic User Optimal Route Choice Problem , 2013, Oper. Res..

[36]  Ziyou Gao,et al.  Passenger Assignment Model Based on Common Route in Congested Transit Networks , 2012 .

[37]  Esteve Codina,et al.  A Variational Inequality Reformulation of a Congested Transit Assignment Model by Cominetti, Correa, Cepeda, and Florian , 2013, Transp. Sci..

[38]  A. Nagurney.  Network Economics: A Variational Inequality Approach , 1992 .

[39]  W. Y. Szeto,et al.  Logit-based transit assignment: Approach-based formulation and paradox revisit , 2018 .

[40]  Patrice Marcotte,et al.  Capacitated transit assignment with loading priorities , 2004, Math. Program..

[41]  Hani S. Mahmassani,et al.  TRUST: A LISP PROGRAM FOR THE ANALYSIS OF TRANSIT ROUTE CONFIGURATIONS , 1990 .

[42]  Fumitaka Kurauchi,et al.  Capacity Constrained Transit Assignment with Common Lines , 2003, J. Math. Model. Algorithms.

[43]  Héctor Martínez,et al.  Frequency optimization in public transportation systems: Formulation and metaheuristic approach , 2014, Eur. J. Oper. Res..

[44]  Ziyou Gao,et al.  Assessing the benefits of integrated en-route transit information systems and time-varying transit pricing systems in a congested transit network , 2009 .

[45]  Michel Gendreau,et al.  Modeling Bus Stops in Transit Networks: A Survey and New Formulations , 2001, Transp. Sci..

[46]  Héctor Cancela,et al.  Mathematical programming formulations for transit network design , 2015 .

[47]  Stephane Hess,et al.  A Review on Transit Assignment Modelling Approaches to Congested Networks: A New Perspective , 2012 .

[48]  Nigel H. M. Wilson,et al.  The allocation of buses in heavily utilized networks with overlapping routes , 1982 .

[49]  Hani S. Mahmassani,et al.  Hybrid route generation heuristic algorithm for the design of transit networks , 1995 .

[50]  Martin Grötschel,et al.  A Column-Generation Approach to Line Planning in Public Transport , 2007, Transp. Sci..

[51]  Zhiyuan Liu,et al.  Bus-based park-and-ride system: a stochastic model on multimodal network with congestion pricing schemes , 2014, Int. J. Syst. Sci..

[52]  Hai Yang,et al.  Simultaneous Optimization of Transit Line Configuration and Passenger Line Assignment , 2006 .

[53]  Shing Chung Josh Wong,et al.  The Optimal Transit Fare Structure under Different Market Regimes with Uncertainty in the Network , 2009 .