In this paper, a novel meta-heuristic algorithm called Fireworks Optimization Algorithm (FOA) is introduced with few control parameters for discrete and continuous optimization problems. This algorithm is inspired from explosion pyrotechnic devices producing colorful spikes like red, blue and silver. By modelling the explosion behavior of the Fireworks in the sky, the search space can be swept efficiently to find the global optima. To improve the balance between the exploration and exploitation of individuals, three categories are defined to avoid local optimal traps and applied to the search agents. Each category has a different task and predefined updating position rules. A grouping strategy is considered to prevent the algorithm from premature convergence. The performance of FOA is demonstrated over 15 standard benchmarks in the continuous version and 30 images thresholding problems in the discrete version. The obtained results reveal the superiority of the proposed algorithm with fewer input parameters over other state-of-the-art optimization methods in most cases.
相似文献Jaya algorithm is one of the heuristic algorithms developed in recent years. The most important difference from other heuristic algorithms is that it updates its position according to its best and worst position. In addition to its simplicity, there is no algorithm-specific parameter. Because of these advantages, it has been preferred by researchers for problem-solving in the literature. In this study, the random walk phase of the original Jaya algorithm is developed and the Improved Jaya Algorithm (IJaya) is proposed. IJaya has been tested for success in eighteen classic benchmark test functions. Although the performance of the original Jaya algorithm has been tested at low dimensions in the literature, its success in large sizes has not been tested. In this study, IJaya's success in 10, 20, 30, 100, 500, and 1000 dimensions was examined. Also, the success of IJaya was tested in different population sizes. It has been proven that IJaya's performance has increased with the tests performed. Test results show that IJaya displays good performance and can be used as an alternative method for constrained optimization. In addition, three different engineering design problems were tested in different population sizes to demonstrate the achievements of Jaya and IJaya. According to the results, IJaya can be used as an optimization algorithm in the literature for continuous optimization and large-scale optimization problems.
相似文献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.
相似文献迭代动态规划(IDP) 作为一种求解非线性问题的离散算法, 其寻优精度和收敛速度受到时间段划分的影响. 通常, 时间段划分依赖主观经验, 缺乏科学有效的指导. 针对终端时刻固定的动态优化问题, 提出一种自适应变步长IDP 算法, 综合考虑控制变量与目标函数值的变化, 对时间段数量、长度和切换点进行优化. 将该方法应用于间歇过程优化, 结果表明其能够智能分配时间段数量与长度, 可有效提升寻优精度.
相似文献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.
相似文献提出一种三态协调搜索多目标粒子群优化算法. 该算法提出的三态指导粒子选择策略可以很好地协调算法的局部和全局搜索能力, 且算法改进了传统的外部档案保存机制, 同时引入3 种突变因子, 使获得的非劣解具有更好的分散性. 通过对标准测试函数的求解, 并与其他经典多目标优化算法比较, 表明了新算法在收敛性和多样性方面均有较大的优越性. 最后分析了区域划分系数对所提出算法性能的影响.
相似文献In this paper, a new hybrid algorithm is introduced, combining two Harris Hawks Optimizer (HHO) and the Imperialist Competitive Algorithm (ICA) to achieve a better search strategy. HHO is a new population-based, nature-inspired optimization algorithm that mimics Harris Hawks cooperative behavior and chasing style in nature called surprise pounce HHO. It is a robust algorithm in exploitation, but has an unfavorable performance in exploring the search space, while ICA has a better performance in exploration; thus, combining these two algorithms produces an effective hybrid algorithm. The hybrid algorithm is called Imperialist Competitive Harris Hawks Optimization (ICHHO). The proposed hybrid algorithm's effectiveness is examined by comparing other nature-inspired techniques, 23 mathematical benchmark problems, and several well-known structural engineering problems. The results successfully indicate the proposed hybrid algorithm's competitive performance compared to HHO, ICA, and some other well-established algorithms.
相似文献帝国竞争算法是一种已在连续优化问题上取得较好效果的新型社会政治算法. 为了使该算法更好地应用于离散型组合优化问题, 提出一种求解旅行商问题的新型帝国竞争算法. 在传统算法的基础上, 改变初始帝国的生成方式; 同化过程采取替换重建方式, 以提升求解质量; 革命过程中引入自适应变异算子, 以增强搜索能力; 殖民竞争过程中调整了殖民地分配方式; 算法加入帝国增强过程, 以加快寻化速度. 实验结果表明, 新型帝国竞争算法求解质量高、收敛速度快.
相似文献Imperialist competitive algorithm is a nascent meta-heuristic algorithm which has good performance. However, it also often suffers premature convergence and falls into local optimal area when employed to solve complex problems. To enhance its performance further, an improved approach which uses mutation operators to change the behavior of the imperialists is proposed in this article. This improved approach is simple in structure and is very easy to be carried out. Three different mutation operators, the Gaussian mutation, the Cauchy mutation and the Lévy mutation, are investigated particularly by experiments. The experimental results suggest that all the three improved algorithms have faster convergence rate, better global search ability and better stability than the original algorithm. Furthermore, the three improved algorithms are also compared with other two excellent algorithms on some benchmark functions and compared with other four existing algorithms on one real-world optimization problem. The comparisons suggest that the proposed algorithms have their own specialties and good applicability. They can obtain better results on some functions than those contrastive approaches.
相似文献The structural dynamic response predominantly depends upon natural frequencies which fabricate these as a controlling parameter for dynamic response of the truss. However, truss optimization problems subjected to multiple fundamental frequency constraints with shape and size variables are more arduous due to its characteristics like non-convexity, non-linearity, and implicit with respect to design variables. In addition, mass minimization with frequency constraints are conflicting in nature which intricate optimization problem. Using meta-heuristic for such kind of problem requires harmony between exploration and exploitation to regulate the performance of the algorithm. This paper proposes a modification of a nature inspired Symbiotic Organisms Search (SOS) algorithm called a Modified SOS (MSOS) algorithm to enhance its efficacy of accuracy in search (exploitation) together with exploration by introducing an adaptive benefit factor and modified parasitism vector. These modifications improved search efficiency of the algorithm with a good balance between exploration and exploitation, which has been partially investigated so far. The feasibility and effectiveness of proposed algorithm is studied with six truss design problems. The results of benchmark planar/space trusses are compared with other meta-heuristics. Complementarily the feasibility and effectiveness of the proposed algorithms are investigated by three unimodal functions, thirteen multimodal functions, and six hybrid functions of the CEC2014 test suit. The experimental results show that MSOS is more reliable and efficient as compared to the basis SOS algorithm and other state-of-the-art algorithms. Moreover, the MSOS algorithm provides competitive results compared to the existing meta-heuristics in the literature.
相似文献The newly proposed Generalized Normal Distribution Optimization (GNDO) algorithm is used to design the truss structures with optimal weight. All trusses optimized have frequency constraints, which make them very challenging optimization problems. A large number of locally optimal solutions and non-convexity of search space make them difficult to solve, therefore, they are suitable for testing the performance of optimization algorithm. This work investigates whether the proposed algorithm is capable of coping with such problems. To evaluate the GNDO algorithm, three benchmark truss optimization problems are considered with frequency constraints. Numerical data show GNDO’s reliability, stability, and efficiency for structural optimization problems than other meta-heuristic algorithms. We thoroughly analyse and investigate the performance of GNDO in this engineering area for the first time in the literature.
相似文献Similar to other swarm-based algorithms, the recently developed whale optimization algorithm (WOA) has the problems of low accuracy and slow convergence. It is also easy to fall into local optimum. Moreover, WOA and its variants cannot perform well enough in solving high-dimensional optimization problems. This paper puts forward a new improved WOA with joint search mechanisms called JSWOA for solving the above disadvantages. First, the improved algorithm uses tent chaotic map to maintain the diversity of the initial population for global search. Second, a new adaptive inertia weight is given to improve the convergence accuracy and speed, together with jump out from local optimum. Finally, to enhance the quality and diversity of the whale population, as well as increase the probability of obtaining global optimal solution, opposition-based learning mechanism is used to update the individuals of the whale population continuously during each iteration process. The performance of the proposed JSWOA is tested by twenty-three benchmark functions of various types and dimensions. Then, the results are compared with the basic WOA, several variants of WOA and other swarm-based intelligent algorithms. The experimental results show that the proposed JSWOA algorithm with multi-mechanisms is superior to WOA and the other state-of-the-art algorithms in the competition, exhibiting remarkable advantages in the solution accuracy and convergence speed. It is also suitable for dealing with high-dimensional global optimization problems.
相似文献