Balancing a one‐way corridor capacity and safety‐oriented reliability: A stochastic optimization approach for metro train timetabling

In urban rail transit systems of large cities, the headway and following distance of successive trains have been compressed as much as possible to enhance the corridor capacity to satisfy extremely high passenger demand during peak hours. To prevent train collisions and ensure the safety of trains, a safe following distance of trains must be maintained. However, this requirement is subject to a series of complex factors, such as the uncertain train braking performance, train communication delay, and driver reaction time. In this paper, we propose a unified mathematical framework to analyze the safety‐oriented reliability of metro train timetables with different corridor capacities, that is, the train traffic density, and determine the most reliable train timetable for metro lines in an uncertain environment. By employing a space‐time network representation in the formulations, the reliability‐based train timetabling problem is formulated as a nonlinear stochastic programming model, in which we use 0‐1 variables to denote the time‐dependent velocity and position of all involved trains. Several reformulation techniques are developed to obtain an equivalent mixed integer programming model with quadratic constraints (MIQCP) that can be solved to optimality by some commercial solvers. To improve the computational efficiency of the MIQCP model, we develop a dual decomposition solution framework that decomposes the primal problem into several sets of subproblems by dualizing the coupling constraints across different samples. An exact dynamic programming combined with search space reduction strategies is also developed to solve the exact optimal solutions of these subproblems. Two sets of numerical experiments, which involve a relatively small‐scale case and a real‐world instance based on the operation data of the Beijing subway Changping Line are implemented to verify the effectiveness of the proposed approaches.     

采用张量方法的盲干扰抑制及信源恢复技术

针对多输入多输出系统受到有意干扰情况下的盲干扰抑制和信源恢复问题,提出一种双阵列天线接收机结构,通过差分处理,在不考虑独立性的条件下实现盲干扰抑制。消除干扰后的数据有明显的张量切片特征,将其堆积成三阶张量,并通过基于张量分解的方法不经信道估计直接恢复源信号,相较于传统基于信道估计的信源恢复方法大大降低信道估计误差的影响,提高恢复精度。仿真结果表明,所提方法较传统基于训练序列进行信道估计的方法能以更小的训练开销达到更优的信号恢复性能。     

Technical note: Some structural results on acyclic supply chains

We consider acyclic supply chains under the full backorder assumption and reveal several simple yet unique properties. Most interestingly, we identify conditions for the best dedicated stocking policy to outperform the best shared stocking policy, and for an acyclic supply chain to be decomposable into a simpler network (e.g., tree). We specify ways to decompose them. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

某单兵无人车载系统电子稳像多分辨率塔式算法

在原有电子稳像算法基础上引入塔式分解,探索满足某单兵无人车载系统中稳像需求的算法,提出电子稳像多分辨率塔式算法.重点介绍了高斯塔和小波塔的构建方法,给出了塔式分解实验结果,并与未进行塔式分解稳像过程进行比较,从而得出此算法大大节省运算时间,提高了系统稳像的实时性,在特定应用环境中具有重要现实意义.     

膨胀型阻燃聚丙烯的制备及热分解动力学研究

以五氧化二磷／季戊四醇／三聚氰胺为原料合成了聚合型膨胀阻燃剂,并制备了膨胀型阻燃聚丙烯。比较和讨论了热分解动力学方法,通过测定体积流速评价了流变性,用热重分析方法研究了膨胀型阻燃聚丙烯的热分解特点。     

信号稀疏分解理论在轴承故障检测中的应用

将信号稀疏分解理论引入到轴承故障检测问题中,提出新的轴承故障检测方法。通过字典学习的方式可有效实现轴承正常状态振动信号稀疏表示的超完备字典。利用该字典只适用于轴承正常状态信号稀疏分解的特点,将待分析信号在该字典上展开,通过比较信号稀疏表示误差与所设定阈值的关系来判断轴承对应的状态,从而实现轴承的故障检测。实验结果表明:当误差阈值设置合理时,该方法可有效地判断出轴承是否发生故障。     

Optimal empty vehicle redistribution for hub‐and‐spoke transportation systems

This article considers the empty vehicle redistribution problem in a hub‐and‐spoke transportation system, with random demands and stochastic transportation times. An event‐driven model is formulated, which yields the implicit optimal control policy. Based on the analytical results for two‐depot systems, a dynamic decomposition procedure is presented which produces a near‐optimal policy with linear computational complexity in terms of the number of spokes. The resulting policy has the same asymptotic behavior as that of the optimal policy. It is found that the threshold‐type control policy is not usually optimal in such systems. The results are illustrated through small‐scale numerical examples. Through simulation the robustness of the dynamic decomposition policy is tested using a variety of scenarios: more spokes, more vehicles, different combinations of distribution types for the empty vehicle travel times and loaded vehicle arrivals. This shows that the dynamic decomposition policy is significantly better than a heuristics policy in all scenarios and appears to be robust to the assumptions of the distribution types. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

关于右连左极函数的Gronwall不等式

给出了传统意义下的Gronwall不等式的推广形式,并且给出了在右连左极函数积分下的一种Gronwall不等式。