改进群智能算法多目标干扰决策

如何运用有限的干扰资源获得最大的干扰效益是电子对抗研究的重点技术之一,针对协同电子对抗,提出一种最优干扰决策方法,解决对抗资源和雷达目标数量不等的干扰资源分配问题。围绕组网雷达检测概率和定位精度2个评估指标,建立基于多目标优化的协同干扰决策任务模型。针对传统人工蜂群和蚁群算法流程寻优缓慢的问题,在候选解的搜索中自适应地增加与当次迭代最优解的交叉运算,给出两改进算法对模型的通用求解步骤,通过仿真验证算法提高了收敛速度。     

一种用于弹目分配的决策方法

针对海战场上多类型反舰导弹攻击舰艇编队的弹目分配问题展开研究,建立多阶段多目标优化数学模型,采用多目标进化算法NSGA-II求解模型,提出一种基于改进专家法赋权的组合距离评估——灰色关联分析法CODAS＿GRA,可从求解得到的Pareto最优解集中选出唯一的最优分配方案。该方法将CODAS和GRA两种不同决策方法的优点进行结合,采用改进熵权法确定不同决策方法的偏好系数。实验表明,与其他5种未考虑领域特点的通用多准则决策方法相比,该方法所选出的弹目分配方案能够同时兼顾最大化毁伤效能和最小化弹药消耗两个目标,合理性强,方案更优。     

强化学习在多阶段装备组合规划问题中的应用

针对多阶段武器装备组合规划中的选择难、规划难问题,提出基于多目标优化算法以及强化学习技术的混合优化方法。在各个阶段以装备组合效能最大和成本最小为准则,构建单阶段多目标优化模型,并设计基于非支配排序遗传算法的求解算法以生成各阶段的Pareto解,在此基础上建立多阶段的组合优化模型。通过强化学习的Q-Learning方法,在各阶段的Pareto解中采用探索或者利用两种模式,生成各阶段的装备组合,并指导下一阶段的装备选型,从而生成整个周期内的规划方案。通过对比实验分析,验证了所提模型和算法的有效性,能够为多阶段武器装备组合规划提供辅助决策。     

面向武器装备体系组合规划的集成决策优化框架

针对当前武器装备体系组合规划存在选择空间规模大、决策目标数量多等问题,提出一种集成决策优化框架,用于组合选择和规划武器装备的发展型号、时间和数量。首先对武器装备体系组合规划问题的NP-Hard和高维多目标性质进行定量化分析和公式化描述;然后采用目标规划方法将该问题构建为双目标优化模型;再基于NSGA-II多目标演化计算方法,开发面向本问题的优化算法,求得该模型的Pareto解集合;最后通过TOPSIS方法,从Pareto解集合中求取符合决策者偏好的满意解。通过某侦察预警监视体系发展规划示例,验证了当给定经验数据和决策者偏好信息后,该框架可获得符合要求的武器装备体系组合规划方案,能够支撑武器装备体系发展论证和规划。     

一种基于蚁群算法的准动态防空武器分配算法

武器目标分配问题是一个典型的限制组合优化问题,旨在得到在整个防御阶段中针对目标函数的最优武器分配方案。分配算法主要分为静态和动态两大类。针对传统静态分配模型中存在的几点问题,提出了基于时间窗的准动态武器目标分配算法,该算法综合考虑拦截概率、拦截时间和武器耗费多个优化指标,并将该算法推广至多类防空武器的优化分配中。通过大量实验验证,该算法在性能、时间复杂度等方面均有较大优势,并且能较好地适应战场态势的变化,及时调整分配方案,具有很好的实用性。     

基于改进的PSO算法解决雷达网布站优化问题

雷达网布站优化是电子对抗仿真的重要组成部分,雷达网布站是否合理直接影响雷达网作战效能.而常规优化算法相对复杂,易陷于局部最优解.针对这一问题,提出适用于解决雷达网布站优化问题的改进粒子群优化算法,并且将所提出的算法与遗传算法进行了比较.仿真结果表明,与遗传算法相比,在相同的条件下,改进粒子群优化算法具有精度较高且不易陷入局部最优解的优点,较好地解决了静态条件下雷达网布站优化问题.     

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

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

空中多飞行器飞行轨迹优化数值仿真

针对空中多飞行器在复杂环境中飞行轨迹的多目标最优问题，分析了多飞行器飞行过程中各种可视和不可视约束条件。基于在回避威胁区前提下燃料消耗最少、飞行时间最短的综合性能指标，采用“多方法组合”思路，提出了改进动态规划法和多点边值法组合算法，并进行了仿真验证，大量C＋＋数值飞行仿真结果表明该算法能够在考虑外界复杂环境和飞行器各种约束条件下快速规划出空中多飞行器的最优飞行轨迹，该组合算法具有一定的实用性和创新性。     

分布式综合化航空电子网络拓扑优化技术

针对分布式综合化(DIMA)架构下实时动态消息流和网络资源能力,优化航空数据和通信网络(ADCN)拓扑问题,提出一种基于业务拓扑、网络拓扑以及延迟、线缆约束下的多目标网络拓扑优化算法。该算法能够基于驻留任务的信号、逻辑连接、物理连接关系,在资源约束下优化机载网络拓扑。算法通过组合优化方法计算折中全局最优解集(Pareto最优)。对于大规模机载网络架构优化,为了减少计算规模和提高计算时间,又提出一种预计算路径算法。算法通过类A320机载网络拓扑场景和类A380机载网络拓扑场景进行验证。结果表明,相比手动功能映射和网络拓扑优化设计,优化效率能提高10%～30%。     

基于混合粒子群优化的多目标决策新方法

多目标优化问题中的一个关键在于合理地评判各有效解的优劣。通过引入灰色系统理论中灰色关联度的概念作为评判准则,结合粒子群优化算法进行有约束多目标规划问题的研究。提出了一种新的不可行解的保留策略,进化过程中以此策略保留适量的不可行解,有利于增强对约束边界附近可能的最优解的搜索,同时,针对粒子群优化算法的容易陷入局部最优的缺点,实现了以粒子群优化为载体的混合算法:即对全局极值邻域进一步混沌搜索寻优。仿真结果表明改进的算法对多目标决策问题是有效的。     

Pseudo-monotonic interval programming

A pseudo-monotonic interval program is a problem of maximizing f(x) subject to x ε X = {x ε Rⁿ | a < Ax < b, a, b ε R^m} where f is a pseudomonotonic function on X, the set defined by the linear interval constraints. In this paper, an algorithm to solve the above program is proposed. The algorithm is based on solving a finite number of linear interval programs whose solutions techniques are well known. These optimal solutions then yield an optimal solution of the proposed pseudo-monotonic interval program.     

A bicriterion approach to common flow allowances due window assignment and scheduling with controllable processing times

We investigate a single‐machine scheduling problem for which both the job processing times and due windows are decision variables to be determined by the decision maker. The job processing times are controllable as a linear or convex function of the amount of a common continuously divisible resource allocated to the jobs, where the resource allocated to the jobs can be used in discrete or continuous quantities. We use the common flow allowances due window assignment method to assign due windows to the jobs. We consider two performance criteria: (i) the total weighted number of early and tardy jobs plus the weighted due window assignment cost, and (ii) the resource consumption cost. For each resource consumption function, the objective is to minimize the first criterion, while keeping the value of the second criterion no greater than a given limit. We analyze the computational complexity, devise pseudo‐polynomial dynamic programming solution algorithms, and provide fully polynomial‐time approximation schemes and an enhanced volume algorithm to find high‐quality solutions quickly for the considered problems. We conduct extensive numerical studies to assess the performance of the algorithms. The computational results show that the proposed algorithms are very efficient in finding optimal or near‐optimal solutions. © 2017 Wiley Periodicals, Inc. Naval Research Logistics, 64: 41–63, 2017     

求解不确定型车辆路径问题的弱鲁棒优化方法

为降低鲁棒优化模型最优解的保守性,以最小化违约车辆数和总惩罚成本为目标,建立针对旅行时间不确定的开放式车辆路径问题的弱鲁棒优化模型。对于不确定数据集的每个取值,该模型的最优解可以使其目标函数值始终不超过某数值,进而改善最优解的保守性。为提高启发式算法发现最优解的概率,提出一种自设计遗传算法对模型进行求解,其主要思想是利用粒子群算法搜索出可使遗传算法预期产生最好解的算法要素,并将其进行组合,从而产生新的遗传算法。采用新产生的遗传算法对模型继续求解,输出最好解。计算结果表明:与以往的鲁棒优化方法相比,弱鲁棒优化方法的最优解的保守性显著降低。     

因素状态值为模糊数的变权综合决策方法

对因素权重为实数、因素状态值为模糊数的多因素不确定性决策问题,由实数型状态变权向量导出模糊数状态变权向量,得出模糊数变权公式,建立模糊数变权综合决策模型,最后给出一个应用模糊数变权综合决策模型的实例.     

基于遗传算法的协同多目标攻击空战决策方法

多机协同多目标攻击是未来空对空作战的一种重要形式。首先建立了多机协同空战的自主优势矩阵 ,并依据多人冲突决策理论构造了空战的总体优化指标向量 ,然后针对其他优化算法的不足 ,提出用遗传算法优化该指标向量 ,实现多机协同多目标攻击空战决策 ,最后对 2∶ 2空战进行了仿真。仿真结果证明了上述思想的正确性。     

Mathematical formulation and heuristic algorithm for the block relocation and loading problem

This study considers the block relocation and loading problem in container terminals. The optimal loading sequence and relocation location are simultaneously decided on the basis of the desired ship‐bay and initial yard space configuration. An integer linear programming model is developed to minimize the number of relocations in the yard space on the basis of no shifts in the ship bay. The accuracy of the model is tested on small‐scale scenarios by using CPLEX. Considering the problem size in the real world, we present a rule‐based heuristic method that is combined with a mathematical model for the removal, loading, and relocation operations. The influence of rules on algorithm performance is also analyzed, and the heuristic algorithm is compared with different types of algorithms in the literature. The extensive numerical experiments show the efficiency of the proposed heuristic algorithm.     

基于改进人工蜂群算法的漏磁缺陷轮廓重构

漏磁缺陷重构是指由检测到的漏磁信号重构缺陷轮廓及参数,是实现漏磁反演的关键。将局部最优解和全局最优解引入到人工蜂群算法(Artificial Bee Colony Algorithm,ABC)中,提出了一种基于改进人工蜂群算法的缺陷重构模型。在该模型中,径向基函数神经网络作为前向模型求解漏磁信号,改进人工蜂群算法用于求解反演问题中的优化问题。将改进人工蜂群算法和基本人工蜂群算法作为反演算法进行了比较,实验结果表明,改进人工蜂群反演算法精度较高,速度较快,同时对实测信号具有鲁棒性,是一种有效可行的漏磁反演新方法。     

On‐line parameter estimation for a partially observable system subject to random failure

In this paper, we study the on‐line parameter estimation problem for a partially observable system subject to deterioration and random failure. The state of the system evolves according to a continuous time homogeneous Markov process with a finite state space. The system state is not observable, except for the failure state. The information related to the system state is available at discrete times through inspections. A recursive maximum likelihood (RML) algorithm is proposed for the on‐line parameter estimation of the model. The RML algorithm proposed in the paper is considerably faster and easier to apply than other RML algorithms in the literature, because it does not require projection into the constraint domain and calculation of the gradient on the surface of the constraint manifolds. The algorithm is illustrated by an example using real vibration data. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

Heuristic algorithms for routing yard‐side equipment for minimizing loading times in container terminals

This paper discusses a method of routing yard‐side equipment during loading operations in container terminals. Both the route of yard‐side equipment (such as transfer cranes or straddle carriers) and the number of containers picked up at each yard‐bay is determined simultaneously. The objective of the problem in this paper is to minimize the total container‐handling time in a yard. The size of the search space can be greatly reduced by utilizing inherent properties of the optimal solution. An encoding method is introduced to represent solutions in the search space. A genetic algorithm and a beam search algorithm are suggested to solve the above problem. Numerical experiments have been conducted to compare the performances of the proposed heuristic algorithms against each other and against that of the optimal solution. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 498–514, 2003     

Flow shop scheduling with earliness,tardiness, and intermediate inventory holding costs

We consider the problem of scheduling customer orders in a flow shop with the objective of minimizing the sum of tardiness, earliness (finished goods inventory holding), and intermediate (work‐in‐process) inventory holding costs. We formulate this problem as an integer program, and based on approximate solutions to two different, but closely related, Dantzig‐Wolfe reformulations, we develop heuristics to minimize the total cost. We exploit the duality between Dantzig‐Wolfe reformulation and Lagrangian relaxation to enhance our heuristics. This combined approach enables us to develop two different lower bounds on the optimal integer solution, together with intuitive approaches for obtaining near‐optimal feasible integer solutions. To the best of our knowledge, this is the first paper that applies column generation to a scheduling problem with different types of strongly ????‐hard pricing problems which are solved heuristically. The computational study demonstrates that our algorithms have a significant speed advantage over alternate methods, yield good lower bounds, and generate near‐optimal feasible integer solutions for problem instances with many machines and a realistically large number of jobs. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004.