战役野战油库油料输送力量优化分配研究

如何科学、合理分配战役野战油库油料输送力量是战时油料保障必须面临的一个实际问题。首先根据战役野战油库运油车分配模型得到一个运油车初始分配方案,然后运用计算机模拟技术对分配方案进行模拟,并根据模拟结果不断调整,直至得到优化的分配方案,为制定战役野战油库油料输送计划提供决策依据。     

鲍摩-瓦尔夫模型在野战油库选址中的应用

野战油库开设是战时油料保障一个十分重要的环节，库址选择是一项复杂的工作，所以如何快速有效地解决野战油库的选址问题显得尤为重要。以油料周转量为重点考虑因素，在总周转量最小的前提下，建立了库址选择的鲍摩-瓦尔夫模型，同时给出了模型的求解方法，从而解决了野战油库的库址选择问题，保证了战时油料保障能够快速顺利的进行。通过实例分析，该方法具有一定的适用性。     

联合战役野战油库部署多目标优化模拟模型

联合战役野战油库部署研究的是如何对联合战役野战油库进行科学、合理、有序配置。以用油部队的满意度最大和战役野战油库的安全性最高为决策目标,提出了基于保障程度和安全性的联合战役野战油库部署多目标优化模拟模型,给出了一种模拟植物生长的求解算法,并采用优先级算法和模拟植物生长算法分别对实例进行求解,比较分析两种求解结果,得到了基于模拟植物生长算法的多目标优化模型的最优解,验证了本模型及算法的合理性、优越性和实用性。     

新型移动式野战加油站建设与运用

针对部队加油站建设标准不一、形式多样、改造周期长、费用高、效率低、耐候性差的问题，本文在明确新型移动式野战加油站的建设意义和建设目标的基础上，对移动式野战加油站的整体可移动性、储油罐与加油装置集成以及边海防等一线连队的油料保障模式和建设标准进行了研究，从工艺流程、建设选址和建设标准等方面提出了基于集装箱方舱框架设计新型移动式野战加油站的保障运用模式。这种模式不仅可填补大容量战储装备空白，还可以为热点方向实施定点保障，为加快推进部队储加油设施建设向集约化转型、保障向战场延伸提供借鉴。     

信息化条件下军队后方油库油料保障决策模拟研究

从后方油库油料保障决策模拟概念入手,分析归纳了后方油库油料保障决策的基本范围,在分析后方油库油料保障决策信息处理流程的基础上形成了模拟模型的总体框架,包括情况综合分析模型组、方案辅助生成模型组和方案评估与选择模型组。后方油库油料保障决策模拟数据根据不同划分标准,可分为多个类别,其主要来源有试验、训练或演习、战史或战例、兵要地志等多种。     

充分利用成品油管道实现军用机场军民融合式油料保障

我军机场驻地分散,远离炼油企业和国家、军队储油基地,加之运输形式单一,战时油料供应保障与安全将面临极大挑战。成品油管道输油具有密闭连续、输送量大、隐蔽安全等优点,为世界发达国家和军队广泛采用。着眼深化军事斗争准备需要,积极探索利用国家成品油管道为军用机场输送油料,总部应积极协调,为充分利用成品油管道创造条件;有关大单位要大胆探索,开展油库利用成品油管道输油试点;部队应加强野战油料管线建设,做好战时紧急开设成品油管道支线准备。     

基于仿真的作战飞机管道加油调度优化研究

针对多机种作战飞机管道油料加注调度优化的现实问题,通过研究作战飞机从到达基地到加油完毕的油料加注周期,提出了一种新的管道加油口选择策略,并基于此策略研制了以作战飞机数量和油料加注时间为仿真结束条件的2种GPSSW仿真程序模型。通过多次仿真实验,结果表明:该策略优于基于调度人员经验的"即空即用"管道加油口选择策略,可有效提高作战飞机油料加注效率,并能实现有限管道加油口的合理分配。     

油料保障作业动态工况仿真

以建模和数据集成为桥梁,运用流体力学和数值分析等学科的理论和方法,深入研究应用多泵并联变频调速技术实现飞机外场管道加油系统恒压供油的原理,分析在离心泵增压条件下该系统因同时加油口数量发生变化引起压力与流量变化的规律和特性,进而提出模拟系统中各种参数的控制量值,给出程序运行流程框图,从而构建外场油料保障模拟训练"中心"平台系统,实现油料保障全过程中岗位的协同模拟训练。研究结果能较好地解决目前油料专业训练中存在的训练装备设施不足、实装训练成本高、协同训练难以落实等问题,提高油料保障专业训练的质量和效益。     

山西省某预备役师后勤部——立足实战磨砺保障硬功

山西省某预备役师后勤部结合一年一度整组工作,组织卫生、运输等后勤保障分队进行野外综合保障演练。他们利用各单位组织的成建制拉动演练．把各保障分队拉到复杂生疏地域,采用声、光、电等模拟器材．设置近似实战的环境,进行野战生存、野战救护、野战加油和野战伪装等课目演练,有效提高了后勤分队野外综合保障能力: 2005年5月．这个师组织所属各团后勤分队进行了综合     

野战机场体系布局韧性研究

野战机场体系是战时完成临时性、紧迫性军事任务的重要补充,合理的空间布局是提高其战场作战保障能力和生存能力的基础前提。为快速部署野战机场体系形成韧性布局,以野战机场体系最大化作战保障能力为目标,考虑野战机场的潜在部署点位、最大保障范围、作战需求可达性和建设资源总量等约束,建立战时随机破坏条件下野战机场体系韧性布局分析模型;设计以粒子群智能算法和蒙特卡罗随机方法为核心的求解流程,实现野战机场体系可行布局的快速求解和优化;以某典型野战机场体系为例,量化分析了不同空间布局方案对体系作战保障能力的影响,以期为野战机场体系的快速构设和作战运用提供决策支撑。     

Optimal refueling sequence for a mixed fleet with limited refuelings

Consider a fleet of vehicles comprised of K₁ identical tankers and K₂ identical nontankers (small aircraft). Tankers are capable of refueling other tankers as well as nontankers. The problem is to find that refueling sequence of the tankers that maximizes the range simultaneously attainable by all K₂ nontankers. A recent paper established that the “unit refueling sequence,” comprised of one tanker refueling at each of K₁ refueling operations, is optimal. The same paper also proffered the following conjecture for the case that the number of refueling operations is constrained to be less than the number of tankers: A nonincreasing refueling sequence is optimal. This article proves the conjecture.     

Optimal refueling strategies for a mixed-vehicle fleet

The problem treated here involves a mixed fleet of vehicles comprising two types of vehicles: K₁ tanker-type vehicles capable of refueling themselves and other vehicles, and K₂ nontanker vehicles incapable of refueling. The two groups of vehicles have different fuel capacities as well as different fuel consumption rates. The problem is to find the tanker refueling sequence that maximizes the range attainable for the K₂ nontankers. A tanker refueling sequence is a partition of the tankers into m subsets (2 ≤ m ≤ K₁). A given sequence of the partition provides a realization of the number of tankers participating in each successive refueling operation. The problem is first formulated as a nonlinear mixed-integer program and reduced to a linear program for a fixed sequence which may be solved by a simple recursive procedure. It is proven that a “unit refueling sequence” composed of one tanker refueling at each of K₁ refueling operations is optimal. In addition, the problem of designing the “minimum fleet” (minimum number of tankers) required for a given set of K₂ nontankers to attain maximal range is resolved. Also studied are extensions to the problem with a constraint on the number of refueling operations, different nontanker recovery base geometry, and refueling on the return trip.     

Vehicle fleet refueling strategies to maximize operational range

The focus of this research is on self-contained missions requiring round-trip vehicle travel from a common origin. For a single vehicle the maximal distance that can be reached without refueling is defined as its operational range. Operational range is a function of a vehicle's fuel capacity and fuel consumption characteristics. In order to increase a vehicle's range beyond its operational range replenishment from a secondary fuel source is necessary. In this article, the problem of maximizing the range of any single vehicle from a fleet of n vehicles is investigated. This is done for four types of fleet configurations: (1) identical vehicles, (2) vehicles with identical fuel consumption rates but different fuel capacities, (3) vehicles which have the same fuel capacity but different fuel consumption rates, and (4) vehicles with both different fuel capacities and different consumption rates. For each of the first three configurations the optimal refueling policy that provides the maximal range is determined for a sequential refueling chain strategy. In such a strategy the last vehicle to be refueled is the next vehicle to transfer its fuel. Several mathematical programming formulations are given and their solutions determined in closed form. One of the major conclusions is that for an identical fleet the range of the farthest vehicle can be increased by at most 50% more than the operational range of a single vehicle. Moreover, this limit is reached very quickly with small values of n. The performance of the identical fleet configuration is further investigated for a refueling strategy involving a multiple-transfer refueling chain, stochastic vehicle failures, finite refueling times, and prepositioned fleets. No simple refueling ordering rules were found for the most general case (configuration 4). In addition, the case of vehicles with different fuel capacities is investigated under a budget constraint. The analysis provides several benchmarks or bounds for which more realistic structures may be compared. Some of the more complex structures left for future study are described.     

航空自导深弹攻潜命中概率分析

以航空自导深弹为研究对象,在分析反潜直升机攻潜过程的基础上,依据某型航空自导深弹的有关技术参数,首先建立了反潜直升机使用航空自导深弹攻潜模型,然后详尽分析了航空自导深弹攻潜作战中的各种源误差,采用解析法计算了反潜直升机在不同条件下投放航空自导深弹攻击潜艇时的单发命中概率,得出了反潜直升机空投航空自导深弹攻潜的使用方法.这对于部队使用航空自导深弹反潜有较高的参考价值.     

飞机运动态势对航空深弹入水点散布影响分析

航空自导深弹具有结构简单、可靠性高、不受水文条件限制等特点,而且还具有自导捕获和跟踪目标能力,对于提高航空兵部队反潜能力具有重要作用。反潜机投放高度、投放速度等运动态势关系到使用航空自导深弹对目标实施准确打击。针对航空自导鱼雷攻潜实际过程,建立其入水点的散布误差模型和空中弹道模型,并仿真分析反潜机投弹高度、投弹速度对航空自导深弹入水点的影响。     

Vulnerability assessment to projectiles: Approach definition and application to helicopter platforms

Survivability is defined as the capability of a platform to avoid or withstand a man-made hostile environment. Military aircraft in particular, but also other kinds of platforms subjected to external, impacting threats, are commonly designed according to increasing survivability requirements. The concept of survivability was first formalized by R. Ball in 1985 in its seminal work on combat aircraft survivability. On the basis of the theory presented in his work, many computer programs have been developed which implement the modelling techniques and computations required by vulnerability assessments. However, a clear and general view of the operative computational procedures is still lacking. Moreover, to date only a limited number of applications to helicopter platforms have been investigated in the survivability field, even though these platforms experience numerous flight conditions exposing the system to different types of threats. In this context, this work aims at establishing a multi-purpose general framework for the vulnerability assessment of different types of platforms subjected to external threats, with a focus on helicopters. The in-house software specifically developed for this application is here described in detail and employed to present a case study on a representative military helicopter.     

空投鱼雷入水点影响因素研究

航空自导鱼雷具有命中精度高、威力大、攻潜效果好等特点。针对反潜直升机空投鱼雷作战使用的特点,深入分析了空投鱼雷的空中弹道、直升机的运动态势和风速风向等影响空投鱼雷入水点位置的关键因素,并得到了各要素的数学描述,进而通过仿真分析得到了直升机运动态势和风速风向对空投鱼雷入水点的影响。     

远海护航行动中舰载直升机巡逻警戒空域的设置

针对远海伴随护航过程中舰载直升机巡逻警戒空域设置问题，在分析影响舰载直升机巡逻警戒空域设置因素及确定舰载直升机巡逻警戒方式的基础上，结合被护船只的数量和队形，从舰载直升机有效震慑海盗，确保被护船队安全的要求出发，构建了舰载直升机巡逻警戒空域范围的计算模型，对舰载直升机远海伴随护航行动中巡逻警戒空域的设置问题进行了量化研究，所得结论可为舰载直升机巡逻警戒空域的优化设置提供理论指导和使用参考。     

Modeling and analyzing multiple station baggage screening security system performance

In the aftermath of the tragic events of 11 September 2001, numerous changes have been made to aviation security policy and operations throughout the nation's airports. The allocation and utilization of checked baggage screening devices is a critical component in aviation security systems. This paper formulates problems that model multiple sets of flights originating from multiple stations (e.g., airports, terminals), where the objective is to optimize a baggage screening performance measure subject to a finite amount of resources. These measures include uncovered flight segments (UFS) and uncovered passenger segments (UPS). Three types of multiple station security problems are identified and their computational complexity is established. The problems are illustrated on two examples that use data extracted from the Official Airline Guide. The examples indicate that the problems can provide widely varying solutions based on the type of performance measure used and the restrictions imposed by the security device allocations. Moreover, the examples suggest that the allocations based on the UFS measure also provide reasonable solutions with respect to the UPS measure; however, the reverse may not be the case. This suggests that the UFS measure may provide more robust screening device allocations. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

飞机再次出动保障活动设计方法

飞机再次出动保障活动所需时间长短对提升飞机的作战效能至关重要,针对当前在飞机保障资源有限约束条件下,再次出动保障活动工期最短难以实现的难题,提出了基于分支切割法的再次出动保障活动时间优化方法。该方法以飞机再次出动保障活动所需时间最短为目标,以有限的保障人员和保障作业间逻辑关系为约束条件,可计算出时间最短的飞机再次出动保障活动具体流程,并用VB6.0编制成计算机程序,开发了飞机再次出动保障活动分析系统。最后,对某型飞机真实保障活动进行了实例分析,结果表明,使用该方法计算得到的结果准确、可靠,与实际保障情况相符,可为飞机再次出动保障与决策提供指导,提升保障活动的自动化水平,具有很好的工程应用价值。