山区公路水毁修复工程难题处理实例

山区公路水毁，其修复工程并不是按原样修复就能解决问题，提出了7种特殊的修复方法，这些方法都收到了较好的效果。     

大管径热网管道中固定管接头焊接质量控制

热网管道线路长、管径大、压力大，这对热网管道的焊接工艺提出了较高的要求。本文对大管径热网管道中固定管接头的焊接工艺进行了讨论。为避免气孔、夹渣、未焊透、咬边、焊瘤、熔合不良、薄厚不均等缺陷，从管接头的焊前准备、管接头的焊接工艺、管道的焊接质量检验几方面提出了控制焊接质量的方法。     

大型沟埋式管道侧向土压力的研究

本文利用现场实测资料，采用回归分析方法，在考虑了填土高度、密度，管道和槽壁间的胸腔大小，侧压力计算点距管底的高度，填土内部的摩擦力等影响管道侧向土压力的因素后，对沟埋式管道侧向土压力的计算提出了新的公式。     

行标《公路地下通信管道高密度聚乙烯硅芯塑料管》的研究与编制

一、任务来源 交通行业标准<公路地下通信管道高密度聚乙烯硅芯塑料管>是交通部交科发(2001)290号文"关于印发2001年交通标准化计划的通知"下达的标准项目,由交通部公路科学研究所负责编制.在通知中原标准名称为<高速公路地下通信管道用高密度聚乙烯硅芯塑料管>,报批名称根据专家审查会审查意见改为<公路地下通信管道高密度聚乙烯硅芯塑料管>.     

Delay Restoration of Single-Track Railway Rescheduling

On the basis of analysis of the principle of delay restoration in a disturbed schedule, a heuristic algorithm for rescheduling trains is developed by restoring the total delay of the disturbed schedule. A discrete event topologic model is derived from the original undisturbed train diagram and a back propagation analysis method is used to label the maximum buffer time of each point in the model. In order to analyze the principle of delay restoration, the concept of critical delay is developed from the labeled maximum buffer time. The critical delay is the critical point of successful delay restoration. All the disturbed trains are classified into the strong-delayed trains and the weak-delayed trains by the criterion of the critical delay. Only the latter, in which actual delay is less than its critical delay, can be adjusted to a normal running state during time horizon considered. The heuristic algorithm is used to restore all the disturbed trains according to their critical details. The cores of the algorithm are the iterative repair technique and two repair methods for the two kinds of trains. The algorithm searches iteratively the space of possible conflicts caused by disturbed trains using an earfiest-delay-first heuristics and always attempts to repair the earliest constraint violation. The algorithm adjusts the weak-delayed trains directly back to the normal running state using the buffer time of the original train diagram. For the strong-delayed trains,the algorithm uses an utility function with some weighted attributes to determine the dynamic priority of the trains, and resolves the conflict according to the calculated dynamic priority. In the end, the experimental results show that the algorithm produces ＂good enough＂ schedules effectively and efficiently in disturbed situations.