平面内一组线段相对于线光源的可见性

给定平面内一组互不相交的线段 ,将实际光源抽象成有限长度线光源 ,讨论其可见性 ,发现线光源的照射效果等价于线光源两端点的照射效果叠加 ,给出了寻找所有可见边的算法 ,推广了文 [1 ]的结论。     

Safe distances

This work highlights the problem in military operations of setting safety limits for friendly forces, neutral forces, or civilians, to avoid sustaining unnecessary casualties both in wartime and in training. We present and investigate an analytic model which both enables the quantitative understanding of the inherent problems, and which furnishes a reasonably flexible tool in the hands of the analyst. Characteristic numerical results are displayed and analyzed: They show in particular that prevailing crude approximations are inadequate. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 259–269, 2001     

恒定应力加速寿命试验的非参数统计方法

在恒定应力加速寿命试验 (简称恒加试验 )的统计分析中 ,非参数统计方法具有一定的实际价值 .在一定的假定下 ,文中给出了两种新估计 ,并证明了它们的优良性     

The LP/POMDP marriage: Optimization with imperfect information

A new technique for solving large‐scale allocation problems with partially observable states and constrained action and observation resources is introduced. The technique uses a master linear program (LP) to determine allocations among a set of control policies, and uses partially observable Markov decision processes (POMDPs) to determine improving policies using dual prices from the master LP. An application is made to a military problem where aircraft attack targets in a sequence of stages, with information acquired in one stage being used to plan attacks in the next. © 2000 John Wiley & Sons, Inc., Naval Research Logistics 47: 607–619, 2000     

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.     

Optimizing barge utilization in hinterland container transportation

In hinterland container transportation the use of barges is getting more and more important. We propose a real‐life operational planning problem model from an inland terminal operating company, in which the number of containers shipped per barge is maximized and the number of terminals visited per barge is minimized. This problem is solved with an integer linear program (ILP), yielding strong cost reductions, about 20%, compared to the method used currently in practice. Besides, we develop a heuristic that solves the ILP in two stages. First, it decides for each barge which terminals to visit and second it assigns containers to the barges. This heuristic produces almost always optimal solutions and otherwise near‐optimal solutions. Moreover, the heuristic runs much faster than the ILP, especially for large‐sized instances.     

On the reduction of total‐cost and average‐cost MDPs to discounted MDPs

This article provides conditions under which total‐cost and average‐cost Markov decision processes (MDPs) can be reduced to discounted ones. Results are given for transient total‐cost MDPs with transition rates whose values may be greater than one, as well as for average‐cost MDPs with transition probabilities satisfying the condition that there is a state such that the expected time to reach it is uniformly bounded for all initial states and stationary policies. In particular, these reductions imply sufficient conditions for the validity of optimality equations and the existence of stationary optimal policies for MDPs with undiscounted total cost and average‐cost criteria. When the state and action sets are finite, these reductions lead to linear programming formulations and complexity estimates for MDPs under the aforementioned criteria.© 2017 Wiley Periodicals, Inc. Naval Research Logistics 66:38–56, 2019     

地球扰动引力对弹道导弹命中精度影响的等效补偿理论

为消除地球扰动引力的影响、提高弹道导弹的命中精度,根据地球扰动引力对弹道导弹运动影响的特性与控制系统理论,建立不直接补偿地球扰动引力对导弹运动参数的影响却能满足命中精度要求的等效补偿理论。根据不同补偿方式与补偿量的特点,提出嵌入式、分步式、分段式等补偿模式,为补偿地球扰动引力对导弹运动的影响提供了一个通用框架和理论基础。     

基于预定作业周期的航母作战部署调度研究

为科学筹划航母作战部署调度,优化航母作战兵力的运用,对航母作战部署调度问题进行建模研究。介绍航母预定作业周期,重点阐述航母综合训练期、维修保障期和人员/作战节奏等相关内容;在此基础上,分析航母作战部署调度的约束条件,在满足对作战区域有效时间覆盖条件下,以最小化航母作战兵力数量为目标函数,构建航母作战部署调度优化模型,并通过实例进行验证。结果表明,该模型是有效、实用的,可为科学决策航母作战部署调度提供依据和方法。     

数字化部队战斗力优化组合模型

数字化部队在战场上的出现,是信息战争产生的重要标志之一.随着信息技术的兴起,一些西方国家组建了数字化部队并加深了对其编成和结构理论的研究.首先介绍了模块理论,通过对数字化部队战斗力原理的分析,讨论了数字化部(分)队战斗力构成要素.在此基础上,使用线性规划理论试探性的构建出数字化部(分)队战斗力模块组合模型,并对模型的不同组合方式进行了论证和分析,得出数字化部(分)队战斗力模块的一种优化组合.最后展望了本课题下一步工作的研究重点.