IDEAS home Printed from https://ideas.repec.org/a/ids/ijmore/v15y2019i3p338-363.html
   My bibliography  Save this article

The efficiency of greedy best response algorithm in road traffic assignment

Author

Listed:
  • Lahna Idres
  • Mohammed Said Radjef

Abstract

In this work, we investigate the problem of the integer road traffic assignment. So, we model the interaction among the road users sharing the same origin-destination pair, as a symmetric network congestion game. We focus on Rosenthal's results to guarantee the existence of a pure Nash equilibrium (PNE). Then, we study the behaviour of an algorithm based on greedy best response (GBR) in finding PNE. In previous studies, the efficiency of GBR to compute a PNE of a symmetric network congestion game in series-parallel networks is proved. In our work, another approach is used to demonstrate its efficiency in more general networks. It is shown that the non-series parallel networks can be classed into two types. The conditions that make GBR succeeds for each type is then drawn. The advantage of GBR-algorithm is that provides a better approximation of the equilibrate assignment, since it is integer.

Suggested Citation

  • Lahna Idres & Mohammed Said Radjef, 2019. "The efficiency of greedy best response algorithm in road traffic assignment," International Journal of Mathematics in Operational Research, Inderscience Enterprises Ltd, vol. 15(3), pages 338-363.
    • Handle: RePEc:ids:ijmore:v:15:y:2019:i:3:p:338-363
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=102077
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

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

    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:ids:ijmore:v:15:y:2019:i:3:p:338-363. 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: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=320 .

    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.