A Study on Network Design Problems for Multi-modal Networks by Probit-based Stochastic User Equilibrium Authors Kenetsu Uchida Graduate School of Engineering Hokkaido University Agachai Sumalee Department of Civil and Structural Engineering The Hong Kong Polytechnic University Institute for Transport Studies University of Leeds David Watling Institute for Transport Studies University of Leeds Richard Connors Institute for Transport Studies University of Leeds Article

First Online: 19 December 2006 Received: 13 January 2006 Accepted: 28 September 2006 DOI :
10.1007/s11067-006-9010-7

Cite this article as: Uchida, K., Sumalee, A., Watling, D. et al. Netw Spat Econ (2007) 7: 213. doi:10.1007/s11067-006-9010-7
Abstract This paper develops a multi-modal transport network model considering various travel modes including railway, bus, auto, and walking. Travellers are assumed to choose their multi-modal routes so as to minimise their perceived disutilities of travel following the Probit Stochastic User Equilibrium (SUE) condition. Factors influencing the disutility of a multi-modal route include actual travel times, discomfort on transit systems, expected waiting times, fares, and constants specific to transport modes. The paper then deals with the multi-modal network design problem (NDP). The paper employs the method of sensitivity analysis to define linear approximation functions between the Probit SUE link flows and the design parameters, which are then used as constraints in the sub-problem of the NDP instead of the original SUE condition. Based on this reformulated NDP, an efficient algorithm for solving the problem is proposed in the paper. Two instances of this general NDP formulation are then presented in the paper: the optimal frequency design problem for public transport services (FDP), and the anti-freezing admixture dispersion problem (AADP).

Keywords Network design Multi-modal networks Stochastic user equilibrium Sensitivity analysis

References Abdulaal M, LeBlanc LJ (1979) Continuous equilibrium network design models. Transp Res, Part B 13:19–32

CrossRef Bielli M, Caramia M, Carotenuto P (2002) Genetic algorithms in bus network optimization. Transp Res, Part C 10:19–34

CrossRef Boyce D, Bar-Gera H (2004) Multiclass combined models for urban travel forecasting. Netw Spat Econ 4:115–124

CrossRef Carey M (1994a) A model and strategy for train pathing with choice of lines, platforms and routes. Transp Res, Part B 28:333–353

CrossRef Carey M (1994b) Extending a train pathing model from one-way to two-way track. Transp Res, Part B 28:395–400

CrossRef Carey M, Carville S (2003) Scheduling and platforming trains at busy complex stations. Transp Res, Part A 37:195–224

Ceder A (1987) Methods for creating bus timetables. Transp Res Part A 21:59–83

CrossRef Ceder A (2002) A step function for improving transit operations planning using fixed and variable scheduling. In: Taylor MAP (ed) Transportation and traffic theory (15th ISTTT). Elsevier, New York, pp 1–21

Cepeda M, Cominetti R, Florian M (2006) A frequency-based assignment model for congested transit networks with strict capacity constraints: characterization and computation of equilibria. Transp Res, Part B 40:437–459

CrossRef Chiriqui C, Robillard P (1975) Common bus lines. Transp Sci 9:115–121

Clark SD, Watling DP (2002) Sensitivity analysis of the probit-based stochastic user equilibrium assignment model. Transp Res, Part B 36:617–635

CrossRef Comminetti R, Correa J (2001) Common-lines and passenger assignment in congested transit networks. Transp Sci 35:250–267

CrossRef Connors RD, Sumalee A, Watling DP (2006) Sensitivity analysis of the variable demand probit stochastic user equilibrium with multiple user-classes. Transp Res Part B (in press)

Constantin I, Florian M (1995) Optimizing frequencies in a transit network: a nonlinear bi-level programming approach. Int Trans Oper Res 2:149–164

CrossRef De Cea J, Fernandez JE (1989) Transit assignment to minimal routes: An effecient new algorithm. Traff Eng Control 30–10, October

De Cea J, Fernandez E (1993) Transit assignment for congested public transport system: an equilibrium model. Transp Sci 27:133–147

Fernandez E, De Cea J, Florian M, Cabrera E (1994) Network equilibrium models with combined modes. Transp Sci 28:182–192

Gao ZY, Sun H, Shan LL (2004) A continuous equilibrium network design model and algorithm for transit systems. Transp Res, Part B 38:235–250

CrossRef Hamdouch Y, Marcotte P, Nguyen S (2004) Capacitated transit assignment with loading priorities. Math Program 101B:205–230

Kamakura WA (1989) The estimation of multinomial probit models. A new calibration algorithm. Transp Sci 23:253–265

Lam WHK, Zhang YP (2000) Capacity-constrained traffic assignment in networks with residual queues. ASCE J Transp Eng 126:121–128

CrossRef Lam WHK, Gao ZY, Chan KS, Yang H (1999) A stochastic user equilibrium assignment model for congested transit networks. Transp Res, Part B 33:351–368

CrossRef Lo HK, Yip CW, Wan KH (2003) Modelling transfer and non-linear fare structure in multi-modal network. Transp Res, Part B 37:149–170

CrossRef Nguyen S, Pallotino S (1988) Equilibrium traffic assignemnt for large scale transit networks. Eur J Oper Res 37:176–186

CrossRef Nielsen OA (2000) A stochastic transit assignment model considering difference in passenger utility functions. Transp Res, Part B 34:377–402

CrossRef Sheffi Y (1985) Urban Transportation Networks . Prentice-Hall, New Jersey

Shepherd SP, Sumalee A (2004) A genetic algorithm based approach to optimal toll level and location problems. Netw Spat Econ 4:161–179

CrossRef Spiess H, Florian M (1989) Optimal strategies: a new assignment model for transit network. Transp Res, Part B 23:83–102

CrossRef Sumalee A, Connors R, Watling DP (2005). Optimal toll design problem with improved behavioural equilibrium model: the case of Probit model. In: Hearn DW, Lawphongpanich S, Smith MJ (eds) Mathematical and computational models for congestion charging. Springer, Berlin Heidelberg New York

Tobin RL, Friesz TL (1988) Sensitivity analysis for equilibrium network flow. Transp Sci 22:242–250

Wan QK, Lo HK (2003) A mixed integer formulation for multiple-route transit network design. J Math Model Algorithms 2:299–308

CrossRef Wirasinghe SC, Liu G (1995) Optimal schedule design for a transit route with one intermediate time point. Transp Plan Technol 19:121–145

Wu JH, Florian M, Marcotte P (1994) Transit equilibrium assignment: A model and solution algorithms. Trans Sci 28:193–203

CrossRef Yang H, Bell MGH (1997) Traffic restraint, road pricing and network equilibrium. Transp Res, Part B 31:303–314

CrossRef Zwaneveld P, Kroon JL, Romeijn HE, Salomon M (1996) Routing trains through railway stations: model formulation and algorithms. Transp Sci 30:181–194

© Springer Science+Business Media, LLC 2006