基于蚁群算法的防空兵兵力机动线路优化

根据防空兵对机动线路的要求以及战时的安全性特点,得出影响防空兵兵力机动线路选择的因素,引入里程指数的概念,将线路的长度进行修正赋权,给出兵力机动线路的等效线路长度。把这一等效线路长度结合到蚁群算法中,能够较好地模拟现代战场的复杂环境对防空兵兵力机动路线的影响,并能科学、合理地选择路线,为指挥员的决策提供帮助。     

基于主成分分析法的目标威胁评估

为提高防空作战指挥员对空中来袭目标实施火力分配的量化决策水平,本文提出了基于主成分分析法的目标威胁评估模型及方法。主成分分析法在将原始变量转变为主成分过程中,同时形成了反映主成分的权数以计算综合评价值,这样在指标权重选择上克服了主观因素的影响,客观反映了各指标因素间的现实关系。通过引入实例,对来袭空中目标进行多指标综合评价,根据综合评估值对各批目标威胁进行排序,所得结果合理且符合客观实际,切实为防空作战指挥员科学合理地实施火力分配提供了数据支持和科学依据。     

DEA方法在防空作战方案优选中的应用

针对现代防空作战对决策速度和准确性的要求,运用DEA方法研究了防空作战方案优选问题。根据防空作战方案构成的主要要素,建立了防空作战方案的C2R评估模型,从“技术有效”和“规模有效”两个方面对备选方案的有效性进行综合分析,得出各方案评估结果,为指挥员优选方案提供了科学准确的依据。与传统的方法相比,该方法不仅具有内在的客观性,避免了方案中投入和产出指标间的相互制约,而且易于实现计算机处理,有效保障指挥员在防空作战中快速准确选定作战方案。     

地面防空兵力配置的不确定性作战效能模型研究

针对现代防空作战环境包含大量不确定性因素的特点,运用地面防空兵战术学、不确定性信息理论和未确知数学理论,探讨地面防空兵力配置的不确定性作战效能问题。设计了能同时处理随机信息、未确知信息的不确定性模型,该模型以指挥员对敌机进袭的主要方向、临空投弹线、投射精确制导炸弹的位置和巡航导弹的进袭航线的主观判断,并以随机变量、未确知有理数的形式作为输入,经未确知期望的计算,得到反映守点、控线、前出战法兵力配置的作战效能值及其可信度。结合一实例进行分析和计算,显示该模型较为贴近实际,体现了从定性到定量分析的系统工程方法的特点。     

A sequential partial information bomber-defender shooting problem

A bomber carrying homogenous weapons sequentially engages ground targets capable of retaliation. Upon reaching a target, the bomber may fire a weapon at it. If the target survives the direct fire, it can either return fire or choose to hold fire (play dead). If the former occurs, the bomber is immediately made aware that the target is alive. If no return fire is seen, the true status of the target is unknown to the bomber. After the current engagement, the bomber, if still alive, can either re-engage the same target or move on to the next target in the sequence. The bomber seeks to maximize the expected cumulative damage it can inflict on the targets. We solve the perfect and partial information problems, where a target always fires back and sometimes fires back respectively using stochastic dynamic programming. The perfect information scenario yields an appealing threshold based bombing policy. Indeed, the marginal future reward is the threshold at which the control policy switches and furthermore, the threshold is monotonic decreasing with the number of weapons left with the bomber and monotonic nondecreasing with the number of targets left in the mission. For the partial information scenario, we show via a counterexample that the marginal future reward is not the threshold at which the control switches. In light of the negative result, we provide an appealing threshold based heuristic instead. Finally, we address the partial information game, where the target can choose to fire back and establish the Nash equilibrium strategies for a representative two target scenario.     

Contractual agreements for coordination and vendor‐managed delivery under explicit transportation considerations

We consider the coordination problem between a vendor and a buyer operating under generalized replenishment costs that include fixed costs as well as stepwise freight costs. We study the stochastic demand, single‐period setting where the buyer must decide on the order quantity to satisfy random demand for a single item with a short product life cycle. The full order for the cycle is placed before the cycle begins and no additional orders are accepted by the vendor. Due to the nonrecurring nature of the problem, the vendor's replenishment quantity is determined by the buyer's order quantity. Consequently, by using an appropriate pricing schedule to influence the buyer's ordering behavior, there is an opportunity for the vendor to achieve substantial savings from transportation expenses, which are represented in the generalized replenishment cost function. For the problem of interest, we prove that the vendor's expected profit is not increasing in buyer's order quantity. Therefore, unlike the earlier work in the area, it is not necessarily profitable for the vendor to encourage larger order quantities. Using this nontraditional result, we demonstrate that the concept of economies of scale may or may not work by identifying the cases where the vendor can increase his/her profits either by increasing or decreasing the buyer's order quantity. We prove useful properties of the expected profit functions in the centralized and decentralized models of the problem, and we utilize these properties to develop alternative incentive schemes for win–win solutions. Our analysis allows us to quantify the value of coordination and, hence, to identify additional opportunities for the vendor to improve his/her profits by potentially turning a nonprofitable transaction into a profitable one through the use of an appropriate tariff schedule or a vendor‐managed delivery contract. We demonstrate that financial gain associated with these opportunities is truly tangible under a vendor‐managed delivery arrangement that potentially improves the centralized solution. Although we take the viewpoint of supply chain coordination and our goal is to provide insights about the effect of transportation considerations on the channel coordination objective and contractual agreements, the paper also contributes to the literature by analyzing and developing efficient approaches for solving the centralized problem with stepwise freight costs in the single‐period setting. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

对策理论的防空作战决策级融合模型

随着防空C3I系统的发展,防空作战决策的过程较以往更为自动化,用于生成各种作战辅助决策方案的计算机模型也具备随着作战环境改变所表现出一定的自适应调整的特征.影响防空作战决策结果正确性的因素众多,表现这些因素的信息有些是冲突的,为得到更为准确、有效的决策方案,各类冲突信息的处理成为防空作战的核心问题.构造了一种在冲突信息环境下基于对策理论的融合模型,以对策理论的相关算法实现了融合中心各类信息的交互决策.实践表明,这一融合模型能有效地解决防空作战决策中各类信息的综合处理问题,具有一定的实用价值.     

一种基于联动的军队网络安全防护体系

网络是军队信息化建设的基础,安全是军队信息化建设的保障。通过分析当前军队网络安全方面所存在的隐患以及防护措施的不足,引入一种基于联动技术的网络安全防护体系。该体系以防火墙为核心,以安全通信协议为基础框架,以PKI/CA体系为安全支撑,能够从整体上对军队网络进行全方位、立体的防护。其逻辑构成为核心安全设备、外围安全设备和安全通信协议3个部分,各种外围安全设备通过不同的安全通信协议如LD- BP、LCSP、ASIP等与核心安全设备(防火墙)进行有机联动,整个体系的安全性可以满足军队对网络安全的要求。     

Algorithms for the multi‐item multi‐vehicles dynamic lot sizing problem

We consider a two‐stage supply chain, in which multi‐items are shipped from a manufacturing facility or a central warehouse to a downstream retailer that faces deterministic external demand for each of the items over a finite planning horizon. The items are shipped through identical capacitated vehicles, each incurring a fixed cost per trip. In addition, there exist item‐dependent variable shipping costs and inventory holding costs at the retailer for items stored at the end of the period; these costs are constant over time. The sum of all costs must be minimized while satisfying the external demand without backlogging. In this paper we develop a search algorithm to solve the problem optimally. Our search algorithm, although exponential in the worst case, is very efficient empirically due to new properties of the optimal solution that we found, which allow us to restrict the number of solutions examined. Second, we perform a computational study that compares the empirical running time of our search methods to other available exact solution methods to the problem. Finally, we characterize the conditions under which each of the solution methods is likely to be faster than the others and suggest efficient heuristic solutions that we recommend using when the problem is large in all dimensions. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2006.     

Priority and dynamic scheduling in a make‐to‐stock queue with hyperexponential demand

We consider the scheduling problem in a make‐to‐stock queue with two demand classes that can be differentiated based on their variability. One class experiences Poisson arrivals and the other class experiences hyperexponential renewal arrivals. We provide an exact analysis of the case where the demand class with higher variability is given non‐preemptive priority. The results are then used to compare the inventory cost performance of three scheduling disciplines, first‐come first‐serve and priority to either class. We then build on an existing dynamic scheduling heuristic to propose a modification that works well for our system. Extensions of the heuristic to more than two classes and to the case where demand state is known are also discussed. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006.