IDEAS home Printed from https://ideas.repec.org/a/hin/complx/2601184.html
   My bibliography  Save this article

Bounding the Inefficiency of the Multiclass, Multicriteria C-Logit Stochastic User Equilibrium in a Transportation Network

Author

Listed:
  • Lekai Yuan
  • Xi Zhang
  • Chaofeng Shi
  • Inés P. Mariño

Abstract

We derive the exact inefficiency upper bounds of the multiclass C-Logit stochastic user equilibrium (CL-SUE) in a transportation network. All travelers are classified on the basis of different values of time (VOT) into M classes. The multiclass CL-SUE model gives a more realistic path choice probability in comparison with the logit-based stochastic user equilibrium model by considering the overlapping effects between paths. To find efficiency loss upper bounds of the multiclass CL-SUE, two equivalent variational inequalities for the multiclass CL-SUE model, i.e., time-based variational inequality (VI) and monetary-based VI, are formulated. We give four different methods to define the inefficiency of the multiclass CL-SUE, i.e., to compare multiclass CL-SUE with multiclass system optimum, or to compare multiclass CL-SUE with multiclass C-Logit stochastic system optimum (CL-SSO), under the time-based criterion and the monetary-based criterion, respectively. We further investigate the effects of various parameters which include the degree of path overlapping (the commonality factor), the network complexity, degree of traffic congestion, the VOT of user classes, the network familiarity, and the total demand on the inefficiency bounds.

Suggested Citation

  • Lekai Yuan & Xi Zhang & Chaofeng Shi & Inés P. Mariño, 2021. "Bounding the Inefficiency of the Multiclass, Multicriteria C-Logit Stochastic User Equilibrium in a Transportation Network," Complexity, Hindawi, vol. 2021, pages 1-20, December.
  • Handle: RePEc:hin:complx:2601184
    DOI: 10.1155/2021/2601184
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/complexity/2021/2601184.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/complexity/2021/2601184.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2021/2601184?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:hin:complx:2601184. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    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.