原文传递 LINEAR PROGRAMMING FORMULATIONS FOR SYSTEM OPTIMUM DYNAMIC TRAFFIC ASSIGNMENT WITH ARRIVAL TIME-BASED AND DEPARTURE TIME-BASED DEMANDS.
题名: LINEAR PROGRAMMING FORMULATIONS FOR SYSTEM OPTIMUM DYNAMIC TRAFFIC ASSIGNMENT WITH ARRIVAL TIME-BASED AND DEPARTURE TIME-BASED DEMANDS.
作者: Li-Y; Ziliaskopoulos-AK; Waller-ST
关键词: ARRIVAL-TIME; DEMAND-; DEPARTURE-TIME; DYNAMIC-TRAFFIC-ASSIGNMENT; LINEAR-PROGRAMMING; LINKS-NETWORKS; MATHEMATICAL-MODELS; NODES-NETWORKS; OPTIMIZATION-; ORIGIN-AND-DESTINATION; ROUTE-CHOICE
摘要: The system optimum dynamic traffic assignment problem, in which drivers fix their arrival rather than their departure times, is examined. A model is formulated as a linear program that simultaneously optimizes departure time and route choice. The model applies to multiorigin/multidestination problems, and the first-in-first-out condition is generally observed on the links and nodes of the network. An extension is discussed that accounts for combined departure time- and arrival time-based demand on the same network. The models are tested on an example network, and the results are discussed.
总页数: Transportation Research Record. 1999. (1667) pp52-59 (2 Fig., 8 Tab., 19 Ref.)
报告类型: 科技报告
检索历史
应用推荐