IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-030-11440-4_53.html
   My bibliography  Save this book chapter

Multi-Attribute, Multi-Class, Trip-Based, Multi-Modal Traffic Network Equilibrium Model: Application to Large-Scale Network

In: Traffic and Granular Flow '17

Author

Listed:
  • Mostafa Ameli

    (Universite Paris-Est, IFSTTAR, GRETTIA
    ENTPE, IFSTTAR, LICIT, Université de Lyon)

  • Jean-Patrick Lebacque

    (Universite Paris-Est, IFSTTAR, GRETTIA)

  • Ludovic Leclercq

    (Université de Lyon, ENTPE, IFSTTAR, LICIT)

Abstract

Transportation systems are dynamically driven not only by non-linear interactions between the different components but also by significant feedbacks between network state and user decision. In this work, we consider a trip-based multi-modal approach to network equilibrium. We assume that mode and path choice is carried out at the same level; therefore, travel time depends on the travel path and the mode attributes of travelers. First, we analyze the existing approaches in the literature to model users’ heterogeneity. Second, we present a formulation for static traffic network equilibrium and propose a hybrid formulation of the cost function for trip-based traffic assignment. Third, we consider dynamic traffic assignment (DTA) and propose a variational inequality formulation of the trip-based fixed demand function for the multi-class dynamic traffic equilibrium problem. Finally, we analyze the equilibrium in a large-scale DTA test case (Lyon 6e + Villeurbanne) by a simulation-based approach. Moreover, we propose a novel trip-based algorithm to solve the discrete DTA problem and compare it with the gap function-based method.

Suggested Citation

  • Mostafa Ameli & Jean-Patrick Lebacque & Ludovic Leclercq, 2019. "Multi-Attribute, Multi-Class, Trip-Based, Multi-Modal Traffic Network Equilibrium Model: Application to Large-Scale Network," Springer Books, in: Samer H. Hamdar (ed.), Traffic and Granular Flow '17, pages 487-495, Springer.
  • Handle: RePEc:spr:sprchp:978-3-030-11440-4_53
    DOI: 10.1007/978-3-030-11440-4_53
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    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:spr:sprchp:978-3-030-11440-4_53. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.