語系:
繁體中文
English
說明(常見問題)
登入
回首頁
切換:
標籤
|
MARC模式
|
ISBD
Dynamic network user equilibrium
紀錄類型:
書目-語言資料,印刷品 : Monograph/item
正題名/作者:
Dynamic network user equilibrium/ by Terry L. Friesz, Ke Han.
作者:
Friesz, Terry L.
其他作者:
Han, Ke.
出版者:
Cham :Springer International Publishing : : 2022.,
面頁冊數:
xii, 391 p. :ill., digital ; : 24 cm.;
Contained By:
Springer Nature eBook
標題:
Transportation Technology and Traffic Engineering. -
電子資源:
https://doi.org/10.1007/978-3-031-25564-9
ISBN:
9783031255649
Dynamic network user equilibrium
Friesz, Terry L.
Dynamic network user equilibrium
[electronic resource] /by Terry L. Friesz, Ke Han. - Cham :Springer International Publishing :2022. - xii, 391 p. :ill., digital ;24 cm. - Complex networks and dynamic systems,v. 52195-7258 ;. - Complex networks and dynamic systems ;v.1..
Introduction -- Mathematical Preliminaries -- The Variational Inequality Formulation of Dynamic User Equilibria -- The Differential Variational Inequality Formulation of Dynamic User Equilibria -- Existence of Dynamic User Equilibria -- Algorithms for Computing Dynamic User Equilibria -- Dynamic Network Loading: Non-Physical Queue Models -- Dynamic Network Loading: Physical Queue Models -- Numerical Results.
This book presents advanced research in a relatively new field of scholarly inquiry that is usually referred to as dynamic network user equilibrium, now almost universally abbreviated as DUE. It provides the first synthesis of results obtained over the last decade from applying the differential variational inequality (DVI) formalism to study the DUE problem. In particular, it explores the intimately related problem of dynamic network loading, which determines the arc flows and effective travel delays (or generalized travel costs) arising from the expression of departure rates at the origins of commuter trips between the workplace and home. In particular, the authors show that dynamic network loading with spillback of queues into upstream arcs may be formulated as a differential algebraic equation system. They demonstrate how the dynamic network loading problem and the dynamic traffic user equilibrium problem may be solved simultaneously rather than sequentially, as well as how the first-in-first-out queue discipline may be maintained for each when Lighthill-Whitham-Richardson traffic flow theory is used. A number of recent and new extensions of the DVI-based theory of DUE and corresponding examples are presented and discussed. Relevant mathematical background material is provided to make the book as accessible as possible.
ISBN: 9783031255649
Standard No.: 10.1007/978-3-031-25564-9doiSubjects--Topical Terms:
1069531
Transportation Technology and Traffic Engineering.
LC Class. No.: HE336.T68
Dewey Class. No.: 388.31
Dynamic network user equilibrium
LDR
:02840nam a2200361 a 4500
001
1115676
003
DE-He213
005
20230807142516.0
006
m d
007
cr nn 008maaau
008
240123s2022 sz s 0 eng d
020
$a
9783031255649
$q
(electronic bk.)
020
$a
9783031255625
$q
(paper)
024
7
$a
10.1007/978-3-031-25564-9
$2
doi
035
$a
978-3-031-25564-9
040
$a
GP
$c
GP
041
0
$a
eng
050
4
$a
HE336.T68
072
7
$a
KCP
$2
bicssc
072
7
$a
GTB
$2
bicssc
072
7
$a
BUS067000
$2
bisacsh
072
7
$a
KCP
$2
thema
072
7
$a
GTM
$2
thema
082
0 4
$a
388.31
$2
23
090
$a
HE336.T68
$b
F912 2022
100
1
$a
Friesz, Terry L.
$3
1102064
245
1 0
$a
Dynamic network user equilibrium
$h
[electronic resource] /
$c
by Terry L. Friesz, Ke Han.
260
$a
Cham :
$c
2022.
$b
Springer International Publishing :
$b
Imprint: Springer,
300
$a
xii, 391 p. :
$b
ill., digital ;
$c
24 cm.
490
1
$a
Complex networks and dynamic systems,
$x
2195-7258 ;
$v
v. 5
505
0
$a
Introduction -- Mathematical Preliminaries -- The Variational Inequality Formulation of Dynamic User Equilibria -- The Differential Variational Inequality Formulation of Dynamic User Equilibria -- Existence of Dynamic User Equilibria -- Algorithms for Computing Dynamic User Equilibria -- Dynamic Network Loading: Non-Physical Queue Models -- Dynamic Network Loading: Physical Queue Models -- Numerical Results.
520
$a
This book presents advanced research in a relatively new field of scholarly inquiry that is usually referred to as dynamic network user equilibrium, now almost universally abbreviated as DUE. It provides the first synthesis of results obtained over the last decade from applying the differential variational inequality (DVI) formalism to study the DUE problem. In particular, it explores the intimately related problem of dynamic network loading, which determines the arc flows and effective travel delays (or generalized travel costs) arising from the expression of departure rates at the origins of commuter trips between the workplace and home. In particular, the authors show that dynamic network loading with spillback of queues into upstream arcs may be formulated as a differential algebraic equation system. They demonstrate how the dynamic network loading problem and the dynamic traffic user equilibrium problem may be solved simultaneously rather than sequentially, as well as how the first-in-first-out queue discipline may be maintained for each when Lighthill-Whitham-Richardson traffic flow theory is used. A number of recent and new extensions of the DVI-based theory of DUE and corresponding examples are presented and discussed. Relevant mathematical background material is provided to make the book as accessible as possible.
650
2 4
$a
Transportation Technology and Traffic Engineering.
$3
1069531
650
2 4
$a
Operations Research and Decision Theory.
$3
1366301
650
1 4
$a
Regional and Spatial Economics.
$3
1366249
650
0
$a
Traffic estimation
$x
Mathematical models.
$3
1002329
650
0
$a
Traffic flow
$x
Mathematical models.
$3
528209
650
0
$a
Traffic assignment
$x
Mathematical models.
$3
1428587
700
1
$a
Han, Ke.
$3
1428586
710
2
$a
SpringerLink (Online service)
$3
593884
773
0
$t
Springer Nature eBook
830
0
$a
Complex networks and dynamic systems ;
$v
v.1.
$3
1073245
856
4 0
$u
https://doi.org/10.1007/978-3-031-25564-9
950
$a
Economics and Finance (SpringerNature-41170)
筆 0 讀者評論
多媒體
評論
新增評論
分享你的心得
Export
取書館別
處理中
...
變更密碼[密碼必須為2種組合(英文和數字)及長度為10碼以上]
登入