traffic assignment system optimal

Traffic Assignment: A Survey of Mathematical Models and Techniques

First Online: 17 May 2018

Cite this chapter

Pushkin Kachroo 14 &
Kaan M. A. Özbay 15

Part of the book series: Advances in Industrial Control ((AIC))

1043 Accesses

2 Citations

This chapter presents the fundamentals of the theory and techniques of traffic assignment problem. It first presents the steady-state traffic assignment problem formulation which is also called static assignment, followed by Dynamic Traffic Assignment (DTA), where the traffic demand on the network is time varying. The static assignment problem is shown in a mathematical programming setting for two different objectives to be satisfied. The first one where all users experience same travel times in alternate used routes is called user-equilibrium and another setting called system optimum in which the assignment attempts to minimize the total travel time. The alternate formulation uses variational inequality method which is also presented. Dynamic travel routing problem is also reviewed in the variational inequality setting. DTA problem is shown in discrete and continuous time in terms of lumped parameters as well as in a macroscopic setting, where partial differential equations are used for the link traffic dynamics. A Hamilton–Jacobi- based travel time dynamics model is also presented for the links and routes, which is integrated with the macroscopic traffic dynamics. Simulation-based DTA method is also very briefly reviewed. This chapter is taken from the following Springer publication and is reproduced here, with permission and with minor changes: Pushkin Kachroo, and Neveen Shlayan, “Dynamic traffic assignment: A survey of mathematical models and technique,” Advances in Dynamic Network Modeling in Complex Transportation Systems (Editor: Satish V. Ukkusuri and Kaan Özbay) Springer New York, 2013. 1-25.

This chapter is taken from the following Springer publication and is reproduced here, with permission and with minor changes: Pushkin Kachroo, and Neveen Shlayan, “Dynamic traffic assignment: A survey of mathematical models and techniques,” Advances in Dynamic Network Modeling in Complex Transportation Systems (Editor: Satish V. Ukkusuri and Kaan Özbay) Springer New York, 2013. 1–25.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Dynamic Traffic Assignment: A Survey of Mathematical Models and Techniques

Traffic Assignments to Transportation Networks

Computing Dynamic User Equilibria on Large-Scale Networks with Software Implementation

Gazis DC (1974) Traffic science. Wiley-Interscience Inc, New York, NY

MATH Google Scholar

Potts RB, Oliver RM (1972) Flows in transportation networks. Elsevier Science

Google Scholar

Stouffer SA (1940) Intervening opportunities: a theory relating mobility and distance. Am Sociol Rev 5:845–867

Article Google Scholar

Hitchcock FL (1941) The distribution of a product from several sources to numerous localities. J Math Phys 20:224–230

Article MathSciNet Google Scholar

Voorhees AM (2013) A general theory of traffic movement 40:1105–1116. https://doi.org/10.1007/s11116-013-9487-0

Wilson AG (1967) A statistical theory of spatial distribution models. Transp Res 1:253–269

Ben-Akiva ME, Lerman SR (1985) Discrete choice analysis: theory and application to travel demand. MIT Press series in transportation studies, MIT Press

Wardrop JG (1952) Some theoretical aspects of road traffic research. Proc Inst Civil Eng PART II 1:325–378

Sheffi Y (1985) Urban transportation networks: equilibrium analysis with mathematical programming methods. Prentice-Hall

Peeta S, Ziliaskopoulos AK (2001) Foundations of dynamic traffic assignment: the past, the present and the future. Netw Spat Econ 1(3/4):233–265

Kachroo P, Sastry S (2016a) Travel time dynamics for intelligent transportation systems: theory and applications. IEEE Trans Intell Transp Syst 17(2):385–394

Kachroo P, Sastry S (2016b) Traffic assignment using a density-based travel-time function for intelligent transportation systems. IEEE Trans Intell Transp Syst 17(5):1438–1447

Dafermos SC, Sparrow FT (1969) The traffic assignment problem for a general network. J Res Natl Bur Stan 73B:91–118

Beckmann MJ, McGuire CB, Winsten CB (1955) Studies in the economics of transportation. Technical report, Rand Corporation

Dafermos S (1980) Traffic equilibrium and variational inequalities. Transp Sci 14:42–54

Dafermos S (1983) An iterative scheme for variational inequalities. Math Prog 26:40–47

Kinderlehrer D, Stampacchia G (2000) An introduction to variational inequalities and their applications, vol 31. Society for Industrial Mathematics

Avriel M (2003) Nonlinear programming: analysis and methods. Dover Publications

Bazaraa MS, Sherali HD, Shetty CM (2006) Nonlinear programming: theory and algorithms. John Wiley & Sons

Mangasarian OL (1994) Nonlinear programming, vol 10. Society for Industrial Mathematics. https://doi.org/10.1137/1.9781611971255

Nugurney A (2000) Sustainable transportation networks. Edward Elgar Publishing, Northampton, MA

Facchinei F, Pang JS (2007) Finite-dimensional variational inequalities and complementarity problems. Springer Science & Business Media

Nagurney A, Zhang D (2012) Projected dynamical systems and variational inequalities with applications, vol 2. Springer Science & Business Media

Zhang D, Nagurney A (1995) On the stability of projected dynamical systems. J Optim Theory Appl 85(1):97–124

Nagurney A, Zhang D (1997) Projected dynamical systems in the formulation, stability analysis, and computation of fixed-demand traffic network equilibria. Transp Sci 31(2):147–158

Zhang D, Nagurney A (1996) On the local and global stability of a travel route choice adjustment process. Transp Res Part B: Methodol 30(4):245–262

Dafermos S (1988) Sensitivity analysis in variational inequalities. Math Oper Res 13:421–434

Dupuis P, Nagurney A (1993) Dynamical systems and variational inequalities. Ann Oper Res 44(1):7–42

Skorokhod AV (1961) Stochastic equations for diffusion processes in a bounded region. Theory Probab Appl 6:264–274

Chiu Y-C, Bottom J, Mahut M, Paz A, Balakrishna R, Waller T, Hicks J (2010) A primer for dynamic traffic assignment. Trans Res Board, 2–3

Ran B, Boyce DE (1996) Modeling dynamic transportation networks: an intelligent transportation system oriented approach. Springer

Chapter Google Scholar

Friesz TL (2001) Special issue on dynamic traffic assignment. Netw Spat Econ Part I 1:231

Merchant DK, Nemhauser GL (1978a) A model and an algorithm for the dynamic traffic assignment problems. Transp Sci 12(3):183–199

Merchant DK, Nemhauser GL (1978b) Optimality conditions for a dynamic traffic assignment model. Transp Sci 12(3):183–199

Boyce D, Lee D, Ran B (2001) Analytical models of the dynamic traffic assignment problem. Netw Spat Econ 1:377–390

Friesz TL, Luque J, Tobin RL, Wie BW (1989) Dynamic network traffic assignment considered as a continuous time optimal control problem. Oper Res 37:893–901

Friesz TL, Bernstein D, Smith TE, Tobin RL, Wie BW (1993) A variational inequality formulation of the dynamic network user equilibrium problem. Oper Res 41:179–191

Chen HK (2012) Dynamic travel choice models: a variational inequality approach. Springer Science & Business Media

Carey M (1992) Nonconvexity of the dynamic traffic assignment problem. Transp Res Part B: Methodol 26(2):127–133

Lighthill MJ, Whitham GB (1955) On kinematic waves II. A theory of traffic on long crowded roods. Proc Roy Soc London A Math Phys Sci 229:317–345. https://doi.org/10.1098/rspa.1955.0089

Richards PI (1956) Shockwaves on the highway. Oper Res 4:42–51

Greenshields B, Channing W, Miller H (1935) A study of traffic capacity. In: Highway Research Board Proceedings. National Research Council (USA), Highway Research Board

LeVeque RJ (1990) Numerical methods for conservation laws. Birkhäuser Verlag

Bressan A (2000) Hyperbolic systems of conservation laws: the one-dimensional Cauchy problem. Oxford University Press

Strub I, Bayen A (2006) Weak formulation of boundary conditions for scalar conservation laws: an application to highway modeling. Int J Robust Nonlinear Control 16:733–748

Garavello M, Piccoli B (2006) Traffic flow on networks. American Institute of Mathematical Sciences, Ser Appl Maths 1:1–243

Holden H, Risebro NH (1995) A mathematical model of traffic flow on a network of unidirectional roads. SIAM J Math Anal 26:999–1017

Lebacque JP (1996) The godunov scheme and what it means for first order traffic flow models. In: Transportation and Traffic Theory, Proceedings of The 13th International Symposium on Transportation and Traffic Theory, Lyon, France, pp 647–677

Coclite GM, Piccoli B (2002) Traffic flow on a road network. Arxiv preprint math/0202146

Garavello M, Piccoli B (2005) Source-destination flow on a road network. Commun Math Sci 3(3):261–283

Gugat M, Herty M, Klar A, Leugering G (2005) Optimal control for traffic flow networks. J Optim theory Appl 126(3):589–616

Lebacque JP, Khoshyaran MM (2002) First order macroscopic traffic flow models for networks in the context of dynamic assignment. In: Patriksson M, Labbé M (eds) Transportation, Planning: State of the Art. Springer US, Boston, MA, pp 119–140. https://doi.org/10.1007/0-306-48220-7_8

Buisson C, Lebacque JP, Lesort JB (1996) Strada, a discretized macroscopic model of vehicular traffic flow in complex networks based on the godunov scheme. In: CESA’96 IMACS Multiconference: computational engineering in systems applications, pp 976–981

Mahmassani HS, Hawas YE, Abdelghany K, Abdelfatah A, Chiu YC, Kang Y, Chang GL, Peeta S, Taylor R, Ziliaskopoulos A (1998) DYNASMART-X; Volume II: analytical and algorithmic aspects. Technical report ST067 85

Ben-Akiva M, Bierlaire M, Koutsopoulos H, Mishalani R (1998) DynaMIT: a simulation-based system for traffic prediction. In: DACCORS short term forecasting workshop, vol TRANSP-OR-CONF-2006-060

Kachroo P, Özbay K (2012) Feedback control theory for dynamic traffic assignment. Springer Science & Business Media

Kachroo P, Özbay K (2011) Feedback ramp metering in intelligent transportation systems. Springer Science & Business Media

Kachroo P, Özbay K (1998) Solution to the user equilibrium dynamic traffic routing problem using feedback linearization. Transp Res Part B: Methodol 32(5):343–360

Kachroo P, Özbay K (2006) Modeling of network level system-optimal real-time dynamic traffic routing problem using nonlinear $\text{ h }{\infty }$ feedback control theoretic approach. J Intell Transp Syst 10(4):159–171

Kachroo P, Özbay K (2005) Feedback control solutions to network level user-equilibrium real-time dynamic traffic assignment problems. Netw Spat Econ 5(3):243–260

Spiess H (1990) Conical volume-delay functions. Transp Sci 24(2):153–158

Download references

Author information

Authors and affiliations.

Department of Electrical and Computer Engineering, University of Nevada, Las Vegas, NV, USA

Pushkin Kachroo

Department of Civil and Urban Engineering, New York University, Brooklyn, NY, USA

Kaan M. A. Özbay

You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Pushkin Kachroo .

Rights and permissions

Reprints and permissions

Copyright information

About this chapter

Kachroo, P., Özbay, K.M.A. (2018). Traffic Assignment: A Survey of Mathematical Models and Techniques. In: Feedback Control Theory for Dynamic Traffic Assignment. Advances in Industrial Control. Springer, Cham. https://doi.org/10.1007/978-3-319-69231-9_2

Download citation

DOI : https://doi.org/10.1007/978-3-319-69231-9_2

Published : 17 May 2018

Publisher Name : Springer, Cham

Print ISBN : 978-3-319-69229-6

Online ISBN : 978-3-319-69231-9

eBook Packages : Engineering Engineering (R0)

Share this chapter

Anyone you share the following link with will be able to read this content:

Sorry, a shareable link is not currently available for this article.

Provided by the Springer Nature SharedIt content-sharing initiative

Publish with us

Policies and ethics

Find a journal
Track your research

Days:

View this program:

Registration Session 1: Welcome & Introduction Session 2: Keynote talk: Markos Papageorgiou: Highlights of Lane-Free Automated Vehicle Traffic with Nudging Session 3: Keynote talk: Dotan Emanuel: Mitigating climate change in cities by traffic signals Coffee Break Session 4A: MaaS (Part 2)

11:00	, , and )
11:20	and )
11:40	, and )
12:00	, , and

11:00	and )
11:20	, and )
11:40	, , and )
12:00	, , and )

11:00	, and )
11:20	and )
11:40	and )
12:00	, and )

11:00	, , , , , and )
11:20	, , and )
11:40	and )
12:00	, and )

14:20	, , , , and )
14:40	and )
15:00	, , , , , , and )
15:20	, and )
15:40	, and

14:20	, , and )
14:40	, , and )
15:00	, and )
15:20	, and
15:40	, , , and

14:20	, and )
14:40	, and )
15:00	and
15:20	, , and
15:40	, , and

14:20	, and )
14:40	, , , and
15:00	, , and )
15:20	, and )
15:40	and )

17:10	, and )
17:30	, , , , and
17:50	, and )
18:10	, and )

17:10	, and
17:30	and )
17:50	, and )
18:10	, , and )

17:10	, , and )
17:30	, , and )
17:50	, , and )
18:10	, , and )

17:10	, , , , , , and )
17:30	, , , , and )
17:50	, , and )
18:10	, and )

View this program: with abstracts session overview talk overview

09:00	, and
09:20	, , and
09:40	and
10:00	, and
10:20	, and

09:00	, , , and
09:20	, , and
09:40	, , , and
10:00	and

13:00	, , , , , , , and
13:20	, and
13:40
14:00	, and
14:20	, and

13:00	, and
13:20	and
13:40	and
14:00	and
14:20	, and

16:00	, , and
16:20	, , and
16:40	and
17:00	, , and
17:20	, , and

16:00	, , , and
16:20	and
16:40	, , , and
17:00
17:20	, , and

09:00	, and
09:20	and
09:40	, , and
10:00	, and
10:20	, , , , , , , and

09:00	, and
09:20	, and
09:40	, and
10:00	, , and
10:20	and

12:00	and
12:20	, , , , and
12:40	and
13:00	, and
13:20	, and

12:00	, and
12:20	, , , and
12:40	, and
13:00	, , and

Information

Author Services

Initiatives

You are accessing a machine-readable page. In order to be human-readable, please install an RSS reader.

All articles published by MDPI are made immediately available worldwide under an open access license. No special permission is required to reuse all or part of the article published by MDPI, including figures and tables. For articles published under an open access Creative Common CC BY license, any part of the article may be reused without permission provided that the original article is clearly cited. For more information, please refer to https://www.mdpi.com/openaccess .

Feature papers represent the most advanced research with significant potential for high impact in the field. A Feature Paper should be a substantial original Article that involves several techniques or approaches, provides an outlook for future research directions and describes possible research applications.

Feature papers are submitted upon individual invitation or recommendation by the scientific editors and must receive positive feedback from the reviewers.

Editor’s Choice articles are based on recommendations by the scientific editors of MDPI journals from around the world. Editors select a small number of articles recently published in the journal that they believe will be particularly interesting to readers, or important in the respective research area. The aim is to provide a snapshot of some of the most exciting work published in the various research areas of the journal.

Original Submission Date Received: .

Active Journals
Find a Journal
Proceedings Series
For Authors
For Reviewers
For Editors
For Librarians
For Publishers
For Societies
For Conference Organizers
Open Access Policy
Institutional Open Access Program
Special Issues Guidelines
Editorial Process
Research and Publication Ethics
Article Processing Charges
Testimonials
Preprints.org
SciProfiles
Encyclopedia

Article Menu

Subscribe SciFeed
Recommended Articles
Google Scholar
on Google Scholar
Table of Contents

Find support for a specific problem in the support section of our website.

Please let us know what you think of our products and services.

Visit our dedicated information section to learn more about MDPI.

JSmol Viewer

Stay two-meters apart: assessing the impact of covid-19 social distancing protocols on subway station walkway performance.

1. Introduction

2. literature review.

Development of a DES model to evaluate the performance of subway station walkways.
Assessment of key performance metrics under both normal and pandemic conditions.
Insights into the impact of social distancing measures on walkway efficiency and congestion.

3. Materials and Methods

3.1. illustration of subway station walkways as a queuing system.

C is the capacity of the walkway in terms of the number of passengers it can accommodate.
k is the density of passengers per square meter (passengers/m 2 ).
L is the length of the walkway in meters.
W is the width of the walkway in meters.
V1 is the walking speed of the lone passenger.
n is the current number of passengers on the walkway.
α : A probability vector that defines the initial distribution across the phases. It determines the likelihood of starting in any given phase when the arrival process begins.
T : A sub-generator matrix that contains the transition rates between the phases. The off-diagonal elements represent the rates of transitioning from one phase to another, while the diagonal elements are negative values indicating the rate of leaving a particular phase.

3.2. PH-Based DES Model Architecture of Subway Station Walkway

3.2.1. passengers’ arrival phase, 3.2.2. state-dependent service phase.

They calculate the average area occupied per passenger, E[A], which equals the facility’s area divided by the average number of passengers in the facility, E[N]. The E[N] value is directly sourced from the FIFO_Queue block.
The Function blocks also monitor the number of passengers, checking if it reaches or surpasses the facility’s capacity. Passengers normally pass through the first entity port of the Output Switch block. However, if they exceed the facility’s capacity, the Function block blocks their entry and triggers the second entity port of the Output Switch block to redirect the excess passengers.
The blocking probability is then determined as the ratio of the number of passengers exiting through the second entity port of the Output Switch block to the total number of arriving passengers.

3.3. Performance Metrics

3.3.1. average number of passengers on the walkway (e[n]), 3.3.2. average dwell time (e[t]), 3.3.3. blocking probability (pb), 3.3.4. average area occupied per passenger (e[a]), 4. results and discussion, 4.1. validation of proposed ph-based des model, 4.1.1. initial experiments and setup, 4.1.2. testing procedure, 4.2. effect of normal and pandemic conditions on performance metrics, 4.3. sensitivity analysis, 5. conclusions and future recommendations, author contributions, institutional review board statement, informed consent statement, data availability statement, conflicts of interest.

Cohen, A. Considerations for Social Distancing on Public Transportation during the COVID-19 Recovery ; Mineta Transportation Institute: San Jose, CA, USA, 2020. [ Google Scholar ]
Kokkola, M.; Nikolaeva, A.; Brömmelstroet, M.T. Missed connections? Everyday mobility experiences and the sociability of public transport in Amsterdam during COVID-19. Soc. Cult. Geogr. 2023 , 24 , 1693–1712. [ Google Scholar ] [ CrossRef ]
Dzisi, E.K.J.; Dei, O.A. Adherence to social distancing and wearing of masks within public transportation during the COVID-19 pandemic. Transp. Res. Interdiscip. Perspect. 2020 , 7 , 100191. [ Google Scholar ] [ CrossRef ] [ PubMed ]
De Vos, J. The effect of COVID-19 and subsequent social distancing on travel behavior. Transp. Res. Interdiscip. Perspect. 2020 , 5 , 100121. [ Google Scholar ] [ CrossRef ] [ PubMed ]
Seriani, S.; Fernandez, R. Pedestrian traffic management of boarding and alighting in metro stations. Transp. Res. Part C Emerg. Technol. 2015 , 53 , 76–92. [ Google Scholar ] [ CrossRef ]
Zhou, M.; Ge, S.; Liu, J.; Dong, H.; Wang, F.-Y. Field observation and analysis of waiting passengers at subway platform—A case study of Beijing subway stations. Phys. A Stat. Mech. Its Appl. 2020 , 556 , 124779. [ Google Scholar ] [ CrossRef ]
Park, Y.; Choi, Y.; Kim, K.; Yoo, J.K. Machine learning approach for study on subway passenger flow. Sci. Rep. 2022 , 12 , 2754. [ Google Scholar ] [ CrossRef ] [ PubMed ]
Islam, M.K.; Vandebona, U.; Dixit, V.V.; Sharma, A. A bulk queue model for the evaluation of impact of headway variations and passenger waiting behavior on public transit performance. IEEE Trans. Intell. Transp. Syst. 2014 , 15 , 2432–2442. [ Google Scholar ] [ CrossRef ]
Pu, Y.; Srikukenthiran, S.; Morrow, E.; Shalaby, A.; Klumpenhouwer, W. Capacity analysis of a passenger rail hub using integrated railway and pedestrian simulation. Urban Rail Transit 2022 , 8 , 1–15. [ Google Scholar ] [ CrossRef ]
Aboudina, A.; Itani, A.; Diab, E.; Srikukenthiran, S.; Shalaby, A. Evaluation of bus bridging scenarios for railway service disruption management: A users’ delay modelling tool. Public Transp. 2021 , 13 , 457–481. [ Google Scholar ] [ CrossRef ]
Xi, Y.; Du, Q.; He, B.; Ren, F.; Zhang, Y.; Ye, X. The dynamic optimization of the departure times of metro users during rush hour in an agent-based simulation: A case study in Shenzhen, China. Appl. Sci. 2017 , 7 , 1102. [ Google Scholar ] [ CrossRef ]
Lu, J.; Ren, G.; Xu, L. Analysis of subway station distribution capacity based on automatic fare collection data of Nanjing metro. J. Transp. Eng. Part A Syst. 2020 , 146 , 04019067. [ Google Scholar ] [ CrossRef ]
Liu, J.; Hu, L.; Xu, X.; Wu, J. A queuing network simulation optimization method for coordination control of passenger flow in urban rail transit stations. Neural Comput. Appl. 2021 , 33 , 10935–10959. [ Google Scholar ] [ CrossRef ]
Jia, F.; Jiang, X.; Li, H.; Yu, X.; Xu, X.; Jiang, M. Passenger-oriented subway network capacity calculation and analysis based on simulation. Transp. Lett. 2021 , 13 , 555–567. [ Google Scholar ] [ CrossRef ]
Su, G.; Si, B.; Zhi, K.; Zhao, B.; Zheng, X. Simulation-Based Method for the Calculation of Passenger Flow Distribution in an Urban Rail Transit Network Under Interruption. Urban Rail Transit 2023 , 9 , 110–126. [ Google Scholar ] [ CrossRef ]
Kittelson & Associates Inc.; Federal Transit Administration; Transit Cooperative Research Program; Transit Development Corporation. Transit Capacity and Quality of Service Manual ; Transportation Research Board: Washington, DC, USA, 2003; Volume 42. [ Google Scholar ]
Ding, H.; Di, Y.; Zheng, X.; Liu, K.; Zhang, W.; Zheng, L. Passenger arrival distribution model and riding guidance on an urban rail transit platform. Phys. A Stat. Mech. Its Appl. 2021 , 571 , 125847. [ Google Scholar ] [ CrossRef ]
Jiang, Y.; Hu, L.; Zhu, J.; Chen, Y. PH fitting of the arrival interval distribution of the passenger flow on urban rail transit stations. Appl. Math. Comput. 2013 , 225 , 158–170. [ Google Scholar ] [ CrossRef ]
Jiang, Y.; Zhu, J.; Hu, L.; Lin, X.; Khattak, A. AG/G (n)/C/C state-dependent simulation model for metro station corridor width design. J. Adv. Transp. 2016 , 50 , 273–295. [ Google Scholar ] [ CrossRef ]
Khattak, A.; Yangsheng, J.; Abid, M.M. Optimal configuration of the metro rail transit station service facilities by integrated simulation-optimization method using passengers’ flow fluctuation. Arab. J. Sci. Eng. 2018 , 43 , 5499–5516. [ Google Scholar ] [ CrossRef ]
Sidorchuk, R.; Lukina, A.; Markin, I.; Korobkov, S.; Ivashkova, N.; Mkhitaryan, S.; Skorobogatykh, I. Influence of passenger flow at the station entrances on passenger satisfaction amid COVID-19. J. Open Innov. Technol. Mark. Complex. 2020 , 6 , 150. [ Google Scholar ] [ CrossRef ]
Yu, H.; Li, A. Study on the Impact of Health Condition Registration and Temperature Check on Inbound Passenger Flow and Optimisation Measures in a Metro Station during the COVID-19 Pandemic. Promet-Traffic Transp. 2023 , 35 , 738–754. [ Google Scholar ] [ CrossRef ]
Jiao, F.; Huang, L.; Song, R.; Huang, H. An improved STL-LSTM model for daily bus passenger flow prediction during the COVID-19 pandemic. Sensors 2021 , 21 , 5950. [ Google Scholar ] [ CrossRef ]
Aghdam, F.B.; Sadeghi-Bazargani, H.; Shahsavarinia, K.; Jafari, F.; Jahangiry, L.; Gilani, N. Investigating the COVID-19 related behaviors in the public transport system. Arch. Public Health 2021 , 79 , 183. [ Google Scholar ] [ CrossRef ] [ PubMed ]
Hidayat, A.M.; Choocharukul, K. Passengers’ Intentions to Use Public Transport during the COVID-19 Pandemic: A Case Study of Bangkok and Jakarta. Sustainability 2023 , 15 , 5273. [ Google Scholar ] [ CrossRef ]
Wilbur, M.; Ayman, A.; Sivagnanam, A.; Ouyang, A.; Poon, V.; Kabir, R.; Vadali, A.; Pugliese, P.; Freudberg, D.; Laszka, A. Impact of COVID-19 on public transit accessibility and ridership. Transp. Res. Rec. 2023 , 2677 , 531–546. [ Google Scholar ] [ CrossRef ] [ PubMed ]
Bansal, P.; Kessels, R.; Krueger, R.; Graham, D.J. Preferences for using the London Underground during the COVID-19 pandemic. Transp. Res. Part A Policy Pract. 2022 , 160 , 45–60. [ Google Scholar ] [ CrossRef ]
Singh, R.; Hörcher, D.; Graham, D.J. An evaluation framework for operational interventions on urban mass public transport during a pandemic. Sci. Rep. 2023 , 13 , 5163. [ Google Scholar ] [ CrossRef ] [ PubMed ]
Khattak, A.; Yangsheng, J. Modeling of subway stations circulation facilities as state-dependent queuing network based on phase-type distribution. In Proceedings of the 2016 IEEE International Conference on Intelligent Transportation Engineering (ICITE), Singapore, 6 October 2016; pp. 133–138. [ Google Scholar ]
Zhu, J.; Hu, L.; Xie, H.; Li, K. A PH (i)/PH (i, n)/C/C Queuing Model in Randomly Changing Environments for Traffic Circulation Systems. J. Adv. Transp. 2022 , 2022 , 6533567. [ Google Scholar ] [ CrossRef ]
Cheah, J.Y.; Smith, J.M. Generalized M/G/C/C state dependent queueing models and pedestrian traffic flows. Queueing Syst. 1994 , 15 , 365–386. [ Google Scholar ] [ CrossRef ]
Smith, J.M.; Smith, J.M. Optimal Routing Problems (ORTE) G (E∗) in TND. In Introduction to Queueing Networks: Theory ∩ Practice ; Springer: Berlin/Heidelberg, Germany, 2018; pp. 397–459. [ Google Scholar ]
Hu, L.; Jiang, Y.; Zhu, J.; Chen, Y. A PH/PH (n)/C/C state-dependent queuing model for metro station corridor width design. Eur. J. Oper. Res. 2015 , 240 , 109–126. [ Google Scholar ] [ CrossRef ]
Smith, J.M.; Li, W.-J. Quadratic assignment problems and M/G/C/C/state dependent network flows. J. Comb. Optim. 2001 , 5 , 421–443. [ Google Scholar ] [ CrossRef ]
Chen, Y.; Yi, B.; Jiang, Y.; Sun, J.; Wahab, M. Inter-arrival time distribution of passengers at service facilities in underground subway stations: A case study of the metropolitan city of Chengdu in China. Transp. Res. Part A Policy Pract. 2018 , 111 , 227–251. [ Google Scholar ] [ CrossRef ]
Khattak, A.; Hussain, A. Hybrid DES-PSO framework for the design of commuters’ circulation space at multimodal transport interchange. Math. Comput. Simul. 2021 , 180 , 205–229. [ Google Scholar ] [ CrossRef ]
Horváth, G.; Telek, M. Acceptance-rejection methods for generating random variates from matrix exponential distributions and rational arrival processes. In Proceedings of the Matrix-Analytic Methods in Stochastic Models; Springer: Berlin/Heidelberg, Germany, 2013; pp. 123–143. [ Google Scholar ]

Click here to enlarge figure

The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

Dong, S.; Khattak, A.; Chen, F.; Xu, F. Stay Two-Meters Apart: Assessing the Impact of COVID-19 Social Distancing Protocols on Subway Station Walkway Performance. Sustainability 2024 , 16 , 6858. https://doi.org/10.3390/su16166858

Dong S, Khattak A, Chen F, Xu F. Stay Two-Meters Apart: Assessing the Impact of COVID-19 Social Distancing Protocols on Subway Station Walkway Performance. Sustainability . 2024; 16(16):6858. https://doi.org/10.3390/su16166858

Dong, Sheng, Afaq Khattak, Feng Chen, and Feifei Xu. 2024. "Stay Two-Meters Apart: Assessing the Impact of COVID-19 Social Distancing Protocols on Subway Station Walkway Performance" Sustainability 16, no. 16: 6858. https://doi.org/10.3390/su16166858

Article Metrics

Article access statistics, further information, mdpi initiatives, follow mdpi.

Subscribe to receive issue release notifications and newsletters from MDPI journals

IMAGES

Optimal solutions of traffic assignment in case Z1 (s=1, i1=2.5
PPT
UNSW CVEN4402: User equilibrium traffic assignment with elastic demand
(PDF) Path-based system optimal dynamic traffic assignment: A
(PDF) Dynamic system optimal traffic assignment with atomic users
Dynamic system optimal traffic assignment with atomic users

COMMENTS

Properties of system optimal traffic assignment with departure time
The system optimization algorithm is structured as a combination of gradient-based forward-backward dynamic programme: to be solved forward in the order of departure time interval for Ψ p (Step 2) and the assignment flow profile (Step 3); solved backward in time for the corresponding costates (Step 4). The study period in continuous time, T, is discretized into K intervals each of length Δs.
Path-based system optimal dynamic traffic assignment: A subgradient
The system-optimal dynamic traffic assignment (SO-DTA) problem aims at solving for the time-dependent link and path flow of a network that yields the minimal total system cost, provided with the Origin-Destination (O-D) demand. The key to solving the path-based formulation of SO-DTA is to efficiently compute the path marginal cost (PMC).
System optimal routing of traffic flows with user constraints using
By seeking system optimal traffic flows subject to user constraints, a compromise assignment can be obtained that balances system and user objectives. To this aim, a linear model and an efficient heuristic algorithm are proposed in this paper. A computational study shows that the proposed model, along with the heuristic algorithm, is able to ...
PDF TRAFFIC ASSIGNMENT
Significance of traffic assignment. Represents the "basic" level of what we mean by "traffic conditions". Essential to make planning, operational, renewal, and policy decisions. Provides "feedback" to trip distribution and mode split steps of the 4-step model. Provides input to assess and influence energy and environmental impacts.
PDF 1 A Distributed Gradient Approach for System Optimal Dynamic Traffic
Abstract—This study presents a distributed gradient-based approach to solve system optimal dynamic traffic assignment (SODTA) formulated based on the cell transmission model. The algorithm distributes SODTA into local sub-problems, who find optimal values for their decision variables within an intersection. Each sub-problem communicates with ...
Dynamic system‐optimal traffic assignment for a city using the
SUMMARY This paper presents a continuum dynamic traffic assignment model for a city in which the total cost of the traffic system is minimized: ... In terms of choice strategy, the DTA problem can be divided into two categories: the dynamic system-optimal (DSO) problem 28, 29 and the dynamic user-optimal ...
Dynamic traffic assignment: Considerations on some deterministic
E. Codina and J. Barceló, A system optimal dynamic traffic assignment model with distributed parameters, Presented at theTRISTAN II Conference, Capri (1994). R. Courant, K. Friedrichs and H. Lewy, Über die Partiellen Differenzengleichungen der Mathemathischen Physik, Mathematische Annalen 100(1928)32-74. Google Scholar
System optimal and user equilibrium time-dependent traffic assignment
This paper formulates two dynamic network traffic assignment models in which O-D desires for the planning horizon are assumed known a priori: the system optimal (SO) and the user equilibrium (UE) time-dependent traffic assignment formulations. Solution algorithms developed and implemented for these models incorporate a traffic simulation model within an overall iterative search framework ...
PDF User equilibrium traffic assignment: k paths subtracting-adding algorithm
Pigou (1918), generated the first ideas related to the traffic assignment problem. The user equilibrium (UE) and system optimal (SO) represent two essential traffic assignment models that have been developed to solve the traffic assignment problem. (Wardrop 1952). Wardrop's first principle is "The travel times on
Traffic Assignment: A Survey of Mathematical Models and Techniques
The remainder of this chapter is organized as follows. The basic introduction to Dynamic Traffic Assignment (DTA) is provided in Sect. 2.1.Section 2.2 deals with the use of mathematical programming methodology for static traffic assignment. The user-equilibrium and system optimal formulations of the traffic assignment problem are discussed in the section.
PDF Tra c Assignment
ra c assignment. The fundamental aim of the tra c assignment process is to reproduce on the transportation system, the pattern of vehicular movements which would be observed when the travel demand represented by the trip matrix, or matrices, to be assi. ned is satis ed. The major aims of tra c assignmen. procedures are:To estimate the volume of ...
System optimal dynamic traffic assignment: Properties and solution
Because of its non-convex constraints and high dimensionality, system optimal dynamic traffic assignment in a many-to-one network (S-SO-DTA) remains one of the challenging problems in transportation research. This paper identified two fundamental properties of it and makes use of them to design an efficient solution procedure to solve general S ...
Traffic Assignment
The system optimum assignment is based on Wardrop's second principle, which states that drivers cooperate with one another in order to minimise total system travel time. This assignment can be thought of as a model in which congestion is minimised when drivers are told which routes to use. ... Traffic Assignment Techniques. Avebury Technical ...
PDF PBW301: Traffic Engineering Lecture 6: Traffic Assignment
System Optimal (SO) Traffic Assignment Basic Concept: Minimizing the Total Travel Time in the Network 15 Flow (q) Total Travel Time (ttt) Marginal increase in For System Optimal Assignment, the travel time marginal increase in travel times of all used routes (between a given OD pair) are equal and less than that of unused routes
PDF Dynamic System-optimal Traffic Assignment Using a State Space Model'
problem of optimal traffic assignment are studied in the context of this model. These optimization ... Merchant and Nemhauser (1978) formulated a mathematical program for system- optimal dynamic traffic assignment in a network with multiple origins and a single desti- nation. They assumed that all links are uncapacitated and that in each time ...
Dynamic system optimal traffic assignment
Dynamic system optimal assignment is formulated here as a state-dependent optimal control problem. A fixed volume of traffic is assigned to departure times and routes such that the total system travel cost is minimised. Solution algorithms are presented and the effect of time discretisation on the quality of calculated assignments is discussed.
Proposing a Simulation-Based Dynamic System Optimal Traffic Assignment
User equilibrium (UE) and system optimal (SO) are among the essential principles for solving the traffic assignment problem. Many studies have been performed on solving the UE and SO traffic assignment problem; however, the majority of them are either static (which can lead to inaccurate predictions due to long aggregation intervals) or analytical (which is computationally expensive for large ...
Advanced Traffic Management Systems: An Overview and A Development Strategy
Keywords: Advanced traffic management systems, Intelligent traffic systems, traffic assignment, traffic optimization, traffic prediction, traffic information, Development strategy 1-1. Introduction The main difference between the phenomenon of traffic and other social phenomena is its reverse growing.
Dynamic traffic assignment: A review of the ...
Aziz and Ukkusuri (2012) integrated an emission-based component into a DTA framework, leading to a model for system optimal assignment with regard to minimization of a weighted sum of total system travel time cost and CO emission cost, and a model for minimizing the total system CO emissions only. Based on the CTM, the resultant models with the ...
PDF Bicriterion Traffic Assignment: Efficient Algorithms Plus Examples
The Volpe National Transportation Systems Center, Kendall Square, Cambridge, MA 02142, U.S.A. (Received 14 January 1996; in revised form 17 July 1996) ... This paper presents a stochastic bicriterion equilibrium traffic assignment model and a solution algorithm. The model permits different trip makers to respond differently--due to finances ...
PDF SOME DEVELOPMENTS IN EQUILIBRIUM TRAFFIC ASSIGNMENTt
traffic assignment in which congestion effects are taken into account and where path choice between each ... the optimal solution Z$, as a function of 8. Suppose that hf.,,(e) is a solution of P2 for a ... The solution of P2 is found by solving the system h,+hz=g h, = g e-eCl/[e-wi + @z] Some developments in equilibrium traffic assignment 247 ...
PROGRAM
Multimodal traffic assignment considering heterogeneous demand and modular operation of shared autonomous vehicles . PRESENTER: Ting Wang. 15:40: ... A simulation model of system optimal motion planning for AVs in shared spaces . PRESENTER: Abdullah Zareh Andaryan. 09:20:
System-optimal dynamic traffic assignment with and without queue
System-optimal dynamic traffic assignment (SO-DTA) aims at determining a time-dependent flow pattern in a network such that the total network cost is minimized. It has attracted considerable attention over the years because this problem is at the core of many transportation applications ranging from day-to-day traffic management to disaster ...
PDF RDMA over Ethernet for Distributed AI Training at Meta Scale
deliver sub-optimal, out-of-box performance with RoCE intercon-nects due to the difference of the developer's environment and production. This necessitates the co-tuning of both collective li-brary and network configurations to achieve optimal performance (Section 6). Low entropy in traffic patterns can result in a few net-
Stay Two-Meters Apart: Assessing the Impact of COVID-19 Social ...
Ensuring passenger safety in public transportation systems is a critical challenge, especially under pandemic conditions that necessitate adherence to social distancing measures, such as maintaining a two-meter distance between individuals. This research focuses on evaluating the performance of subway station walkways when subjected to these distancing requirements. To conduct this analysis, a ...
Dynamic system optimal traffic assignment with atomic users
Dynamic system optimal (DSO) traffic assignment represents normative traffic flow patterns minimising total costs in transport networks. The optimal solutions of a DSO problem provide useful insights into the design of efficient transport management and control schemes, while the value of the objective function is the benchmark for evaluating ...