着陆冲击试验系统设计及大型橡胶容器试验验证

为确保大型橡胶容器的运输适航性,依据中国民用航空局对运输类飞机的应急着陆过载要求,开展着陆冲击试验系统设计。通过冲击平台仿真设计与校核、波形发生器仿真设计、摆锤系统与导向机构设计,构建了着陆冲击试验系统,有效负载约达20 t,最大冲击载荷达到400 t。选取大型橡胶容器作为典型空运物资进行应急着陆实装试验验证,结果表明:冲击波形均近似为三角波,与仿真曲线波形相似,过载峰值分别为侧向1.54g、航向3.06g、9.02g、16.20g,与目标峰值最大相对误差小于3%,峰值对应时间大于50 ms,试验系统符合设计要求。该试验系统可用于空运平台的研制,对于确保飞行安全、降低研制风险、提高空运适航性具有重要的意义。     

A mathematical formulation and efficient heuristics for the dynamic container relocation problem

The container relocation problem (CRP) is concerned with emptying a single yard‐bay which contains J containers each following a given pickup order so as to minimize the total number of relocations made during their retrieval process. The CRP can be modeled as a binary integer programming (IP) problem and is known to be NP‐hard. In this work, we focus on an extension of the CRP to the case where containers are both received and retrieved from a single yard‐bay, and call it the dynamic container relocation problem. The arrival (departure) sequences of containers to (from) the yard‐bay is assumed to be known a priori. A binary IP formulation is presented for the problem. Then, we propose three types of heuristic methods: index based heuristics, heuristics using the binary IP formulation, and a beam search heuristic. Computational experiments are performed on an extensive set of randomly generated test instances. Our results show that beam search heuristic is very efficient and performs better than the other heuristic methods.Copyright © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 101–118, 2014     

Determining crane areas for balancing workload among interfering and noninterfering cranes

This article treats the problem of subdividing an area for storing containers such that the workload is evenly shared among the cranes operating the resulting subareas. We consider two crane sets: while noncrossing constraints between cranes of the same set need to be observed, cranes of different sets do not interfere. Such a problem setting is, for instance, relevant for scheduling the (un‐)loading of vessels by parallel quay cranes operating on opposing berths or in container yards with cross‐over cranes. We formalize the resulting optimization problem, prove computational complexity, and present exact and heuristic solution procedures. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012     

Mitigation effects on the reflected overpressure of blast shock with water surrounding an explosive in a confined space

The mitigation of blast shock with water has broad application prospects. Understanding the mitigation effects on the reflected overpressure of the explosion shock with water surrounding an explosive in a confined space is of great significance for military explosives safety applications. To estimate the effects of the parameters on the reflected overpressure of blasted shock wave, a series of experiments were carried out in confined containers with spherical explosives immersed in a certain thickness of water, and numerical simulations were conducted to explore the corresponding mechanisms. The results reveal that the reflected overpressure is abnormally aggravated at a small scaled distance. This aggravation is due to the high impulse of the bulk accelerated water shell converted from the explosion. With increasing scaled distance, the energy will be gradually dissipated. The mitigation effects will appear with the dispersed water phase front impacting at a larger scaled distance, except in the case of a dense water phase state. A critical scaled distance range of 0.7—0.8 m/kg1/3 for effective mitigation was found. It is suggested that the scaled distance of space walls should be larger than the critical value for a certain water-to-explosive weight ratio range (5—20).     

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.     

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

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

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

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

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     

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