scholarly journals A Survey on Dragonfly Algorithm and its Applications in Engineering

2022 ◽  
Author(s):  
Chnoor M. Rahman ◽  
Tarik A. Rashid ◽  
Abeer Alsadoon ◽  
Nebojsa Bacanin ◽  
Polla Fattah ◽  
...  
Keyword(s):  
Large Scale ◽  
Optimization Problems ◽  
Optimization Techniques ◽  
Superior Performance ◽  
Dragonfly Algorithm ◽  
Engineering Problems ◽  
Complex Optimization ◽  
Metaheuristic Techniques ◽  
Scale Optimization ◽  
Benchmark Test Functions

<p></p><p></p><p>The 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 examined 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. The utilized engineering applications are the applications in the field of mechanical engineering problems, electrical engineering problems, optimal parameters, economic load dispatch, and loss reduction. The algorithm is tested and evaluated against particle swarm optimization algorithm and firefly algorithm. To evaluate the ability of the dragonfly algorithm and other participated algorithms a set of traditional benchmarks (TF1-TF23) were utilized. Moreover, to examine the ability of the algorithm to optimize large scale optimization problems CEC-C2019 benchmarks were utilized. 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 participated algorithms (GWO, PSO, and GA), 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><p></p><p></p>

scholarly journals A Survey on Dragonfly Algorithm and its Applications in Engineering

2020 ◽  
Author(s):  
Chnoor M. Rahman ◽  
Tarik A. Rashid
Keyword(s):  
Review Paper ◽  
Optimization Problems ◽  
Optimization Techniques ◽  
Superior Performance ◽  
Test Functions ◽  
Dragonfly Algorithm ◽  
Engineering Problems ◽  
Complex Optimization ◽  
Metaheuristic Techniques ◽  
Benchmark Test Functions

<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>

scholarly journals A Survey on Dragonfly Algorithm and its Applications in Engineering

2020 ◽  
Author(s):  
Chnoor M. Rahman ◽  
Tarik A. Rashid ◽  
Abeer Alsadoon ◽  
Nebojsa Bacanin ◽  
Polla Fattah
Keyword(s):  
Review Paper ◽  
Optimization Problems ◽  
Optimization Techniques ◽  
Superior Performance ◽  
Test Functions ◽  
Dragonfly Algorithm ◽  
Engineering Problems ◽  
Complex Optimization ◽  
Metaheuristic Techniques ◽  
Benchmark Test Functions

<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>

scholarly journals A Survey on Dragonfly Algorithm and its Applications in Engineering

2020 ◽  
Author(s):  
Chnoor M. Rahman ◽  
Tarik A. Rashid ◽  
Abeer Alsadoon ◽  
Nebojsa Bacanin ◽  
Polla Fattah
Keyword(s):  
Review Paper ◽  
Optimization Problems ◽  
Optimization Techniques ◽  
Superior Performance ◽  
Test Functions ◽  
Dragonfly Algorithm ◽  
Engineering Problems ◽  
Complex Optimization ◽  
Metaheuristic Techniques ◽  
Benchmark Test Functions

<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>

scholarly journals A Survey on Dragonfly Algorithm and its Applications in Engineering

2020 ◽  
Author(s):  
Chnoor M. Rahman ◽  
Tarik A. Rashid
Keyword(s):  
Real World ◽  
Optimization Problems ◽  
Computational Design ◽  
Heuristic Optimization ◽  
Future Trends ◽  
Excellent Performance ◽  
Comprehensive Investigation ◽  
Dragonfly Algorithm ◽  
Engineering Problems ◽  
Complex Optimization

<p>Dragonfly algorithm (DA) is one of the most recently developed heuristic optimization algorithms by Mirjalili in 2016. It is now one of the most widely used algorithms. In some cases, it outperforms the most popular algorithms. However, this algorithm is not far from obstacles when it comes to complex optimization problems. In this work, along with the strengths of the algorithm in solving real-world optimization problems, the weakness of the algorithm to optimize complex optimization problems is addressed. This survey presents a comprehensive investigation of DA in the engineering area. First, an overview of the algorithm is discussed. Additionally, the different variants of the algorithm are addressed too. The combined versions of the DA with other techniques and the modifications that have been done to make the algorithm work better are shown. Besides, a survey on applications in engineering area that used DA is offered. The algorithm is compared with some other metaheuristic algorithms to demonstrate its ability to optimize problems comparing to the others. The results of the algorithm from the works that utilized the DA in the literature and the results of the benchmark functions showed that in comparison with some other algorithms DA has an excellent performance, especially for small to medium problems. Moreover, the bottlenecks of the algorithm and some future trends are discussed. Authors conduct this research with the hope of offering beneficial information about the DA to the researchers who want to study the algorithm and utilize it to optimize engineering problems.</p><p><strong><br></strong></p><p><strong> Journal of Computational Design and Engineering, 2020.</strong></p><p><strong>DOI: 10.1093/jcde/qwaa037</strong></p>

Applying Large-Scale Optimization to Evaluate Pavement Maintenance Alternatives for Low-Volume Roads using Genetic Algorithms

2018 ◽  
Vol 2672 (52) ◽  
pp. 205-215 ◽  
Author(s):  
Marwan Hafez ◽  
Khaled Ksaibati ◽  
Rebecca A. Atadero
Keyword(s):  
Genetic Algorithms ◽  
Large Scale ◽  
Optimization Problems ◽  
Optimization Techniques ◽  
Pavement Performance ◽  
Large Scale Optimization ◽  
Maintenance Policy ◽  
Low Volume Roads ◽  
Low Volume ◽  
Scale Optimization

Over the last decade, significant progress has been made to customize the maintenance policies of low-volume roads (LVRs) to local needs and available resources. Low-cost treatments and surface repairs are extensively employed to reduce annual maintenance costs. Colorado Department of Transportation (CDOT) uses chip seals and thin overlays as the available treatment options applied to LVRs. However, the effectiveness of these treatments differs depending on the existing condition of pavements. Some surface treatments and light rehabilitations provide only short-term effectiveness. Multi-year optimization techniques can support decision makers with a set of optimal maintenance activities to achieve specific pavement performance targets. This study applies large-scale optimization to compare the current CDOT maintenance policy with an alternative strategy recommended for low-volume paved roads in Colorado. Genetic algorithms were applied in the optimization models because they are capable of resolving the computational complexity of optimization problems in a timely fashion. The optimized maintenance alternatives were comprehensively investigated for a LVR network in Colorado over a specific planning horizon. The specific optimization constraints and limitations prevailing in LVRs are addressed and introduced in the problem formulation of the optimization process. The results of both performance and cost analysis emphasize the effectiveness of the proposed maintenance strategy compared with the existing one. The alternative policy provides much more benefit-cost saving while preserving the overall pavement performance of the network. This approach is expected to be efficient to quantify the mid- and long-term financial impact of different treatment policies applied to LVRs within modest resources.

A new three-term spectral conjugate gradient algorithm with higher numerical performance for solving large scale optimization problems based on Quasi-Newton equation

2021 ◽  
pp. 2150053
Author(s):  
Jie Guo ◽  
Zhong Wan
Keyword(s):  
Conjugate Gradient ◽  
Large Scale ◽  
Line Search ◽  
Optimization Problems ◽  
Gradient Algorithm ◽  
Large Scale Optimization ◽  
Newton Equation ◽  
Numerical Performance ◽  
Scale Optimization ◽  
Quasi Newton

A new spectral three-term conjugate gradient algorithm in virtue of the Quasi-Newton equation is developed for solving large-scale unconstrained optimization problems. It is proved that the search directions in this algorithm always satisfy a sufficiently descent condition independent of any line search. Global convergence is established for general objective functions if the strong Wolfe line search is used. Numerical experiments are employed to show its high numerical performance in solving large-scale optimization problems. Particularly, the developed algorithm is implemented to solve the 100 benchmark test problems from CUTE with different sizes from 1000 to 10,000, in comparison with some similar ones in the literature. The numerical results demonstrate that our algorithm outperforms the state-of-the-art ones in terms of less CPU time, less number of iteration or less number of function evaluation.

A modified competitive swarm optimizer for large scale optimization problems

2017 ◽  
Vol 59 ◽  
pp. 340-362 ◽  
Author(s):  
Prabhujit Mohapatra ◽  
Kedar Nath Das ◽  
Santanu Roy
Keyword(s):  
Large Scale ◽  
Optimization Problems ◽  
Large Scale Optimization ◽  
Scale Optimization
Sign in / Sign up

Export Citation Format

Share Document