基于滚动时域的C2组织决策层结构动态适应性优化

针对C2组织决策层结构适应性优化问题,定义了决策层结构与使命的适应性测度,分析了影响C2组织决策层结构的不确定因素,建立了决策层结构适应性优化模型.为了降低决策层结构适应性优化问题求解所面临的不确定性和减少决策层结构变化成本,设计了基于滚动时域的动态适应性优化方法,在提升决策层结构性能的同时控制了决策层结构变化成本.通...     

Optimization of steerable sensor network for threat detection

A Markov chain approach to detecting a threat in a given surveillance zone by a network of steerable sensors is presented. The network has a finite number of predetermined states, and transition from one state to another follows a Markov chain. Under the assumption that the threat avoids detection, two game theoretic problems for finding an optimal Markov chain (two surveillance strategies) are formulated: the first maximizes the probability of threat detection for two consecutive detection periods, whereas the second minimizes the average time of detection for the worst‐case threat's trajectory. Both problems are reduced to linear programming, and special techniques are suggested to solve them. For a dynamic environment with moving noise sources, the optimal Markov chain changes at each detection period, and the rate of convergence of the Markov chain to its stationary distribution is analyzed. Both surveillance strategies are tested in numerical experiments and compared one with another. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

Quadratic bottleneck problems

We study the quadratic bottleneck problem (QBP) which generalizes several well‐studied optimization problems. A weak duality theorem is introduced along with a general purpose algorithm to solve QBP. An example is given which illustrates duality gap in the weak duality theorem. It is shown that the special case of QBP where feasible solutions are subsets of a finite set having the same cardinality is NP‐hard. Likewise the quadratic bottleneck spanning tree problem (QBST) is shown to be NP‐hard on a bipartite graph even if the cost function takes 0–1 values only. Two lower bounds for QBST are derived and compared. Efficient heuristic algorithms are presented for QBST along with computational results. When the cost function is decomposable, we show that QBP is solvable in polynomial time whenever an associated linear bottleneck problem can be solved in polynomial time. As a consequence, QBP with feasible solutions form spanning trees, s‐t paths, matchings, etc., of a graph are solvable in polynomial time with a decomposable cost function. We also show that QBP can be formulated as a quadratic minsum problem and establish some asymptotic results. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

基于近似策略的联合优化方法

针对优化中收敛速度和优化解全局性的问题,提出了一种联合优化方法:构造原问题的近似模型,使用全局优化方法对近似函数进行优化,得到优化点作为初值,再使用局部优化方法对原问题进行优化.为了获得对原问题更好的近似,改进了径向基插值方法,以优化误差的方法来选择参数.利用临近空间机翼模型的优化对算法进行了测试,结果表明,优化参数的...     

基于优化算法的Free-form型机床各轴.运动方程及其对齿面误差的影响

以No.116铣齿机为例,通过推导传统摇台型机床、Free-form型机床中的坐标变换矩阵,根据运动等效转换的原则,应用最小二乘优化原理,用多项式拟合出Free-form型机床各轴的运动方程.通过算例分析,传统摇台型机床与Free-form型机床中的坐标变换矩阵高度吻合,用各轴运动方程在CATIA软件中虚拟加工出的螺旋...     

基于拉格朗日松弛的航天测控调度上界求解算法

通过分析航天测控调度问题的测控需求,建立了航天测控调度0-1整数规划模型,运用拉格朗日松弛方法对模型中的设备约束和卫星约束进行了松弛,运用次梯度优化算法求得了拉格朗日对偶问题的上界.最后,通过对两个场景的试验分析,证明了运用次梯度优化算法求得的上界的有效性.     

复杂系统复合维修间隔期优化模型

采用组合策略对复杂系统辅以功能检测的定期更换维修工作进行综合优化.在分析复杂系统维修费用结构和组成的基础上,建立了其无限使用期条件下单位时间期望费用的数学模型,从而获得系统最佳的功能检测间隔期、定期更换周期内的检测次数和最优总费用.最后通过一个算例验证了该策略和模型的有效性.     

灭火救援技术与战术作业的内容优化及应用

以灭火救援技术与战术课程作业为切入点,分析了作业存在的主要问题,提出了作业内容优化方案,结合问卷调查法分析了学员对课后作业优化前、后的满意程度,并提出可行的应用策略。     

基于混合粒子群算法的软硬武器协同反导决策

以单舰使用软硬武器对抗末端飞行的反舰导弹为背景,在对软硬武器抗击反舰导弹存在相互干扰进行分析的基础上,为了最大程度地减小干扰,取得最大的作战效果,建立了单舰协同使用软硬武器分层防御反舰导弹的模型.这是一个多阶段单指标方案优选问题,使用混合粒子群算法进行求解,仿真结果表明:该算法可以找到合理的、满足要求的反导方案,而且计算方便.     

海上编队雷达网优化部署系统的设计与实现

建立海上编队雷达网优化部署系统模型,包括实体模型和认知模型。仿真海上编队雷达网在无威胁条件下的优化部署和面临干扰和超低空突防威胁时的对抗过程,经过海上编队雷达网优化部署认知模型的解算,指挥舰队编队成员进行机动部署,编队成员通过重新机动,使编队雷达网获得较好的探测性能。仿真结果表明所建立模型的可行性和正确性。对于在未来海战场复杂电磁环境下,更好地发挥编队雷达网探测、预警能力具有重要意义。