A globally convergent algorithm for transportation continuous network design problem

The continuous network design problem (CNDP) is characterized by a bilevel programming model, in which the upper level problem is generally to minimize the total system cost under limited expenditure, while at the lower level the network users make choices with regard to route conditions following the user equilibrium principle. In this paper, the bilevel programming model for CNDP is transformed into a single level convex programming problem by virtue of an optimal-value function tool and the relationship between System Optimum (SO) and User Equilibrium (UE). By exploring the inherent nature of the CNDP, the optimal-value function for the lower level user equilibrium problem is proved to be continuously differentiable and its derivative in link capacity enhancement can be obtained efficiently by implementing user equilibrium assignment subroutine. However, the reaction (or response) function between the upper and lower level problem is implicit and its gradient is difficult to obtain. Although, here we approximately express the gradient with the difference concept at each iteration, based on the method of successive averages (MSA), we propose a globally convergent algorithm to solve the single level convex programming problem. Comparing with widely used heuristic algorithms, such as sensitivity analysis based (SAB) method, the proposed algorithm needs not strong hypothesis conditions and complex computation for the inverse matrix. Finally, a numerical example is presented to compare the proposed method with some existing algorithms.     

A novel deep learning scheme for multi-condition remaining useful life prediction of rolling element bearings

The remaining useful life (RUL) prediction of a rolling element bearing is important for more reasonable maintenance of machinery and equipment. Generally, the information of a failure can hardly be acquired in advance while running and the degradation process varies in terms of different faults. Thus, fault identification is indispensable for a multi-condition RUL prediction, where, however, the fault identification and RUL prediction are separated in most studies. A new hybrid scheme is proposed in this paper for the multi-condition RUL prediction of rolling element bearings. The proposed scheme contains both classification and regression, where the 2D-DCNN based classifier and predictors are built concerning typical fault conditions of a bearing. For the online prediction, the raw signals are spanned in the time-frequency domain and then transferred into images as the input of the scheme. The classifier is used to monitor the vibration of rolling bearings for online fault recognition and excite the corresponding predictor for RUL prediction once a fault is detected. The output from the predictor is amended by the proposed adaptive delay correction method as the final prediction results. A demonstration is performed based on the XJTU-SY datasets and the results are compared with those from the state-of-the-art methods, which proves the superiority of the proposed scheme in improving the accuracy and linearity of RUL prediction. The time cost of the proposed online prediction scheme is also investigated and the results indicate high time effectiveness.     

基于EFPN的模糊离散事件系统可诊断性分析

针对模糊有限自动机及模糊Petri网在模糊离散事件系统(Fuzzy Discrete Event System,FDES)行为建模中的不足,提出一种扩展模糊Petri网(Extended Fuzzy Petri Net,EFPN),并基于EFPN构造了FDES行为模型及系统故障诊断器。EFPN以一种新的事件模型为基础对FDES的系统行为进行建模,并根据事件触发矩阵计算下一系统状态中各分量的可能性分布。与模糊有限自动机及模糊Petri网的对比分析表明,在描述FDES模糊事件时,对于同步距离为0的一组事件所造成的影响,EFPN的表达能力强于经典模糊Petri网;在对含有多个状态分量的FDES建模时,EFPN模型的规模远小于模糊有限自动机。在基于EFPN构造的系统行为模型中,运用可达状态标识图分析系统状态集,可有效地构造FDES的故障诊断器,并可据此进行系统可诊断性分析。     

轴承试验机监控系统设计

实现轴承试验机监控系统的设计,使用S7-200 PLC中的PID控制功能实现轴承环境温度的闭环控制,并采用WebAccess实现了轴承试验机监控界面的组态,使系统的监视和操作变得直观简便.采用S7-200PC Access作为OPC服务器解决S7-200PLC和WebAccess之间的通讯问题.该控制系统合理利用了PLC的硬件资源和软件资源,提高了轴承试验机运行的安全性和可靠性,有效地提高了轴承寿命检测的自动化程度.     

Rheological behaviors of fresh cement pastes with polycarboxylate superplasticizer

The rheologicalbehaviors of fresh cement paste with polycarboxylate superplasticizer were systematically investigated.Influentialfactors including superplasticizer to cement ratio(Sp/C),water to cement ratio(w/c),temperature,and time were discussed.Fresh cement pastes with Sp/Cs in the range of 0 to 2.0% and varied W/Cs from 0.25 to 0.5 were prepared and tested at 0,20 and 40 °C,respectively.Flowability and rheologicaltests on cement pastes were conducted to characterize the development of the rheologicalbehavior of fresh cement pastes over time.The exprimentalresults indicate that the initialflowability and flowability retention over shelf time increase with the growth in superplasticizer dosage due to the plasticizing effect and retardation effect of superplasticizer.Higher temperature usually leads to a sharper drop in initialflowability and flowability retention.However,for the cement paste with high Sp/C or w/c,the flowability is slightly affected by temperature.Yield stress and plastic viscosity show similar variation trends to the flowability under the abovementioned influentialfactors at low Sp/C.In the case of high Sp/C,yield stress and plastic viscosity start to decline over shelf time and the decreasing rate descends at elevated temperature.Moreover,two equations to roughly predict yield stress and plastic viscosity of the fresh cement pastes incorporating Sp/C,w/c,temperature and time are developed on the basis of the existing models,in which experimentalconstants can be extracted from a database created by the rheologicaltest results.     

An analysis method for correlation between catenary irregularities and pantograph-catenary contact force

Pantograph-catenary contact force provides the main basis for evaluation of current quality collection; however, the pantograph-catenary contact force is largely affected by the catenary irregularities. To analyze the correlated relationship between catenary irregularities and pantograph-catenary contact force, a method based on nonlinear auto-regressive with exogenous input （NARX） neural networks was developed. First, to collect the test data of catenary irregularities and contact force, the pantograph/catenary dynamics model was established and dynamic simulation was conducted using MATLAB/Simulink. Second, catenary irregularities were used as the input to NARX neural network and the contact force was determined as output of the NARX neural network, in which the neural network was trained by an improved training mechanism based on the regularization algorithm. The simulation results show that the testing error and correlation coefficient are 0.1100 and 0.8029, respectively, and the prediction accuracy is satisfactory. And the comparisons with other algorithms indicate the validity and superiority of the proposed approach.     

基于场景的车载设备测试用例自动生成方法研究

列控车载子系统是确保列车的安全运行的关键设备,对车载子系统进行测试是保证功能实现与系统规范一致性的重要手段。针对传统手工测试用例生成的效率低、耗时长、工作量繁杂、可重用性低等缺陷,提出一种基于场景的车载系统测试用例自动生成方法,依据CTCS-3级列控系统技术规范构造车载子系统场景树模型,由实时系统测试用例自动生成工具Co Ver对列车运行模式转换自动机网模型生成基于场景的测试用例,并由运行模式最小重复度选择算法生成全模式覆盖的测试序列。结论证明,基于场景自动生成的测试用例能够覆盖全部车载模式,并提高了模式转换测试序列生成效率。     

A Train Dispatching Model Under a Stochastic Environment: Stable Train Routing Constraints and Reformulation

After major capacity breakdown(s) on a railway network, train dispatchers need to generate appropriate dispatching plans to recover the impacted train schedule from perturbations and minimize the expected total train delay time under stochastic scenarios. In this paper, we propose a cumulative flow variables-based integer programming model for dispatching trains under a stochastic environment on a general railway network. Stable Train Routing (STR) constraints are introduced to ensure that trains traverse on the same route across different capacity breakdown scenarios, which are further reformulated to equivalent linear inequality constraints. Track occupancy and safety headways are modelled as side constraints which are dualized through a proposed Lagrangian relaxation solution framework. The original complex train dispatching problem is then decomposed to a set of single-train and single-scenario optimization subproblems. For each subproblem, a standard label correcting algorithm is embedded for finding the time dependent least cost path on a space-time network. The resulting dual solutions can be transformed to feasible solutions through priority rules. Numerical experiments are conducted to demonstrate the efficiency and effectiveness of the proposed solution approach.