IDEAS home Printed from https://ideas.repec.org/a/eee/transb/v22y1988i4p261-274.html
   My bibliography  Save this article

An examination of convergence error in equilibrium traffic assignment models

Author

Listed:
  • Rose, Geoffrey
  • Daskin, Mark S.
  • Koppelman, Frank S.

Abstract

This research focuses on the convergence error inherent in the predictions of network equilibrium flows obtained from the Frank-Wolfe algorithm. Factors which determine the magnitude of the convergence error are identified. The effects of selection of a stopping criterion and an initial solution are examined in an empirical study. The results indicate that it is difficult to obtain precise flow predictions in some contexts, specifically where networks contain only a few O-D pairs which are connected by a number of alternative overlapping routes. In addition to having important implications for research studies, the empirical results highlight the need for both researchers and practitioners to consider the issue of convergence error when selecting stopping criteria and initial solutions for flow prediction algorithms.

Suggested Citation

  • Rose, Geoffrey & Daskin, Mark S. & Koppelman, Frank S., 1988. "An examination of convergence error in equilibrium traffic assignment models," Transportation Research Part B: Methodological, Elsevier, vol. 22(4), pages 261-274, August.
  • Handle: RePEc:eee:transb:v:22:y:1988:i:4:p:261-274
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0191-2615(88)90003-3
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

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


    Cited by:

    1. Rasmussen, Thomas Kjær & Watling, David Paul & Prato, Carlo Giacomo & Nielsen, Otto Anker, 2015. "Stochastic user equilibrium with equilibrated choice sets: Part II – Solving the restricted SUE for the logit family," Transportation Research Part B: Methodological, Elsevier, vol. 77(C), pages 146-165.

    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:eee:transb:v:22:y:1988:i:4:p:261-274. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/548/description#description .

    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.