对HX_D3型电力机车蓄电池故障的分析与对策

对一起HXD3型电力机车蓄电池故障情况和机车低温预热电路进行分析,提出维修对策。     

CTCS-3级列控仿真系统ATP接口平台实时性研究与实现

详细分析在CTCS-3级列控仿真系统中ATP实物设备接入仿真平台面临的实时性问题,并对ATP接口平台的实时性进行详细研究与分析,针对ATP接口平台实时性设计中的关键问题提出解决方案。     

基于GIS的城市轨道交通线网客流监测预警

在分析城轨客流特性的基础上,提出线网实时客流的监测算法;利用地理信息系统（GIS）技术,动态展示城市轨道交通线网实时客流分布态势;设定预警研判机理,对超过限定预警值的车站、区间的客流进行监测预警;借助GIS动态定位特性,辅助实现公交接驳的紧急疏散,以满足线网运营的可视化、高效的现代化管理。     

应用交通仿真软件PARAMICS验证交通分配模型

为了考察交通分配模型能够在多大程度上反映现实的交通状况，需要对交通分配模型进行验证，本文阐述了利用微观交通仿软件PARAMICS对交通分配模型进行验证的研究思路。通过建模工具Modeller提供的图形界面，研究者不但能够非常直观地观察交通分配模型的效果，而且可以利用其分析工具Analyser对结果全面分析。因此RARAMICS是一个验证交通分配模型性能优良的平台。     

Development and calibration of a long-distance passenger traffic assignment model

This paper studies the assignment of long-distance passenger traffic on a highway corridor network. First, we propose a traditional model for the long-distance traffic assignment considering interactions with local commuter traffic. It addresses the effect of local networks on highway corridors. An iterative algorithm is developed to solve for the exact solution. Then, to address the potential computational issues that arise therein, a decomposition method is proposed by introducing a new concept of corridor elasticity. An assignment procedure for long-distance passenger traffic is developed accordingly. Numerical tests show that the proposed decomposition method makes significant improvements in computational performance at a small loss of optimality. This decomposition method well approximates the exact assignment from the traditional formulation, especially when the highway corridors are near-saturation. The proposed decomposition method appears practical for application.     

Tradable network permits: A new scheme for the most efficient use of network capacity

Akamatsu et al. (2006) proposed a new transportation demand management scheme called “tradable bottleneck permits” (TBP), and proved its efficiency properties for a single bottleneck model. This paper explores the properties of a TBP system for general networks. An equilibrium model is first constructed to describe the states under the TBP system with a single OD pair. It is proved that equilibrium resource allocation is efficient in the sense that the total transportation cost in a network is minimized. It is also shown that the “self-financing principle” holds for the TBP system. Furthermore, theoretical relationships between TBP and congestion pricing (CP) are discussed. It is demonstrated that TBP has definite advantages over CP when demand information is not perfect, whereas both TBP and CP are equivalent for the perfect information case. Finally, it is shown that the efficiency result also holds for more general demand conditions.     

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.     

Integrated airline planning: Robust update of scheduling and fleet balancing under demand uncertainty

The airline schedule planning problem is defined as the sequence of decisions that need to be made to obtain a fully operational flight schedule. Historically, the airline scheduling problem has been sequentially solved. However, there have already been many attempts in order to obtain airline schedules in an integrated way. But due to tractability issues it is nowadays impossible to determine a fully operative and optimal schedule with an integrated model which accounts for all the key airline related aspects such as competitive effects, stochastic demand figures and uncertain operating conditions. Airlines usually develop base schedules, which are obtained much time in advance to the day of operations and not accounting for all the related uncertainty. This paper proposes a mathematical model in order to update base schedules in terms of timetable and fleet assignments while considering stochastic demand figures and uncertain operating conditions, and where robust itineraries are introduced in order to ameliorate miss-connected passengers. The proposed model leads to a large-scale problem which is difficult to be solved. Therefore, a novel improved and accelerated Benders decomposition approach is proposed. The analytical work is supported with case studies involving the Spanish legacy airline, IBERIA. The presented approach shows that the number of miss-connected passengers may be reduced when robust planning is applied.     

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.     

三角闸门门缝输水运行工况研究

门缝输水是三角闸门的一种重要特性。基于三角闸门门缝输水,低水头船闸可以不设置阀门以降低工程建设成本,但具体适用工况尚难把握。依托未设置阀门的大柳巷船闸,采用理论计算与现场实测相结合的方法,分析了门缝输水时水力及启闭力。研究表明:口门越大三角闸门能承受门缝输水的水头越小;目前门缝输水有关计算公式尚需结合三角闸门的结构特点确定流量系数;三角闸门启闭力除按规范公式计算外还应考虑门体缝隙流和惯性阻力矩的影响。