A discrete rational adjustment process of link flows in traffic networks

被引：65

作者：

Guo, Ren-Yong ^{[1
]}

Yang, Hai ^{[2
,3
]}

Huang, Hai-Jun ^{[3
]}

机构：

[1] Inner Mongolia Univ, Coll Comp Sci, Hohhot 010021, Peoples R China

[2] Hong Kong Univ Sci & Technol, Dept Civil & Environm Engn, Kowloon, Hong Kong, Peoples R China

[3] Beihang Univ, Sch Econ & Management, Beijing 100191, Peoples R China

来源：

TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES | 2013年 / 34卷

基金：

中国国家自然科学基金;

关键词：

Traffic dynamics; User equilibrium; System optimum; Convergence; TRAVELER INFORMATION-SYSTEMS; STOCHASTIC EQUILIBRIUM; DYNAMICAL-SYSTEMS; EVOLUTION PROCESS; USER EQUILIBRIUM; ASSIGNMENT; STABILITY; MODEL; EXISTENCE; OPTIMUM;

D O I：

10.1016/j.trc.2013.06.002

中图分类号：

U [交通运输];

学科分类号：

08 ; 0823 ;

摘要：

A discrete dynamical system model, called a discrete rational adjustment process (DRAP), is built upon link-based variables to characterize the process of achieving equilibrium from a non-equilibrium state in traffic networks. The equilibrium state can be in either a deterministic or a stochastic user equilibrium state. The DRAP is formulated in a general framework with either fixed or elastic demand. Several mathematical properties of the DRAP are presented, including the invariance of its evolutionary trajectory, the equivalence between its stationary state and user equilibrium, the uniqueness of its stationary state, and its convergence. Proper toll schemes can make the DRAP evolve towards a system optimum state. Numerical experiments are carried out to show application of the DRAP and its properties and the effectiveness of toll schemes. (C) 2013 Elsevier Ltd. All rights reserved.

引用

页码：121 / 137

页数：17

共 50 条

[1] Rational Behavior Adjustment Process with Boundedly Rational User Equilibrium
Ye, Hongbo
Yang, Hai
TRANSPORTATION SCIENCE, 2017, 51 (03) : 968 - 980
[2] Virtualized Traffic: Reconstructing Traffic Flows from Discrete Spatiotemporal Data
Sewall, Jason
van den Berg, Jur
Lin, Ming C.
Manocha, Dinesh
IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS, 2011, 17 (01) : 26 - 37
[3] STRUCTURE OF TRAFFIC FLOWS IN MULTISERVICE NETWORKS
FILIPIAK, J
AUSTRALIAN TELECOMMUNICATION RESEARCH, 1989, 23 (01): : 5 - 18
[4] Sensitivity of the Traffic Flows in Transportation Networks
Moridpour, Sara
JOURNAL OF URBAN PLANNING AND DEVELOPMENT-ASCE, 2009, 135 (02): : 56 - 65
[5] Link Cost Function and Link Capacity for Mixed Traffic Networks
Das, Aathira K.
Rama Chilukuri, Bhargava
TRANSPORTATION RESEARCH RECORD, 2020, 2674 (09) : 38 - 50
[6] A discrete and symmetric price adjustment process on the simplex
Tuinstra, J
JOURNAL OF ECONOMIC DYNAMICS & CONTROL, 2000, 24 (5-7): : 881 - 907
[7] Traffic engineering of management flows by link augmentations on confluent trees
Bhatia, Randeep
Immorlica, Nicole
Kimbrel, Tracy
Mirrokni, Vahab S.
Naor, Joseph
Schieber, Baruch
THEORY OF COMPUTING SYSTEMS, 2008, 42 (01) : 2 - 26
[8] Traffic Engineering of Management Flows by Link Augmentations on Confluent Trees
Randeep Bhatia
Nicole Immorlica
Tracy Kimbrel
Vahab S. Mirrokni
Joseph (Seffi) Naor
Baruch Schieber
Theory of Computing Systems, 2008, 42 : 2 - 26
[9] Simulation of ATM networks with multirate traffic flows
Porotskij, S.M.
Elektrosvyaz, 1998, (07): : 33 - 35
[10] Link-level Interpretation of Eigenanalysis for Network Traffic Flows
Lateef, Irfan
Akansu, Ali N.
2017 51ST ANNUAL CONFERENCE ON INFORMATION SCIENCES AND SYSTEMS (CISS), 2017,

← 1 2 3 4 5 →