IDEAS home Printed from https://ideas.repec.org/
MyIDEAS: Login to save this article or follow this journal

Frequency-based transit assignment considering seat capacities

  • Schmöcker, Jan-Dirk
  • Fonzone, Achille
  • Shimamoto, Hiroshi
  • Kurauchi, Fumitaka
  • Bell, Michael G.H.
Registered author(s):

    This paper proposes a frequency-based assignment model that considers travellers probability of finding a seat in their perception of route cost and hence also their route choice. The model introduces a "fail-to-sit" probability at boarding points with travel costs based on the likelihood of travelling seated or standing. Priority rules are considered; in particular it is assumed that standing on-board passengers will occupy any available seats of alighting passengers before newly boarding passengers can fill any remaining seats. At the boarding point passengers are assumed to mingle, meaning that FIFO is not observed, as is the case for many crowded bus and metro stops, particularly in European countries. The route choice considers the common lines problem and an user equilibrium solution is sought through a Markov type network loading process and the method of successive averages. The model is first illustrated with a small example network before being applied to the inner zone of London's underground network. The effect of different values passengers might attach to finding a seat are illustrated. Applications of the model for transit planning as well as for information provision at the journey planner stage are discussed.

    If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.

    File URL: http://www.sciencedirect.com/science/article/B6V99-50RV894-1/2/f83a8b839ef218fc6eddf5bdbe242a22
    Download Restriction: Full text for ScienceDirect subscribers only

    As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.

    Article provided by Elsevier in its journal Transportation Research Part B: Methodological.

    Volume (Year): 45 (2011)
    Issue (Month): 2 (February)
    Pages: 392-408

    as
    in new window

    Handle: RePEc:eee:transb:v:45:y:2011:i:2:p:392-408
    Contact details of provider: Web page: http://www.elsevier.com/wps/find/journaldescription.cws_home/548/description#description

    Order Information: Postal: http://www.elsevier.com/wps/find/supportfaq.cws_home/regional
    Web: https://shop.elsevier.com/order?id=548&ref=548_01_ooc_1&version=01

    References listed on IDEAS
    Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:

    as in new window
    1. 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.
    2. Schmöcker, Jan-Dirk & Bell, Michael G.H. & Kurauchi, Fumitaka, 2008. "A quasi-dynamic capacity constrained frequency-based transit assignment model," Transportation Research Part B: Methodological, Elsevier, vol. 42(10), pages 925-945, December.
    3. 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," Transportation Research Part B: Methodological, Elsevier, vol. 40(6), pages 437-459, July.
    4. Sumalee, Agachai & Tan, Zhijia & Lam, William H.K., 2009. "Dynamic stochastic transit assignment with explicit seat allocation model," Transportation Research Part B: Methodological, Elsevier, vol. 43(8-9), pages 895-912, September.
    5. 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.
    Full references (including those not matched with items on IDEAS)

    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

    When requesting a correction, please mention this item's handle: RePEc:eee:transb:v:45:y:2011:i:2:p:392-408. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei)

    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 references are entirely missing, you can add them using this form.

    If the full references list an item that is present in RePEc, but the system did not link 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 profile, as there may be some citations waiting for confirmation.

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

    This information is provided to you by IDEAS at the Research Division of the Federal Reserve Bank of St. Louis using RePEc data.