检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:何胜学[1]
出 处:《上海理工大学学报》2005年第3期219-222,228,共5页Journal of University of Shanghai For Science and Technology
摘 要:以多种已有模型为基础,建立了动态配流流量细化原则,并依据这一原则,在避免估算路段走行时间的情况下构造了一个改进的新模型.该模型的解释性强,具有全局收敛性,并考虑了距离不同带来的可达性的影响.在对该模型最优解条件的充要性进行说明的同时,对新模型的择路机理也予以了推证.By virtue of the principle of detailed traffic flow, a dynamic user optimum traffic assignment model based on accessibility is constructed. Taking advantage of the functional convexity assumption, in the new model estimation of the link cost is avoided. The new model's optimal solution satisfies the sufficient and necessary conditions. The meaning of terms in the objective function and the mechanism of searching route are given out. One of the features of the objective function is that the accessibility from an original node to a destination node is taken into consideration. Some clues for solving the dynamic traffic model based on accessibility can also be found in the article.
分 类 号:U491[交通运输工程—交通运输规划与管理]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.49