检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]东南大学交通学院,南京210096
出 处:《Journal of Southeast University(English Edition)》2011年第2期185-187,共3页东南大学学报(英文版)
基 金:The National High Technology Research and Development Program of China(863 Program)(No.2007AA11Z202);the National Key Technology R&D Program of China during the 11th Five-Year Plan Period(No.2006BAJ18B03)
摘 要:The measures of path charge are important considerations in traffic assignment of road networks. Factors, such as travel time, fixed charge and traffic congestion which affect road users' choices of trip paths, are analyzed. Travelers usually decide their trip paths based on their personal habits, preferences and the information at hand. By considering both deterministic and stochastic factors which affect the value of time (VOT) during the process of path choosing, a variational inequality model is proposed to describe the problem of traffic assignment. A lazy loading algorithm for traffic assignment is designed to solve the proposed model, and the calculation steps are given. Numerical experiment results show that compared with the all-or-nothing assignment, the proposed model and the algorithm can provide more optimal traffic assignments for road networks. The results of this study can be used to optimize traffic planning and management.路径收费措施是影响道路网络交通分配的重要因素.受出行时间、道路收费及交通拥堵等多种因素的影响,道路使用者会根据自身习惯、偏好及掌握的信息选择不同的出行路径.综合考虑了路径选择过程中确定性因素和随机性因素对时间感知价值的影响,建立了交通分配的变分不等式模型,设计了求解该模型的延迟加载算法,并叙述了该算法的求解过程.算例结果表明:相对于全有全无交通分配,该模型和算法可以对道路网络中的交通流量进行更优化的分配.分析研究结果可以为实际的交通网络规划与管理提供借鉴.
关 键 词:traffic assignment road networks fixed charge lazy loading algorithm
分 类 号:U491.2[交通运输工程—交通运输规划与管理]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.229