IDEAS home Printed from https://ideas.repec.org/h/spr/isochp/978-0-387-71134-8_10.html
   My bibliography  Save this book chapter

A Simulation-Based Dynamic Intermodal Network Equilibrium Algorithm

In: Network Science, Nonlinear Science and Infrastructure Systems

Author

Listed:
  • Elaine Chang

    (University of South Florida)

  • Athanasios Ziliaskopoulos

    (University of Thessaly)

Abstract

This paper introduces a Variational Inequality (VI) formulation for the time-dependent combined mode split and traffic assignment problem. Travel costs are represented by generalized cost functions and mode choices are deterministically obtained based on assignment to intermodal least cost paths without accounting for possible randomness in travelers’ choices. The intermodal user equilibrium (IUE) is estimated using an inner approximation (IA) algorithm that results in a nonlinear program with linear constraints. The algorithm converges assuming continuous and monotonic path travel cost functions. The paths on multimodal networks are computed with an intermodal optimum path algorithm; a cell transmission-based simulator, enhanced to account for both automobile and transit vehicles, is used to estimate the path travel costs. A heuristic search approach is proposed and implemented in the VISTA simulation-based framework. Computational results are presented on example networks to test convergence and equilibrium.

Suggested Citation

  • Elaine Chang & Athanasios Ziliaskopoulos, 2007. "A Simulation-Based Dynamic Intermodal Network Equilibrium Algorithm," International Series in Operations Research & Management Science, in: Terry L. Friesz (ed.), Network Science, Nonlinear Science and Infrastructure Systems, chapter 0, pages 201-222, Springer.
    • Handle: RePEc:spr:isochp:978-0-387-71134-8_10
    DOI: 10.1007/0-387-71134-1_10
    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 search for a similarly titled item that would be available.

    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:isochp:978-0-387-71134-8_10. 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.