基于分解的多目标布谷鸟搜索算法求解多无人机协同任务分配问题

多无人机协同任务分配问题是一个多目标优化问题,将多目标优化问题转化为单目标优化问题的传统方法易造成决策的主观性和片面性.为帮助决策者做出科学决策,提出了一种基于分解的多目标布谷鸟搜索算法用于求解多无人机协同任务分配问题.通过对多无人机协同任务分配问题分析,建立了多无人机协同任务分配模型.将布谷鸟搜索算法的两个关键组件转化为多目标优化算法的繁殖算子,并结合一种自适应算子选择策略,构成了多目标布谷鸟搜索算法.设计了一种新的编码方案,将带约束的多目标优化问题转为无约束的多目标优化问题.仿真实验表明,多目标布谷鸟搜索算法能有效求解多无人机协同任务分配问题.     

基于改进粒子群算法的协同多目标攻击空战决策

超视距空战和协同多目标攻击是空战的发展趋势,协同多目标攻击中的关键问题是空战决策。建立了协同多目标攻击空战决策的多目标优化数学模型,提出了一种改进的粒子群优化算法,并将其应用于空战决策。基本的粒子群算法是一个有效的求解连续优化问题的方法,结合遗传算法的思想,提出了直接对粒子进行交叉和变异操作来完成粒子更新的方法。仿真结...     

一种武器-目标分配模型及求解算法

武器-目标分配是拟制作战计划的一项重要内容,是合理运用现有武器系统,充分发挥其作战效能的关键.依据火力分配的基本要素,针对多种武器对多个目标的分配问题,运用一种基于模糊优选技术的多目标混合优化理论,建立了武器-目标最佳分配模型,然后用遗传算法来求解,并在计算机条件下对求解的效果进行了检验.     

基于MOEA/D的柔性结构燃料—时间多目标优化控制研究

利用基于分解的多目标优化算法(MOEA/D)研究了柔性航天器多目标优化的rest-to-rest机动问题.基于空间飞行器刚柔耦合动力学方程,提出了最小时间-最少耗能的多目标优化控制模型;给出了基于MOEA/D的算法框架,并对柔性飞行器空间机动问题进行了多目标优化控制的分析设计;典型算例表明该算法可有效地应用于柔性航天器姿态机动控制器的分析设计之中.     

基于边界交叉法的高超声速滑翔飞行器多目标轨迹优化研究

针对高超声速滑翔飞行器复杂约束条件下多目标轨迹设计问题，基于边界交叉法和伪谱法提出了其多目标轨迹优化方法。首先，分析了高超声速滑翔飞行器复杂约束轨迹优化问题的特点，提出了多目标轨迹优化问题。然后，采用边界交叉法和伪谱法将多目标轨迹优化问题转化为一组单目标优化子问题，利用非线性规划算法分别求解。在优化过程中，将已求解子问题的解作为下一个子问题的初始值。利用上述方法求解了最大横程和最小峰值热流轨迹优化问题，仿真结果表明：本文方法能够有效搜索到优化轨迹的Pareto前沿，可以为高超声速滑翔飞行器轨迹设计提供参考。     

小行星探测多脉冲交会轨道多目标优化

现有的小行星探测交会轨道研究多集中于二脉冲最优燃料研究,本文则研究了小行星探测多脉冲交会轨道多目标优化问题.基于Lambert交会算法建立了包含地球逃逸轨道和日心转移轨道的多脉冲交会轨道优化模型,以燃料消耗最小和转移时间最短为两个优化目标函数.采用一类典型的多目标进化算法——NSGA -Ⅱ用于Pareto最优解的确定....     

发射与制导分离的编队协同防空目标分配决策

为解决舰艇编队协同防空中发射和制导分离时的动态目标分配问题,以编队生存概率最大、目标突防综合威胁值最小和制导单元分配效益最优为最优函数,建立了动态多目标优化分配决策模型及状态的动态更新方式.采用多项改进措施设计了动态多目标粒子群优化求解算法及流程.仿真结果表明,所建立的目标分配模型能较好地解决舰舰协同防空中火力通道固定和分离时的不同分配问题,并得到了一些有益结论.     

适用于复杂系统仿真试验的试验设计方法

拉丁超立方试验设计是"充满空间"试验设计方法的重要领域.传统拉丁超立方试验设计优化以列相关系数最小化或试验点之间最大距离最小为单一优化准则,这种单目标试验设计优化方法存在缺陷.提出了将两类优化准则作为优化目标的多目标优化准则,以及实现多目标优化的改进ESE算法.算例分析证明,提出的试验设计优化算法优于已有典型试验设计方法.     

信息融合系统中的多传感器优化分配

在舰载多传感器信息融合系统中,对传感器优化分配问题进行了研究.充分考虑目标身份和目标优先级等信息,依据最大信息增益准则,建立了传感器优化分配的数学模型,并对算法进行了仿真实验.     

交互式增广加权范数法及其应用

本文提出利用增广加权范数把多目标优化问题转化为标量优化问题,证明了转化后的问题与原问题完全等价,同时给出了目标函数值与权系数的关系,建立了以目标函数值作为交互媒介的多目标优化方法,最后给出了应用该方法的一个实例。     

认知无线Mesh网络中资源节约的最小信道冲突值组播路由算法

认知无线Mesh网络中满足服务质量约束的多目标优化组播路由问题比单目标优化组播问题更加复杂,为了快速求解认知无线Mesh网络中满足服务质量约束的、以最小化资源消耗与最小化信道冲突值为目标的多目标优化组播路由问题,提出一种基于粒子群优化算法的问题求解框架,包括问题描述、粒子编码与粒子初始化、适应度函数、粒子飞行、粒子变异、粒子消环。粒子由表示节点之间连接关系的带权邻接矩阵表示,重新定义了用于粒子飞行的3种运算规则以及粒子飞行运算和粒子变异运算。仿真结果表明提出的算法能达到预定目标,资源消耗较低且能获得较低的信道冲突值。     

基于GRA-PSO算法的端铣工艺参数多目标优化

考虑生产实际的需求,综合最小变形误差、最大金属切除率和最大刀具耐用度建立端铣工艺参数多目标优化模型。通过对粒子群全局寻优能力和灰色理论的适应性综合分析,研究提出耦合粒子群算法（Particle Swarm Op-timization,PSO）和灰色关联（Gray Relevancy Analysis,GRA）的多目标工艺参数优化算法。该方法将多目标函数的优化问题转化为优化单项灰关联度,得到了多项工艺指标要求下的参数优化组合。将该方法应用在多目标工艺参数优化设计中取得了满意的结果,表明其具有很大的适应性。     

需求可拆分的应急物资调度问题的蚁群算法

应急物资调度问题是个典型的需求可拆分的车辆路径问题,区别于传统的车辆路径问题,将每个需求节点只能由一辆车访问的约束去除,允许需求节点由多辆车进行访问。针对应急物资调度问题的特点,建立相应的多目标车辆路径数学规划模型(SDVRP),并根据模型特点设计改进蚁群优化算法。最后,进行相应的算例分析,验证了该模型和算法的有效性。     

面向多平台多目标协同跟踪的指派问题

针对多平台多目标协同跟踪中要求多个无人地面平台尽可能均匀地协同跟踪多个目标的特点,提出了改进的离散粒子群优化算法。首先采用连续型粒子群优化算法中的速度和位置迭代公式,然后对粒子位置进行离散编码,使粒子编码对应于可行的指派方案;其次,在优化算法中引入局部搜索,提高算法寻优性能。最后将所提算法应用于多平台多目标协同跟踪中的指派问题,并与未加入局部搜索的粒子群优化算法比较,仿真结果表明,加入局部搜索后的离散粒子群优化算法具有较好的寻优性能。     

Solving multifacility location problems involving euclidean distances

This paper considers the problem of locating multiple new facilities in order to minimize a total cost function consisting of the sum of weighted Euclidean distances among the new facilities and between the new and existing facilities, the locations of which are known. A new procedure is derived from a set of results pertaining to necessary conditions for a minimum of the objective function. The results from a number of sample problems which have been executed on a programmed version of this algorithm are used to illustrate the effectiveness of the new technique.     

基于遗传算法的车用散热器优化设计

选取散热器的散热量、体积和压降作为优化目标,采用线性加权法建立了散热器的多目标优化模型。在给定的散热器原始数据和性能要求条件下,对散热器芯体的外形尺寸和翅片参数进行了优化。介绍了遗传优化算法的执行步骤和流程,在此基础上开发了优化程序。结果表明,优化后散热器的散热量明显增大,散热器芯体的体积和压降也有不同程度的减小。     

A self‐adapting genetic algorithm for project scheduling under resource constraints

This papers deals with the classical resource‐constrained project scheduling problem (RCPSP). There, the activities of a project have to be scheduled subject to precedence and resource constraints. The objective is to minimize the makespan of the project. We propose a new heuristic called self‐adapting genetic algorithm to solve the RCPSP. The heuristic employs the well‐known activity list representation and considers two different decoding procedures. An additional gene in the representation determines which of the two decoding procedures is actually used to compute a schedule for an individual. This allows the genetic algorithm to adapt itself to the problem instance actually solved. That is, the genetic algorithm learns which of the alternative decoding procedures is the more successful one for this instance. In other words, not only the solution for the problem, but also the algorithm itself is subject to genetic optimization. Computational experiments show that the mechanism of self‐adaptation is capable to exploit the benefits of both decoding procedures. Moreover, the tests show that the proposed heuristic is among the best ones currently available for the RCPSP. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 433–448, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10029     

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     

伺服机构故障下基于线性规划的运载火箭姿控系统重构控制

发动机伺服机构故障给新一代运载火箭姿控系统的可靠性和安全性带来挑战,亟须开展重构控制策略研究。针对这一问题,提出一种基于线性规划的摆角重构控制分配方法。将伺服机构故障下的摆角分配问题转化为1范数单目标有约束优化问题,进而转化为标准的线性规划模型,采用单纯形法进行求解。仿真结果表明,所提出的线性规划法能够实现伺服机构故障下姿控系统的完全重构,各摆角均未达到饱和值,表明了方法的有效性。     

Bicriteria product design optimization: An efficient solution procedure using AND/OR trees

Competitive imperatives are causing manufacturing firms to consider multiple criteria when designing products. However, current methods to deal with multiple criteria in product design are ad hoc in nature. In this paper we present a systematic procedure to efficiently solve bicriteria product design optimization problems. We first present a modeling framework, the AND/OR tree, which permits a simplified representation of product design optimization problems. We then show how product design optimization problems on AND/OR trees can be framed as network design problems on a special graph—a directed series‐parallel graph. We develop an enumerative solution algorithm for the bicriteria problem that requires as a subroutine the solution of the parametric shortest path problem. Although this parametric problem is hard on general graphs, we show that it is polynomially solvable on the series‐parallel graph. As a result we develop an efficient solution algorithm for the product design optimization problem that does not require the use of complex and expensive linear/integer programming solvers. As a byproduct of the solution algorithm, sensitivity analysis for product design optimization is also efficiently performed under this framework. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 574–592, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10031