Second best toll and capacity optimisation in networks: solution algorithm and policy implications

This paper looks at the first and second best jointly optimal toll and road capacity investment problems from both policy and technical oriented perspectives. On the technical side, the paper investigates the applicability of the constraint cutting algorithm for solving the second best problem under elastic demand which is formulated as a bilevel programming problem. The approach is shown to perform well despite several problems encountered by our previous work in Shepherd and Sumalee (Netw. Spat. Econ., 4(2): 161–179, 2004). The paper then applies the algorithm to a small sized network to investigate the policy implications of the first and second best cases. This policy analysis demonstrates that the joint first best structure is to invest in the most direct routes while reducing capacities elsewhere. Whilst unrealistic this acts as a useful benchmark. The results also show that certain second best policies can achieve a high proportion of the first best benefits while in general generating a revenue surplus. We also show that unless costs of capacity are known to be low then second best tolls will be affected and so should be analysed in conjunction with investments in the network.

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.     

Using on-board logging devices to study the longer-term impact of an eco-driving course

In this paper the long-term impact of an eco-driving training course is evaluated by monitoring driving behavior and fuel consumption for several months before and after the course. Cars were equipped with an on-board logging device that records the position and speed of the vehicle using GPS tracking as well as real time as electronic engine data extracted from the controller area network. The data includes mileage, number of revolutions per minute, position of the accelerator pedal, and instantaneous fuel consumption. It was gathered over a period of 10 months for 10 drivers during real-life conditions thus enabling an individual drive style analysis. The average fuel consumption four months after the course fell by 5.8%. Most drivers showed an immediate improvement in fuel consumption that was stable over time, but some tended to fall back into their original driving habits.     

一种基于独立成分分析和径向基神经网络的人脸识别新方法

提出了一种新的基于独立成分分析和径向基神经网络的人脸识别方法。独立成分分析可以从高阶上消除特征数据的相关性,改进了主成分分析方法只能从2阶上消除数据相关性的弱点;最终特征数据的分类由RBF神经网络来实现。在人脸数据库上的实验结果表明该新方法的识别性能较其他方法有了很大提高。     

人的可靠性分析方法及其在军事活动中的应用

回顾了人的可靠性分析发展的历史和现状,重点对现在已存在的人的可靠性分析方法进行了介绍分析,提出并简要介绍了两种在军事活动中适用的人的可靠性评估方法的基本原理：基于粗糙集的人的可靠性评估法和基于贝叶斯的人的可靠性评估法,最后分析了人的可靠性研究中存在的问题。     

基于BP-DS证据理论的航标状态识别模型研究

内河航标标示了可航行水域的边界,是保障内河船舶安全航行的重要前提.面向内河航标不同故障模式,构建一种基于BP-DS证据理论的航标状态识别模型.采用两个BP神经网络分别训练航标基础属性数据与环境因素数据,计算独立的证据值;通过DS证据理论实现航标运行状态识别结果的决策融合.结果表明,基于BP-DS证据理论的航标状态识别模...     

京港澳高速武汉北喇叭形互通改扩建方案探讨

喇叭形立交为我国应用比例最高的基本型立交,受各控制因素制约,其改扩建难度较大。京港澳高速武汉北互通喇叭形立交改扩建充分利用现有工程,通过原址扩建升级立交功能,解决立交堵点。分析介绍了武汉北互通主线、G107扩建方式和远景交通量、用地等控制因素,探讨了根据实际控制因素及功能需求双喇叭立交的改扩建设计思路和具体方案。     

哈大高铁影响下东北城市群交通网络空间结构特征研究

哈大高铁的运行缩短了东北城市群之间的相对距离,优化了东北城市群城市交通网络空间结构.通过建立向心性分形模型以及相关性分形模型,以交通距离代替空间的实际距离来研究城市群之间分形特征,通过城市间高速铁路时间距离和高速公路时间距离进行对比,计算高铁开通前后东北城市群交通空间聚集维数和空间关联维数,分析东北城市群交通网络空间结...     

基于机器视觉的车辆检测与参数识别研究进展

近年来公路交通运输快速增长,交通车辆的快速准确检测与识别对智能交通系统和交通基础设施运维具有重要意义.随着机器视觉和深度学习技术的迅速发展及其在目标检测领域的广泛应用,车辆目标检测和参数识别也取得新的突破.该文从车辆参数的识别方法和应用研究两方面梳理了机器视觉和深度学习在车辆检测与参数识别领域的研究现状、最新研究成果和...     

基于乘客路径选择的多制式轨道交通客流分配

为量化换乘对乘客出行路径选择的影响程度,在单层网络中添加虚拟换乘站,构建无隐性连接的三层多制式轨道交通拓扑网络模型.基于时间、换乘节点衔接性,计算线网间衔接性系数;利用Dijkstra法搜索模型各起讫点间的K短路径,以乘客感受到的线网复杂度及乘客出行计划确定时间,建立乘客对线网的熟悉度函数;根据乘客路径选择影响因素构建...