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

On Binary Mode Choice/Assignment Models

Author

Listed:
  • Michael Florian

    (Université de Montréal, Montréal, Quebec)

  • Heinz Spiess

    (Université de Montréal, Montréal, Quebec)

Abstract

We consider the two mode equilibrium road and transit assignment model which incorporates a zonal aggregate mode choice model. We reformulate this special structure network equilibrium model as a variational inequality and demonstrate that the origin to destination demands and travel costs, link flows and link travel costs are unique when appropriate sufficient conditions are satisfied. Then we demonstrate the existence of equivalent optimization formulations of special versions of this problem and study sufficient conditions for the convergence of diagonalization methods that are used to obtain solutions for this model.

Suggested Citation

  • Michael Florian & Heinz Spiess, 1983. "On Binary Mode Choice/Assignment Models," Transportation Science, INFORMS, vol. 17(1), pages 32-47, February.
    • Handle: RePEc:inm:ortrsc:v:17:y:1983:i:1:p:32-47
    DOI: 10.1287/trsc.17.1.32
    as

    Download full text from publisher

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

    Citations

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


    Cited by:

    1. C Fisk, 1984. "A Nonlinear Equation Framework for Solving Network Equilibrium Problems," Environment and Planning A, , vol. 16(1), pages 67-80, January.
    2. Laure Cabantous & Gilbert Laporte, 2015. "ASP, The Art and Science of Practice: Academia-Industry Interfacing in Operations Research in Montréal," Interfaces, INFORMS, vol. 45(6), pages 554-566, December.
    3. Ren, Hualing & Song, Yingjie & Long, Jiancheng & Si, Bingfeng, 2021. "A new transit assignment model based on line and node strategies," Transportation Research Part B: Methodological, Elsevier, vol. 150(C), pages 121-142.
    4. Tao Zhang & Yang Yang & Gang Cheng & Minjie Jin, 2020. "A Practical Traffic Assignment Model for Multimodal Transport System Considering Low-Mobility Groups," Mathematics, MDPI, vol. 8(3), pages 1-19, March.
    5. Tian, Qingyun & Wang, David Z.W. & Lin, Yun Hui, 2022. "Optimal deployment of autonomous buses into a transit service network," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 165(C).

    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:17:y:1983:i:1:p:32-47. 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.