基于改进萤火虫优化算法的BP神经网络目标群威胁判断

以舰艇防空作战目标选择决策和规划需求为背景,针对萤火虫算法求解精度不高且收敛速度较慢的问题,提出可动态调整步长的改进萤火虫优化算法。在改进萤火虫优化算法的基础上,建立基于改进萤火虫优化算法的BP神经网络目标群威胁判断结构模型。通过改进萤火虫算法优化BP神经网络的初始权值和阈值,能够更好地预测测试集。实验结果表明,该方法可快速、准确地实现目标群威胁判断。     

LCDP SO算法在协同空战攻击决策中的运用?

为了探索提高协同空战攻击决策算法性能的途径,将多子群粒子群优化理论用于求解协同空战攻击决策,利用生命周期粒子群模型（ LCPSO）,提出了一种生命周期离散粒子群（ LCDPSO）协同空战攻击决策算法。基于典型空战想定背景,仿真验证了算法的有效性。通过统计实验的方法,分析比较了LCDPSO协同空战攻击决策算法与多种智能决策算法的准确性、可靠性和快速性,研究结果证明LCDPSO协同空战攻击决策算法优良的综合性能。     

基于SQP法的助推-滑翔导弹助推段弹道优化研究

轨迹优化是飞行器总体优化设计中的重要组成部分,它贯穿于飞行器的整个设计过程。高超声速助推-滑翔导弹的弹道优化问题涉及攻角、法向过载、最大动压等多种约束条件,是一种复杂的最优控制问题。序列二次规划法（SQP）是解决该类问题行之有效的数值优化方法。本文利用SQP算法对助推-滑翔导弹助推段进行弹道优化,为这一高超声速飞行器的整体结构设计提供了有益的参考。     

基于SDP松弛的干扰资源优化分配技术研究

提出一种基于semidefinite programming(简称SDP)松弛的干扰资源优化分配算法。在问题优化过程中首先对模型中非凸的约束条件进行松弛,变为凸约束,将原来的数学模型转化成SDP求解形式,利用内点算法对松弛后的模型求解。该算法利用解析的手段使得干扰资源优化分配问题中的NP难问题在多项式时间内得以解决,并且有较高的可靠性。仿真结果验证了算法的有效性。     

合成分队双层主从决策模型研究

针对合成分队不同指挥层级之间的决策交互优化问题,提出了基于主从决策的双层武器目标分配模型。该模型能够体现上下指挥层级之间交互式决策协调优化的特点:上层目标为主攻方向我方遭受威胁最小,下层目标为对敌打击最大。结合合成分队作战决策的特点和要求,提出了一种求解该模型的改进型粒子群优化算法。仿真结果表明,该模型合理有效,改进的求解算法能够获得满意解。     

云模型改进惯性权重的混沌交替粒子群算法

标准粒子群算法通过线性减小惯性权重系数来调整寻优性能,但缺乏智能化机制易导致算法后期产生早熟或陷入局部最优而产生僵局。针对这一问题,提出一种基于云模型改进惯性权重的混沌交替粒子群优化算法。根据粒子迭代变化关系,采用云模型理论对惯性权重ω进行智能化调整,以平衡其全局和局部搜索能力,防止算法产生局部僵局;另外,判定粒子稳定性,对于可能陷入局部僵局的稳定粒子进行混沌扰动,促使其跳出僵局进而向最优位置更新。实验与分析表明,基于云模型改进惯性权重的混沌交替粒子群优化算法能够跳出局部僵局且具有较高的寻优精度,算法接近完全收敛时的平均迭代次数,较现有相关研究分别降低了13.73%~20.11%。     

基于复杂网络的作战同步建模与优化

为了量化分析作战同步问题,提出多作战单元协同作战复杂网络模型,在此基础上,应用复杂网络同步理论,重点从作战单元动力学行为和网络拓扑结构两个方面对作战同步的内在机理进行分析。针对不同的作战情形,设计了静态同步和动态同步两种网络,并分别应用离散粒子群算法对网络结构进行优化。对网络抗毁性的仿真实验表明两型网络对随机攻击和恶意攻击均具有较好的鲁棒性。     

基于多Agent无人机协同侦察任务规划模型

建立了多无人机协同侦察任务规划模型,在考虑侦察时间间隔约束和目标载荷需求基础上,给出了位于不同基地的无人机优化部署和调度策略,并提出了基于多Agent的优化搜索仿真算法,利用Matlab实现了无人机优化配置和任务规划模型,得出了无人机优化配置和任务规划方案,最后分析了模型算法存在的某些不足,提出了模型改进的方向。     

Historical and Political Background to the Erosion of the Rule of Law and Human Rights During Sri Lanka’s Civil War and the Way Forward

The Sri Lankan Civil War (1983–2009) is regarded as a violent reflection of deepening divides along political and ethnic lines. During this civil war the Sri Lankan Government and its security forces have been implicated in unlawful killings carried out in a pervasive manner against civilians, whilst at the same time specifically targeting ethnic Tamils, humanitarian workers and journalists. The human rights of all citizens suffered as a result and ultimately led to the weakening of the rule of law. With the end of the civil war, the Sri Lankan Government has made little progress in providing accountability for wartime abuses. Its absence of and reluctance to ensure justice is seen as a logical culmination of decades of impunity. The importance of acknowledging historical behaviour and taking accountability for past violations will be discussed. In an analysis for paving the way to a new democracy in Sri Lanka, the main outcomes of this article are calls for accountability arising out of the government’s actions during the war; an investigation into the present state of human rights, the rule of law and finally; an examination into the political solution going forward to ensure a process of reconciliation and peaceful co-existence.     

Using stochastic programming to solve an outpatient appointment scheduling problem with random service and arrival times

We study a stochastic outpatient appointment scheduling problem (SOASP) in which we need to design a schedule and an adaptive rescheduling (i.e., resequencing or declining) policy for a set of patients. Each patient has a known type and associated probability distributions of random service duration and random arrival time. Finding a provably optimal solution to this problem requires solving a multistage stochastic mixed‐integer program (MSMIP) with a schedule optimization problem solved at each stage, determining the optimal rescheduling policy over the various random service durations and arrival times. In recognition that this MSMIP is intractable, we first consider a two‐stage model (TSM) that relaxes the nonanticipativity constraints of MSMIP and so yields a lower bound. Second, we derive a set of valid inequalities to strengthen and improve the solvability of the TSM formulation. Third, we obtain an upper bound for the MSMIP by solving the TSM under the feasible (and easily implementable) appointment order (AO) policy, which requires that patients are served in the order of their scheduled appointments, independent of their actual arrival times. Fourth, we propose a Monte Carlo approach to evaluate the relative gap between the MSMIP upper and lower bounds. Finally, in a series of numerical experiments, we show that these two bounds are very close in a wide range of SOASP instances, demonstrating the near‐optimality of the AO policy. We also identify parameter settings that result in a large gap in between these two bounds. Accordingly, we propose an alternative policy based on neighbor‐swapping. We demonstrate that this alternative policy leads to a much tighter upper bound and significantly shrinks the gap.