IDEAS home Printed from https://ideas.repec.org/a/taf/tjorxx/v72y2021i5p1042-1057.html
   My bibliography  Save this article

Should drivers cooperate? Performance evaluation of cooperative navigation on simulated road networks using network DEA

Author

Listed:
  • Nichalin S. Summerfield
  • Amit V. Deokar
  • Mei Xu
  • Weiwei Zhu

Abstract

For drivers, traffic congestion causes enormous delays and increases energy consumption. For a city’s traffic management team, traffic congestion challenges economic growth and increases pollution. Many drivers rely on a GPS navigation system to choose the fastest route to reach their destination. The GPS algorithms generally work for a single driver, while ignoring their collective resulting impact on the road network. If there exists a cooperative centralised routing algorithm that minimises the whole network congestion, the city can greatly benefit from congestion reduction, though some drivers may suffer from such a cooperative routing algorithm. These drivers may opt-out from the cooperative centralised routing, which, in turn, impacts the whole network routing efficiency. So, does having higher proportions of cooperative drivers on the road network always work better? In this paper, we take a heuristic cooperative routing algorithm which minimises the network congestion. We simulate a road network and measure its performance under various proportions of cooperative drivers. We measure both the congestion and the average drivers’ perceived road network performance. Network data envelopment analysis (network DEA) technique is used to see which proportions of cooperative drivers can best benefit the city and drivers collectively.

Suggested Citation

  • Nichalin S. Summerfield & Amit V. Deokar & Mei Xu & Weiwei Zhu, 2021. "Should drivers cooperate? Performance evaluation of cooperative navigation on simulated road networks using network DEA," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 72(5), pages 1042-1057, May.
  • Handle: RePEc:taf:tjorxx:v:72:y:2021:i:5:p:1042-1057
    DOI: 10.1080/01605682.2019.1700766
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1080/01605682.2019.1700766?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:tjorxx:v:72:y:2021:i:5:p:1042-1057. 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/tjor .

    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.