光电跟瞄平台稳定控制器设计

以考虑光电跟瞄平台三轴环架间的耦合所建立的数学模型为基础,对光电跟瞄平台的稳定回路分别设计了基于线性矩阵不等式(LMI)的状态反馈H∞控制器和多输入系统极点配置控制器;分别建立基于所设计两种控制器的跟瞄平台稳定控制系统,并对其控制效果进行对比研究,结果表明,二者皆能实现对光电跟瞄平台的稳定控制,都具有一定的鲁棒性能。其中H∞控制器的设计更简单,超调更小且达到稳定的时间短,更适合于光电跟瞄平台的稳定控制。     

分布式遗传模拟退火算法的火力打击目标分配优化

根据火力打击规则,建立了多目标函数的目标分配模型,提出了分布式遗传模拟退火算法对模型进行求解。分布式遗传模拟退火算法基于经典遗传算法进行改进:将单目标串行搜索方式变成多目标分布式搜索方式,适用于多目标寻优问题求解;采用保留最优个体和轮盘赌相结合的方式进行个体选择,在交叉算子中引入模拟退火算法,使用自适应变异概率,较好地保持算法广度和深度搜索平衡。最后,通过仿真实验验证了算法的有效性和可靠性。     

一种改进的量子粒子群算法

量子粒子群算法是将量子计算与粒子群算法相结合的一种新的优化方法。首先利用相位角进行实数编码,将动态量子旋转门引入到粒子群算法中,采用自适应变异,提出了一种改进的量子粒子群算法。然后运用Pe-nalized函数和Ackley函数测试了该算法的性能。最后将该算法应用到武器目标分配模型中,获得了最优的分配方案。仿真研究表明,该算法具有收敛速度快、搜索能力强和稳定性高的特点。     

Graph distance‐dependent labeling related to code assignment in computer networks

For nonnegative integers d₁, d₂, and L(d₁, d₂)‐labeling of a graph G, is a function f : V(G) → {0, 1, 2, …} such that |f(u) − f(v)| ≥ d_i whenever the distance between u and v is i in G, for i = 1, 2. The L(d₁, d₂)‐number of G, λ(G) is the smallest k such that there exists an L(d₁, d₂)‐labeling with the largest label k. These labelings have an application to a computer code assignment problem. The task is to assign integer “control codes” to a network of computer stations with distance restrictions, which allow d₁ ≤ d₂. In this article, we will study the labelings with (d₁, d₂) ∈ {(0, 1), (1, 1), (1, 2)}. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2005     

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.     

Scheduling and lot streaming in two‐machine open shops with no‐wait in process

We study the problem of minimizing the makespan in no‐wait two‐machine open shops producing multiple products using lot streaming. In no‐wait open shop scheduling, sublot sizes are necessarily consistent; i.e., they remain the same over all machines. This intractable problem requires finding sublot sizes, a product sequence for each machine, and a machine sequence for each product. We develop a dynamic programming algorithm to generate all the dominant schedule profiles for each product that are required to formulate the open shop problem as a generalized traveling salesman problem. This problem is equivalent to a classical traveling salesman problem with a pseudopolynomial number of cities. We develop and test a computationally efficient heuristic for the open shop problem. Our results indicate that solutions can quickly be found for two machine open shops with up to 50 products. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005     

预警机指挥多机群空战的协同战术决策

分析了预警机指挥下的多机群协同空战的战术决策方法,建立起了它的战术编队、威胁评估以及目标分配模型,并进行了仿真计算,结果表明此战术决策方法对于提高多机群协同空战的作战效能有着显著的作用,对于未来无人作战飞机多编队协同作战也具有很好的参考价值.     

弹炮结合武器系统火力分配优化问题研究

在确定弹炮结合武器系统对目标的可射击系数、火力重叠修正系数和转火矛盾修正系数的基础上,结合防空作战的实际,通过对运用地空导弹射击、运用高炮射击、运用地空导弹和高炮混合射击三种情况的分析,介绍了解决弹炮结合武器系统火力分配优化问题的一般步骤。通过算例,证明了该方法的可行性,为有效解决弹炮结合武器系统火力分配优化问题提供了一种较为科学的方法。     

The bottleneck problem with minimum quantity commitments

Given an edge‐distance graph of a set of suppliers and clients, the bottleneck problem is to assign each client to a selected supplier minimizing their maximum distance. We introduce minimum quantity commitments to balance workloads of suppliers, provide the best possible approximation algorithm, and study its generalizations and specializations. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

各向异性矩形板平面应力问题一般解析解

采用复级数方法首次建立了线性偏微分方程组边值问题的一般解析解法,并用于求解各向异性矩形板平面应力问题,给出各向异性板平面应力问题一般解析解．引入（Ｕ,Ｖ）＝∑∞－∞（Ａ,Ｂ）ｅｉｍπζ,ｅｉｍπηｒ,代入控制方程组,推出实数型级数解,将其回代入平衡方程组中任一个,可确定待定系数（Ａ,Ｂ）之间关系．将一般解析解代入边界条件,用余弦级数的方法确定待求系数．数值计算验证了解析方法的收敛性．