首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 15 毫秒
1.

As an optimization paradigm, Salp Swarm Algorithm (SSA) outperforms various population-based optimizers in the perspective of the accuracy of obtained solutions and convergence rate. However, SSA gets stuck into sub-optimal solutions and degrades accuracy while solving the complex optimization problems. To relieve these shortcomings, a modified version of the SSA is proposed in the present work, which tries to establish a more stable equilibrium between the exploration and exploitation cores. This method utilizes two different strategies called opposition-based learning and levy-flight (LVF) search. The algorithm is named m-SSA, and its validation is performed on a well-known set of 23 classical benchmark problems. To observe the strength of the proposed method on the scalability of the test problems, the dimension of these problems is varied from 50 to 1000. Furthermore, the proposed m-SSA is also used to solve some real engineering optimization problems. The analysis of results through various statistical measures, convergence rate, and statistical analysis ensures the effectiveness of the proposed strategies integrated with the m-SSA. The comparison of the m-SSA with the conventional SSA, variants of SSA and some other state-of-the-art algorithms illustrate its enhanced search efficiency.

  相似文献   

2.
Fan  Qian  Chen  Zhenjian  Zhang  Wei  Fang  Xuhua 《Engineering with Computers》2020,38(1):797-814

In this paper, a novel hybrid meta-heuristic algorithm called ESSAWOA is proposed for solving global optimization problems. The main idea of ESSAWOA is to enhance Whale Optimization Algorithm (WOA) by combining the mechanism of Salp Swarm Algorithm (SSA) and Lens Opposition-based Learning strategy (LOBL). The hybridization process includes three parts: First, the leader mechanism with strong exploitation of SSA is applied to update the population position before the basic WOA operation. Second, the nonlinear parameter related to the convergence property in SSA is introduced to the two phases of encircling prey and bubble-net attacking in WOA. Third, LOBL strategy is used to increase the population diversity of the proposed optimizer. The hybrid design is expected to significantly enhance the exploitation and exploration capacity of the proposed algorithm. To investigate the effectiveness of ESSAWOA, twenty-three benchmark functions of different dimensions and three classical engineering design problems are performed. Furthermore, SSA, WOA and seven other well-known meta-heuristic algorithms are employed to compare with the proposed optimizer. Our results reveal that ESSAWOA can effectively and quickly obtain the promising solution of these optimization problems in the search space. The performance of ESSAWOA is significantly superior to the basic WOA, SSA and other meta-heuristic algorithms.

  相似文献   

3.
陈民铀  程杉 《控制与决策》2013,28(11):1729-1734

提出一种基于随机黑洞粒子群算法(RBH-PSO) 和逐步淘汰策略的多目标粒子群优化(MRBHPSO-SE) 算法. 利用RBH-PSO 全局优化能力强和收敛速度快的优点逼近Pareto 最优解; 为了避免拥挤距离排序策略的缺陷, 提出逐步淘汰策略, 并将其应用到下一代粒子的选择策略中. 同时, 动态选择领导粒子, 运用动态惯性权重系数和变异操作 来增强种群全局寻优能力, 以及避免早熟收敛. 利用具有不同特点的测试函数进行验证, 结果表明, 与同类算法相比, 该算法具有较高的精度并兼顾优化解的多样性.

  相似文献   

4.
徐志丹 《控制与决策》2016,31(5):829-834
提出趋磁性细菌多目标优化算法(MTBMO).该算法以趋磁性细菌优化算法(MBOA)中磁小体(MTSs)的生成机制为基础,设计适用于多目标优化的新型MTSs磁矩调节机制,确保群体的收敛性;同时采用基于混沌变异的替换方法取代MBOA中的磁小体替换机制来增强群体的多样性.通过标准函数测试和与现有多目标优化算法的比较表明,MTBMO对于求解多目标优化问题(MOPs)是可行且有效的.  相似文献   

5.
提出一种高维多目标多方向协同进化算法(HMMCA).该算法利用目标空间内的一组方向向量将多目标优化问题分解成多个方向进行寻优,并提出一种混合变异策略以加强算法在每个方向上的收敛能力;同时,该算法采用改进的交互式模糊支配和拥挤度估计因子来维护外部归档集的规模,增强种群的收敛性和分布性.将该算法与目前性能最好的3种多目标进化算法在标准测试函数集上进行对比实验,所得结果表明HMMCA与其他算法相比具有更好的收敛性和分布性.  相似文献   

6.
为了进一步提高元胞遗传算法在求解多目标优化问题时的收敛性和分布性。在多目标元胞遗传算法的基础上,引入了三维空间元胞,提出了三维元胞多目标遗传算法。采用多目标基准测试函数对该算法进行了测试,并将其与目前比较流行的几种多目标遗传算法进行对比。结果表明,此种算法在收敛性和分布性上取得了更好的效果。采用以上这几种算法分别对机床主轴多目标优化问题进行了求解,相比其他几种算法,改进的多目标元胞遗传算法得到了更优的结果,说明了改进的算法在求解此问题时行之有效。  相似文献   

7.
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.  相似文献   

8.
陈昊  黎明  张可 《控制与决策》2010,25(9):1343-1348
针对如何通过附加的方法对多目标化问题进行理论分析,提出并证明了选择附加函数的3个前提条件.提出一种多目标化进化算法,根据种群中个体的多样性度量进行多目标化,并采用改进的非劣分类遗传算法对构造所得的多目标优化问题进行多目标优化.在静态和动态两种环境下进行算法性能验证,结果表明,在种群多样性保持、处理欺骗问题、动态环境下的适应能力等方面,所提算法明显优于其他同类算法.  相似文献   

9.
鉴于电力需求的日益增长与传统无功优化方法的桎梏,如何更加合理有效地解决电力系统的无功优化问题逐渐成为了研究的热点。提出一种多目标飞蛾扑火算法来解决电力系统多目标无功优化的问题,算法引入固定大小的外部储存机制、自适应的网格和筛选机制来有效存储和提升无功优化问题的帕累托最优解集,算法采用CEC2009标准多目标测试函数来进行仿真实验,并与两种经典算法进行性能的对比分析。此外,在电力系统IEEE 30节点上将该算法与MOPSO,NGSGA-II算法的求解结果进行比较分析的结果表明,多目标飞蛾算法具有良好的性能,并在解决电力系统多目标无功优化问题上具有良好的潜力。  相似文献   

10.

针对缓冲区有限的多目标流水车间调度问题, 提出一种基于Pareto 最优的广义多目标萤火虫算法. 通过引入交换子和交换序将基本萤火虫算法离散化, 并将算法拓展为全局搜索过程和局部搜索过程. 进化初期采用全局搜索将种群推向较优区域, 进化中后期采用捕食搜索策略使算法主体在全局搜索和局部搜索间智能切换, 从而保证全局与局部的平衡. 动态变步长策略进一步增强了算法搜索能力. 通过算例测试验证了所提出算法的有效性.

  相似文献   

11.

在处理有约束多目标问题的进化算法中, 目前普遍采用Deb 教授提出的约束占优的直接支配选择策略. 在约束处理中, 优秀不可行解与优秀可行解同样重要, 但在直接支配选择策略中, 不可行解被选择的几率很小. 针对此问题, 设计一种环境Pareto 支配的选择策略, 并基于此提出用于解决有约束多目标问题的差分进化算法. 对经典测试函数进行仿真计算, 结果表明, 与其他算法相比, 所提出的算法具有更高的收敛性和稳定性.

  相似文献   

12.
Gu  Qinghua  Wang  Rui  Xie  Haiyan  Li  Xuexian  Jiang  Song  Xiong  Naixue 《Applied Intelligence》2021,51(7):4236-4269

Dominance resistance is a challenge for Pareto-based multi-objective evolutionary algorithms to solve the high-dimensional optimization problems. The Non-dominated Sorting Genetic Algorithm III (NSGA-III) still has such disadvantage even though it is recognized as an algorithm with good performance for many-objective problems. Thus, a variation of NSGA-III algorithm based on fine final level selection is proposed to improve convergence. The fine final level selection is designed in this way. The θ-dominance relation is used to sort the solutions in the critical layer firstly. Then ISDE index and favor convergence are employed to evaluate convergence of individuals for different situations. And some better solutions are selected finally. The effectiveness of our proposed algorithm is validated by comparing with nine state-of-the-art algorithms on the Deb-Thiele-Laumanns-Zitzler and Walking-Fish-Group test suits. And the optimization objectives are varying from 3 to 15. The performance is evaluated by the inverted generational distance (IGD), hypervolume (HV), generational distance (GD). The simulation results show that the proposed algorithm has an average improvement of 55.4%, 60.0%, 63.1% of 65 test instances for IGD, HV, GD indexes over the original NSGA-III algorithm. Besides, the proposed algorithm obtains the best performance by comparing 9 state-of-art algorithms in HV, GD indexes and ranks third for IGD indicator. Therefore, the proposed algorithm can achieve the advantages over the benchmarks.

  相似文献   

13.

Optimization techniques, specially evolutionary algorithms, have been widely used for solving various scientific and engineering optimization problems because of their flexibility and simplicity. In this paper, a novel metaheuristic optimization method, namely human behavior-based optimization (HBBO), is presented. Despite many of the optimization algorithms that use nature as the principal source of inspiration, HBBO uses the human behavior as the main source of inspiration. In this paper, first some human behaviors that are needed to understand the algorithm are discussed and after that it is shown that how it can be used for solving the practical optimization problems. HBBO is capable of solving many types of optimization problems such as high-dimensional multimodal functions, which have multiple local minima, and unimodal functions. In order to demonstrate the performance of HBBO, the proposed algorithm has been tested on a set of well-known benchmark functions and compared with other optimization algorithms. The results have been shown that this algorithm outperforms other optimization algorithms in terms of algorithm reliability, result accuracy and convergence speed.

  相似文献   

14.

In this paper, a hybrid bio-inspired metaheuristic optimization approach namely emperor penguin and salp swarm algorithm (ESA) is proposed. This algorithm imitates the huddling and swarm behaviors of emperor penguin optimizer and salp swarm algorithm, respectively. The efficiency of the proposed ESA is evaluated using scalability analysis, convergence analysis, sensitivity analysis, and ANOVA test analysis on 53 benchmark test functions including classical and IEEE CEC-2017. The effectiveness of ESA is compared with well-known metaheuristics in terms of the optimal solution. The proposed ESA is also applied on six constrained and one unconstrained engineering problems to evaluate its robustness. The results reveal that ESA offers optimal solutions as compared to the other competitor algorithms.

  相似文献   

15.
提出一种基于动态层次分析的自适应多目标粒子群优化算法,利用模糊一致矩阵层次分析法选取全局最优粒子,保证进化方向的合理性和客观性。在进化过程中对种群状态进行客观度量,自适应更新种群的权重和学习因子等重要参数,使种群进化具有自我调节能力。将提出的算法分别应用于标准多目标测试函数、PID控制器参数优化和甲醇转化烃类物质的工业过程模型辨识中,通过与其他算法的对比说明了所提出算法的有效性和可行性。  相似文献   

16.
Evolutionary algorithms have been successfully applied to various multi-objective optimization problems. However, theoretical studies on multi-objective evolutionary algorithms, especially with self-adaption, are relatively scarce. This paper analyzes the convergence properties of a self-adaptive (μ+1)-algorithm. The convergence of the algorithm is defined, and general convergence conditions are studied. Under these conditions, it is proven that the proposed self-adaptive (μ+1)-algorithm converges in probability or almost surely to the Pareto-optimal front.  相似文献   

17.

This paper addresses multi-objective optimization and the truss optimization problem employing a novel meta-heuristic that is based on the real-world water cycle behavior in rivers, rainfalls, streams, etc. This meta-heuristic is called multi-objective water cycle algorithm (MOWCA) which is receiving great attention from researchers due to the good performance in handling optimization problems in different fields. Additionally, the hyperbolic spiral movement is integrated into the basic MOWCA to guide the agents throughout the search space. Consequently, under this hyperbolic spiral movement, the exploitation ability of the proposed MOSWCA is promoted. To assess the robustness and coherence of the MOSWCA, the performance of the proposed MOSWCA is analysed on some multi-objective optimisation benchmark functions; and three truss structure optimization problems. The results obtained by the MOSWCA of all test problems were compared with various multi-objective meta-heuristic algorithms reported in the literature. From the empirical results, it is evident that the suggested approach reaches an excellent performance when solving multi-objective optimization and the truss optimization problems.

  相似文献   

18.
免疫克隆多目标优化算法求解约束优化问题   总被引:4,自引:1,他引:3  
尚荣华  焦李成  马文萍 《软件学报》2008,19(11):2943-2956
针对现有的约束处理技术的一些不足之处,提出一种用于求解约束优化问题的算法——免疫克隆多目标优化算法(immune clonal multi-objective optimization algorithm,简称ICMOA).算法的主要特点是通过将约束条件转化为一个目标,从而将问题转化为两个目标的多目标优化问题.引入多目标优化中的Pareto-支配的概念,每一个个体根据其被支配的程度进行克隆、变异及选择等操作.克隆操作实现了全局择优,有利于得到高质量的解;变异操作提高算法的局部搜索能力,有利于所得解的多样性;选择操作有利于算法向着最优搜索,而且加快了收敛速度.基于抗体群的随机状态转移过程,证明该算法具有全局收敛性.通过对13个标准测试问题的测试,并与已有算法进行比较。结果表明,该算法在收敛速度和求解精度上均具有一定的优势.  相似文献   

19.
针对约束多目标优化算法存在难以有效地兼顾收敛性和多样性的问题,提出一种基于协同进化的约束多目标优化算法。第一阶段,通过基于稳态演化的可行解搜索方式得到一个具有一定数量可行解的种群;第二阶段,将这个种群拆分为两个子种群,并通过双子种群协同进化的方式实现对收敛性和多样性的兼顾;最后采用标准约束多目标优化问题CF1~CF7、DOC1~DOC7和实际工程问题进行仿真实验,以测试所提算法的求解性能。实验结果表明,与基于约束支配准则的非支配排序遗传算法(NSGA-Ⅱ-CDP)、两阶段算法(ToP)、推拉搜索算法(PPS)和约束多目标优化的双存档进化算法(C-TAEA)相比,所提算法在反向世代距离(IGD)和超体积(HV)两个指标上均取得了良好的结果,说明所提算法可以有效地兼顾收敛性和多样性。  相似文献   

20.
为了解决多目标优化求解的问题,提出一种基于旋转基技术的多目标粒子群优化算法(rtMOPSO)。改进了旋转基可视化技术,并将Pareto前沿映射到改进的旋转基扇形平面上,采用差熵指标监测种群进化状态。为平衡归档集的收敛性和多样性,提出了角度支配和角度支配力度两种新的概念,并设计归档集新的排序方法。在融合了旋转基角度和距离的概念的基础上,提出了一种改进的全局引导粒子的选择策略。改进算法采用两个类别的测试函数,与五种多目标优化算法进行了对比实验。实验结果表明,改进算法在收敛性和多样性方面优势明显。  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号