小波变换在管道泄漏点定位中的应用

当管道发生泄漏时，泄漏诱发的负压波传播到管道上下游监测点时会使该点压力信号幅值产生瞬态下降，利用小波变换模极大值检测压力信号的突变点，从而计算出管道泄漏诱发的负压波传播到上下游监测点的时间差。在MATLAB6．1软件环境下，以某次实验数据为例进行管道泄漏点定位研究。在计算过程中小波基函数选取为Haar小波，尺度水平为6，计算结果表明该方法可以计算出管道泄漏点处诱发的负压波传播到管道上游监测点的时间差，从而为准确定位泄漏点提供了基础。     

Travel time estimation from sparse floating car data with consistent path inference: A fixed point approach

Estimation of urban network link travel times from sparse floating car data (FCD) usually needs pre-processing, mainly map-matching and path inference for finding the most likely vehicle paths that are consistent with reported locations. Path inference requires a priori assumptions about link travel times; using unrealistic initial link travel times can bias the travel time estimation and subsequent identification of shortest paths. Thus, the combination of path inference and travel time estimation is a joint problem. This paper investigates the sensitivity of estimated travel times, and proposes a fixed point formulation of the simultaneous path inference and travel time estimation problem. The methodology is applied in a case study to estimate travel times from taxi FCD in Stockholm, Sweden. The results show that standard fixed point iterations converge quickly to a solution where input and output travel times are consistent. The solution is robust under different initial travel times assumptions and data sizes. Validation against actual path travel time measurements from the Google API and an instrumented vehicle deployed for this purpose shows that the fixed point algorithm improves shortest path finding. The results highlight the importance of the joint solution of the path inference and travel time estimation problem, in particular for accurate path finding and route optimization.     

基于改进BP-GA方法的FPSO舷侧结构耐撞性能优化设计

基于遗传算法和ABAQUS参数化有限元仿真技术,对传统的BP-GA优化方法进行改进,并采用改进的BP-GA方法对浮式生产储油卸油装置(FPSO)舷侧结构的耐撞性能进行优化,以验证其可行性和准确性。结果表明,与传统的BP神经网络相比,经遗传算法优化的BP神经网络具有更高的预测精度和更强的泛化能力;改进的BP-GA优化方法可在结构减重的基础上进一步提高结构的耐撞性能,能较好地适用于复杂的FPSO舷侧结构耐撞性优化设计。采用的优化方法具有通用性,可为抗爆性能的优化设计提供参考。     

Highway voting system: Embracing a possible paradigm shift in traffic data acquisition

The integration of internet and mobile phones has opened the door to a new wave of utilizing private vehicles as probes not only for performance evaluation but for traffic control as well, gradually replacing the role of traffic surveillance systems as the dominant source of traffic data. To prepare for such a paradigm shift, one needs to overcome some key institutional barriers, in particular, the privacy issue. A Highway Voting System (HVS) is proposed to address this issue in which drivers provide link- and/or path-based vehicle data to the traffic management system in the form of “votes” in order to receive favorable service from traffic control. The proposed HVS offers a platform that links data from individual vehicles directly with traffic control. In the system, traffic control responds to voting vehicles in a way similar to the current system responding to prioritized vehicles and providing the requested services accordingly. We show in the paper that the proposed “voting” system can effectively resolve the privacy issue which often hampers traffic engineers from getting detailed data from drivers. Strategies to entice drivers into “voting” so as to increase the market penetration level under all traffic conditions are discussed. Though the focus of the paper is on addressing the institutional issues associated with data acquisition from individual vehicles, other research topics associated with the proposed system are identified. Two examples are given to demonstrate the impact of the proposed system on algorithm development and traffic control.     

Does crowding affect the path choice of metro passengers?

This paper investigates crowding effect on the path choice of metro passengers. We show people reroute not only to avoid the delay from crowding but also to evade crowding itself. More specifically, a logit model fits best when it uses the transit delay from crowding as well as the passenger load of a connection in addition to the conventional explanatory variables. Also, we demonstrate that crowding decreases the overall welfare of metro passengers. The model is tested on the real path choice data acquired by the recent algorithm by Hong et al. (2015) known to detect the real path choice from Smart Card data in more than 90% of the cases.     

基于前轮转角约束自适应模型预测控制的路径跟踪研究

针对在车辆行驶中较小的前轮转角无法充分利用路面附着能力,较大的前轮转角使得车辆的行驶稳定性差的问题,文章提出了一种前轮转角约束自适应模型预测方法。首先建立车辆的动力学模型,然后通过计算得到轮胎纵向力,最终得到车辆的前轮转角。将车辆的状态量与前轮转角自适应约束条件输入给模型预测控制器,输出车辆的前轮转角,实现对参考路径的跟踪。在Carsim和MATLAB平台上联合仿真,仿真结果表明前轮转角约束自适应模型预测控制的车辆相比固定转角约束的车辆具有较好的跟踪能力和稳定性。     

典型交叉口非机动车二次过街设计方法

以宁波市典型灯控交叉口为例，介绍了非机动车二次过街的设计方法，并详细分析了非机动车二次过街方式的设置条件、左转待转区的设置及二次过街的交通组织方式。     

Cost scaling based successive approximation algorithm for the traffic assignment problem

This paper presents a cost scaling based successive approximation algorithm, called ε-BA (ε-optimal bush algorithm), to solve the user equilibrium traffic assignment problem by successively refining ε-optimal flows. As ε reduces to zero, the user equilibrium solution is reached. The proposed method is a variant of bush-based algorithms, and also a variant of the min-mean cycle algorithm to solve the min-cost flow by successive approximation. In ε-BA, the restricted master problem, implying traffic equilibration restricted on a bush, is solved to ε-optimality by cost scaling before bush reconstruction. We show that ε-BA can reduce the number of flow operations substantially in contrast to Dial’s Algorithm B, as the former operates flows on a set of deliberately selected cycles whose mean values are sufficiently small. Further, the bushes can be constructed effectively even if the restricted master problem is not solved to a high level of convergence, by leveraging the ε-optimality condition. As a result, the algorithm can solve a highly precise solution with faster convergence on large-scale networks compared to our implementation of Dial’s Algorithm B.     

基于模糊PID控制的ABS仿真研究

以车轮滑移率为控制对象,分析了模糊控制的理论基础,将传统的模糊控制与经典的PID控制相结合,提出了白适应模糊PID控制算法,并进行了仿真研究.     

Large-scale evacuation network optimization: a bi-level control method with uncertain arterial demand

To improve the efficiency of large-scale evacuations, a network aggregation method and a bi-level optimization control method are proposed in this paper. The network aggregation method indicates the uncertain evacuation demand on the arterial sub-network and balances accuracy and efficiency by refining local road sub-networks. The bi-level optimization control method is developed to reconfigure the aggregated network from both supply and demand sides with contraflow and conflict elimination. The main purpose of this control method is to make the arterial sub-network to be served without congestion and interruption. Then, a corresponding bi-objective network flow model is presented in a static manner for an oversaturated network, and a Genetic Algorithm-based solution method is used to solve the evacuation problem. The numerical results from optimizing a city-scale evacuation network for a super typhoon justify the validity and usefulness of the network aggregation and optimization control methods.