scholarly journals A Box-Girder Design Using Metaheuristic Algorithms and Mathematical Test Functions for Comparison

2021 ◽  
Vol 2 (4) ◽  
pp. 891-910
Author(s):  
Károly Jármai ◽  
Csaba Barcsák ◽  
Gábor Zoltán Marcsák

In engineering, metaheuristic algorithms have been used to solve complex optimization problems. This paper investigates and compares various algorithms. On one hand, the study seeks to ascertain the advantages and disadvantages of the newly presented heuristic techniques. The efficiency of the algorithms is highly dependent on the nature of the problem. The ability to change the complexity of the problem and the knowledge of global optimal locations are two advantages of using synthetic test functions for algorithm benchmarking. On the other hand, real-world design issues may frequently give more meaningful information into the effectiveness of optimization strategies. A new synthetic test function generator has been built to examine various optimization techniques. The objective function noisiness increased significantly with different transformations (Euclidean distance-based weighting, Gaussian weighting and Gabor-like weighting), while the positions of the optima remained the same. The test functions were created to assess and compare the performance of the algorithms in preparation for further development. The ideal proportions of the primary girder of an overhead crane have also been discovered. By evaluating the performance of fifteen metaheuristic algorithms, the optimum solution to thirteen mathematical optimization techniques, as well as the box-girder design, is identified. Some conclusions were drawn about the efficiency of the different optimization techniques at the test function and the transformed noisy functions. The overhead travelling crane girder design shows the real-life application.

2020 ◽  
Author(s):  
Chnoor M. Rahman ◽  
Tarik A. Rashid

<p></p><p></p><p>Dragonfly algorithm developed in 2016. It is one of the algorithms used by the researchers to optimize an extensive series of uses and applications in various areas. At times, it offers superior performance compared to the most well-known optimization techniques. However, this algorithm faces several difficulties when it is utilized to enhance complex optimization problems. This work addressed the robustness of the method to solve real-world optimization issues, and its deficiency to improve complex optimization problems. This review paper shows a comprehensive investigation of the dragonfly algorithm in the engineering area. First, an overview of the algorithm is discussed. Besides, we also examine the modifications of the algorithm. The merged forms of this algorithm with different techniques and the modifications that have been done to make the algorithm perform better are addressed. Additionally, a survey on applications in the engineering area that used the dragonfly algorithm is offered. A comparison is made between the algorithm and other metaheuristic techniques to show its ability to enhance various problems. The outcomes of the algorithm from the works that utilized the dragonfly algorithm previously and the outcomes of the benchmark test functions proved that in comparison with some techniques, the dragonfly algorithm owns an excellent performance, especially for small to intermediate applications. Moreover, the congestion facts of the technique and some future works are presented. The authors conducted this research to help other researchers who want to study the algorithm and utilize it to optimize engineering problems.</p><br><p></p><p></p>


2011 ◽  
Vol 07 (03) ◽  
pp. 363-381 ◽  
Author(s):  
MILLIE PANT ◽  
RADHA THANGARAJ ◽  
AJITH ABRAHAM

This paper presents a simple, hybrid two phase global optimization algorithm called DE-PSO for solving global optimization problems. DE-PSO consists of alternating phases of Differential Evolution (DE) and Particle Swarm Optimization (PSO). The algorithm is designed so as to preserve the strengths of both the algorithms. Empirical results show that the proposed DE-PSO is quite competent for solving the considered test functions as well as real life problems.


2021 ◽  
Vol 11 (11) ◽  
pp. 4795
Author(s):  
Rasel Ahmed ◽  
Amril Nazir ◽  
Shuhaimi Mahadzir ◽  
Mohammad Shorfuzzaman ◽  
Jahedul Islam

Metaheuristic algorithms are widely used for optimization in both research and the industrial community for simplicity, flexibility, and robustness. However, multi-modal optimization is a difficult task, even for metaheuristic algorithms. Two important issues that need to be handled for solving multi-modal problems are (a) to categorize multiple local/global optima and (b) to uphold these optima till the ending. Besides, a robust local search ability is also a prerequisite to reach the exact global optima. Grey Wolf Optimizer (GWO) is a recently developed nature-inspired metaheuristic algorithm that requires less parameter tuning. However, the GWO suffers from premature convergence and fails to maintain the balance between exploration and exploitation for solving multi-modal problems. This study proposes a niching GWO (NGWO) that incorporates personal best features of PSO and a local search technique to address these issues. The proposed algorithm has been tested for 23 benchmark functions and three engineering cases. The NGWO outperformed all other considered algorithms in most of the test functions compared to state-of-the-art metaheuristics such as PSO, GSA, GWO, Jaya and two improved variants of GWO, and niching CSA. Statistical analysis and Friedman tests have been conducted to compare the performance of these algorithms thoroughly.


2020 ◽  
Author(s):  
Chnoor M. Rahman ◽  
Tarik A. Rashid ◽  
Abeer Alsadoon ◽  
Nebojsa Bacanin ◽  
Polla Fattah

<p></p><p></p><p>Dragonfly algorithm developed in 2016. It is one of the algorithms used by the researchers to optimize an extensive series of uses and applications in various areas. At times, it offers superior performance compared to the most well-known optimization techniques. However, this algorithm faces several difficulties when it is utilized to enhance complex optimization problems. This work addressed the robustness of the method to solve real-world optimization issues, and its deficiency to improve complex optimization problems. This review paper shows a comprehensive investigation of the dragonfly algorithm in the engineering area. First, an overview of the algorithm is discussed. Besides, we also examine the modifications of the algorithm. The merged forms of this algorithm with different techniques and the modifications that have been done to make the algorithm perform better are addressed. Additionally, a survey on applications in the engineering area that used the dragonfly algorithm is offered. A comparison is made between the algorithm and other metaheuristic techniques to show its ability to enhance various problems. The outcomes of the algorithm from the works that utilized the dragonfly algorithm previously and the outcomes of the benchmark test functions proved that in comparison with some techniques, the dragonfly algorithm owns an excellent performance, especially for small to intermediate applications. Moreover, the congestion facts of the technique and some future works are presented. The authors conducted this research to help other researchers who want to study the algorithm and utilize it to optimize engineering problems.</p><br><p></p><p></p>


2020 ◽  
Author(s):  
Chnoor M. Rahman ◽  
Tarik A. Rashid ◽  
Abeer Alsadoon ◽  
Nebojsa Bacanin ◽  
Polla Fattah

<p></p><p></p><p>Dragonfly algorithm developed in 2016. It is one of the algorithms used by the researchers to optimize an extensive series of uses and applications in various areas. At times, it offers superior performance compared to the most well-known optimization techniques. However, this algorithm faces several difficulties when it is utilized to enhance complex optimization problems. This work addressed the robustness of the method to solve real-world optimization issues, and its deficiency to improve complex optimization problems. This review paper shows a comprehensive investigation of the dragonfly algorithm in the engineering area. First, an overview of the algorithm is discussed. Besides, we also examine the modifications of the algorithm. The merged forms of this algorithm with different techniques and the modifications that have been done to make the algorithm perform better are addressed. Additionally, a survey on applications in the engineering area that used the dragonfly algorithm is offered. A comparison is made between the algorithm and other metaheuristic techniques to show its ability to enhance various problems. The outcomes of the algorithm from the works that utilized the dragonfly algorithm previously and the outcomes of the benchmark test functions proved that in comparison with some techniques, the dragonfly algorithm owns an excellent performance, especially for small to intermediate applications. Moreover, the congestion facts of the technique and some future works are presented. The authors conducted this research to help other researchers who want to study the algorithm and utilize it to optimize engineering problems.</p><br><p></p><p></p>


2012 ◽  
Vol 622-623 ◽  
pp. 35-39 ◽  
Author(s):  
Durgesh Sharma ◽  
Suresh Garg ◽  
Chitra Sharma

Most of real-life engineering problems are objectives optimization problems. In many cases objectives under consideration conflict with each other and optimizing a particular solution with respect to a single objective can result in unacceptable results with respect to the other.FMS Scheduling problem is considered as one of the most difficult NP-hard combinatorial optimization problems. Therefore, determining an optimal schedule and controlling an FMS is considered a difficult task. It is difficult for traditional optimization techniques to provide the best solution. In this paper, we propose a multi-objective genetic algorithm for effectively solving job processing FMS Scheduling problem. An attempt has been made to generate a schedule using Genetic Algorithm with Roulette Wheel Base Selection Process to minimize Total Make Span Time and to maximize machine utilization time.


Tehnika ◽  
2021 ◽  
Vol 76 (4) ◽  
pp. 439-446
Author(s):  
Branislav Milenković

Recently, optimization techniques have become very important and popular in different engineering applications. In this paper we demonstrate how Harris Hawks Optimization (HHO) algorithm can be used to solve certain optimization problems in engineering. In the second part, biological fundamentals, as well as method explanation are given. Afterwards, the HHO algorithm and its' applicability is explained in detail. The pseudo code for this algorithm was written using MATLAB R2019a software suite. Harris Hawks Optimization (HHO) algorithm was used for optimization of engineering problems, such as: speed reducer optimization, pressure vessel optimization, cantilever beam optimization and tension/compression spring optimization. The statistical results and comparisons show that the HHO algorithm provides very promising and competitive results compared to others metaheuristic algorithms.


2021 ◽  
Vol 1 (1) ◽  
pp. 75-94
Author(s):  
Pei-Wei Tsai ◽  
◽  
Xingsi Xue ◽  
Jing Zhang ◽  
Vaci Istanda ◽  
...  

<abstract><p>Evolutionary algorithm is one of the optimization techniques. Cat swarm optimization (CSO)-based algorithm is frequently used in many applications for solving challenging optimization problems. In this paper, the tracing mode in CSO is modified to reduce the number of user-defined parameters and weaken the sensitivity to the parameter values. In addition, a <italic>mode ratio</italic> control scheme for switching individuals between different movement modes and a search boosting strategy are proposed. The obtained results from our method are compared with the modified CSO without the proposed strategy, the original CSO, the particle swarm optimization (PSO) and differential evolution (DE) with three commonly-used DE search schemes. Six test functions from IEEE congress on evolutionary competition (CEC) are used to evaluate the proposed methods. The overall performance is evaluated by the average ranking over all test results. The ranking result indicates that our proposed method outperforms the other methods compared.</p></abstract>


2021 ◽  
Vol 2021 ◽  
pp. 1-31
Author(s):  
Yanhui Che ◽  
Dengxu He

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.


Mathematics ◽  
2021 ◽  
Vol 9 (13) ◽  
pp. 1477
Author(s):  
Chun-Yao Lee ◽  
Guang-Lin Zhuo

This paper proposes a hybrid whale optimization algorithm (WOA) that is derived from the genetic and thermal exchange optimization-based whale optimization algorithm (GWOA-TEO) to enhance global optimization capability. First, the high-quality initial population is generated to improve the performance of GWOA-TEO. Then, thermal exchange optimization (TEO) is applied to improve exploitation performance. Next, a memory is considered that can store historical best-so-far solutions, achieving higher performance without adding additional computational costs. Finally, a crossover operator based on the memory and a position update mechanism of the leading solution based on the memory are proposed to improve the exploration performance. The GWOA-TEO algorithm is then compared with five state-of-the-art optimization algorithms on CEC 2017 benchmark test functions and 8 UCI repository datasets. The statistical results of the CEC 2017 benchmark test functions show that the GWOA-TEO algorithm has good accuracy for global optimization. The classification results of 8 UCI repository datasets also show that the GWOA-TEO algorithm has competitive results with regard to comparison algorithms in recognition rate. Thus, the proposed algorithm is proven to execute excellent performance in solving optimization problems.


Sign in / Sign up

Export Citation Format

Share Document