TY - JOUR
T1 - Continuity of the Effective Delay Operator for Networks Based on the Link Delay Model
AU - Han, Ke
AU - Friesz, Terry L.
N1 - Funding Information:
Acknowledgements This work is partially supported by NSF through grant EFRI-1024707, A theory of complex transportation network design.
Publisher Copyright:
© 2017, The Author(s).
PY - 2017/12/1
Y1 - 2017/12/1
N2 - This paper is concerned with a dynamic traffic network performance model, known as dynamic network loading (DNL), that is frequently employed in the modeling and computation of analytical dynamic user equilibrium (DUE). As a key component of continuous-time DUE models, DNL aims at describing and predicting the spatial-temporal evolution of traffic flows on a network that is consistent with established route and departure time choices of travelers, by introducing appropriate dynamics to flow propagation, flow conservation, and travel delays. The DNL procedure gives rise to the path delay operator, which associates a vector of path flows (path departure rates) with the corresponding path travel costs. In this paper, we establish strong continuity of the path delay operator for networks whose arc flows are described by the link delay model (Friesz et al., Oper Res 41(1):80–91, 1993; Carey, Networks and Spatial Economics 1(3):349–375, 2001). Unlike the result established in Zhu and Marcotte (Transp Sci 34(4):402–414, 2000), our continuity proof is constructed without assuming a priori uniform boundedness of the path flows. Such a more general continuity result has a few important implications to the existence of simultaneous route-and-departure-time DUE without a priori boundedness of path flows, and to any numerical algorithm that allows convergence to be rigorously analyzed.
AB - This paper is concerned with a dynamic traffic network performance model, known as dynamic network loading (DNL), that is frequently employed in the modeling and computation of analytical dynamic user equilibrium (DUE). As a key component of continuous-time DUE models, DNL aims at describing and predicting the spatial-temporal evolution of traffic flows on a network that is consistent with established route and departure time choices of travelers, by introducing appropriate dynamics to flow propagation, flow conservation, and travel delays. The DNL procedure gives rise to the path delay operator, which associates a vector of path flows (path departure rates) with the corresponding path travel costs. In this paper, we establish strong continuity of the path delay operator for networks whose arc flows are described by the link delay model (Friesz et al., Oper Res 41(1):80–91, 1993; Carey, Networks and Spatial Economics 1(3):349–375, 2001). Unlike the result established in Zhu and Marcotte (Transp Sci 34(4):402–414, 2000), our continuity proof is constructed without assuming a priori uniform boundedness of the path flows. Such a more general continuity result has a few important implications to the existence of simultaneous route-and-departure-time DUE without a priori boundedness of path flows, and to any numerical algorithm that allows convergence to be rigorously analyzed.
UR - http://www.scopus.com/inward/record.url?scp=85038077902&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85038077902&partnerID=8YFLogxK
U2 - 10.1007/s11067-017-9379-5
DO - 10.1007/s11067-017-9379-5
M3 - Article
AN - SCOPUS:85038077902
VL - 17
SP - 1095
EP - 1110
JO - Networks and Spatial Economics
JF - Networks and Spatial Economics
SN - 1566-113X
IS - 4
ER -