橡胶隔振器冲击刚度的试验研究

在冲击环境下,隔振器的刚度特性会产生显著的变化.由于该过程相当复杂,要从理论上进行分析是相当困难的.该文研究了利用轻气炮技术和力锤敲击测试隔振器冲击刚度的方法,并分别对不同规格的橡胶隔振器进行了试验研究,对这2种方法特点的比较表明,轻气炮试验适用于工程中大型橡胶隔振器冲击刚度的测试研究,而锤击法试验适用于同系列不同型号的小型橡胶隔振器冲击刚度的测试研究,因而二者互为补充,在工程实践中具有一定的应用价值.     

橡胶挠性接管特性研究

对橡胶挠性接管的静、动态特性进行了研究 .给出了橡胶挠性接管耐压强度的理论计算公式 ,建立了粘弹性管壁管道动态特性数学模型 ,并对方程组进行了求解     

Mathematical formulation and heuristic algorithm for the block relocation and loading problem

This study considers the block relocation and loading problem in container terminals. The optimal loading sequence and relocation location are simultaneously decided on the basis of the desired ship‐bay and initial yard space configuration. An integer linear programming model is developed to minimize the number of relocations in the yard space on the basis of no shifts in the ship bay. The accuracy of the model is tested on small‐scale scenarios by using CPLEX. Considering the problem size in the real world, we present a rule‐based heuristic method that is combined with a mathematical model for the removal, loading, and relocation operations. The influence of rules on algorithm performance is also analyzed, and the heuristic algorithm is compared with different types of algorithms in the literature. The extensive numerical experiments show the efficiency of the proposed heuristic algorithm.     

高速破片撞击充液容器形成液压水锤的试验研究

为研究高速破片撞击充液容器形成的液压水锤效应,设计一套试验装置和测试方法,试验破片撞击充液容器产生空腔的变化过程、液体中不同位置处的压力变化以及前后面板的变形情况。试验发现：破片撞击容器后面板时会出现一圈空化气泡,气泡在后面板内表面从撞击点位置迅速沿径向扩展;液压水锤初始冲击阶段,距离撞击点较近区域在初始冲击波压力脉冲过后会出现一个较大负压,而距离撞击点较远区域不受负压影响;破片撞击速度对容器前面板最大变形影响较小,变形范围随着撞击速度的增大沿撞击点向四周扩展。后面板的最大变形及变形范围都随着破片撞击速度的增大而变大。     

装甲装备橡胶器材防老化涂料的制备

以有机硅改性丙烯酸乳液为基料,制备了具有一定弹性和抗老化性的装甲装备橡胶器材防护涂料,并对涂料的耐湿热性、耐盐雾性进行了测试。结果表明:纳米硅丙涂料是一种综合性能优异的装甲装备橡胶器材防老化涂料,能够有效地延长橡胶器材的库存寿命。     

复波速在挠性胶管动态特性研究中的应用

针对挠性胶管管壁的粘弹性,提出了复波速的概念,并将其应用于挠性胶管现有的动态特性理论中,分别建立了挠性胶管瞬态响应和频率响应的模型,说明了挠性胶管衰减管中液体介质压力脉动和流量脉动的原理并解释了现有的现象,得出了一些新的结论.此外,还指出了该方法目前存在的不足及今后的研究方向.     

防毒面具罩体材料发展现状

简要介绍了防毒面具罩体材料的发展历史及国内外具有代表性的先进面具罩体材料的使用情况,并指出了罩体材料通常的性能要求和我军现有面具罩体材料存在的主要问题。通过对几种常用罩体材料的性能比较,介绍了综合性能更好的丁基类橡胶和硅橡胶材料．最后,就罩体方面应努力的方向进行了简要总结。     

组合金属橡胶隔振系统参数识别

对2块金属橡胶元件组合制备的隔振器进行静动态试验,指出组合隔振器的优点;利用双折线模型描述该非线性迟滞系统的记忆恢复力,并建立该系统的本构关系及参数识别方程;采用给记忆恢复力zs赋初值,再将用最小二乘法识别得到的参数作为初值构造误差函数,利用误差函数把一次刚度和记忆恢复力的参数识别问题转化为函数优化问题的方法,用小生境遗传算法进行优化识别;对该方法进行模拟仿真识别,并对某金属橡胶隔振器进行试验研究.仿真和试验均表明该方法根据系统输入-输出数据来直接识别系统的物理参数,简单可行且精度较高.     

The quay crane scheduling problem with time windows

The quay crane scheduling problem consists of scheduling tasks for loading and unloading containers on cranes that are assigned to a vessel for its service. This article introduces a new approach for quay crane scheduling, where the availability of cranes at a vessel is restricted to certain time windows. The problem is of practical relevance, because container terminal operators frequently redeploy cranes among vessels to speed up the service of high‐priority vessels while serving low‐priority vessels casually. This article provides a mathematical formulation of the problem and a tree‐search‐based heuristic solution method. A computational investigation on a large set of test instances is used to evaluate the performance of the heuristic and to identify the impact of differently structured crane time windows on the achievable vessel handling time. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

A branch‐and‐cut algorithm for the quay crane scheduling problem in a container terminal

The quay crane scheduling problem consists of determining a sequence of unloading and loading movements for cranes assigned to a vessel in order to minimize the vessel completion time as well as the crane idle times. Idle times originate from interferences between cranes since these roll on the same rails and a minimum safety distance must be maintained between them. The productivity of container terminals is often measured in terms of the time necessary to load and unload vessels by quay cranes, which are the most important and expensive equipment used in ports. We formulate the quay crane scheduling problem as a vehicle routing problem with side constraints, including precedence relationships between vertices. For small size instances our formulation can be solved by CPLEX. For larger ones we have developed a branch‐and‐cut algorithm incorporating several families of valid inequalities, which exploit the precedence constraints between vertices. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2006