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

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

尼铁现代化项目中矩形空心桥台的优化设计

当前常用的时速200 km的铁路矩形空心桥台参考图中的桥台截面尺寸偏厚,安全富余量很大。为节约混凝土圬工量,希望在保证安全的前提下减少桥台截面尺寸。首先提出专门针对铁路矩形空心桥台台身截面计算的荷载图示,然后利用这一新的图示对拉伊铁路项目中使用的常规矩形空心桥台进行有限元分析,经过不断试算提出最优的截面尺寸。在钢筋用量基本不变的情况下,新尺寸桥台较原参考图中桥台的混凝土用量减少10%以上。对于项目所在地尼日利亚国水泥价格高昂的情况而言,桥台尺寸的这一优化将产生较大的经济效益。     

An optimization framework for workplace charging strategies

The workplace charging (WPC) has been recently recognized as the most important secondary charging point next to residential charging for plug-in electric vehicles (PEVs). The current WPC practice is spontaneous and grants every PEV a designated charger, which may not be practical or economic when there are a large number of PEVs present at workplace. This study is the first research undertaken that develops an optimization framework for WPC strategies to satisfy all charging demand while explicitly addressing different eligible levels of charging technology and employees’ demographic distributions. The optimization model is to minimize the lifetime cost of equipment, installations, and operations, and is formulated as an integer program. We demonstrate the applicability of the model using numerical examples based on national average data. The results indicate that the proposed optimization model can reduce the total cost of running a WPC system by up to 70% compared to the current practice. The WPC strategies are sensitive to the time windows and installation costs, and dominated by the PEV population size. The WPC has also been identified as an alternative sustainable transportation program to the public transit subsidy programs for both economic and environmental advantages.     

An optimization model for integrated planning of railway traffic and network maintenance

Railway transportation systems are important for society and have many challenging and important planning problems. Train services as well as maintenance of a railway network need to be scheduled efficiently, but have mostly been treated as two separate planning problems. Since these activities are mutually exclusive they must be coordinated and should ideally be planned together. In this paper we present a mixed integer programming model for solving an integrated railway traffic and network maintenance problem. The aim is to find a long term tactical plan that optimally schedules train free windows sufficient for a given volume of regular maintenance together with the wanted train traffic. A spatial and temporal aggregation is used for controlling the available network capacity. The properties of the proposed model are analyzed and computational experiments on various synthetic problem instances are reported. Model extensions and possible modifications are discussed as well as future research directions.     

Solving the gate assignment problem through the Fuzzy Bee Colony Optimization

In the field of Swarm Intelligence, the Bee Colony Optimization (BCO) has proven to be capable of solving high-level combinatorial problems, like the Flight-Gate Assignment Problem (FGAP), with fast convergence performances. However, given that the FGAP can be often affected by uncertainty or approximation in data, in this paper we develop a new metaheuristic algorithm, based on the Fuzzy Bee Colony Optimization (FBCO), which integrates the concepts of BCO with a Fuzzy Inference System. The proposed method assigns, through the multicriteria analysis, airport gates to scheduled flights based on both passengers’ total walking distance and use of remote gates, to find an optimal flight-to-gate assignment for a given schedule. Comparison of the results with the schedules of real airports has allowed us to show the characteristics of the proposed concepts and, at the same time, it stressed the effectiveness of the proposed method.     

A generic data assimilation framework for vehicle trajectory reconstruction on signalized urban arterials using particle filters

With trajectory data, a complete microscopic and macroscopic picture of traffic flow operations can be obtained. However, trajectory data are difficult to observe over large spatiotemporal regions—particularly in urban contexts—due to practical, technical and financial constraints. The next best thing is to estimate plausible trajectories from whatever data are available. This paper presents a generic data assimilation framework to reconstruct such plausible trajectories on signalized urban arterials using microscopic traffic flow models and data from loops (individual vehicle passages and thus vehicle counts); traffic control data; and (sparse) travel time measurements from whatever source available. The key problem we address is that loops suffer from miss- and over-counts, which result in unbounded errors in vehicle accumulations, rendering trajectory reconstruction highly problematic. Our framework solves this problem in two ways. First, we correct the systematic error in vehicle accumulation by fusing the counts with sparsely available travel times. Second, the proposed framework uses particle filtering and an innovative hierarchical resampling scheme, which effectively integrates over the remaining error distribution, resulting in plausible trajectories. The proposed data assimilation framework is tested and validated using simulated data. Experiments and an extensive sensitivity analysis show that the proposed method is robust to errors both in the model and in the measurements, and provides good estimations for vehicle accumulation and vehicle trajectories with moderate sensor quality. The framework does not impose restrictions on the type of microscopic models used and can be naturally extended to include and estimate additional trajectory attributes such as destination and path, given data are available for assimilation.     

Macroscopic multiple-station short-turning model in case of complete railway blockages

In case of railway disruptions, traffic controllers are responsible for dealing with disrupted traffic and reduce the negative impact for the rest of the network. In case of a complete blockage when no train can use an entire track, a common practice is to short-turn trains. Trains approaching the blockage cannot proceed according to their original plans and have to short-turn at a station close to the disruption on both sides. This paper presents a Mixed Integer Linear Program that computes the optimal station and times for short-turning the affected train services during the three phases of a disruption. The proposed solution approach takes into account the interaction of the traffic between both sides of the blockage before and after the disruption. The model is applied to a busy corridor of the Dutch railway network. The computation time meets the real-time solution requirement. The case study gives insight into the importance of the disruption period in computing the optimal solution. It is concluded that different optimal short-turning solutions may exist depending on the start time of the disruption and the disruption length. For periodic timetables, the optimal short-turning choices repeat due to the periodicity of the timetable. In addition, it is observed that a minor extension of the disruption length may result in less delay propagation at the cost of more cancellations.     

视讯会议系统“一键点名”功能硏究

以铁路视讯会议网工程建设标准和视讯会议系统网管的标准配置文件为基础,通过反复试验和结果分析,确定广铁集团视讯会议操作繁琐的原因,并提出相应的优化方案,提高了广铁集团视讯会议系统会议控制的效率。     

基于改进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.