地球静止轨道高能电子通量在线预测模型研究

利用粒子群优化算法和最小二乘支持向量机,建立了地球静止轨道高能电子通量(1.8-3.5MeV)在线预测模型。针对粒子群优化算法,提出了一种新的粒子群多样性测度计算方法,有效改善了其早熟收敛现象;基于改进的粒子群优化算法优化最小二乘支持向量机的正则化参数和核参数;利用滑动时间窗口策略更新模型数据,设计变量选择触发机制以及模型的再学习机制实现模型的在线预测功能。[根据题目的调整,对摘要做了相应改动]通过对2000年电子通量监测数据和相关太阳风、地磁参数等实际数据进行提前1-3天的预测实验,表明了所建在线预测模型具有较高的预测性能,有一定的实用价值。     

基于蝙蝠算法的多目标战备物资调运决策优化

战备物资的调运是部队后勤工作中十分重要的一环,面对复杂多变的战场环境,战备物资调运必须进行科学合理的决策优化。然而现有战备物资调运模型的优化模型较为复杂,如果涉及较多供应点和目标要求则不易实现。针对涉及多个调运点的多目标战备物资调运问题,提出一种新的决策优化模型,利用启发式蝙蝠算法进行优化计算,发挥出蝙蝠算法易于实现、性能优越的特点,较好地解决了涉及较多供应点的多目标战备物资调运决策优化问题,并结合一个仿真算例,证明该方法相对于其他方法更具简易性和有效性。     

Expansion planning for waste‐to‐energy systems using waste forecast prediction sets

We consider an expansion planning problem for Waste‐to‐Energy (WtE) systems facing uncertainty in future waste supplies. The WtE expansion plans are regarded as strategic, long term decisions, while the waste distribution and treatment are medium to short term operational decisions which can adapt to the actual waste collected. We propose a prediction set uncertainty model which integrates a set of waste generation forecasts and is constructed based on user‐specified levels of forecasting errors. Next, we use the prediction sets for WtE expansion scenario analysis. More specifically, for a given WtE expansion plan, the guaranteed net present value (NPV) is evaluated by computing an extreme value forecast trajectory of future waste generation from the prediction set that minimizes the maximum NPV of the WtE project. This problem is essentially a multiple stage min‐max dynamic optimization problem. By exploiting the structure of the WtE problem, we show this is equivalent to a simpler min‐max optimization problem, which can be further transformed into a single mixed‐integer linear program. Furthermore, we extend the model to optimize the guaranteed NPV by searching over the set of all feasible expansion scenarios, and show that this can be solved by an exact cutting plane approach. We also propose a heuristic based on a constant proportion distribution rule for the WtE expansion optimization model, which reduces the problem into a moderate size mixed‐integer program. Finally, our computational studies demonstrate that our proposed expansion model solutions are very stable and competitive in performance compared to scenario tree approaches. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 47–70, 2016     

非线性系统的神经网络广义预测控制

研究了神经网络广义预测控制方法在非线性系统中的应用,基于BP网络构造神经网络预测器,利用非线性系统的开环输入输出数据离线训练神经网络,根据拟牛顿BFGS优化算法使得二次型性能指标函数达到最小,得到了最优的控制序列。同时给出了神经网络广义预测控制算法的步骤,讨论了提高系统鲁棒性的措施。仿真结果表明,这种神经网络预测控制算法具有响应速度快、控制效果好和跟踪精度高等特点。     

声纳浮标均匀布放问题研究

针对声纳浮标的均匀布放问题,借鉴喷泉最优布放模型对此进行了研究。对声纳浮标的作用距离、平均场强、平均偏离强度进行建模,采用数值算法对正三角形阵的最优布放间隔进行了计算,并对其余两种阵型的计算方法进行了论述。经分析,认为正三角形、正四边形、正六边形是符合要求的三种基本阵型。所求得浮标间距能够满足工程上的要求,能够为反潜机的浮标布放提供决策依据。     

四种智能算法的比较研究

随着智能算法的研究深入,一些新的智能优化算法不断被提出,包括从遗传算法、蚁群算法、粒子群算法、人工鱼群算法等。这些算法都是从自然界的自然生物的特性启发而研究出来的,由于这些算法在求解时不依赖于梯度信息,因而特别适用于传统方法解决不了的大规模复杂问题。通过这些算法的介绍和分析,并通过测试函数测试了四种算法的收敛性、收敛速度和精度,评价了这些智能算法在求解函数优化问题的能力。最后对优化算法今后的发展方向进行了评述与展望。     

基于运载能力评估的固体运载火箭推力向量控制方案比较

从对运载能力影响角度开展固体运载火箭发动机推力向量控制系统比较分析研究。设计了三种采用不同发动机推力向量控制系统的多级固体运载火箭方案,将增广乘子法与共轭方向法相结合,对固体运载火箭上升段弹道进行了优化设计,给出运载能力评估结果。研究表明,起飞质量均为50 000kg,目标轨道均为300km太阳同步轨道时,采用栅格舵和侧喷流作为推力向量控制系统方案,比采用燃气舵和侧喷流作为推力向量控制系统方案,运载能力提高70kg,比各级固体发动机全部采用摆动喷管控制方案,运载能力提高115kg,为固体运载火箭总体方案论证提供理论依据。     

Equitable bandwidth allocation in content distribution networks

Applications for content distribution over networks, such as Video‐on‐Demand (VOD), are expected to grow significantly over time. Effective bandwidth allocation schemes that can be repeatedly executed must be deployed since new programs are often installed at various servers while other are deleted. We present a model for bandwidth allocation in a content distribution network that consists of multiple trees, where the root of each tree has a server that broadcasts multiple programs throughout the tree. Each network link has limited capacity and may be used by one or more of these trees. The model is formulated as an equitable resource allocation problem with a lexicographic maximin objective function that attempts to provide equitable service performance for all requested programs at the various nodes. The constraints include link capacity constraints and tree‐like ordering constraints imposed on each of the programs. We present an algorithm that provides an equitable solution in polynomial time for certain performance functions. At each iteration, the algorithm solves single‐link maximin optimization problems while relaxing the ordering constraints. The algorithm selects a bottleneck link, fixes various variables at their lexicographic optimal solution while enforcing the ordering constraints, and proceeds with the next iteration. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

基于小波配点法的空间机械臂关节轨迹规划

针对平面型空间机械臂关节轨迹优化问题,提出一种基于小波配点法的数值算法。该算法在区间样条小波函数及其导数算法的基础上,对状态变量与控制变量在小波配点上作离散化处理,然后将原最优控制问题转化为以小波系数为优化参数的非线性规划问题,利用非线性规划算法求解该问题得到原问题的解。算法可充分利用小波具有非线性逼近的优点,提高计算精度和效率。对典型问题进行数值仿真,结果表明该算法对空间机械臂关节轨迹优化问题是有效的。     

面向信息化战争的广义兰切斯特作战模型

由于经典兰切斯特方程不能描述信息对于信息化战争的影响,因此在分析兰切斯特线性律和平方律的基础上,通过引入战场感知系数和信息优势系数,并利用信息优势系数对线性律和平方律中毁伤系数进行修正,提出了能够描述信息对战争影响的广义兰切斯特作战模型,仿真实验结果说明其能够有效地描述信息优势对于改变战争进程所发挥的重要作用。该模型为研究信息化战争的交战过程提供理论参考。