[1]石小法,王炜.高度信息化条件下的动态配流模型[J].东南大学学报(自然科学版),2001,31(2):91-93.[doi:10.3969/j.issn.1001-0505.2001.02.022]
 Shi Xiaofa,Wang Wei.Dynamic Assignment Model Based on Traffic Information[J].Journal of Southeast University (Natural Science Edition),2001,31(2):91-93.[doi:10.3969/j.issn.1001-0505.2001.02.022]
点击复制

高度信息化条件下的动态配流模型()
分享到:

《东南大学学报(自然科学版)》[ISSN:1001-0505/CN:32-1178/N]

卷:
31
期数:
2001年第2期
页码:
91-93
栏目:
交通运输工程
出版日期:
2001-03-20

文章信息/Info

Title:
Dynamic Assignment Model Based on Traffic Information
作者:
石小法 王炜
东南大学交通学院, 南京 210096
Author(s):
Shi Xiaofa Wang Wei
College of Traffic and Transportation Engineering, Southeast University, Nanjing 210096)
关键词:
信息 先进的出行者信息系统 动态路径选择
Keywords:
information advanced traveler information systems dynamic route choice
分类号:
U491
DOI:
10.3969/j.issn.1001-0505.2001.02.022
摘要:
考虑出行者在高度信息化条件下的动态路径选择行为,提出一种高度信息化条件下动态配流模型的框架.将出行者分为被诱导和未被诱导两类,未被诱导的出行者选择静态最短路径,而被诱导的出行者选择随时间变化的最短路径.出行者在交通信息影响下选择自己的最佳出行路径,先进的出行者信息系统通过对交通网络各种交通状况信息的收集和处理,为出行者提供更有价值的交通信息.该模型框架为智能化交通运输系统的建立提供一定的理论依据.
Abstract:
This paper presents a framework of dynamic assignment model under information considering the travelers’ behavior of route chooses under information. The travelers are divided into guided travelers and unguided travelers, the unguided travelers follow static shortest paths while guided travelers follow according to time-dependent shortest paths. The travelers select the optimal travel path under the influence of information, advanced traveler information systems collect the data of traffic network and process it, and generate the valuable travel information for travelers. This framework of model provides some theoretical basis for ITS.

参考文献/References:

[1] Merchant D K,Nemhauser G L.A model and algorithm for the dynamic traffic assignment model.Transportation Science,1978,12 (3):183~199
[2] Carey M.Optimal time-varying flows on congested networks.Operations Research,1987,35 (1):58~69
[3] Friesz T L,Luque F J,Tobin R L,et al.Dynamic network traffic assignment considered as a continuous time optimal control problem.Operations Research,1989,37(6):893~901
[4] Bazaraa S M,Jarvis J J.Linear programming and network flows.New York:John Wiley & Sons,1977.474~506

备注/Memo

备注/Memo:
作者简介:石小法,男,1960年生,博士研究生.
基金项目:国家自然科学基金重点资助项目(59838310).
更新日期/Last Update: 2001-03-20