IDEAS home Printed from https://ideas.repec.org/a/taf/transr/v24y2003i4p437-463.html
   My bibliography  Save this article

Route Choice Models Used in the Stochastic User Equilibrium Problem: A Review

Author

Listed:
  • JOSEPH N. PRASHKER
  • SHLOMO BEKHOR

Abstract

Several route choice models are reviewed in the context of the stochastic user equilibrium problem. The traffic assignment problem has been extensively studied in the literature. Several models were developed focusing mainly on the solution of the link flow pattern for congested urban areas. The behavioural assumption governing route choice, which is the essential part of any traffic assignment model, received relatively much less attention. The core of any traffic assignment method is the route choice model. In the wellknown deterministic case, a simple choice model is assumed in which drivers choose their best route. The assumption of perfect knowledge of travel costs has been long considered inadequate to explain travel behaviour. Consequently, probabilistic route choice models were developed in which drivers were assumed to minimize their perceived costs given a set of routes. The objective of the paper is to review the different route choice models used to solve the traffic assignment problem. Focus is on the different model structures. The paper connects some of the route choice models proposed long ago, such as the logit and probit models, with recently developed models. It discusses several extensions to the simple logit model, as well as the choice set generation problem and the incorporation of the models in the assignment problem.

Suggested Citation

  • Joseph N. Prashker & Shlomo Bekhor, 2003. "Route Choice Models Used in the Stochastic User Equilibrium Problem: A Review," Transport Reviews, Taylor & Francis Journals, vol. 24(4), pages 437-463, October.
  • Handle: RePEc:taf:transr:v:24:y:2003:i:4:p:437-463
    DOI: 10.1080/0144164042000181707
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/0144164042000181707
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/0144164042000181707?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
    ---><---

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

    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:taf:transr:v:24:y:2003:i:4:p:437-463. 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 Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/TTRV20 .

    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.