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

Transit Equilibrium Assignment: A Model and Solution Algorithms

Author

Listed:
  • Jia Hao Wu

    (Centre de recherche sur les transports, Université de Montréal)

  • Michael Florian

    (Centre de recherche sur les transports and Département d'IRO, Université de Montréal)

  • Patrice Marcotte

    (Centre de recherche sur les transports, Université de Montréal and Collége militaire royal de Saint-Jean)

Abstract

In this paper we propose a model for the transit equilibrium assignment problem (TEAP) and develop two algorithms for its solution. The behavior of the transit users is modeled by using the concept of hyperpaths (strategies) on an appropriate network (general network) which is obtained from the road network and the transit lines by a transformation which makes explicit the walk, wait, in-vehicle, transfer and alight arcs. The waiting (generalized) cost is a function of both frequency of the transit lines and congestion effects due to queues at stops. The TEAP is stated and formulated as a variational inequality problem, in the space of hyperpath flows, and then solved by the linearized Jacobi method and the projection method. We prove the global convergence of these two algorithms for strongly monotone arc cost mappings. The implementation of the algorithms and computational experiments are presented as well.

Suggested Citation

  • 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.
    • Handle: RePEc:inm:ortrsc:v:28:y:1994:i:3:p:193-203
    DOI: 10.1287/trsc.28.3.193
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.28.3.193
    Download Restriction: no
    File URL: https://libkey.io/10.1287/trsc.28.3.193?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
    ---><---

    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:28:y:1994:i:3:p:193-203. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.