摘要
针对多目标最短路径的问题采用线性加权Dijstra算法。在立体交通规划布局阶段,考虑其相互作用关系,提出群布型立体交叉的概念及用最短路径法优化匝道设计的实用方法。以重庆绕城高速公路与射线之间的界石、一品、南彭立交为例,检验该方法的实用性。
Linearity weighted Dijstra algorithm is applied in shortest path of multiple objectives. In the planning stage of interchange, because of the relationship between interchanges, group-division interchange is defined. Practical approach that shortest path method is applied in optimizing ramps is analyzed by using the example of Jieshi, Yiping, Nanpeng interchanges located at express loop highway and urban intersecting arterial roads.
出处
《交通科技与经济》
2009年第3期19-20,23,共3页
Technology & Economy in Areas of Communications
关键词
群布型立交
最短路径
线性加权
匝道优化
group-division interchange
shortest path
linearity weight
optimizing ramp