公路桥梁高承台桩基沉降分析研究

桩基的沉降计算是桩基工程设计不可忽视的关键问题之一。为探讨高承台桩基沉降特性，基于荷载传递法提出一种高承台桩基沉降计算方法，并采用多组不同参数对某高承台群桩的沉降特性进行了比较计算和深入分析，得到了多个影响因素下群桩沉降的变化规律。     

高墩大跨径弯连续刚构桥梁空间非线性稳定分析

在高墩大跨弯连续刚构桥梁的设计与施工中,结构稳定性非常重要。本文分别考虑结构的几何非线性和材料非线性力学特征,对高墩大跨弯连续刚构桥梁的结构稳定性进行详细的数值分析,并与线弹性的计算结果进行对比。结果表明:弯连续刚构桥梁的稳定问题已经转化为考虑结构材料屈服强度的极限承载力问题,同时几何非线性对稳定的影响亦不能忽略。     

V形刚构桥施工中倒三角区域支架的拆除时机分析

采用桥梁博士软件模拟一座典型的V形墩连续刚构桥的施工过程,为找出支架拆除对传力途径的影响,分别单独计算结构自重、预应力以及收缩徐变内力,然后对单因素分析的结果进行组合。分析结果表明倒三角区域支架的拆除时机对桥梁在施工阶段及成桥后的内力均有显著影响,可达50%以上。建议优先采用早拆支架方案,以使结构受力明确,且对V形墩区域受力有利。     

城市高架桥之高独柱墩横向位移探讨

结合城市高架高独柱墩顶部发生横向位移这一现象,对高独柱墩顶部横向荷载产生的原因进行初步分析,并应用三维非线性屈曲分析,阐述组合荷载所引起的大变形及混凝土徐变效应与墩顶横向位移之间的关系,提出了设计、施工类似结构时应注意的事项。     

桥墩及桩基形式对墩底平转施工转盘设计的影响

以新建福厦(福州—厦门)高速铁路17500 t转体刚构为背景,采用实体有限元方法分析了不同桥墩类型及桩基布置对墩底平转转体中转盘受力的影响,并对桥墩及桩基进行了优化。结果表明:实体墩对上转盘受力最有利,其次是空心墩,最不利的是双薄壁墩;增加墩底实体段能够有效降低空心墩、双薄壁墩上转盘的主拉应力;随着墩底实体段高度的增加,主拉应力降低的幅度逐渐变小;球铰正下方有桩基时对下转盘底部受力更加有利;距离球铰中心越远,桩基受力越小,适当增加中桩桩径,可使各桩基应力状态更加均衡。     

放宽条件定点集结模式下编组站车辆 集结排队系统分析

集结模式决定了货车集结过程的结束条件，定点集结是一种高效率的集结方式，有利于提高运输质量.针对放宽条件定点集结模式下编组站车辆集结过程，建立离散时间批到达批服务排队模型，利用嵌入式马尔可夫链方法求得离去时刻瞬时系统集结车辆队长分布，并求得任意时刻车辆集结队长分布，在此基础上分别分析了最小编成辆数，车组大小分布，车流到达强度，服务时间间隔分布对车辆平均集结队长，集结延误时间，效率，一昼夜发送车流量等系统指标的影响.分析结果表明，各因素对车辆集结排队系统影响明显.因此，利用本文提出的模型能为编组站的精细化管理和车流组织优化提供决策参考.     

An optimal data-splitting algorithm for aircraft scheduling on a single runway to maximize throughput

In this research, we present a data-splitting algorithm to optimally solve the aircraft sequencing problem (ASP) on a single runway under both segregated and mixed-mode of operation. This problem is formulated as a 0–1 mixed-integer program (MIP), taking into account several realistic constraints, including safety separation standards, wide time-windows, and constrained position shifting, with the objective of maximizing the total throughput. Varied scenarios of large scale realistic instances of this problem, which is NP-hard in general, are computationally difficult to solve with the direct use of commercial solver as well as existing state-of-the-art dynamic programming method. The design of the algorithm is based on a recently introduced data-splitting algorithm which uses the divide-and-conquer paradigm, wherein the given set of flights is divided into several disjoint subsets, each of which is optimized using 0–1 MIP while ensuring the optimality of the entire set. Computational results show that the difficult instances can be solved in real-time and the solution is efficient in comparison to the commercial solver and dynamic programming, using both sequential, as well as parallel, implementation of this pleasingly parallel algorithm.     

防止电力机车进入无电单元(区)的安全预警方法

针对目前计划内接触网停电时电力机车进入无电单元(区)的问题,提出了基于动态停电作业区域数据对比库语音、屏幕鼠标点击坐标和高清成像分析进行“三元素二阶段”处理对比方法,以减少人员操作失误和损失。机车/车次信息及对应机车属性先由操作人员办理接发列预告(办理闭塞)的语音识别获取,再通过TDCS/CTC终端机非上位机获取并核对机车/车次信息及对应机车属性信息,第1阶段获取排列列车进路及调车进路口呼内容语音识别所关联的设备名称与无电单元(区)信息进行对比,此步可以预防错误操作;第2阶段可获取屏幕鼠标点击坐标对应的设备名称、并通过高清成像分析计算机联锁界面上已排列好的进路光带所包含的设备名称,进行对比后,报警提示改正错误操作即取消进路操作。通过以上方法能有效防止电力机车进入无电单元(区),可为铁路现场相关业务领域提供参考。     

船用电器柜抗冲击设计研究

为增强船内部电器柜的抗冲击性能,采用有限元法对船内不同安装型式的电器柜结构进行了模态和抗冲击性能仿真分析,通过对比分析得出了使用撑杆加固型式安装的电器柜能显著提高船内电器柜的抗冲击性能的结论,并确定了电器柜抗冲击优化设计方案。     

Generalized Maximum Benefit Multiple Chinese Postman Problem

This research is focused on a generalization on the Max Benefit Chinese Postman Problem and the multiple vehicle variant of the Chinese Postman Problem. We call this generalization, the Generalized Maximum Benefit k-Chinese Postman Problem (GB k-CPP). We present a novel Mixed Integer Programming (MIP) formulation for the GB k-CPP. Four different cases of the model are discussed. The first case, performs arc-routing with profits and assumes that the origin and destination for each vehicle is the same for each cycle and is given by the user. The next case relaxes the assumption that the origin and destination for each vehicle should be the same and allows the users to select possible origins/destinations for vehicles. Case three gets the origin for each vehicle as input and produces a solution based on finding the best destination for each vehicle. The last case, that is very general, allows the optimization model to select possibly different locations for vehicle origin and destination, during each cycle. The different cases are applied to a security patrolling case conducted on the network of University of Maryland at College Park campus and the results are compared.