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.
General
Imprint: |
Springer International Publishing AG
|
Country of origin: |
Switzerland |
Series: |
Complex Networks and Dynamic Systems, 5 |
Release date: |
August 2023 |
First published: |
2022 |
Authors: |
Terry L. Friesz
• Ke Han
|
Dimensions: |
235 x 155mm (L x W) |
Format: |
Hardcover
|
Pages: |
392 |
Edition: |
1st ed. 2022 |
ISBN-13: |
978-3-03-125562-5 |
Categories: |
Books
|
LSN: |
3-03-125562-3 |
Barcode: |
9783031255625 |
Is the information for this product incomplete, wrong or inappropriate?
Let us know about it.
Does this product have an incorrect or missing image?
Send us a new image.
Is this product missing categories?
Add more categories.
Review This Product
No reviews yet - be the first to create one!