scholarly journals MTV-MFO: Multi-Trial Vector-Based Moth-Flame Optimization Algorithm

Symmetry ◽  
2021 ◽  
Vol 13 (12) ◽  
pp. 2388
Author(s):  
Mohammad H. Nadimi-Shahraki ◽  
Shokooh Taghian ◽  
Seyedali Mirjalili ◽  
Ahmed A. Ewees ◽  
Laith Abualigah ◽  
...  
Keyword(s):  
Optimization Problems ◽  
Search Strategies ◽  
Premature Convergence ◽  
Chemical Effect ◽  
Benchmark Problems ◽  
Exploration And Exploitation ◽  
Trial Vector ◽  
Movement Strategies ◽  
Nature Inspired Algorithm ◽  
Movement Strategy

The moth-flame optimization (MFO) algorithm is an effective nature-inspired algorithm based on the chemical effect of light on moths as an animal with bilateral symmetry. Although it is widely used to solve different optimization problems, its movement strategy affects the convergence and the balance between exploration and exploitation when dealing with complex problems. Since movement strategies significantly affect the performance of algorithms, the use of multi-search strategies can enhance their ability and effectiveness to solve different optimization problems. In this paper, we propose a multi-trial vector-based moth-flame optimization (MTV-MFO) algorithm. In the proposed algorithm, the MFO movement strategy is substituted by the multi-trial vector (MTV) approach to use a combination of different movement strategies, each of which is adjusted to accomplish a particular behavior. The proposed MTV-MFO algorithm uses three different search strategies to enhance the global search ability, maintain the balance between exploration and exploitation, and prevent the original MFO’s premature convergence during the optimization process. Furthermore, the MTV-MFO algorithm uses the knowledge of inferior moths preserved in two archives to prevent premature convergence and avoid local optima. The performance of the MTV-MFO algorithm was evaluated using 29 benchmark problems taken from the CEC 2018 competition on real parameter optimization. The gained results were compared with eight metaheuristic algorithms. The comparison of results shows that the MTV-MFO algorithm is able to provide competitive and superior results to the compared algorithms in terms of accuracy and convergence rate. Moreover, a statistical analysis of the MTV-MFO algorithm and other compared algorithms was conducted, and the effectiveness of our proposed algorithm was also demonstrated experimentally.

scholarly journals Balancing Exploration and Exploitation With Decomposition-Based Dynamic Multi-Objective Evolutionary Algorithm

2021 ◽  
Vol 15 (4) ◽  
pp. 1-23
Author(s):  
Qing Zhang ◽  
Ruwang Jiao ◽  
Sanyou Zeng ◽  
Zhigao Zeng
Keyword(s):  
Global Optimization ◽  
Evolutionary Algorithm ◽  
Optimization Problem ◽  
Optimization Problems ◽  
Early Stage ◽  
Population Diversity ◽  
Benchmark Problems ◽  
Exploration And Exploitation ◽  
Multi Objective ◽  
Count Function

Balancing exploration and exploitation is a crucial issue in evolutionary global optimization. This paper proposes a decomposition-based dynamic multi-objective evolutionary algorithm for addressing global optimization problems. In the proposed method, the niche count function is regarded as a helper objective to maintain the population diversity, which converts a global optimization problem to a multi-objective optimization problem (MOP). The niche-count value is controlled by the niche radius. In the early stage of evolution, a large niche radius promotes the population diversity for better exploration; in the later stage of evolution, a niche radius close to 0 focuses on convergence for better exploitation. Through the whole evolution process, the niche radius is dynamically decreased from a large value to zero, which can provide a sound balance between the exploration and exploitation. Experimental results on CEC 2014 benchmark problems reveal that the proposed algorithm is capable of offering high-quality solutions, in comparison with four state-of-the-art algorithms.

scholarly journals Quadratic Interpolation Based Simultaneous Heat Transfer Search Algorithm and Its Application to Chemical Dynamic System Optimization

Processes ◽  
2020 ◽  
Vol 8 (4) ◽  
pp. 478
Author(s):  
Ebrahim Alnahari ◽  
Hongbo Shi ◽  
Khalil Alkebsi
Keyword(s):  
Heat Transfer ◽  
Chemical Engineering ◽  
Optimization Problems ◽  
Interpolation Method ◽  
System Optimization ◽  
Benchmark Problems ◽  
Exploration And Exploitation ◽  
Quadratic Interpolation ◽  
New Variant ◽  
Simultaneous Heat

Dynamic optimization problems (DOPs) are widely encountered in complex chemical engineering processes. However, due to the existence of highly constrained, nonlinear, and nonsmooth environment in chemical processes, which usually causes nonconvexity, multimodality and discontinuity, handling DOPs is not a straightforward task. Heat transfer search (HTS) algorithm is a relative novel metaheuristic approach inspired by the natural law of thermodynamics and heat transfer. In order to solve DOPs efficiently, a new variant of HTS algorithm named quadratic interpolation based simultaneous heat transfer search (QISHTS) algorithm is proposed in this paper. The QISHTS algorithm introduces three modifications into the original HTS algorithm, namely the effect of simultaneous heat transfer search, quadratic interpolation method, and population regeneration mechanism. These three modifications are employed to provide lower computational complexity, as well as to enhance the exploration and exploitation capabilities. Therefore, the ensemble of these modifications can provide a more efficient optimization algorithm with well-balanced exploration and exploitation capabilities. The proposed variant is firstly investigated by well-defined benchmark problems and then applied to solve four chemical DOPs. Moreover, it is compared with different well-established methods existing in the literature. The results demonstrate that QISHTS algorithm has the greatest robustness and precision than other competitors.

scholarly journals Smallest-Small-World Cellular Harmony Search for Optimization of Unconstrained Benchmark Problems

2013 ◽  
Vol 2013 ◽  
pp. 1-9 ◽  
Author(s):  
Sung Soo Im ◽  
Do Guen Yoo ◽  
Joong Hoon Kim
Keyword(s):  
Topological Structure ◽  
Optimization Problems ◽  
Harmony Search ◽  
Small World ◽  
Clustering Coefficient ◽  
Benchmark Problems ◽  
Small World Network ◽  
Exploration And Exploitation ◽  
Characteristic Path Length ◽  
Population Structures

We presented a new hybrid method that combines cellular harmony search algorithms with the Smallest-Small-World theory. A harmony search (HS) algorithm is based on musical performance processes that occur when a musician searches for a better state of harmony. Harmony search has successfully been applied to a wide variety of practical optimization problems. Most of the previous researches have sought to improve the performance of the HS algorithm by changing the pitch adjusting rate and harmony memory considering rate. However, there has been a lack of studies to improve the performance of the algorithm by the formation of population structures. Therefore, we proposed an improved HS algorithm that uses the cellular automata formation and the topological structure of Smallest-Small-World network. The improved HS algorithm has a high clustering coefficient and a short characteristic path length, having good exploration and exploitation efficiencies. Nine benchmark functions were applied to evaluate the performance of the proposed algorithm. Unlike the existing improved HS algorithm, the proposed algorithm is expected to have improved algorithmic efficiency from the formation of the population structure.

scholarly journals A Hybrid Whale Optimization with Seagull Algorithm for Global Optimization Problems

2021 ◽  
Vol 2021 ◽  
pp. 1-31
Author(s):  
Yanhui Che ◽  
Dengxu He
Keyword(s):  
Global Optimization ◽  
Optimization Problems ◽  
Metaheuristic Algorithms ◽  
Premature Convergence ◽  
Attack Behavior ◽  
Test Functions ◽  
Exploration And Exploitation ◽  
Computational Accuracy ◽  
Whale Optimization ◽  
Benchmark Test Functions

Seagull optimization algorithm (SOA) inspired by the migration and attack behavior of seagulls in nature is used to solve the global optimization problem. However, like other well-known metaheuristic algorithms, SOA has low computational accuracy and premature convergence. Therefore, in the current work, these problems are solved by proposing the modified version of SOA. This paper proposes a novel hybrid algorithm, called whale optimization with seagull algorithm (WSOA), for solving global optimization problems. The main reason is that the spiral attack prey of seagulls is very similar to the predation behavior of whale bubble net, and the WOA has strong global search ability. Therefore, firstly, this paper combines WOA’s contraction surrounding mechanism with SOA’s spiral attack behavior to improve the calculation accuracy of SOA. Secondly, the levy flight strategy is introduced into the search formula of SOA, which can effectively avoid premature convergence of algorithms and balance exploration and exploitation among algorithms more effectively. In order to evaluate the effectiveness of solving global optimization problems, 25 benchmark test functions are tested, and WSOA is compared with seven famous metaheuristic algorithms. Statistical analysis and results comparison show that WSOA has obvious advantages compared with other algorithms. Finally, four engineering examples are tested with the proposed algorithm, and the effectiveness and feasibility of WSOA are verified.

scholarly journals A chaotic-based improved many-objective Jaya algorithm for many-objective optimization problems

2021 ◽  
pp. 49-62 ◽  
Author(s):  
Sandeep U. Mane ◽  
M. R. Narsingrao
Keyword(s):  
Performance Metrics ◽  
Optimization Problems ◽  
Statistical Tests ◽  
Chaotic Sequence ◽  
Premature Convergence ◽  
Jaya Algorithm ◽  
Exploration And Exploitation ◽  
Decomposition Approach ◽  
Selection Scheme ◽  
Population Based Algorithm

The Jaya algorithm is a recently developed novel population-based algorithm. The proposed work presents the modifications in the existing many-objective Jaya (MaOJaya) algorithm by integrating the chaotic sequence to improve the performance to optimize many-objective benchmark optimization problems. The MaOJaya algorithm has exploitation more dominating, due to which it traps in local optima. The proposed work aims to reduce these limitations by modifying the solution update equation of the MaOJaya algorithm. The purpose of the modification is to balance the exploration and exploitation, improve the divergence and avoid premature convergence. The well-known chaotic sequence - a logistic map integrated into the solution update equation. This modification keeps the MaOJaya algorithm simple as well as, preserves its parameterless feature. The other component of the existing MaOJaya algorithm, such as non-dominated sorting, reference vector and tournament selection scheme of NSGA-II is preserved. The decomposition approach used in the proposed approach simplifies the complex many-objective optimization problems. The performance of the proposed chaotic based many-objective Jaya (C-MaOJaya) algorithm is tested on DTLZ benchmark functions for three to ten objectives. The IGD and Hypervolume performance metrics evaluate the performance of the proposed C-MaOJaya algorithm. The statistical tests are used to compare the performance of the proposed C-MaOJaya algorithm with the MaOJaya algorithm and other algorithms from the literature. The C-MaOJaya algorithm improved the balance between exploration and exploitation and avoids premature convergence significantly. The comparison shows that the proposed C-MaOJaya algorithm is a promising approach to solve many-objective optimization problems.

scholarly journals Balancing Exploration and Exploitation with Decomposition-Based Dynamic Multi-objective Evolutionary Algorithm

2021 ◽  
Vol 15 (4) ◽  
pp. 0-0
Keyword(s):  
Global Optimization ◽  
Evolutionary Algorithm ◽  
Optimization Problem ◽  
Optimization Problems ◽  
Early Stage ◽  
Population Diversity ◽  
Benchmark Problems ◽  
Exploration And Exploitation ◽  
Multi Objective ◽  
Count Function

Balancing exploration and exploitation is a crucial issue in evolutionary global optimization. This paper proposes a decomposition-based dynamic multi-objective evolutionary algorithm for addressing global optimization problems. In the proposed method, the niche count function is regarded as a helper objective to maintain the population diversity, which converts a global optimization problem to a multi-objective optimization problem (MOP). The niche-count value is controlled by the niche radius. In the early stage of evolution, a large niche radius promotes the population diversity for better exploration; in the later stage of evolution, a niche radius close to 0 focuses on convergence for better exploitation. Through the whole evolution process, the niche radius is dynamically decreased from a large value to zero, which can provide a sound balance between the exploration and exploitation. Experimental results on CEC 2014 benchmark problems reveal that the proposed algorithm is capable of offering high-quality solutions, in comparison with four state-of-the-art algorithms.

scholarly journals Improved Salp Swarm Algorithm with Simulated Annealing for Solving Engineering Optimization Problems

Symmetry ◽  
2021 ◽  
Vol 13 (6) ◽  
pp. 1092
Author(s):  
Qing Duan ◽  
Lu Wang ◽  
Hongwei Kang ◽  
Yong Shen ◽  
Xingping Sun ◽  
...  
Keyword(s):  
Simulated Annealing ◽  
Optimization Problems ◽  
Chaotic Sequence ◽  
Engineering Optimization ◽  
Exploration And Exploitation ◽  
Salp Swarm Algorithm ◽  
Symmetric Perturbation ◽  
Swarm Algorithm ◽  
Search Capability ◽  
Engineering Optimization Problems

Swarm-based algorithm can successfully avoid the local optimal constraints, thus achieving a smooth balance between exploration and exploitation. Salp swarm algorithm(SSA), as a swarm-based algorithm on account of the predation behavior of the salp, can solve complex daily life optimization problems in nature. SSA also has the problems of local stagnation and slow convergence rate. This paper introduces an improved salp swarm algorithm, which improve the SSA by using the chaotic sequence initialization strategy and symmetric adaptive population division. Moreover, a simulated annealing mechanism based on symmetric perturbation is introduced to enhance the local jumping ability of the algorithm. The improved algorithm is referred to SASSA. The CEC standard benchmark functions are used to evaluate the efficiency of the SASSA and the results demonstrate that the SASSA has better global search capability. SASSA is also applied to solve engineering optimization problems. The experimental results demonstrate that the exploratory and exploitative proclivities of the proposed algorithm and its convergence patterns are vividly improved.

scholarly journals Differential Evolution with Population and Strategy Parameter Adaptation

2015 ◽  
Vol 2015 ◽  
pp. 1-10 ◽  
Author(s):  
V. Gonuguntla ◽  
R. Mallipeddi ◽  
Kalyana C. Veluvolu
Keyword(s):  
Differential Evolution ◽  
Population Size ◽  
Optimization Problems ◽  
Search Space ◽  
Benchmark Problems ◽  
Parameter Adaptation ◽  
De Algorithm ◽  
Probabilistic Technique ◽  
Number Of Individuals ◽  
Strategy Parameters

Differential evolution (DE) is simple and effective in solving numerous real-world global optimization problems. However, its effectiveness critically depends on the appropriate setting of population size and strategy parameters. Therefore, to obtain optimal performance the time-consuming preliminary tuning of parameters is needed. Recently, different strategy parameter adaptation techniques, which can automatically update the parameters to appropriate values to suit the characteristics of optimization problems, have been proposed. However, most of the works do not control the adaptation of the population size. In addition, they try to adapt each strategy parameters individually but do not take into account the interaction between the parameters that are being adapted. In this paper, we introduce a DE algorithm where both strategy parameters are self-adapted taking into account the parameter dependencies by means of a multivariate probabilistic technique based on Gaussian Adaptation working on the parameter space. In addition, the proposed DE algorithm starts by sampling a huge number of sample solutions in the search space and in each generation a constant number of individuals from huge sample set are adaptively selected to form the population that evolves. The proposed algorithm is evaluated on 14 benchmark problems of CEC 2005 with different dimensionality.

scholarly journals Utilizing Model Knowledge for Design Developed Genetic Algorithm to Solving Problem

2018 ◽  
Vol 3 (2) ◽  
pp. 172
Author(s):  
Hamidreza Salmani mojaveri
Keyword(s):  
Genetic Algorithm ◽  
Genetic Algorithms ◽  
Parallel Machines ◽  
Job Shop ◽  
Optimization Problems ◽  
Premature Convergence ◽  
Local Optimum ◽  
Scheduling Problems ◽  
Algorithm Implementation

One of the discussed topics in scheduling problems is Dynamic Flexible Job Shop with Parallel Machines (FDJSPM). Surveys show that this problem because of its concave and nonlinear nature usually has several local optimums. Some of the scheduling problems researchers think that genetic algorithms (GA) are appropriate approach to solve optimization problems of this kind. But researches show that one of the disadvantages of classical genetic algorithms is premature convergence and the probability of trap into the local optimum. Considering these facts, in present research, represented a developed genetic algorithm that its controlling parameters change during algorithm implementation and optimization process. This approach decreases the probability of premature convergence and trap into the local optimum. The several experiments were done show that the priority of proposed procedure of solving in field of the quality of obtained solution and convergence speed toward other present procedure.

scholarly journals An evolutionary-based optimization algorithm for truss sizing design

2016 ◽  
Vol 38 (4) ◽  
pp. 307-317
Author(s):  
Pham Hoang Anh
Keyword(s):  
Local Search ◽  
Objective Function ◽  
Optimization Algorithm ◽  
Optimization Problems ◽  
Optimal Solution ◽  
The Other ◽  
Truss Structures ◽  
Benchmark Problems ◽  
Discrete Variables ◽  
Objective Functions

In this paper, the optimal sizing of truss structures is solved using a novel evolutionary-based optimization algorithm. The efficiency of the proposed method lies in the combination of global search and local search, in which the global move is applied for a set of random solutions whereas the local move is performed on the other solutions in the search population. Three truss sizing benchmark problems with discrete variables are used to examine the performance of the proposed algorithm. Objective functions of the optimization problems are minimum weights of the whole truss structures and constraints are stress in members and displacement at nodes. Here, the constraints and objective function are treated separately so that both function and constraint evaluations can be saved. The results show that the new algorithm can find optimal solution effectively and it is competitive with some recent metaheuristic algorithms in terms of number of structural analyses required.

Sign in / Sign up

Export Citation Format

Share Document