Differential evolution (DE) is a popular evolutionary algorithm inspired by Darwin’s theory of evolution and has been studied extensively to solve different areas of optimisation and engineering applications since its introduction by Storn in 1997. This study aims to review the massive progress of DE in the research community by analysing the 192 articles published on this subject from 1997 to 2021, particularly studies in the past five years. The methodology used to search for relevant DE papers and an overview of the original DE are firstly explained. Recent advances in the modifications proposed to enhance the effectiveness and efficiency of the original DE are reviewed by analysing the strengths and weaknesses of each published work, followed by the potential applications of these DE variants in solving different real-world engineering problems. In contrast to most existing DE review papers, additional analyses are performed in this survey by investigating the impacts of various parameter settings on given DE variants to identify their optimal values required for solving certain problem classes. The qualities of modifications incorporated into selected DE variants are also evaluated by measuring the performance gains achieved in terms of search accuracy and/or efficiency against the original DE. The additional surveys conducted in this study are anticipated to provide more insightful perspectives for both beginners and experts of DE research, enabling their better understanding about current research trends and new motivations to outline appropriate strategic planning for future development works. 

Differential evolution: A recent review based on state-of-the-art works

In recent years, several multi-method and multi-operator-based algorithms have been proposed for solving optimization problems. Generally, their performance is better than other algorithms that based on a single operator and/or algorithm. However, they do not perform consistently well over all the problems tested in the literature. In this paper, we propose an improved optimization algorithm that uses the benefits of multiple differential evolution operators, with more emphasis placed on the best-performing operator. The performance of the proposed algorithm is tested by solving 10 problems with 5, 10, 15 and 20 dimensions taken from CEC2020 competition on single objective bound constrained optimization, with its results outperforming both single operator-based and different state-of-the-art algorithms.

Improved Multi-operator Differential Evolution Algorithm for Solving Unconstrained Problems

The use of UAVs in areas ranging from agriculture over urban services to entertainment or simply as a hobby has rapidly grown over the last years. Regarding serious/commercial applications, UAVs have been considered in the literature, especially as mobile sensing/actuation platforms (i.e., as a delivery platform for an increasingly wide range of sensors and actuators). With regard to timely, cost-effective and very rich data acquisition, both, NEC Research as well as TNO are pursuing investigations into the use of UAVs and swarms of UAVs for scenarios where high-resolution requirements, prohibiting environments or tight time constraints render traditional approaches ineffective. In this review article, we provide a brief overview of safety and security-focused application areas that we identified as main targets for industrial and commercial projects, especially in the context of intelligent autonomous systems and autonomous/semi-autonomously operating swarms. We discuss a number of challenges related to the deployment of UAVs in general and to their deployment within the identified application areas in particular. As such, this article is meant to serve as a review and overview of the literature and the state-of-the-art, but also to offer an outlook over our possible (near-term) future work and the challenges that we will face there.

Review: Using Unmanned Aerial Vehicles (UAVs) as Mobile Sensing Platforms (MSPs) for Disaster Response, Civil Security and Public Safety

Differential evolution (DE) is a popular evolutionary algorithm inspired by Darwin’s theory of evolution and has been studied extensively to solve different areas of optimisation and engineering applications since its introduction by Storn in 1997. This study aims to review the massive progress of DE in the research community by analysing the 192 articles published on this subject from 1997 to 2021, particularly studies in the past five years. The methodology used to search for relevant DE papers and an overview of the original DE are firstly explained. Recent advances in the modifications proposed to enhance the effectiveness and efficiency of the original DE are reviewed by analysing the strengths and weaknesses of each published work, followed by the potential applications of these DE variants in solving different real-world engineering problems. In contrast to most existing DE review papers, additional analyses are performed in this survey by investigating the impacts of various parameter settings on given DE variants to identify their optimal values required for solving certain problem classes. The qualities of modifications incorporated into selected DE variants are also evaluated by measuring the performance gains achieved in terms of search accuracy and/or efficiency against the original DE. The additional surveys conducted in this study are anticipated to provide more insightful perspectives for both beginners and experts of DE research, enabling their better understanding about current research trends and new motivations to outline appropriate strategic planning for future development works.

Unmanned aerial vehicles (UAVs) or Drones technology has a huge potential for supporting different efficient solutions for the smart applications in our world. The applications include sma...

A survey on recent optimal techniques for securing unmanned aerial vehicles applications

Abstract Deep Neural Networks (DNNs) are widely regarded as the most effective learning tool for dealing with large datasets, and they have been successfully used in thousands of applications in a variety of fields. Based on these large datasets, they are trained to learn the relationships between various variables. The adaptive moment estimation (Adam) algorithm, a highly efficient adaptive optimization algorithm, is widely used as a learning algorithm in various fields for training DNN models. However, it needs to improve its generalization performance, especially when training with large-scale datasets. Therefore, in this paper, we propose HN Adam, a modified version of the Adam Algorithm, to improve its accuracy and convergence speed. The HN_Adam algorithm is modified by automatically adjusting the step size of the parameter updates over the training epochs. This automatic adjustment is based on the norm value of the parameter update formula according to the gradient values obtained during the training epochs. Furthermore, a hybrid mechanism was created by combining the standard Adam algorithm and the AMSGrad algorithm. As a result of these changes, the HN_Adam algorithm, like the stochastic gradient descent (SGD) algorithm, has good generalization performance and achieves fast convergence like other adaptive algorithms. To test the proposed HN_Adam algorithm performance, it is evaluated to train a deep convolutional neural network (CNN) model that classifies images using two different standard datasets: MNIST and CIFAR-10. The algorithm results are compared to the basic Adam algorithm and the SGD algorithm, in addition to other five recent SGD adaptive algorithms. In most comparisons, the HN Adam algorithm outperforms the compared algorithms in terms of accuracy and convergence speed. AdaBelief is the most competitive of the compared algorithms. In terms of testing accuracy and convergence speed (represented by the consumed training time), the HN-Adam algorithm outperforms the AdaBelief algorithm by an improvement of 1.0% and 0.29% for the MNIST dataset, and 0.93% and 1.68% for the CIFAR-10 dataset, respectively. 

/pdf/a-modified-adam-algorithm-for-deep-neural-network-289v15ou.pdf

A modified Adam algorithm for deep neural network optimization

The paper discusses the cooperative tracking problem of partially known cyber-physical multi-agent networked systems. In this system, there exist two cascaded chances for cyber-attacks. The local agent is of networked system type that is subjected to unknown false data-injection and replay cyber-attacks that are dissimilar in the sensor-controller and the controller-actuator network parts. The communication between any two agents, if they are connected, is accomplished via a communication network that is subjected to false data-injection cyber-attacks. The problem of the existing two cascaded chances for cyber-attacks is solved in three steps. First, with partially known system parameters and unknown false data-injection and replay cyber-attacks, the state estimates of all the local followers are evaluated by designing local adaptive observers. Second, a new technique is designed to compensate for the unmatched terms that result from the use of local adaptive observers. After that, distributed adaptive leader-follower security controllers are proposed based on the local estimated information in addition to the infected arrived information from the neighbors. Meanwhile, it is verified that the suggested security control method guarantees that all states of the followers under the considered cyber-attacks follow the given leader asymptotically. The efficacy of the developed adaptive leader-follower security controllers is verified via an illustrative example.

Cooperative control for cyber-physical multi-agent networked control systems with unknown false data-injection and replay cyber-attacks.

The Differential Evolution (DE) algorithm, introduced by Storn and Price in 1995, has become one of the most efficacious population-based optimization approaches. In this algorithm, use is made of the significant concepts of mutation, crossover, and selection. The tuning control parameters are population size, mutation scaling factor, and crossover rate. Over the last decade, several variants of DE have been presented to improve its performance aspects. In the present paper, we further enhance DE. The population size and mutation scaling factor are taken alone in the tuning process; the crossover rate is treated implicitly in the crossover stage. Five forms for crossover are suggested for the first 100 iterations of the computational algorithm. After this learning period, we pick the form which yields the best value of the objective function in the greatest number of iterations (among the 100). Our algorithm is tested on a total of 47 benchmark functions: 27 traditional functions and 20 special functions chosen from CEC2005 and CEC2013. The results are assessed in terms of the mean and standard deviation of the error, success rate, and average number of function evaluations over successful runs. Convergence characteristics are also investigated. Comparison is made with the original DE and Success-History based Adaptive DE (SHADE) as a state-of-the-art DE algorithm, and the results demonstrate the superiority of the proposed approach for the majority of the functions considered.

An enhanced differential evolution optimization algorithm

Currently, building accurate indoor positioning systems is a crucial challenge facing scientific researchers One of the most effective metrics that increases positioning accuracy is the placement of access points (APs) in the service area In this paper, we propose a genetic algorithm based framework, GenoPlacement, to solve APs placement problem GenoPlacement handles different types of building walls such as concrete, brick, and glass Our objective is to find an APs setup with unique fingerprints at each signal test point (STP) while maximizing diversity among these fingerprints To evaluate GenoPlacement, we compare the proposed objective function with the traditional one which maximizes the received signal strength at each STP Then, we compare GenoPlacement with two nominated approaches The results confirm that building indoor positioning system considering the optimal places of APs decreases the positioning error down to four meters at 90% precision

Optimal placement of access points for indoor positioning using a genetic algorithm

Differential evolution (DE) is a stochastic population-based optimization algorithm first introduced in 1995. It is an efficient search method that is widely used for solving global optimization problems. It has three control parameters: the scaling factor (F), the crossover rate (CR), and the population size (NP). As any evolutionary algorithm (EA), the performance of DE depends on its exploration and exploitation abilities for the search space. Tuning the control parameters and choosing a suitable mutation strategy play an important role in balancing the rate of exploration and exploitation. Many variants of the DE algorithm have been introduced to enhance its exploration and exploitation abilities. All of these DE variants try to achieve a good balance between exploration and exploitation rates. In this paper, an enhanced DE algorithm with multi-mutation strategies and self-adapting control parameters is proposed. We use three forms of mutation strategies with their associated self-adapting control parameters. Only one mutation strategy is selected to generate the trial vector. Switching between these mutation forms during the evolution process provides dynamic rates of exploration and exploitation. Having different rates of exploration and exploitation through the optimization process enhances the performance of DE in terms of accuracy and convergence rate. The proposed algorithm is evaluated over 38 benchmark functions: 13 traditional functions, 10 special functions chosen from CEC2005, and 15 special functions chosen from CEC2013. Comparison is made in terms of the mean and standard deviation of the error with the standard \"DE/rand/1/bin\" and five state-of-theart DE algorithms. Furthermore, two nonparametric statistical tests are applied in the comparison: Wilcoxon signed-rank and Friedman tests. The results show that the performance of the proposed algorithm is better than other DE algorithms for the majority of the tested functions.

/pdf/an-enhanced-differential-evolution-algorithm-with-multi-yg98730z5s.pdf

An Enhanced Differential Evolution Algorithm with Multi-mutation Strategies and Self-adapting Control Parameters

Handle everyday research tasks with reliable, citation-backed results

Your personal Research Agent to handle research tasks with citation-backed results

Popular Tasks used by Researchers

How can I help with your research?

Meet SciSpace

Get more enhanced response by uploading the PDFs you want me to reference.

No relevant PDFs in your library

SciSpace is the AI research assistant for academics. Run systematic literature reviews on 280M+ papers, and write papers with cited sources. Trusted by 1M+ students, PhDs & researchers.

SciSpace | AI for Research

Analyze PDFs

Code & Manuscripts

Funding & Grants

Literature & Patents

Medical & Clinical Data

Systematic Review

Visualize & Present

Web & Data

Build a Google Scholar-like website for your research.

Build a website

Create charts and images for your research

Create a Chart

Write a paper for submission to a journal

Draft a manuscript

Patent Search

Design eye-catching scientific posters in minutes.

Scientific Poster Generation

Systematic Literature Review

One task is running at the moment. Your messages will be shown right after.

Drag and drop or click here to browse

Loved by <highlight>1 million+</highlight> researchers

Extract a list of specific topics and their sources from unstructured text

Topics

Compare and analyze relevant papers that matches with your search

Papers

Get insights from PDFs and bookmarked papers from your library

My library

Recent searches

Try searching for:

Catch AI-generated content in scholarly and non-scholarly content

{ai} Detector

Ai Writer

Get PDF Summaries, highlighted text explanations 

Chat with PDF

Effortlessly create in-text citations and bibliographies in APA and 2,500 other formats

Citation generator

Get explanations, summaries, and answers on academic papers

Ease up your research workflow with {scispace}'s cohort of exciting AI tools

Elevate your academic writing skills and convey your ideas the way you want

Paraphraser

Explore our range of reading and writing tools

Your file is being prepared and should be ready in a few minutes. If it's a large file, it might take a bit longer. You can close this window, and we'll email you the file when it's done.

You have reached a maximum limit of <strong>{limit}</strong> columns in the table. Remove at least <strong>1</strong> column to add or create another one.

M. Arafa

Author Tools

Chat about Author