scholarly journals ANA: Ant Nesting Algorithm for Optimizing Real-World Problems

Mathematics ◽  
2021 ◽  
Vol 9 (23) ◽  
pp. 3111
Author(s):  
Deeam Najmadeen Hama Rashid ◽  
Tarik A. Rashid ◽  
Seyedali Mirjalili
Keyword(s):  
Real World ◽  
Rate Of Change ◽  
Test Cases ◽  
Intelligent Algorithm ◽  
Dragonfly Algorithm ◽  
Whale Optimization ◽  
Engineering Problems ◽  
Swarming Behavior ◽  
Nesting Algorithm ◽  
Real World Problems

In this paper, a novel swarm intelligent algorithm is proposed called ant nesting algorithm (ANA). The algorithm is inspired by Leptothorax ants and mimics the behavior of ants searching for positions to deposit grains while building a new nest. Although the algorithm is inspired by the swarming behavior of ants, it does not have any algorithmic similarity with the ant colony optimization (ACO) algorithm. It is worth mentioning that ANA is considered a continuous algorithm that updates the search agent position by adding the rate of change (e.g., step or velocity). ANA computes the rate of change differently as it uses previous, current solutions, fitness values during the optimization process to generate weights by utilizing the Pythagorean theorem. These weights drive the search agents during the exploration and exploitation phases. The ANA algorithm is benchmarked on 26 well-known test functions, and the results are verified by a comparative study with genetic algorithm (GA), particle swarm optimization (PSO), dragonfly algorithm (DA), five modified versions of PSO, whale optimization algorithm (WOA), salp swarm algorithm (SSA), and fitness dependent optimizer (FDO). ANA outperformances these prominent metaheuristic algorithms on several test cases and provides quite competitive results. Finally, the algorithm is employed for optimizing two well-known real-world engineering problems: antenna array design and frequency-modulated synthesis. The results on the engineering case studies demonstrate the proposed algorithm’s capability in optimizing real-world problems.

scholarly journals New Challenges Arising in Engineering Problems with Fractional and Integer Order

2021 ◽  
Vol 5 (2) ◽  
pp. 35
Author(s):  
Haci Mehmet Baskonus ◽  
Luis Manuel Sánchez Ruiz ◽  
Armando Ciancio
Keyword(s):  
Mathematical Models ◽  
Real World ◽  
Integer Order ◽  
Engineering Problems ◽  
New Challenges ◽  
Real World Problems

Mathematical models have been frequently studied in recent decades in order to obtain the deeper properties of real-world problems [...]

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>

WOADF: Whale Optimization Integrated Adaptive Dragonfly Algorithm Enabled with the TDD Properties for Model Transformation

2019 ◽  
Vol 18 (04) ◽  
pp. 1950026 ◽  
Author(s):  
Pramod P. Jadhav ◽  
Shashank D. Joshi
Keyword(s):  
Model Transformation ◽  
Fitness Function ◽  
Test Cases ◽  
Relational Schema ◽  
Dragonfly Algorithm ◽  
Proposed Model ◽  
Fitness Value ◽  
Whale Optimization ◽  
Input Model ◽  
Class Diagrams

Model Transformation (MT) has led the researchers to concentrate more in the field of software engineering. MT focuses mainly on transforming the input model to the target model to make it easily understandable. For the transformation, using optimal rules among a set of rules makes the design simpler. This paper proposes an algorithm, namely Whale Optimization integrated Adaptive Dragonfly (WOADF) algorithm, which integrates Adaptive Dragonfly (ADF) algorithm and Whale Optimization Algorithm (WOA), for transforming class diagrams (CLDs) to Relational Schema (RS). Further, the UML CLD is transformed into the RS model based on specific rules incorporated by the proposed WOADF algorithm. The fitness function of the proposed model is evaluated to select the optimal rule, by including the test cases to evaluate the optimal blocks. Then, the optimal blocks obtained from the proposed WOADF algorithm are used for achieving the transformation from CLD to the RS model. The effectiveness of the proposed WOADF algorithm is checked with Automatic Correctness (AC) and fitness values and is evaluated to be the best when compared to other existing techniques with maximum AC value measured to be 0.812 and fitness value to be 0.897, respectively.

scholarly journals Handrails through the Swamp? A Pilot to Test the Integration and Implementation Science Framework in Complex Real-World Research

2021 ◽  
Vol 13 (10) ◽  
pp. 5491
Author(s):  
Melissa Robson-Williams ◽  
Bruce Small ◽  
Roger Robson-Williams ◽  
Nick Kirk
Keyword(s):  
Pilot Study ◽  
Case Studies ◽  
Implementation Science ◽  
Real World ◽  
Environmental Problems ◽  
Environmental Research ◽  
Integrative Framework ◽  
The World ◽  
Science Framework ◽  
Real World Problems

The socio-environmental challenges the world faces are ‘swamps’: situations that are messy, complex, and uncertain. The aim of this paper is to help disciplinary scientists navigate these swamps. To achieve this, the paper evaluates an integrative framework designed for researching complex real-world problems, the Integration and Implementation Science (i2S) framework. As a pilot study, we examine seven inter and transdisciplinary agri-environmental case studies against the concepts presented in the i2S framework, and we hypothesise that considering concepts in the i2S framework during the planning and delivery of agri-environmental research will increase the usefulness of the research for next users. We found that for the types of complex, real-world research done in the case studies, increasing attention to the i2S dimensions correlated with increased usefulness for the end users. We conclude that using the i2S framework could provide handrails for researchers, to help them navigate the swamps when engaging with the complexity of socio-environmental problems.

scholarly journals Combined Games with Randomly Delayed Beginnings

Mathematics ◽  
2021 ◽  
Vol 9 (5) ◽  
pp. 534
Author(s):  
F. Thomas Bruss
Keyword(s):  
Discrete Time ◽  
Real World ◽  
Optimal Stopping ◽  
Random Variables ◽  
Approximate Solutions ◽  
Real World Problems

This paper presents two-person games involving optimal stopping. As far as we are aware, the type of problems we study are new. We confine our interest to such games in discrete time. Two players are to chose, with randomised choice-priority, between two games G1 and G2. Each game consists of two parts with well-defined targets. Each part consists of a sequence of random variables which determines when the decisive part of the game will begin. In each game, the horizon is bounded, and if the two parts are not finished within the horizon, the game is lost by definition. Otherwise the decisive part begins, on which each player is entitled to apply their or her strategy to reach the second target. If only one player achieves the two targets, this player is the winner. If both win or both lose, the outcome is seen as “deuce”. We motivate the interest of such problems in the context of real-world problems. A few representative problems are solved in detail. The main objective of this article is to serve as a preliminary manual to guide through possible approaches and to discuss under which circumstances we can obtain solutions, or approximate solutions.

Review of Network Flow Algorithms David P. Williamson

2021 ◽  
Vol 52 (1) ◽  
pp. 12-15
Author(s):  
S.V. Nagaraj
Keyword(s):  
Graduate Students ◽  
Real World ◽  
Network Flow ◽  
Network Flows ◽  
Optimization Problems ◽  
Capacity Constraints ◽  
Incoming Flow ◽  
Network Flow Problems ◽  
Flow Problems ◽  
Real World Problems

This book is on algorithms for network flows. Network flow problems are optimization problems where given a flow network, the aim is to construct a flow that respects the capacity constraints of the edges of the network, so that incoming flow equals the outgoing flow for all vertices of the network except designated vertices known as the source and the sink. Network flow algorithms solve many real-world problems. This book is intended to serve graduate students and as a reference. The book is also available in eBook (ISBN 9781316952894/US$ 32.00), and hardback (ISBN 9781107185890/US$99.99) formats. The book has a companion web site www.networkflowalgs.com where a pre-publication version of the book can be downloaded gratis.

Help communities solve real-world problems with AI

AI Matters ◽  
2019 ◽  
Vol 5 (3) ◽  
pp. 12-14
Author(s):  
Tara Chklovski
Keyword(s):  
Real World ◽  
Real World Problems
Sign in / Sign up

Export Citation Format

Share Document