期刊文献+
共找到3篇文章
< 1 >
每页显示 20 50 100
基于PageRank的交路选择算法研究
1
作者 王若昆 黄克勇 +1 位作者 邱鹏 李露 《高速铁路技术》 2024年第5期87-91,共5页
交路设计是行车计划编制中的重要考虑因素。本文通过对信号系统设备布置结构和设备属性的分析,以静态配置数据的形式表达分析结果,采用图机器学习方法建立用于交路选择的图模型。基于PageRank算法,对图模型中的节点进行重要度分析,给出... 交路设计是行车计划编制中的重要考虑因素。本文通过对信号系统设备布置结构和设备属性的分析,以静态配置数据的形式表达分析结果,采用图机器学习方法建立用于交路选择的图模型。基于PageRank算法,对图模型中的节点进行重要度分析,给出了节点的重要度排序。依据节点的重要度和交路结构,实现了交路分类,给出了一种交路选择算法,为轨道交路选择提供了一种参考方案。最后,以某线路为例进行了实验验证。结果表明,算法可以有效提高交路选择效率。 展开更多
关键词 轨道 图机器学习 交路选择 PAGERANK
下载PDF
Route choice models based on altering OD
2
作者 裴玉龙 郎益顺 《Journal of Harbin Institute of Technology(New Series)》 EI CAS 2003年第4期367-370,共4页
The condition and physical sense of actual dynamic user optimum are explained by analyzing a simple road network route choice. To match the practical application requirements, assignment network and simulation network... The condition and physical sense of actual dynamic user optimum are explained by analyzing a simple road network route choice. To match the practical application requirements, assignment network and simulation network are classified account for varying flowing loading. Instantaneous dynamic user optimum model should be applied to the former and actual dynamic user optimum model the latter respectively. The two model’s feasibility is studied as well. Considering the application in ATMS, the model is mainly used to analyze the altering OD problem. Moreover, it adds the method of route adapting into the object function selection to appraise elastic trip strategy and set up real means of route inducement. 展开更多
关键词 altering OD dynamic traffic assignment instantaneous dynamic user optimum actual dynamic user optimum
下载PDF
ROUTING ALGORITHM FOR THE ROTATION-EXCHANGE NETWORK
3
作者 ChenBaoxing XiaoWenjun 《Journal of Electronics(China)》 2005年第3期255-260,共6页
The paper proposes a new routing algorithm for the Rotation-Exchange (REn) network. The length of the path between any two nodes given by the algorithm is not more than (3/8)n2 + O(n), that is, the diameter of REn is ... The paper proposes a new routing algorithm for the Rotation-Exchange (REn) network. The length of the path between any two nodes given by the algorithm is not more than (3/8)n2 + O(n), that is, the diameter of REn is not more than (3/8)n2 + O(n). This improves on a (1/2)n2 + O(n) routing algorithm proposed earlier. 展开更多
关键词 Cayley graph Rotation-Exchange (REn) network Fixed degree ROUTING
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部