基于激光推进的光船发射任务设计与参数优化分析

针对发射初始质量为100kg的光船到近地圆轨道的任务,研究了激光平均功率、激光大气传输特性、光船激光接收面面积、发动机比冲、发动机能量转化效率等参数之间的相互关系及光船飞行任务的优化问题。针对激光发射光船的具体要求,由功率估算公式计算出激光平均功率,从激光作用范围估算出光船的激光接收面的最小面积;基于光船飞行动力学模型,结合估算的参数,应用序列二次规划方法优化计算出光船飞行的最优弹道。计算结果表明,光船入轨质量可达到35.5kg,最优比冲为8140m/s。     

导弹最优制导律弹道仿真分析

根据导弹仿真数据,绘制可直观显示弹道特性的理想弹道曲线。给出了比例导引法的差分方程,建立了比例导引法的三维弹道仿真模型。在对比例导引法进行三维弹道仿真的基础上,分别对增量比例导引、基于二次型的最优制导律和考虑动态特性的二次型最优制导律进行了三维弹道仿真,绘制出了可直观显示弹道特性的理想弹道,计算了导弹与目标的遭遇时间,并对结果进行了比较分析。最后得出考虑弹体动态特性的二次型最优制导律具有最优性。     

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

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

一种基于导航点的航天器相对运动轨迹生成策略

针对圆(近圆)轨道航天器相对运动的固定时间状态转移问题,提出了一种基于导航点的多脉冲优化轨迹生成策略.从相对运动动力学出发,应用最优控制理论给出了基于连续推力的最优转移轨线,将引入的导航点限定在最优转移轨线上得到其位置参数;然后利用导航点位置参数建立了脉冲约束下的基于脉冲的优化轨迹生成模型,采用二次规划算法求解,通过改变导航点位置和脉冲间隔优化轨迹.仿真算例验证了策略的有效性.     

Doubly Stochastic Sequential Assignment Problem

This article introduces the Doubly Stochastic Sequential Assignment Problem (DSSAP), an extension of the Sequential Stochastic Assignment Problem (SSAP), where sequentially arriving tasks are assigned to workers with random success rates. A given number of tasks arrive sequentially, each with a random value coming from a known distribution. On a task arrival, it must be assigned to one of the available workers, each with a random success rate coming from a known distribution. Optimal assignment policies are proposed for DSSAP under various assumptions on the random success rates. The optimal assignment algorithm for the general case of DSSAP, where workers have distinct success rate distribution, has an exponential running time. An approximation algorithm that achieves a fraction of the maximum total expected reward in a polynomial time is proposed. The results are illustrated by several numerical experiments. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 124–137, 2016     

Optimal staffing in nonstationary service centers with constraints

This paper considers optimal staffing in service centers. We construct models for profit and cost centers using dynamic rate queues. To allow for practical optimal controls, we approximate the queueing process using a Gaussian random variable with equal mean and variance. We then appeal to the Pontryagin's maximum principle to derive a closed form square root staffing (SRS) rule for optimal staffing. Unlike most traditional SRS formulas, the main parameter in our formula is not the probability of delay but rather a cost‐to‐benefit ratio that depends on the shadow price. We show that the delay experienced by customers can be interpreted in terms of this ratio. Throughout the article, we provide theoretical support of our analysis and conduct extensive numerical experiments to reinforce our findings. To this end, various scenarios are considered to evaluate the change in the staffing levels as the cost‐to‐benefit ratio changes. We also assess the change in the service grade and the effects of a service‐level agreement constraint. Our analysis indicates that the variation in the ratio of customer abandonment over service rate particularly influences staffing levels and can lead to drastically different policies between profit and cost service centers. Our main contribution is the introduction of new analysis and managerial insights into the nonstationary optimal staffing of service centers, especially when the objective is to maximize profitability. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 615–630, 2017     

Capacity expansion and cost efficiency improvement in the warehouse problem

The warehouse problem with deterministic production cost, selling prices, and demand was introduced in the 1950s and there is a renewed interest recently due to its applications in energy storage and arbitrage. In this paper, we consider two extensions of the warehouse problem and develop efficient computational algorithms for finding their optimal solutions. First, we consider a model where the firm can invest in capacity expansion projects for the warehouse while simultaneously making production and sales decisions in each period. We show that this problem can be solved with a computational complexity that is linear in the product of the length of the planning horizon and the number of capacity expansion projects. We then consider a problem in which the firm can invest to improve production cost efficiency while simultaneously making production and sales decisions in each period. The resulting optimization problem is non‐convex with integer decision variables. We show that, under some mild conditions on the cost data, the problem can be solved in linear computational time. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 367–373, 2016     

相控阵雷达LPI搜索方法研究

相控阵雷达可通过合理配置工作参数优化其性能。针对相控阵雷达在搜索目标时易受敌方电子侦察设备威胁的现实,研究了在保持搜索能力的同时,通过合理配置参数降低截获概率的问题。分析了影响相控阵雷达搜索状态LPI(Low Probability of Intercept)性能的主要因素,建立了截获概率模型与搜索能力模型,给出了3种参数调整策略。仿真试验验证了模型的有效性,并比较了3种策略的优劣。     

Selecting review periods for a coordinated multi‐item inventory model with staggered deliveries

Consider an N‐item, periodic review, infinite‐horizon, undiscounted, inventory model with stochastic demands, proportional holding and shortage costs, and full backlogging. For 1 ≤ j ≤ N, orders for item j can arrive in every period, and the cost of receiving them is negligible (as in a JIT setting). Every T_j periods, one reviews the current stock level of item j and decides on deliveries for each of the next T_j periods, thus incurring an item‐by‐item fixed cost k_j. There is also a joint fixed cost whenever any item is reviewed. The problem is to find review periods T₁, T₂, …, T_N and an ordering policy satisfying the average cost criterion. The current article builds on earlier results for the single‐item case. We prove an optimal policy exists, give conditions where it has a simple form, and develop a branch and bound algorithm for its computation. We also provide two heuristic policies with O(N) computational requirements. Computational experiments indicate that the branch and bound algorithm can handle normal demand problems with N ≤ 10 and that both heuristics do well for a wide variety of problems with N ranging from 2 to 200; moreover, the performance of our heuristics seems insensitive to N. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48:430–449, 2001     

一类对固定目标的集群搜寻对策问题及求解

利用集群搜索对策的理论与方法 ,建立了集群对固定目标的一类搜索对策模型 ,给出了集群的ε -最优搜寻策略 ,并考虑了其在搜索过程中的应用