NETWORK DESIGN EFFECTS OF DYNAMIC TRAFFIC ASSIGNMENT

被引：22

作者：

JANSON, BN

机构：

[1] Dept, Of Civ. Engrg., Univ. Of Colorado, Denver, CO

来源：

JOURNAL OF TRANSPORTATION ENGINEERING-ASCE | 1995年 / 121卷 / 01期

关键词：

D O I：

10.1061/(ASCE)0733-947X(1995)121:1(1)

中图分类号：

TU [建筑科学];

学科分类号：

0813 ;

摘要：

This paper examines the effects of dynamic user-equilibrium (DUE) traffic assignment with scheduled trip arrival times on network design outcomes in comparison to outcomes with steady-state travel demands. The objective is to minimize systemwide travel cost by considering alternative link improvements to an existing network (e.g., select among budget-constrained subsets of link-improvement candidates). DUE is a temporal generalization of static user-equilibrium (SUE) assignment with additional constraints to insure temporally continuous trip paths and first-in first-out (FIFO) trip ordering between all origin-destination pairs. Previous research has not investigated the effects of dynamic travel demands and schedule delay (i.e., shifts by trips to earlier or later arrival times) on network design with multiple trip origins and destinations. DUE is formulated as a bilevel program of two subproblems solved successively by an iterative algorithm that consistently converges to solutions that closely satisfy the necessary optimality conditions of this problem. Examples show the impacts of alternative combinations of network changes affecting capacities and/or free-flow travel times (e.g., ramp metering or road widening) to depend on temporal travel demands and schedule delay distributions.

引用

页码：1 / 13

页数：13

共 29 条

[1]

Abdulaal M., Leblanc L.J., Continuous equilibrium network design models, Transp. Res, 13, pp. 19-32, (1979)

[2]

Arnott R., De Palma A., Lindsey R., Properties of dynamic traffic equilibrium involving bottlenecks, including a paradox and metering, Transp. Sci, 27, 2, pp. 148-160, (1993)

[3]

Bertsekas D.P., Linear Network Optimization: Algorithms and Codes, (1991)

[4]

Boyce D.E., Urban transportation network-equilibrium and design models: Recent achievements and future prospects, Envir. And Ping, 16, pp. 1445-1474, (1984)

[5]

Boyce D.E., Janson B.N., A discrete transportation network design problem with combined trip distribution and assignment, Transp. Res, 14, 2, pp. 147-154, (1980)

[6]

Carey M., Optimal time-varying flows on congested networks, Operations Res, 35, 1, pp. 58-69, (1987)

[7]

Carey M., Nonconvexity of the dynamic assignment problem, Transp. Res, 26, 2, pp. 127-133, (1992)

[8]

Friesz T.L., Luque J., Tobin R.L., Wie B., Dynamic network traffic assignment considered as a continuous time optimal control problem, Operations Res, 37, 6, pp. 893-901, (1989)

[9]

Hearn D.W., The gap function of a convex program. Operations Res, Letters, 1, pp. 67-71, (1982)

[10]

Janson B.N., Dynamic traffic assignment for urban road networks, Transp. Res, 25, 2-3, pp. 143-161, (1991)

← 1 2 3 →