城市道路网可行性研究中CIVIL 3D应用浅谈

以武汉航空企业总部区域市政配套工程(四期)为例,采用AutoCAD Civil 3D计算道路和场地土石方,并与传统设计软件EICAD进行了比较。对Civil 3D的运用进行了简单的探索。     

浅谈市政工程中小桥设计问题

随着我国城市化建设的快速发展,越来越多的城市高架桥梁、轨道交通、下穿隧道等市政交通项目应运而生,而这些新增交通项目与现状地面道路、河道以及市政管线等构筑物的空间冲突,导致城市中小桥梁建设的形式也越来越丰富。如何合理地解决市政工程中小桥设计中遇到的问题,结合工程设计实例提了几点相应的解决思路。从造价、经济、使用管养安全等角度,确定合适的管线过桥组合方案;对于处于平面交叉口处的变宽桥梁,应综合考虑美观、经济、实施简单等方面确定最合理的设计方案;与地下工程有关联的市政工程中小桥需沟通多部门,进行多方面的充分论证。     

综合交通枢纽车道边交通组织方式研究

针对现代综合交通枢纽车道边的交通组织方式进行研究,结合车站的整体建筑布局、周边路网、交通量等提出了简单、实用和高效的交通组织方式。     

宜昌市夜明珠路总体方案研究

结合宜昌BRT(快速公交系统)建设对宜昌市夜明珠路进行改造,受众多因素控制,道路改造难度较高。介绍了工程建设条件及总体设计方案。总体方案结合路线两侧现状地形、控制因素等不同特点,将路线分为沿河线段和合流线段两个典型路段,并进行方案比选,综合各方面因素,得出了推荐方案。     

扎（木）墨（脱）公路病害分析与处治

文章结合扎墨简易公路便道整修工程实践,介绍了扎墨公路沿线地质的工程特性、分类以及该路线上的公路病害情况,提出了相应的病害处治措施及在扎墨公路沿线区域进行公路工程施工应注意的问题。     

大型活动的交通调查及分析

随着我国经济的不断发展,全国各地举行的大型活动越来越多。大型活动产生突增交通量造成周边地区的交通拥挤,而分析大型活动带来的交通拥挤则是以对大型活动的交通调查为基础的。以长春市南岭体育场周围的道路交通系统为基础,对举行足球比赛产生的观众到达高峰和离开高峰进行了实地调查,并通过问卷的方式对观众出行方式及其他与此活动相关的特性进行了分析。     

旧路加宽路面纵向开裂原因分析与防治

针对公路改建工程中出现的沥青路面纵向开裂这一常见现象,结合省道改建工程的设计特点与施工要点,重点就加宽路基部位与路面各结构层的施工质量控制方面进行分析和阐述,提出施工控制方法及相应的处理措施。     

Developing an enhanced weight-based topological map-matching algorithm for intelligent transport systems

Map-matching (MM) algorithms integrate positioning data from a Global Positioning System (or a number of other positioning sensors) with a spatial road map with the aim of identifying the road segment on which a user (or a vehicle) is travelling and the location on that segment. Amongst the family of MM algorithms consisting of geometric, topological, probabilistic and advanced, topological MM (tMM) algorithms are relatively simple, easy and quick, enabling them to be implemented in real-time. Therefore, a tMM algorithm is used in many navigation devices manufactured by industry. However, existing tMM algorithms have a number of limitations which affect their performance relative to advanced MM algorithms. This paper demonstrates that it is possible by addressing these issues to significantly improve the performance of a tMM algorithm. This paper describes the development of an enhanced weight-based tMM algorithm in which the weights are determined from real-world field data using an optimisation technique. Two new weights for turn-restriction at junctions and link connectivity are introduced to improve the performance of matching, especially at junctions. A new procedure is developed for the initial map-matching process. Two consistency checks are introduced to minimise mismatches. The enhanced map-matching algorithm was tested using field data from dense urban areas and suburban areas. The algorithm identified 96.8% and 95.93% of the links correctly for positioning data collected in urban areas of central London and Washington, DC, respectively. In case of suburban area, in the west of London, the algorithm succeeded with 96.71% correct link identification with a horizontal accuracy of 9.81 m (2σ). This is superior to most existing topological MM algorithms and has the potential to support the navigation modules of many Intelligent Transport System (ITS) services.     

Bush-based sensitivity analysis for approximating subnetwork diversion

Subnetwork analysis is often used in traffic assignment problems to reduce the size of the network being analyzed, with a corresponding decrease in computation time. This is particularly important in network design, second-best pricing, or other bilevel problems in which many equilibrium runs must be solved as a subproblem to a master optimization program. A fixed trip table based on an equilibrium path flow solution is often used, but this ignores important attraction and diversion effects as drivers (globally) change routes in response to (local) subnetwork changes. This paper presents an approach for replacing a regional network with a smaller one, containing all of the subnetwork, and zones. Artificial arcs are created to represent “all paths” between each origin and subnetwork boundary node, under the assumption that the set of equilibrium routes does not change. The primary contribution of the paper is a procedure for estimating a cost function on these artificial arcs, using derivatives of the equilibrium travel times between the end nodes to create a Taylor series. A bush-based representation allows rapid calculation of these derivatives. Two methods for calculating these derivatives are presented, one based on network transformations and resembling techniques used in the analysis of resistive circuits, and another based on iterated solution of a nested set of linear equations. These methods are applied to two networks, one small and artificial, and the other a regional network representing the Austin, Texas metropolitan area. These demonstrations show substantial improvement in accuracy as compared to using a fixed table, and demonstrate the efficiency of the proposed approach.