小波变换在漏磁检测信号处理中的应用

在对军用装备进行漏磁无损检测时,漏磁信号中含有大量噪声,针对这种情况,介绍了小波变换消噪理论.在数字化实现中,离散小波变换是利用Mallat分解与重构算法来完成.仿真试验中,选取二阶样条小波为小波函数,对从漏磁检测装置中采集到的漏磁信号进行消噪.结果表明将小波变换应用于炮管漏磁检测中,能提高检测信号的信噪比和抗干扰能力.为漏磁信号分析、特征提取和缺陷漏磁反演打下了基础.     

基于遗传BP神经网络的装备研制风险分析方法

简要介绍了GA和BP算法,利用遗传算法全局性搜索的特点,改变BP算法依赖梯度信息的指导来调整网络权值的方法,寻找最为合适的网络连接权和网络结构,提出了遗传算法优化BP神经网络的思路及其数学模型.最后,结合对某型航空装备的风险源的分析,利用此优化模型进行了验证.结果表明了该方法的可行性,为装备研制风险分析提供了一种新思路.     

基于风险控制的装备供应链网络设计模型

针对风险管理中的装备供应链正向（供应）网络设计问题,在对装备供应链风险和成本进行量化分析的基础上,综合考虑风险和成本2方面因素,建立了基于风险控制的装备供应链网络设计优化模型。并设计了遗传算法对模型进行求解,给出在指定风险水平下最优设计方案与总成本。最后通过实例分析和计算,结果表明,该优化模型合理、有效、可行。     

电子侦察卫星联合侦察的混合调度算法

针对电子侦察卫星的使用约束,及不同任务的调度需求,建立了电子侦察卫星联合侦察的多目标混合整数规划模型.利用进化算法的全局搜索能力和变邻域搜索的局部优化能力,提出了一种多目标进化算法和变邻域搜索相结合两阶段混合调度算法MOEA VNS.针对问题多时间窗组合优化特点,设计了进化算子与邻域移动算子,在确保解多样性的同时使算法...     

基于遗传算法的雷达管控问题

通过对雷达组网系统责任区保障问题的深入研究,以完成对责任区的保障任务为目的,使责任区各个高度层均满足一定联合探测概率和雷达覆盖系数为约束条件,以雷达网整体工作代价最小为目标函数,构建了有干扰情形对雷达的管理和控制(以下简称雷达管控)数学模型。运用改进的遗传算法对雷达管控模型进行求解,通过设定保护概率保存了最优个体的遗传性,通过合理的算法参数设置改善了算法的性能。仿真算例和实际应用结果表明,雷达管控达标率由管控前的36.54%上升到63.46%,达到100%,雷达管控结果符合管控要求,且雷达开机数量较少,采取的抗干扰措施合理,验证了模型和方法的有效性。     

联合作战中作战单元决策演化博弈研究

利用演化博弈理论,探讨了联合作战中担负相同作战任务的作战单元间其策略选择根据利益变化的演化过程,建立了复制动态方程并求得平衡点解,通过复制动态的相位图直观反映了博弈的演化稳定策略,并通过Malab软件对作战单元策略选择与收益关系进行了仿真,其行为选择的演化结果与相位图展示具有一致性。研究结论表明,收益大小及变化是作战单元策略改变的重要依据,最后针对提高作战单元间的策略稳定性提出对策建议.     

超燃冲压发动机二维进气道多级多目标优化设计方法

提出了超燃冲压发动机二维进气道的多级多目标设计方法。选择总压恢复系数、压升比和阻力系数为性能目标,引入多级设计概念,分别基于一维气动力学分析方法和计算流体力学方法,采用混合遗传算法对4楔角外压和2楔角内压混合压缩进气道进行了多级多目标优化设计,得到了问题的Pareto非劣解集。采用上述方法可以提升超燃冲压发动机进气道的设计水平,得到高性能的设计方案。     

Balancing perfectly periodic service schedules: An application from recycling and waste management

A national recycling and waste management company provides periodic services to its customers from over 160 service centers. The services are performed periodically in units of weeks over a planning horizon. The number of truck‐hours allocated to this effort is determined by the maximum weekly workload during the planning horizon. Therefore, minimizing the maximum weekly workload results in minimum operating expenses. The perfectly periodic service scheduling (PPSS) problem is defined based on the practices of the company. It is shown that the PPSS problem is strongly NP‐hard. Attempts to solve large instances by using an integer programming formulation are unsuccessful. Therefore, greedy BestFit heuristics with three different sorting schemes are designed and tested for six real‐world PPSS instances and 80 randomly generated data files. The heuristics provide effective solutions that are within 2% of optimality on average. When the best found BestFit schedules are compared with the existing schedules, it is shown that operational costs are reduced by 18% on average. © 2012 Wiley Periodicals, Inc. Naval Research Logistics 59: 160–171, 2012     

A misclassification cost‐minimizing evolutionary–neural classification approach

Machine learning algorithms that incorporate misclassification costs have recently received considerable attention. In this paper, we use the principles of evolution to develop and test an evolutionary/genetic algorithm (GA)‐based neural approach that incorporates asymmetric Type I and Type II error costs. Using simulated, real‐world medical and financial data sets, we compare the results of the proposed approach with other statistical, mathematical, and machine learning approaches, which include statistical linear discriminant analysis, back‐propagation artificial neural network, integrated cost preference‐based linear mathematical programming‐based minimize squared deviations, linear integrated cost preference‐based GA, decision trees (C 5.0, and CART), and inexpensive classification with expensive tests algorithm. Our results indicate that the proposed approach incorporating asymmetric error costs results in equal or lower holdout sample misclassification cost when compared with the other statistical, mathematical, and machine learning misclassification cost‐minimizing approaches. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006.     

一种含最优变异的多微粒群优化算法

针对微粒群优化算法中的固有缺点,提出了带有最优变异算子的多微粒群优化算法,采用多个微粒群对目标函数进行寻优,并在寻优过程中对子群中最优微粒引入了最优变异算子。通过这样的处理,算法可以预防早熟收敛并具有更快的收敛速度和更好的局部开发能力。对一组测试函数的模拟实验结果表明,带最优变异的多微粒群优化算法可以摆脱局部最优解对微粒的吸引,在较少的代数内就能够获得好的优化结果。