IDEAS home Printed from https://ideas.repec.org/a/inm/ortrsc/v35y2001i3p238-249.html
   My bibliography  Save this article

A Modeling Framework for Passenger Assignment on a Transport Network with Timetables

Author

Listed:
  • Sang Nguyen

    (Département d'informatique et de recherche opérationnelle and Centre de recherche sur les transports, Université de Montréal, c.p. 6128, succ. centre ville, Montréal, Canada H3C 3J7)

  • Stefano Pallottino

    (Dipartimento di Informatica, Università di Pisa, 40 corso Italia, 56125 Pisa, Italy)

  • Federico Malucelli

    (Dipartimento di Elettronica e Informazione, Politecnico di Milano, P. le L. da Vinci 32, Milano, Italy)

Abstract

This paper presents a new graph theoretic framework for the passenger assignment problem that encompasses simultaneously the departure time and the route choice. The implicit FIFO access to transit lines is taken into account by the concept of available capacity. This notion of flow priority has not been considered explicitly in previous models. A traffic equilibrium model is described and a computational procedure based on asymmetric boarding penalty functions is suggested.

Suggested Citation

  • Sang Nguyen & Stefano Pallottino & Federico Malucelli, 2001. "A Modeling Framework for Passenger Assignment on a Transport Network with Timetables," Transportation Science, INFORMS, vol. 35(3), pages 238-249, August.
    • Handle: RePEc:inm:ortrsc:v:35:y:2001:i:3:p:238-249
    DOI: 10.1287/trsc.35.3.238.10152
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.35.3.238.10152
    Download Restriction: no
    File URL: https://libkey.io/10.1287/trsc.35.3.238.10152?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Gordon F. Newell, 1987. "The Morning Commute for Nonidentical Travelers," Transportation Science, INFORMS, vol. 21(2), pages 74-88, May.
    2. Nguyen, S. & Pallottino, S., 1988. "Equilibrium traffic assignment for large scale transit networks," European Journal of Operational Research, Elsevier, vol. 37(2), pages 176-186, November.
    3. Larry J. LeBlanc & Richard V. Helgason & David E. Boyce, 1985. "Improved Efficiency of the Frank-Wolfe Algorithm for Convex Network Programs," Transportation Science, INFORMS, vol. 19(4), pages 445-462, November.
    4. Carey, Malachy & Srinivasan, Ashok, 1988. "Congested network flows: Time-varying demands and start-time policies," European Journal of Operational Research, Elsevier, vol. 36(2), pages 227-240, August.
    5. Alfa, Attahiru Sule, 1989. "Departure rate and route assignment of commuter traffic during peak period," Transportation Research Part B: Methodological, Elsevier, vol. 23(5), pages 337-344, October.
    6. Torbjörn Larsson & Michael Patriksson, 1992. "Simplicial Decomposition with Disaggregated Representation for the Traffic Assignment Problem," Transportation Science, INFORMS, vol. 26(1), pages 4-17, February.
    7. Carey, Malachy, 1992. "Nonconvexity of the dynamic traffic assignment problem," Transportation Research Part B: Methodological, Elsevier, vol. 26(2), pages 127-133, April.
    8. Spiess, Heinz & Florian, Michael, 1989. "Optimal strategies: A new assignment model for transit networks," Transportation Research Part B: Methodological, Elsevier, vol. 23(2), pages 83-102, April.
    9. Hani Mahmassani & Robert Herman, 1984. "Dynamic User Equilibrium Departure Time and Route Choice on Idealized Traffic Arterials," Transportation Science, INFORMS, vol. 18(4), pages 362-384, November.
    10. Y. Arezki & D. Van Vliet, 1990. "A Full Analytical Implementation of the PARTAN/Frank–Wolfe Algorithm for Equilibrium Assignment," Transportation Science, INFORMS, vol. 24(1), pages 58-62, February.
    11. Stella Dafermos, 1980. "Traffic Equilibrium and Variational Inequalities," Transportation Science, INFORMS, vol. 14(1), pages 42-54, February.
    12. Terry L. Friesz & David Bernstein & Tony E. Smith & Roger L. Tobin & B. W. Wie, 1993. "A Variational Inequality Formulation of the Dynamic Network User Equilibrium Problem," Operations Research, INFORMS, vol. 41(1), pages 179-191, February.
    13. Hani S. Mahmassani & Gang-Len Chang, 1987. "On Boundedly Rational User Equilibrium in Transportation Systems," Transportation Science, INFORMS, vol. 21(2), pages 89-99, May.
    14. Sumi, Tomonori & Matsumoto, Yoshiji & Miyaki, Yasuyuki, 1990. "Departure time and route choice of commuters on mass transit systems," Transportation Research Part B: Methodological, Elsevier, vol. 24(4), pages 247-262, August.
    15. Smith, M. J., 1983. "An algorithm for solving asymmetric equilibrium problems with a continuous cost-flow function," Transportation Research Part B: Methodological, Elsevier, vol. 17(5), pages 365-371, October.
    16. Jia Hao Wu & Michael Florian & Patrice Marcotte, 1994. "Transit Equilibrium Assignment: A Model and Solution Algorithms," Transportation Science, INFORMS, vol. 28(3), pages 193-203, August.
    17. Smith, M. J., 1979. "The existence, uniqueness and stability of traffic equilibria," Transportation Research Part B: Methodological, Elsevier, vol. 13(4), pages 295-304, December.
    18. Smith, M. J., 1983. "The existence and calculation of traffic equilibria," Transportation Research Part B: Methodological, Elsevier, vol. 17(4), pages 291-303, August.
    19. Terry L. Friesz & Javier Luque & Roger L. Tobin & Byung-Wook Wie, 1989. "Dynamic Network Traffic Assignment Considered as a Continuous Time Optimal Control Problem," Operations Research, INFORMS, vol. 37(6), pages 893-901, December.
    20. Hearn, Donald W. & Lawphongpanich, Siriphong & Nguyen, Sang, 1984. "Convex programming formulations of the asymmetric traffic assignment problem," Transportation Research Part B: Methodological, Elsevier, vol. 18(4-5), pages 357-365.
    21. Alfa, Attahiru Sule, 1986. "A review of models for the temporal distribution of peak traffic demand," Transportation Research Part B: Methodological, Elsevier, vol. 20(6), pages 491-499, December.
    22. Caroline Fisk & Sang Nguyen, 1982. "Solution Algorithms for Network Equilibrium Models with Asymmetric User Costs," Transportation Science, INFORMS, vol. 16(3), pages 361-381, August.
    23. Andre de Palma & Moshe Ben-Akiva & Claude Lefevre & Nicolaos Litinas, 1983. "Stochastic Equilibrium Model of Peak Period Traffic Congestion," Transportation Science, INFORMS, vol. 17(4), pages 430-453, November.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Liu, Jiangtao & Zhou, Xuesong, 2016. "Capacitated transit service network design with boundedly rational agents," Transportation Research Part B: Methodological, Elsevier, vol. 93(PA), pages 225-250.
    2. Hamdouch, Younes & Szeto, W.Y. & Jiang, Y., 2014. "A new schedule-based transit assignment model with travel strategies and supply uncertainties," Transportation Research Part B: Methodological, Elsevier, vol. 67(C), pages 35-67.
    3. Binder, Stefan & Maknoon, Yousef & Bierlaire, Michel, 2017. "Exogenous priority rules for the capacitated passenger assignment problem," Transportation Research Part B: Methodological, Elsevier, vol. 105(C), pages 19-42.
    4. Donghyung Yook & Kevin Heaslip, 2015. "The effect of crowding on public transit user travel behavior in a large-scale public transportation system through modeling daily variations," Transportation Planning and Technology, Taylor & Francis Journals, vol. 38(8), pages 935-953, December.
    5. Alireza Khani & Mark Hickman & Hyunsoo Noh, 2015. "Trip-Based Path Algorithms Using the Transit Network Hierarchy," Networks and Spatial Economics, Springer, vol. 15(3), pages 635-653, September.
    6. Mohamed Wahba & Amer Shalaby, 2011. "Large-scale application of MILATRAS: case study of the Toronto transit network," Transportation, Springer, vol. 38(6), pages 889-908, November.
    7. S. Mahmassani, Hani & F. Hyland, Michael, 2016. "Gap-based transit assignment algorithm with vehicle capacity constraints: Simulation-based implementation and large-scale applicationAuthor-Name: Verbas, Ömer," Transportation Research Part B: Methodological, Elsevier, vol. 93(PA), pages 1-16.
    8. Shang, Pan & Li, Ruimin & Guo, Jifu & Xian, Kai & Zhou, Xuesong, 2019. "Integrating Lagrangian and Eulerian observations for passenger flow state estimation in an urban rail transit network: A space-time-state hyper network-based assignment approach," Transportation Research Part B: Methodological, Elsevier, vol. 121(C), pages 135-167.
    9. Linzhong Liu & Haibo Mu & Juhua Yang, 2017. "Toward algorithms for multi-modal shortest path problem and their extension in urban transit network," Journal of Intelligent Manufacturing, Springer, vol. 28(3), pages 767-781, March.
    10. Guangming Xu & Shuo Zhao & Feng Shi & Feilian Zhang, 2017. "Cell transmission model of dynamic assignment for urban rail transit networks," PLOS ONE, Public Library of Science, vol. 12(11), pages 1-31, November.
    11. Poon, M. H. & Wong, S. C. & Tong, C. O., 2004. "A dynamic schedule-based model for congested transit networks," Transportation Research Part B: Methodological, Elsevier, vol. 38(4), pages 343-368, May.
    12. Hamdouch, Younes & Ho, H.W. & Sumalee, Agachai & Wang, Guodong, 2011. "Schedule-based transit assignment model with vehicle capacity and seat availability," Transportation Research Part B: Methodological, Elsevier, vol. 45(10), pages 1805-1830.
    13. Codina, Esteve & Rosell, Francisca, 2017. "A heuristic method for a congested capacitated transit assignment model with strategies," Transportation Research Part B: Methodological, Elsevier, vol. 106(C), pages 293-320.
    14. Jiang, Y. & Szeto, W.Y., 2016. "Reliability-based stochastic transit assignment: Formulations and capacity paradox," Transportation Research Part B: Methodological, Elsevier, vol. 93(PA), pages 181-206.
    15. Khani, Alireza, 2019. "An online shortest path algorithm for reliable routing in schedule-based transit networks considering transfer failure probability," Transportation Research Part B: Methodological, Elsevier, vol. 126(C), pages 549-564.
    16. Cats, Oded & Koutsopoulos, Haris N. & Burghout, Wilco & Toledo, Tomer, 2013. "Effect of real-time transit information on dynamic path choice of passengers," Working papers in Transport Economics 2013:28, CTS - Centre for Transport Studies Stockholm (KTH and VTI).
    17. Zhaoqi Zang & Xiangdong Xu & Anthony Chen & Chao Yang, 2022. "Modeling the α-max capacity of transportation networks: a single-level mathematical programming formulation," Transportation, Springer, vol. 49(4), pages 1211-1243, August.
    18. Peftitsi, Soumela & Jenelius, Erik & Cats, Oded, 2022. "Modeling the effect of real-time crowding information (RTCI) on passenger distribution in trains," Transportation Research Part A: Policy and Practice, Elsevier, vol. 166(C), pages 354-368.
    19. Yu, Liping & Liu, Huiran & Fang, Zhiming & Ye, Rui & Huang, Zhongyi & You, Yayun, 2023. "A new approach on passenger flow assignment with multi-connected agents," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 628(C).
    20. Mo, Baichuan & Koutsopoulos, Haris N. & Shen, Zuo-Jun Max & Zhao, Jinhua, 2023. "Robust path recommendations during public transit disruptions under demand uncertainty," Transportation Research Part B: Methodological, Elsevier, vol. 169(C), pages 82-107.
    21. Younes Hamdouch & Siriphong Lawphongpanich, 2010. "Congestion Pricing for Schedule-Based Transit Networks," Transportation Science, INFORMS, vol. 44(3), pages 350-366, August.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Xu, Zhandong & Xie, Jun & Liu, Xiaobo & Nie, Yu (Marco), 2020. "Hyperpath-based algorithms for the transit equilibrium assignment problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 143(C).
    2. Ran, Bin & Boyce, David E., 1995. "Ideal Dynamic User-Optimal Route Choice: A Link-Based Variational Inequality Formulation," Institute of Transportation Studies, Research Reports, Working Papers, Proceedings qt3t4686x6, Institute of Transportation Studies, UC Berkeley.
    3. Meneguzzer, Claudio, 1995. "An equilibrium route choice model with explicit treatment of the effect of intersections," Transportation Research Part B: Methodological, Elsevier, vol. 29(5), pages 329-356, October.
    4. Belgacem Bouzaïene-Ayari & Michel Gendreau & Sang Nguyen, 2001. "Modeling Bus Stops in Transit Networks: A Survey and New Formulations," Transportation Science, INFORMS, vol. 35(3), pages 304-321, August.
    5. Tong, C. O. & Wong, S. C., 2000. "A predictive dynamic traffic assignment model in congested capacity-constrained road networks," Transportation Research Part B: Methodological, Elsevier, vol. 34(8), pages 625-644, November.
    6. Ran, Bin & Hall, Randolph W. & Boyce, David E., 1996. "A link-based variational inequality model for dynamic departure time/route choice," Transportation Research Part B: Methodological, Elsevier, vol. 30(1), pages 31-46, February.
    7. Alfa, Attahiru Sule & Chen, Mingyuan, 1995. "Temporal distribution of public transport demand during the peak period," European Journal of Operational Research, Elsevier, vol. 83(1), pages 137-153, May.
    8. Chai, Huajun, 2019. "Dynamic Traffic Routing and Adaptive Signal Control in a Connected Vehicles Environment," Institute of Transportation Studies, Working Paper Series qt9ng3z8vn, Institute of Transportation Studies, UC Davis.
    9. García, Ricardo & Marín, Angel, 2005. "Network equilibrium with combined modes: models and solution algorithms," Transportation Research Part B: Methodological, Elsevier, vol. 39(3), pages 223-254, March.
    10. Moore, II, James E. & Kim, Geunyoung & Cho, Seongdil & Hu, Hsi-hwa & Xu, Rong, 1997. "Evaluating System ATMIS Technologies Via Rapid Estimation Of Network Flows: Final Report," Institute of Transportation Studies, Research Reports, Working Papers, Proceedings qt5c70f3d9, Institute of Transportation Studies, UC Berkeley.
    11. Lu, Chung-Cheng & Mahmassani, Hani S. & Zhou, Xuesong, 2009. "Equivalent gap function-based reformulation and solution algorithm for the dynamic user equilibrium problem," Transportation Research Part B: Methodological, Elsevier, vol. 43(3), pages 345-364, March.
    12. Ran, Bin & Hall, Randolph & Boyce, David E., 1995. "A Link-Based Variational Inequality Model for Dynamic Departure Time/Route Choice," Institute of Transportation Studies, Research Reports, Working Papers, Proceedings qt84t190b3, Institute of Transportation Studies, UC Berkeley.
    13. Y. Ge & B. Sun & H. Zhang & W. Szeto & Xizhao Zhou, 2015. "A Comparison of Dynamic User Optimal States with Zero, Fixed and Variable Tolerances," Networks and Spatial Economics, Springer, vol. 15(3), pages 583-598, September.
    14. Younes Hamdouch & Siriphong Lawphongpanich, 2010. "Congestion Pricing for Schedule-Based Transit Networks," Transportation Science, INFORMS, vol. 44(3), pages 350-366, August.
    15. Hamdouch, Younes & Lawphongpanich, Siriphong, 2008. "Schedule-based transit assignment model with travel strategies and capacity constraints," Transportation Research Part B: Methodological, Elsevier, vol. 42(7-8), pages 663-684, August.
    16. Nair, Rahul & Miller-Hooks, Elise, 2014. "Equilibrium network design of shared-vehicle systems," European Journal of Operational Research, Elsevier, vol. 235(1), pages 47-61.
    17. Han, Sangjin, 2007. "A route-based solution algorithm for dynamic user equilibrium assignments," Transportation Research Part B: Methodological, Elsevier, vol. 41(10), pages 1094-1113, December.
    18. Jiang, Chenming & Bhat, Chandra R. & Lam, William H.K., 2020. "A bibliometric overview of Transportation Research Part B: Methodological in the past forty years (1979–2019)," Transportation Research Part B: Methodological, Elsevier, vol. 138(C), pages 268-291.
    19. Fan, Yinchao & Ding, Jianxun & Liu, Haoxiang & Wang, Yu & Long, Jiancheng, 2022. "Large-scale multimodal transportation network models and algorithms-Part I: The combined mode split and traffic assignment problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 164(C).
    20. Lo, Hong K. & Chen, Anthony, 2000. "Traffic equilibrium problem with route-specific costs: formulation and algorithms," Transportation Research Part B: Methodological, Elsevier, vol. 34(6), pages 493-513, August.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:ortrsc:v:35:y:2001:i:3:p:238-249. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.