共查询到19条相似文献,搜索用时 687 毫秒
1.
《机器人》2014,(4)
为了有效提升自由漂浮空间机器人的负载能力,提出一种基于多目标粒子群优化(multi-objective particle swarm optimization,MOPSO)算法的多约束多目标轨迹优化方法.结合建立的负载操作模式下空间机器人系统动力学模型,将负载最大化问题转化为实现关节力矩、基座扰动和系统能量同时最小的多目标轨迹优化问题;建立了相应的多目标优化问题(multi-objective optimization problem,MOP)数学模型;基于MOPSO算法求解出满足负载最大化要求的Pareto最优解集,并在算法中对约束条件进行了有效的处理.通过仿真实验证明了所提方法的有效性. 相似文献
2.
针对MOPSO优化算法在优化多目标问题当中收敛程度较差和容易进入部分最优的缺点,提出一种基于高斯变异和自适应参考点融合的MOPSO优化算法。利用高斯变异位置更新方法改善解集提前停止寻优现象,提高MOPSO优化算法在寻找最优过程中寻找解集的多样性;采用自适应参考点的外部档案维护策略,将收敛性较差的粒子剔除,提高算法的收敛性。实验结果表明:改进的MOPSO算法同传统的MOPSO算法相比,反向代距离和超体积比有了明显的改善,具有更好的解集多样性和收敛性。 相似文献
3.
多目标微粒群优化算法综述 总被引:1,自引:0,他引:1
作为一种有效的多目标优化工具,微粒群优化(PSO)算法已经得到广泛研究与认可.首先对多目标优化问题进行了形式化描述,介绍了微粒群优化算法与遗传算法的区别,并将多目标微粒群优化算法(MOPSO)分为以下几类:聚集函数法、基于目标函数排序法、子群法、基于Pareto支配算法和其他方法,分析了各类算法的主要思想、特点及其代表性算法.其次,针对非支配解的选择、外部档案集的修剪、解集多样性的保持以及微粒个体历史最优解和群体最优解的选取等热点问题进行了论述,并在此基础上对各类典型算法进行了比较.最后,根据当前MOPSO算法的研究状况,提出了该领域的发展方向. 相似文献
4.
用多目标粒子群优化(MOPSO)算法的粒子位置更新模式替代NSGA Ⅱ的交叉操作,获得一个新的算法(NSGA Ⅱ MOPSO)。为使这两种差异较大的算法实现无缝融合,在NSGA Ⅱ算法范围内对MOPSO中特有的概念粒子及其速度、Pbest、引导者进行处理: 1)粒子对应于NSGA Ⅱ中子代群体的个体; 2)不再使用粒子速度概念; 3)不再使用粒子Pbest概念,代之以从父代群体中为每个粒子的每一维寻找一个最近的该粒子非支配个体; 4)每一个粒子的引导者可以是父代群体中稀疏程度最大的个体或者是按照二进制随机竞赛选择方法从父代群体中选择的一个个体,具体哪一种方式发挥作用依赖于预先设定的概率。另外,引入稀疏程度概念来评价粒子在目标函数空间的分布。6个算例的结果表明,与NSGA Ⅱ及最新的两种MOPSO算法(CLMOPSO 和 EM MOPSO)相比,新算法是一个有效、稳定的算法。 相似文献
5.
6.
作为一种简单有效的多目标智能优化算法,多目标模拟退火(MOSA)算法已经引起了广泛研究并在许多领域得到应用。针对近二十年来MOSA算法及其应用的进展进行了系统的综述和评论。首先描述了MOSA算法的基本框架;接着讨论了几种典型的MOSA算法,重点探讨了这些算法的接受概率函数的计算方法,并对这些算法进行归类性分析;然后介绍了MOSA算法的应用进展;最后,根据当前MOSA算法的研究状况,展望了该算法若干值得进一步研究的方向和所面临的挑战。可为今后对MOSA算法的改进以及在实际工程应用中的研究提供综合参考。 相似文献
7.
8.
鉴于电力需求的日益增长与传统无功优化方法的桎梏,如何更加合理有效地解决电力系统的无功优化问题逐渐成为了研究的热点。提出一种多目标飞蛾扑火算法来解决电力系统多目标无功优化的问题,算法引入固定大小的外部储存机制、自适应的网格和筛选机制来有效存储和提升无功优化问题的帕累托最优解集,算法采用CEC2009标准多目标测试函数来进行仿真实验,并与两种经典算法进行性能的对比分析。此外,在电力系统IEEE 30节点上将该算法与MOPSO,NGSGA-II算法的求解结果进行比较分析的结果表明,多目标飞蛾算法具有良好的性能,并在解决电力系统多目标无功优化问题上具有良好的潜力。 相似文献
9.
基于拥挤度与变异的动态微粒群多目标优化算法 总被引:2,自引:0,他引:2
提出一种动态微粒群多目标优化算法(DCMOPSO),算法中的惯性权重和加速因子动态变化以增强算法的全局搜索能力,并采用拥挤度的方法对外部档案进行维护以增加非劣解的多样性.在维护过程中,从外部档案中按拥挤度为每个微粒选择全局最好位置,同时使用变异操作避免算法早熟.通过几个典型的多目标测试函数对DCMOPSO算法的性能进行了测试,并与多目标优化算法MOPSO和NSGA-Ⅱ进行对比.结果表明,DCMOPSO算法具有良好的搜索性能. 相似文献
10.
多云环境下,用户能够基于虚拟应用技术与基础设施虚拟技术自由组合基础设施资源以部署虚拟应用网络,并且能够快速构建具有一定业务功能的分布式应用系统。鉴于现有多云部署决策方法,以及在部署描述及处理用户多目标需求方面的不足,首先给出了基于开放虚拟格式文档的虚拟应用网络部署描述方法;其次研究定义了基础设施资源组合的常见服务质量指标及多目标优化模型,并使用第二代非支配排序遗传算法(NSGA-II)和多目标粒子群优化(MOPSO)算法求解模型;最后给出了一种基于模糊决策的最终满意解确定方法。多次实验统计表明,两种算法均能在合理时间内实现较好收敛,NSGA-II适合2~3个目标的场景,而MOPSO能够用于更多目标场景,且均有更好表现;模糊决策所得最终解能够最佳匹配用户的目标偏好。 相似文献
11.
Particle swarm optimization with preference order ranking for multi-objective optimization 总被引:2,自引:0,他引:2
A new optimality criterion based on preference order (PO) scheme is used to identify the best compromise in multi-objective particle swarm optimization (MOPSO). This scheme is more efficient than Pareto ranking scheme, especially when the number of objectives is very large. Meanwhile, a novel updating formula for the particle’s velocity is introduced to improve the search ability of the algorithm. The proposed algorithm has been compared with NSGA-II and other two MOPSO algorithms. The experimental results indicate that the proposed approach is effective on the highly complex multi-objective optimization problems. 相似文献
12.
This paper presents the Multi-Objective Vortex Particle Swarm Optimization MOVPSO as a strategy based on the behavior of a particle swarm using rotational and translational motions. The MOVPSO strategy is based upon the emulation of the emerging property performed by a swarm (flock), achieving a successful motion with diversity control, via collaborative, using linear and circular movements.The proposed algorithm is tested through several multi-objective optimization functions and is compared with standard Multi-Objective Particle Swarm Optimization (MOPSO).The qualitative results show that particle swarms behave as expected. Finally, statistical analysis allows to appreciate that the MOVPSO algorithm has a favorable performance compared to traditional MOPSO algorithm. 相似文献
13.
This paper presents an efficient metamodel-based multi-objective multidisciplinary design optimization (MDO) architecture for solving multi-objective high fidelity MDO problems. One of the important features of the proposed method is the development of an efficient surrogate model-based multi-objective particle swarm optimization (EMOPSO) algorithm, which is integrated with a computationally efficient metamodel-based MDO architecture. The proposed EMOPSO algorithm is based on sorted Pareto front crowding distance, utilizing star topology. In addition, a constraint-handling mechanism in non-domination appointment and fuzzy logic is also introduced to overcome feasibility complexity and rapid identification of optimum design point on the Pareto front. The proposed algorithm is implemented on a metamodel-based collaborative optimization architecture. The proposed method is evaluated and compared with existing multi-objective optimization algorithms such as multi-objective particle swarm optimization (MOPSO) and non-dominated sorting genetic algorithm II (NSGA-II), using a number of well-known benchmark problems. One of the important results observed is that the proposed EMOPSO algorithm provides high diversity with fast convergence speed as compared to other algorithms. The proposed method is also applied to a multi-objective collaborative optimization of unmanned aerial vehicle wing based on high fidelity models involving structures and aerodynamics disciplines. The results obtained show that the proposed method provides an effective way of solving multi-objective multidisciplinary design optimization problem using high fidelity models. 相似文献
14.
In this paper, a bi-objective multi-product (r,Q) inventory model in which the inventory level is reviewed continuously is proposed. The aim of this work is to find the optimal value for both order quantity and reorder point through minimizing the total cost and maximizing the service level of the proposed model simultaneously. It is assumed that shortage could occur and unsatisfied demand could be backordered, too. There is a budget limitation and storage space constraint in the model. With regard to complexity of the proposed model, several Pareto-based meta-heuristic approaches such as multi-objective vibration damping optimization (MOVDO), multi-objective imperialist competitive algorithm (MOICA), multi-objective particle swarm optimization (MOPSO), non-dominated ranked genetic algorithm (NRGA), and non-dominated sorting genetic algorithm (NSGA-II) are applied to solve the model. In order to compare the results, several numerical examples are generated and then the algorithms were analyzed statistically and graphically. 相似文献
15.
为了降低稀布阵列的峰值旁瓣电平并抑制稀布阵列的栅瓣,提出了一种多目标粒子群与凸优化相结合的方向图综合算法。该算法将多目标粒子群优化(Multi-objective particles swarm optimization,MOPSO)作为全局搜索器,凸优化算法作为局部搜索器来搜索最优解,优化的变量不仅是阵元的权值,而且还加入了阵元位置这一参数,从而能够提供更多的自由度来控制稀布阵列的性能。基于30阵元的稀布圆形阵列的仿真结果表明:与单纯使用MOPSO算法相比,本文提出的用MOPSO算法优化阵元位置,凸优化算法优化阵元权值的联合优化算法,得到的栅瓣和峰值旁瓣电平都小于-19.3 dB。 相似文献
16.
Seyed Hamid Reza Pasandideh Seyed Taghi Akhavan Niaki Sharareh Sharafzadeh 《Journal of Manufacturing Systems》2013
In this paper, a bi-objective multi-products economic production quantity (EPQ) model is developed, in which the number of orders is limited and imperfect items that are re-workable are produced. The objectives of the problem are minimization of the total inventory costs as well as minimizing the required warehouse space. The model is shown to be of a bi-objective nonlinear programming type, and in order to solve it two meta-heuristic algorithms namely, the non-dominated sorting genetic algorithm (NSGA-II) and multi-objective particle swarm optimization (MOPSO) algorithm, are proposed. To verify the solution obtained and to evaluate the performance of proposed algorithms, two-sample t-tests are employed to compare the means of the first objective value, the means of the second objective values, and the mean required CPU time of solving the problem using two algorithms. The results show while both algorithms are efficient to solve the model and the solution qualities of the two algorithms do not differ significantly, the computational CPU time of MOPSO is considerably lower than that of NSGA-II. 相似文献
17.
18.
19.
The Kapur and Otsu methods are widely used image thresholding approaches and they are very efficient in bi-level thresholding applications. Evolutionary algorithms have been developed to extend the Kapur and Otsu methods to the multi-level thresholding case. However, there remains an unsolved argument that neither Kapur nor Otsu objective can optimally fit diverse content contained in different kinds of images. This paper proposes a multi-objective model which seeks to find the Pareto-optimal set with respect to Kapur and Otsu objectives. Based on dominance and diversity criteria, we developed a hybrid multi-objective particle swarm optimization (MOPSO) method by incorporating several intelligent search strategies. The ensemble strategy is also applied to automatically select the best search strategy to perform at various algorithm stages according to its historic performances. The experimental result shows that the solutions to our multi-objective model consistently produce equal or better segmentation results than those by the optimal solutions to the original Kapur and Otsu models, and that the proposed hybrid algorithm with and without the ensemble strategy produces a better approximation to the ideal Pareto front than those obtained by two other MOPSO variants and the MOEA/D. In comparison with the most recent multilevel thresholding methods, our approach also consistently obtains better performance in the segmentation result for several benchmark images. 相似文献