Elastic demand dynamic network user equilibrium: Formulation, existence and computation

Ke Han, Terry L. Friesz, W. Y. Szeto, Hongcheng Liu

Research output: Contribution to journalArticle

22 Citations (Scopus)

Abstract

This paper is concerned with dynamic user equilibrium with elastic travel demand (E-DUE) when the trip demand matrix is determined endogenously. We present an infinite-dimensional variational inequality (VI) formulation that is equivalent to the conditions defining a continuous-time E-DUE problem. An existence result for this VI is established by applying a fixed-point existence theorem (Browder, 1968) in an extended Hilbert space. We present three computational algorithms based on the aforementioned VI and its re-expression as a differential variational inequality (DVI): a projection method, a self-adaptive projection method, and a proximal point method. Rigorous convergence results are provided for these methods, which rely on increasingly relaxed notions of generalized monotonicity, namely mixed strongly-weakly monotonicity for the projection method; pseudomonotonicity for the self-adaptive projection method, and quasimonotonicity for the proximal point method. These three algorithms are tested and their solution quality, convergence, and computational efficiency are compared. Our convergence results, which transcend the transportation applications studied here, apply to a broad family of VIs and DVIs, and are the weakest reported to date.

Original languageEnglish (US)
Pages (from-to)183-209
Number of pages27
JournalTransportation Research Part B: Methodological
Volume81
DOIs
StatePublished - Nov 1 2015

Fingerprint

demand
Hilbert spaces
Computational efficiency
projection
travel
efficiency

All Science Journal Classification (ASJC) codes

  • Civil and Structural Engineering
  • Transportation

Cite this

@article{1c05835f857543e4aa74d7daffab0d0b,
title = "Elastic demand dynamic network user equilibrium: Formulation, existence and computation",
abstract = "This paper is concerned with dynamic user equilibrium with elastic travel demand (E-DUE) when the trip demand matrix is determined endogenously. We present an infinite-dimensional variational inequality (VI) formulation that is equivalent to the conditions defining a continuous-time E-DUE problem. An existence result for this VI is established by applying a fixed-point existence theorem (Browder, 1968) in an extended Hilbert space. We present three computational algorithms based on the aforementioned VI and its re-expression as a differential variational inequality (DVI): a projection method, a self-adaptive projection method, and a proximal point method. Rigorous convergence results are provided for these methods, which rely on increasingly relaxed notions of generalized monotonicity, namely mixed strongly-weakly monotonicity for the projection method; pseudomonotonicity for the self-adaptive projection method, and quasimonotonicity for the proximal point method. These three algorithms are tested and their solution quality, convergence, and computational efficiency are compared. Our convergence results, which transcend the transportation applications studied here, apply to a broad family of VIs and DVIs, and are the weakest reported to date.",
author = "Ke Han and Friesz, {Terry L.} and Szeto, {W. Y.} and Hongcheng Liu",
year = "2015",
month = "11",
day = "1",
doi = "10.1016/j.trb.2015.07.008",
language = "English (US)",
volume = "81",
pages = "183--209",
journal = "Transportation Research, Series B: Methodological",
issn = "0191-2615",
publisher = "Elsevier Limited",

}

Elastic demand dynamic network user equilibrium : Formulation, existence and computation. / Han, Ke; Friesz, Terry L.; Szeto, W. Y.; Liu, Hongcheng.

In: Transportation Research Part B: Methodological, Vol. 81, 01.11.2015, p. 183-209.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Elastic demand dynamic network user equilibrium

T2 - Formulation, existence and computation

AU - Han, Ke

AU - Friesz, Terry L.

AU - Szeto, W. Y.

AU - Liu, Hongcheng

PY - 2015/11/1

Y1 - 2015/11/1

N2 - This paper is concerned with dynamic user equilibrium with elastic travel demand (E-DUE) when the trip demand matrix is determined endogenously. We present an infinite-dimensional variational inequality (VI) formulation that is equivalent to the conditions defining a continuous-time E-DUE problem. An existence result for this VI is established by applying a fixed-point existence theorem (Browder, 1968) in an extended Hilbert space. We present three computational algorithms based on the aforementioned VI and its re-expression as a differential variational inequality (DVI): a projection method, a self-adaptive projection method, and a proximal point method. Rigorous convergence results are provided for these methods, which rely on increasingly relaxed notions of generalized monotonicity, namely mixed strongly-weakly monotonicity for the projection method; pseudomonotonicity for the self-adaptive projection method, and quasimonotonicity for the proximal point method. These three algorithms are tested and their solution quality, convergence, and computational efficiency are compared. Our convergence results, which transcend the transportation applications studied here, apply to a broad family of VIs and DVIs, and are the weakest reported to date.

AB - This paper is concerned with dynamic user equilibrium with elastic travel demand (E-DUE) when the trip demand matrix is determined endogenously. We present an infinite-dimensional variational inequality (VI) formulation that is equivalent to the conditions defining a continuous-time E-DUE problem. An existence result for this VI is established by applying a fixed-point existence theorem (Browder, 1968) in an extended Hilbert space. We present three computational algorithms based on the aforementioned VI and its re-expression as a differential variational inequality (DVI): a projection method, a self-adaptive projection method, and a proximal point method. Rigorous convergence results are provided for these methods, which rely on increasingly relaxed notions of generalized monotonicity, namely mixed strongly-weakly monotonicity for the projection method; pseudomonotonicity for the self-adaptive projection method, and quasimonotonicity for the proximal point method. These three algorithms are tested and their solution quality, convergence, and computational efficiency are compared. Our convergence results, which transcend the transportation applications studied here, apply to a broad family of VIs and DVIs, and are the weakest reported to date.

UR - http://www.scopus.com/inward/record.url?scp=84942582745&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84942582745&partnerID=8YFLogxK

U2 - 10.1016/j.trb.2015.07.008

DO - 10.1016/j.trb.2015.07.008

M3 - Article

AN - SCOPUS:84942582745

VL - 81

SP - 183

EP - 209

JO - Transportation Research, Series B: Methodological

JF - Transportation Research, Series B: Methodological

SN - 0191-2615

ER -