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

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

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     

The assignment of storage locations to containers for a container stack

Assigning storage locations to incoming or reshuffled containers is a fundamental problem essential to the operations efficiency of container terminals. The problem is notoriously hard for its combinatorial and dynamic nature. In this article, we minimize the number of reshuffles in assigning storage locations for incoming and reshuffled export containers. For the static problem to empty a given stack without any new container arrival, the optimum reshuffle sequence is identified by an integer program (IP). The integer program captures the evolution of stack configurations as a function of decisions and is of interest by itself. Heuristics based on the integer program are then derived. Their competitiveness in accuracy and time are established by extensive numerical runs comparing them with existing heuristics in literature and in practice as well as with extensions of the existing heuristics. Variants of the IP‐based heuristics are then applied to the dynamic problem with continual retrievals and arrivals of containers. Again, numerical runs confirm that the IP‐based heuristic is competitive. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009     

试论静止液体对容器的压力

以圆台型容器为例 ,定量分析讨论了容器器壁所受到的压力和容器内液体所受到的重力两者之间的数量关系     

飞行器点火爆炸通用测量装置的设计

针对飞行器试验用点火器的通用测量装置,提出了一种柱形爆炸容器的设计方法,从容器壁厚、反射超压、应用材料、容器结构以及点火器爆炸当量等方面进行考虑,计算柱形爆炸容器的压力瞬间载荷,并利用COSMOS Works软件进行应力仿真,最后通过实际飞行试验环节进行验证,回收采集系统所记录的试验数据并间接分析出点火器的工作状态,结果表明:试验结果和理论分析完全吻合,容器设计合理,从而为飞行器研制试验用点火器驱动动力装置提供必要的数据参考和支撑。     

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