Boundedly rational user equilibrium with restricted unused routes (Q2398552): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(7 intermediate revisions by 6 users not shown)
Property / author
 
Property / author: Ling Cheng / rank
Normal rank
 
Property / author
 
Property / author: Ling Cheng / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q59123712 / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: GAMS / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1155/2016/9848916 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2559904793 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evaluation of choice set generation algorithms for route choice models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3251780 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simplicial Decomposition with Disaggregated Representation for the Traffic Assignment Problem / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 07:13, 14 July 2024

scientific article
Language Label Description Also known as
English
Boundedly rational user equilibrium with restricted unused routes
scientific article

    Statements

    Boundedly rational user equilibrium with restricted unused routes (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    16 August 2017
    0 references
    Summary: 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.
    0 references

    Identifiers