多重优化的分布式无线覆盖探测算法

为满足无线通信网络信号覆盖有效性的实时实地可重复探测的需求,提出一种基于传感器网络的分布式无线覆盖探测算法。通过随机部署于目标区域内的无线传感器节点对无线通信网接收信号强度进行感知和预处理;利用变异函数构造新的BP神经网络目标函数,通过改进粒子群算法优化其初始权值和阈值;利用训练好的网络模型对存在探测盲区的目标区域进行插值估计,并联合传感器节点采集到的数据生成无线通信网络等信号强度线。仿真结果表明,所提算法比其他经典算法具有更高的精度,可有效探测目标区域无线通信网络的信号覆盖情况。     

基于粒子群算法的宽带真延时平面阵列方向图综合

针对大阵元间距平面阵列方向图综合问题,提出基于粒子群算法的宽带真延时平面阵列方向图综合方法。该方法根据真延时条件下阵列方向图主瓣和栅瓣指向的特点,采用宽带真延时抑制阵列方向图的栅瓣;利用粒子群优化算法优化阵列结构,得到具有较高主副瓣比的平面阵列方向图。通过对8×8的矩形平面阵进行仿真,验证了所提方法的有效性,在此基础上,还仿真研究了该方法对栅瓣的抑制性能与信号带宽之间的关系。     

IIR数字滤波器联立优化CAD

文中介绍了多目标联立最佳逼近CAD方法,对各种设计方法的性能作了分析比较,提出了改善途径。程序在IBM-PC/XT微机上运行通过,文中给出了应用线性相位IIR数字滤波器线性规划逼近法设计的低通实例。     

稳定特征选择的多目标蚁群优化

为了提高进化算法特征选择稳定性,提出一种面向稳定特征选择的多目标蚁群优化方法。通过抽样策略集成三种特征排序法的输出作为多目标蚁群优化的稳定性指导信息,聚合特征的费舍尔分值和最大信息系数值作为多目标蚁群优化的启发式信息,以分类正确率和扩展昆彻瓦指标值作为两个优化目标,兼顾算法的分类性能与特征选择稳定性。在四个标准数据集上进行对比实验,结果表明,所提方法能够在分类性能与稳定性方面达到较好的平衡。     

装备寿命周期备件供应网络优化方法

针对现有备件供应优化方法未从寿命周期角度考虑备件供应优化问题,将寿命周期不同阶段的备件需求特征融入备件供应网络设计中,实施动态需求特征下的寿命周期整体优化。深入分析寿命周期不同阶段的备件需求特征;建立备件供应响应时间转移方程,在此基础上,构建使寿命周期备件保障效益最大的多目标混合整数规划模型。通过仿真案例证明了多种备件保障模式的组合能够显著提高寿命周期保障效益,寿命周期整体优化可以实施更高效的备件供应。     

Partitioning of biweighted trees

A districting problem is formulated as a network partitioning model where each link has one weight to denote travel time and another weight to denote workload. The objective of the problem is to minimize the maximum diameter of the districts while equalizing the workload among the districts. The case of tree networks is addressed and efficient algorithms are developed when the network is to be partitioned into two or three districts. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 143–158, 2002; DOI 10.1002/nav.10003     

多目标的分布式协同进化MDO算法

通过引入非优超排序和排挤的多目标处理机制 ,将分布式协同进化MDO算法的能力扩展到多目标的多学科设计优化问题。多目标的分布式协同进化MDO算法在保持各学科充分自治和各学科并行设计优化协同的基础上 ,通过一次运行即可获得具有良好分布的多个Pareto最优解 ,逼近整个Pareto最优前沿。应用于导弹气动 /发动机 /控制三学科两目标设计优化问题 ,与约束法计算结果的对比表明算法能够有效逼近该问题的Pareto最优前沿 ,为设计决策提供了丰富的信息     

稳态随机过程激励下基于首次超越破坏的结构优化设计

把结构系统动力可靠性分析与最优化设计结合起来 ,以结构系统的最小质量为目标函数 ,给出了考虑在平稳随机过程激励下多自由度线性系统总的可靠性的结构优化设计方法。运用谱分析理论 ,推导了结构系统在平稳随机过程激励下响应的统计特征 ,同时结合首次超越破坏的Possion模型计算结构系统的可靠性 ,最终采用广义乘子法得到结构系统设计变量的最优值。计算结果表明该方法是可行的     

Balancing a one‐way corridor capacity and safety‐oriented reliability: A stochastic optimization approach for metro train timetabling

In urban rail transit systems of large cities, the headway and following distance of successive trains have been compressed as much as possible to enhance the corridor capacity to satisfy extremely high passenger demand during peak hours. To prevent train collisions and ensure the safety of trains, a safe following distance of trains must be maintained. However, this requirement is subject to a series of complex factors, such as the uncertain train braking performance, train communication delay, and driver reaction time. In this paper, we propose a unified mathematical framework to analyze the safety‐oriented reliability of metro train timetables with different corridor capacities, that is, the train traffic density, and determine the most reliable train timetable for metro lines in an uncertain environment. By employing a space‐time network representation in the formulations, the reliability‐based train timetabling problem is formulated as a nonlinear stochastic programming model, in which we use 0‐1 variables to denote the time‐dependent velocity and position of all involved trains. Several reformulation techniques are developed to obtain an equivalent mixed integer programming model with quadratic constraints (MIQCP) that can be solved to optimality by some commercial solvers. To improve the computational efficiency of the MIQCP model, we develop a dual decomposition solution framework that decomposes the primal problem into several sets of subproblems by dualizing the coupling constraints across different samples. An exact dynamic programming combined with search space reduction strategies is also developed to solve the exact optimal solutions of these subproblems. Two sets of numerical experiments, which involve a relatively small‐scale case and a real‐world instance based on the operation data of the Beijing subway Changping Line are implemented to verify the effectiveness of the proposed approaches.     

加权模糊C均值聚类算法实现BDS三频组合观测值优选

在对BDS三频载波相位组合观测值进行误差分析的基础上,确定了优选载波相位线性组合系数的筛选标准。针对传统聚类算法在高维多频混合数据集分类中存在的不足,采用一种基于加权的模糊C均值聚类算法,通过对同一维度在不同簇上赋予不同的权重值,对传统遍历搜索法所获得的部分BDS三频载波相位组合观测值进行了优化分类选取,有效解决了传统全球导航卫星系统载波相位观测值选取方法效率低的问题,同时为多系统多频数据组合观测值系数的优化选取提供了一种新的思路。对分类结果进行分析,确定了各类组合观测量的适用范围,并结合实测数据,利用无几何层叠模糊度解算方法对优选组合进行了整周模糊度的解算,结果验证了该方法的可行性。