IDEAS home Printed from https://ideas.repec.org/a/wly/jnddns/v2016y2016i1n9848916.html
   My bibliography  Save this article

Boundedly Rational User Equilibrium with Restricted Unused Routes

Author

Listed:
  • Chao Sun
  • Menghui Li
  • Lin Cheng
  • Senlai Zhu
  • Zhaoming Chu

Abstract

A boundedly rational user equilibrium model with restricted unused routes (R‐BRUE) considering the restrictions of both used route cost and unused route cost is proposed. The proposed model hypothesizes that for each OD pair no traveler can reduce his/her travel time by an indifference band by unilaterally changing route. Meanwhile, no route is unutilized if its travel time is lower than sum of indifference band and the shortest route cost. The largest and smallest used route sets are defined using mathematical expression. We also show that, with the increase of the indifference band, the largest and smallest used route sets will be augmented, and the critical values of indifference band to augment these two path sets are identified by solving the mathematical programs with equilibrium constraints. Based on the largest and smallest used route sets, the R‐BRUE route set without paradoxical route is generated. The R‐BRUE solution set can then be obtained by assigning all traffic demands to the corresponding generated route set. Various numerical examples are also provided to illustrate the essential ideas of the proposed model and structure of R‐BRUE route flow solution set.

Suggested Citation

Handle: RePEc:wly:jnddns:v:2016:y:2016:i:1:n:9848916
DOI: 10.1155/2016/9848916
as

Download full text from publisher

File URL: https://doi.org/10.1155/2016/9848916
Download Restriction: no

File URL: https://libkey.io/10.1155/2016/9848916?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
---><---

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:wly:jnddns:v:2016:y:2016:i:1:n:9848916. 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: Wiley Content Delivery (email available below). General contact details of provider: https://onlinelibrary.wiley.com/journal/3059 .

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.