Search

Summary The channel availability problem reaches a higher degree in mobile ad hoc networks (MANETs) and garners a lot of attention in communication networks. Because increased mobile usage might result in a lack of channel allocation, an improved channel allocation technique is presented to tackle the availability problem. The distributed dynamic channel allocation (DDCA) model is built in this paper using the hybrid memory dragonfly with imperialist competitive (HMDIC) method. Based on optimization logic, this strategy assigns the channel to mobile hosts. The MANET provides a dispersed network within the coverage region in the absence of base station infrastructure. The HMDIC optimizer approach in this circumstance randomly begins every respective node to update and store their pbest value utilizing RAM dragonfly employing satellite images. The constraint values are then used to construct the cost function, which results in a strong kind of global optimum solution. The channels are therefore distributed in an effective manner. The HMDIC algorithm is used in this research to build a novel channel allocation system. It makes advantage of the exploration capabilities to successfully explore the individual node using MDA (Modified Dragonfly Algorithm) and locate the global best solution using imperialist competitive algorithm (ICA). Both of these combined tactics are more effective in accelerating the convergence of the allocation model. To validate the performance, the HMDIC‐based DDCA system provides promising results in terms of assigning available channels, thereby enhancing channel reuse efficiency and fractional interference. [ABSTRACT FROM AUTHOR]

The objective of this paper is to identify the most sensitive component of a turbogenerator and optimize its availability. To achieve this, we begin by conducting an initial reliability, availability, maintainability, and dependability (RAMD) analysis on each component. Subsequently, a novel stochastic model is developed to analyze the steady‐state availability of the turbogenerator, employing a Markov birth‐death process. In this model, failure and repair rates are assumed to follow an exponential distribution and are statistically independent. To optimize the proposed stochastic model, we employ four population‐based meta‐heuristic approaches: the grey wolf optimization (GWO), the dragonfly algorithm (DA), the grasshopper optimization algorithm (GOA), and the whale optimization algorithm (WOA). These algorithms are utilized to find the optimal solution by iteratively improving the availability of the turbogenerator. The performance of each algorithm is evaluated in terms of system availability and execution time, allowing us to identify the most efficient algorithm for this task. Based on the numerical results, it is evident that the WOA outperforms the GWO, GOA, and DA in terms of both system availability and execution time. [ABSTRACT FROM AUTHOR]

AbstractThis paper was conducted to model the drying kinetics of Capparis spinosa buds using dragonfly swarm optimized nonlinear regression and to compare the impact of drying treatments on their quality. Experiments included hot-air convective drying (HACD) from 40 to 120 °C, vacuum drying (VD) at 40, 60, and 80 °C, microwave drying (MD) ranging from 200 to 1000 W. Out of 30 models tested, the drying kinetics fitted best with Jena Das model in both HACD and VD and modified Midilli for MD. The comparison between the drying treatments used indicated that when taking into account the quality of the dried caper, VD at 80 °C was the most effective, resulting in a high-quality caper with a well-preserved color (ΔE = 7.47), high bioactives (TPC = 30.18mgGAE/gDW and TFC = 10.27 mg QE/gDW) and radical scavenging abilities (DPPH = 0.249 and ABTS = 4.448 mg/mL) at the expense of long duration (6h) and high specific energy consumption (50.667 kWh/kg). On the other hand, when considering the drying behavior MD ranked best with samples dried at 1000 W showing high diffusivities 2.04e−8 m2s−1 low energy consumption (MER 0.1216 kg/h), and short drying times (12 mn). This research is critical in selecting better drying conditions for increased usage in the culinary, cosmetic, and pharmaceutical sectors. [ABSTRACT FROM AUTHOR]

Knowledge of the optical properties of blood plays important role in medical diagnostics and therapeutic applications in laser medicine. In this paper, we present a very rapid and accurate artificial intelligent approach using Dragonfly Algorithm/Support Vector Machine models to estimate the optical properties of blood, specifically the absorption coefficient, and the scattering coefficient using key parameters such as wavelength (nm), hematocrit percentage (%), and saturation of oxygen (%), in building very highly accurate Dragonfly Algorithm-Support Vector Regression models (DA-SVR). 1000 training and testing sets were selected in the wavelength range of 250-1200 nm and the hematocrit of 0-100%. The performance of the proposed method is characterized by high accuracy indicated in the correlation coefficients (R) of 0.9994 and 0.9957 for absorption and scattering coefficients, respectively. In addition, the root mean squared error values (RMSE) of 0.972 and 2.9193, as well as low mean absolute error values (MAE) of 0.2173 and 0.2423, this result showed a strong match with the experimental data. The models can be used to accurately predict the absorption and scattering coefficients of blood, and provide a reliable reference for future studies on the optical properties of human blood. [ABSTRACT FROM AUTHOR]

With the increasing growth rate of smart home devices and their interconnectivity via the Internet of Things (IoT), security threats to the communication network have become a concern. This paper proposes a learning engine for a smart home communication network that utilizes blockchain-based secure communication and a cloud-based data evaluation layer to segregate and rank data on the basis of three broad categories of Transactions (T), namely Smart T, Mod T, and Avoid T. The learning engine utilizes a neural network for the training and classification of the categories that helps the blockchain layer with improvisation in the decision-making process. The contributions of this paper include the application of a secure blockchain layer for user authentication and the generation of a ledger for the communication network; the utilization of the cloud-based data evaluation layer; the enhancement of an SI-based algorithm for training; and the utilization of a neural engine for the precise training and classification of categories. The proposed algorithm outperformed the Fused Real-Time Sequential Deep Extreme Learning Machine (RTS-DELM) system, the data fusion technique, and artificial intelligence Internet of Things technology in providing electronic information engineering and analyzing optimization schemes in terms of the computation complexity, false authentication rate, and qualitative parameters with a lower average computation complexity; in addition, it ensures a secure, efficient smart home communication network to enhance the lifestyle of human beings. [ABSTRACT FROM AUTHOR]

In this paper, we present a novel DILTS algorithm that uses a new approach inspired by the energy efficiency of dragonflies. The algorithm optimizes the energy-harvesting mechanisms in IoT devices, inspired by the way dragonflies use wind energy to fly. A sophisticated algorithm optimizes power consumption during task execution, saving energy and speeding up tasks while maintaining the application throughput. The algorithm leverages lazy task scheduling (LTS) to enhance task execution performance. The proposed algorithm evaluates the energy levels of each task and implements an LTS method. This LTS approach improves performance and task management by streamlining scheduling data and reducing overhead. The LTS model reliably optimizes the energy across microbenchmarks and real-time IoT devices. To assess the efficiency and practicality of our algorithm, we compared it to four alternatives. Our novel algorithm outperformed the others with a chip area of 856 μm2, performance speed of 7.11 ns, scheduling accuracy of 94%, and response time of 2.61 ns. Our simulations showed that our proposed method reduced energy consumption by up to 10.02% compared to existing methods. We evaluated the performance of the algorithms on a Zynq 7000 FPGA using the Xilinx Vivado platform via simulations. Our novel algorithm can improve the energy efficiency of green data centers. [ABSTRACT FROM AUTHOR]

Navigation poses a significant challenge for autonomous vehicles, prompting the exploration of various bio-inspired artificial intelligence techniques to address issues related to path generation, obstacle avoidance, and optimal path planning. Numerous studies have delved into bio-inspired approaches to navigate and overcome obstacles. In this paper, we introduce the dragonfly algorithm (DA), a novel bio-inspired meta-heuristic optimization technique to autonomously set goals, detect obstacles, and minimize human intervention. To enhance efficacy in unstructured environments, we propose and analyze the dragonfly–fuzzy hybrid algorithm, leveraging the strengths of both approaches. This hybrid controller amalgamates diverse features from different methods into a unified framework, offering a multifaceted solution. Through a comparative analysis of simulation and experimental results under varied environmental conditions, the hybrid dragonfly–fuzzy controller demonstrates superior performance in terms of time and path optimization compared to individual algorithms and traditional controllers. This research aims to contribute to the advancement of autonomous vehicle navigation through the innovative integration of bio-inspired meta-heuristic optimization techniques. [ABSTRACT FROM AUTHOR]

Metaheuristics are commonly employed as a means of solving many distinct kinds of optimization problems. Several natural-process-inspired metaheuristic optimizers have been introduced in the recent years. The convergence, computational burden and statistical relevance of metaheuristics should be studied and compared for their potential use in future algorithm design and implementation. In this paper, eight different variants of dragonfly algorithm, i.e. classical dragonfly algorithm (DA), hybrid memory-based dragonfly algorithm with differential evolution (DADE), quantum-behaved and Gaussian mutational dragonfly algorithm (QGDA), memory-based hybrid dragonfly algorithm (MHDA), chaotic dragonfly algorithm (CDA), biogeography-based Mexican hat wavelet dragonfly algorithm (BMDA), hybrid Nelder-Mead algorithm and dragonfly algorithm (INMDA), and hybridization of dragonfly algorithm and artificial bee colony (HDA) are applied to solve four industrial chemical process optimization problems. A fuzzy multi-criteria decision making tool in the form of fuzzy-measurement alternatives and ranking according to compromise solution (MARCOS) is adopted to ascertain the relative rankings of the DA variants with respect to computational time, Friedman's rank based on optimal solutions and convergence rate. Based on the comprehensive testing of the algorithms, it is revealed that DADE, QGDA and classical DA are the top three DA variants in solving the industrial chemical process optimization problems under consideration. [ABSTRACT FROM AUTHOR]

The deterministic directional overcurrent relay (DOCR) coordination approaches find limitation in providing fast and reliable protection to today's distribution networks due to growing integration of distributed generations (DGs). In this paper, an adaptive DOCR protection coordination scheme is proposed using an efficient optimization algorithm called the dragonfly algorithm (DA). The main inspiration of the proposed DA optimization technique originates from static and dynamic swarming behaviours of dragonflies. In this approach, the dominant changes in the network topologies are identified by monitoring the status of the circuit breakers connected at the terminals of the DGs and other main power components. When any dominant changes in the network topologies or operating modes are identified, the fault current for that particular condition is calculated and the new optimal DOCRs settings for the prevailing condition are obtained from the substation central computer in online mode. The comparative results with the existing approaches justify the superiority of the proposed scheme in achieving the minimum overall relay operating time and maintaining the coordination between the primary and backup relay pairs. In the proposed adaptive protection scheme, the average percentage reduction in the overall operating times of DOCRs in the 6-bus and the IEEE 14-bus test systems with different levels DG penetration is found to be 49.7% and 15%, respectively, compared to the existing approaches. [ABSTRACT FROM AUTHOR]

A wireless sensor network (WSN) consists of an extensive number of low-power sensor nodes to gather information from their environment and monitor physical activities. This makes node localization a crucial aspect in most WSN applications since measurement data is worthless unless the location from where the data is acquired is known precisely. The majority of localization solutions rely on anchor nodes for estimating the node locations with different localization accuracy, complexity, and hence different applicability. But, the cost and complexity in the localization of large-scale WSNs are not significantly reduced. In this paper, a novel Hybridized Dragonfly and Jaya Optimization technique (HyDAJ) is introduced for improving localization accuracy and performance of mobile WSNs. The proposed hybrid technique combines the advantages of Dragonfly algorithm and Jaya algorithm to localize the sensor nodes in a more efficient way and overcomes the limitations of the original algorithm. The hybrid algorithm verifies that all target nodes are precisely localized with higher accuracy. Simulation results reveal that HyDAJ outperforms existing methods under multiple metrics including localization efficiency, mean localization error, computation time, and energy consumption. [ABSTRACT FROM AUTHOR]

Since the past few years, several metaheuristic algorithms, inspired by the natural processes, have been introduced to solve different complex optimization problems. Studying and comparing the convergence, computational burden and statistical significance of those metaheuristics are helpful for future algorithmic development and their applications. This paper focuses on comparing the optimization performance of classical dragonfly algorithm (DA) and its seven different variants, i.e., hybrid memory-based dragonfly algorithm with differential evolution (DADE), quantum-behaved and Gaussian mutational dragonfly algorithm (QGDA), memory-based hybrid dragonfly algorithm (MHDA), chaotic dragonfly algorithm (CDA), biogeography-based Mexican hat wavelet dragonfly algorithm (BMDA), hybrid Nelder–Mead algorithm and dragonfly algorithm (INMDA) and hybridization of dragonfly algorithm and artificial bee colony (HDA) while solving 80 CEC-2021 benchmark problems. It is observed that the convergence rates of different variants of DA algorithm vary, and the corresponding computational times for such variations are also evaluated. This paper finally ranks DA and its variants according to their convergence efficiency and Friedman test. The DADE, QGDA, BMDA and DA evolve out as the most efficient algorithms for solving the considered CEC-2021 benchmark problems. [ABSTRACT FROM AUTHOR]

Grey Wolf optimizer (GWO) has been used in several fields of research. The main advantages of this algorithm are its simplicity, little controlling parameter, and adaptive exploratory behavior. However, similar to other metaheuristic algorithms, the GWO algorithm has several limitations. The main drawback of the GWO algorithm is its low capability to handle a multimodal search landscape. This drawback occurs because the alpha, beta, and gamma wolves tend to converge to the same solution. This paper presents HDGM – a novel hybrid optimization model of dragonfly algorithm and grey wolf optimizer, aiming to overcome the disadvantages of GWO algorithm. Dragonfly algorithm (DA) is combined with GWO in this study because DA has superior exploration ability, which allows it to search in promising areas in the search space. To verify the solution quality and performance of the HDGM algorithm, we used twenty-three test functions to compare the proposed model's performance with that of the GWO, DA, particle swam optimization (PSO) and ant lion optimization (ALO). The results show that the hybrid algorithm provides more competitive results than the other variants in terms of solution quality, stability, and capacity to discover the global optimum. [ABSTRACT FROM AUTHOR]

The predictability of the adsorption capacity of the multicomponent adsorption system was modelled using Support Vector Machine (SVM). Two SVM models were built and compared. In the first model, the SVM method was used with an already built-in optimisation algorithm. However, in the second model, the SVM method was used by means of a very recent and efficient optimisation algorithm: the Dragonfly Algorithm (DA). The models’ accuracy was evaluated by three well-established statistical metrics (root mean squared error RMSE, determination coefficient R², and correlation coefficient R). The used data were collected from previous experimental papers published in literature containing all kinds of pollutants, such as heavy metal ions, dyes, and organic compounds, and different natural/ synthetic adsorbents. The dataset contained five important variables with 1023 points; the variables were divided into four inputs (molecular weight, equilibrium concentrations of adsorbate, specific area of adsorbent, and temperature), and one output (adsorption capacity at equilibrium). The data were divided using the holdout function into two subsets (80 % for training set, and 20 % for test set). The programming stage was carried out using MATLAB software. The results showed that the optimised DA-SVM model with RBF-Gaussian kernel function had good ability for global search combined with high prediction accuracy, with R² = 0.997, R = 0.998, and RMSE = 2.539. The obtained model can be used to predict the efficiency of the adsorption system, and provides a tool for process optimisation responding to changes in operating conditions. A new graphical user interface (GUI) was developed with MATLAB GUI to estimate accurately the desired responses by using the best DA-SVM model. [ABSTRACT FROM AUTHOR]

Optimization problems are prevalent in almost all areas and hence optimization algorithms are crucial for a myriad of real-world applications. Deterministic optimization algorithms tend to be computationally costly and time-consuming. Hence, heuristic and metaheuristic algorithms are more favoured as they provide near-optimal solutions in an acceptable amount of time. Swarm intelligence algorithms are being increasingly used for optimization problems owing to their simplicity and good performance. The Dragonfly Algorithm (DA) is one which is inspired by the swarming behaviours of dragonflies, and it has been proven to have a superior performance than other algorithms in multiple applications. Hence, it is worth considering its application to the traveling salesman problem which is a predominant discrete optimization problem. The original DA is only suitable for solving continuous optimization problems and, although there is a binary version of the algorithm, it is not easily adapted for solving discrete optimization problems like TSP. We have previously proposed a discrete adapted DA algorithm suitable for TSP. However, it has low effectiveness, and it has not been used for large TSP problems. In this paper, we propose an optimized discrete adapted DA by using the steepest ascent hill climbing algorithm as a local search. The algorithm is applied to a TSP problem modelling a package delivery system in the Kuala Lumpur area and to benchmark TSP problems, and it is found to have a higher effectiveness than the discrete adapted DA and some other swarm intelligence algorithms. It also has a higher efficiency than the discrete adapted DA. [ABSTRACT FROM AUTHOR]

This paper introduces an economic disposal and lot-sizing problem (EDLSP) for perishable inventories, it is a new version of an economic lot-sizing problem (ELSP). The classic ELSP aims to determine the production-inventory strategy such that the sum of holding, production, and setup costs is minimized. In the proposed EDLSP, the optimal disposal strategy, as well as the optimal production-inventory strategy, is determined for perishable inventories. Disposal strategy determines how many and when corrupt items should be removed from the stock. In the new model, the unit holding cost depends on the volume of the corrupt inventories that exist in the stock. To closely reflect reality, the model considers fixed and variable disposal costs that represent the costs of removing the corrupt inventories from the warehouse. As a generalized form of the classic lot-sizing problem with the setup cost, the EDLSP is an NP-complete problem. Therefore, two meta-heuristic algorithms, namely Binary Dragonfly Algorithm (BDA) and Genetic Algorithm (GA), are proposed to solve the model. The Taguchi method is also applied to calibrate the meta-heuristics. Then, the performance of these algorithms is evaluated on a set of test problems. The obtained results indicate that both meta-heuristics have a good performance in solving small-sized problems. However, the GA has a better performance than the BDA for medium- and large-sized problems. Furthermore, a sensitivity analysis of key parameters is done to determine the model specifications and to present some managerial insights. [ABSTRACT FROM AUTHOR]

Induction motors tend to have better efficiency on rated conditions, but at partial load conditions, when these motors operate on rated flux, they exhibit lower efficiency. In such conditions, when these motors operate for a long duration, a lot of electricity gets consumed by the motors, due to which the computational cost as well as the total running cost of industrial plant increases. Squirrel-cage induction motors are widely used in industries due to their low cost, robustness, easy maintenance, and good power/mass relation all through their life cycle. A significant amount of electrical energy is consumed due to the large count of operational units worldwide; hence, even an enhancement in minute efficiency can direct considerable contributions within revenue saving, global electricity consumption, and other environmental facts. In order to improve the efficiency of induction motors, this research paper presents a novel contribution to maximizing the efficiency of induction motors. As such, a model of induction motor drive is taken, in which the proportional integral (PI) controller is tuned. The optimal tuning of gains of a PI controller such as proportional gain and integral gain is conducted. The tuning procedure in the controller is performed in such a condition that the efficiency of the induction motor should be maximum. Moreover, the optimization concept relies on the development of a new hybrid algorithm, the so-called Scrounger Strikes Levy-based dragonfly algorithm (SL-DA), that hybridizes the concept of dragonfly algorithm (DA) and group search optimization (GSO). The proposed algorithm is compared with particle swarm optimization (PSO) for verification. The analysis of efficiency, speed, torque, energy savings, and output power is validated, which confirms the superior performance of the suggested method over the comparative algorithms employed. [ABSTRACT FROM AUTHOR]

This paper deals with an integrated algorithm for the approximation of higher dimensional system (HDS). Framework of this research is initiated by considering different higher order transfer functions of LTI system. Numerator as well as denominator coefficients of the corresponding lower dimensional model (LDM) are computed using dragonfly algorithm (DA) and Routh approximation (RA) respectively. The proposed technique is verified by considering standard test cases. Further, the performance accuracies are evaluated by comparing the step and frequency responses of HDS and LDM. [ABSTRACT FROM AUTHOR]

Insertion of intermittent natured renewable energy resources in the microgrid to decline global warming and due to highly inconsistent propulsion load, frequency control of the isolated hybrid micro-grid system (HMGs) is the key point of attraction and necessitates a highly competent and robust control strategy. Hence, in this paper, an efficient frequency control mechanism for HMGs is proposed by utilizing an efficient tilt derivative filter-tilt integral derivative filter (TDF-TIDF) controller. HMGs are composed of solar, wind, fuel cell, freezer, diesel engines, heat pumps, and loads. A recently appeared dragonfly algorithm (DFA) is employed to optimize the suggested controllers' design variables. The dynamic analysis is exhibited with different types of energy storage units under various conditions. The conditions incorporate perturbations in demanded load and power generation through renewable energy sources. In this study, solar thermal and wind power systems are not contributing to frequency control owing to the plan of their maximum power tracking approach. The dynamic performance of different controllers such as PIDF, TIDF, PDF-PIDF, and TDF-TIDF controllers are evaluated with their design variables tuned by employing genetic algorithm, particle swarm optimization, gravitational search algorithm, quasi harmony search algorithm, grasshopper algorithm and dragonfly algorithm. The output graphs of transient responses and collected statistical data corroborate that the suggested DFA-based TDF-TIDF scheme provides least objective function value (8.1e‒07) compared to PDF-PIDF (4.011e‒06), TIDF (3.14e‒05) and PIDF (5.03e‒05), hence, more capable in reducing the oscillations quickly for the system with non-linearities. Moreover, statistical data yielded by DFA is observed superior when evaluated with other existing optimization methods. [ABSTRACT FROM AUTHOR]

Effective task scheduling is recognized as one of the main critical challenges in cloud computing; it is an essential step for effectively exploiting cloud computing resources, as several tasks may need to be efficiently scheduled on various virtual machines by minimizing makespan and maximizing resource utilization. Task scheduling is an NP-hard problem, and consequently, finding the best solution may be difficult, particularly for Big Data applications. This paper presents an intelligent Big Data task scheduling approach for IoT cloud computing applications using a hybrid Dragonfly Algorithm. The Dragonfly algorithm is a newly introduced optimization algorithm for solving optimization problems which mimics the swarming behaviors of dragonflies. Our algorithm, MHDA, aims to decrease the makespan and increase resource utilization, and is thus a multi-objective approach. β-hill climbing is utilized as a local exploratory search to enhance the Dragonfly Algorithm's exploitation ability and avoid being trapped in local optima. Two experimental studies were conducted on synthetic and real trace datasets using the CloudSim toolkit to compare MHDA to other well-known algorithms for solving task scheduling problems. The analysis, which included the use of a t-test, revealed that MHDA outperformed other well-known algorithms: MHDA converged faster than other methods, making it useful for Big Data task scheduling applications, and it achieved 17.12% improvement in the results. [ABSTRACT FROM AUTHOR]

The objective of this research was to build a mathematical model based on a Support Vector Machine (SVM) capable of predicting the amount adsorbed at equilibrium (qe). Activated carbon fibres (ACF) were used for the adsorption of certain phenols (phenol, 2-chlorophenol, 4-chlorophenol, 2,4,6-trichlorophenol, 4-nitrophenol, and 2,4-dinitrophenol). An experimental dataset of 129 points was collected from previously published papers. The inputs considered for modelling were temperature (T), concentration at equilibrium (ce), and two descriptors (boiling point (BP) and density (d)) to differentiate between the pollutants studied. The data used were pre-processed by the statistical analysis to ensure that they were adequate for modelling. The results showed a superiority of the Gaussian kernel function DA-SVM model demonstrated by its determination coefficient (R² = 0.997) and root mean squared error (RMSE = 0.027 mmol l −1). [ABSTRACT FROM AUTHOR]

The Dragonfly algorithm (DA) is a heuristic optimization algorithm that is commonly used for complex optimization problems. Despite its widespread application, the abundance of social behaviors in its construct can lead to poor accuracy in solutions and an imbalance between exploration and exploitation phases. To overcome these issues, this paper proposes a mutation-based Dragonfly optimization algorithm (MIDA). In order to increase the solution accuracy of the original DA and reduce its handicaps, the proposed model includes three procedures, namely, mutation operation, boundary control, and greedy selection mechanisms. The mutation operator helps to find global optima by avoiding getting stuck at the local optimum point, while the boundary control and greedy selection mechanisms update the dragonflies at each iteration and thus use the better fitness value of the updated ones. The performance of the proposed MIDA is tested and shown to be superior to the original DA using several analyses such as convergence, search history, trajectory, average distance, computational complexity, diversity and balance. To validate the MIDA algorithm, it is tested on the 10, 30, 50 and 100 dimensions of the CEC2014 benchmark functions. Furthermore, a comparison against twelve state-of-the-art (SOTA) meta-heuristic optimization algorithms is performed. The performance of the proposed MIDA is also compared with the performances of some improved dragonfly algorithms taken from the literature. The statistical results obtained by the original DA and MIDA for ten minimization problems with 5, 10, 15 and 20 dimensions from the CEC2020 test suite are presented. Finally, the proposed algorithm is applied to optimize the ANFIS model parameters in order to be used for short-term wind forecasting as a real-world problem. The results obtained for the different dimensions of CEC2014 and CEC2020 test problems in the study show that the search performance of proposed MIDA is better than that of the original DA. MIDA outperformed the original DA by 91.33% for CEC2014 benchmarks and 94.25% for CEC2020 benchmarks. In addition, MIDA came first in comparison with twelve different SOTAs from the literature. In comparisons with different DA versions, MIDA took the second place in terms of statistical performance. Computational complexity was examined in the CEC2020 benchmarks and it was seen that MIDA has a more effective run time than DA. Finally, the short-term wind speed forecasting results of the ANFIS-DA hybrid model according to four different error metrics are more successful than those of the ANFIS-DA hybrid model. [Display omitted] • A mutation-based dragonfly optimization algorithm (MIDA) is developed. • The dragonfly algorithm is improved by incorporating three mechanisms. • The proposed MIDA is evaluated using CEC2014 and CEC2020 benchmarks. • MIDA was applied to optimize the parameters of a neuro-fuzzy model (ANFIS). • A hybrid ANFIS-MIDA model is presented for short term wind speed forecasting. [ABSTRACT FROM AUTHOR]

• Optimal solution to harness the unexploited potential renewable energy sources. • Heuristic optimization with dragonfly algorithm for renewable system sizing. • Economic assessment to achieve low net present value with higher reliability. Globally, most solar and wind power systems can produce power cheaper than fossil fuel-powered systems under certain circumstances according to the international renewable energy agency (IRENA). Despite that, the penetration rate of renewable energy has slowed down recently due to its non-availability and reliability in providing an uninterruptible power supply. A hybrid renewable energy system (HRES) with the conventional grid to counter the intermittency challenges without battery storage is a way forward for a greener solution. In this paper, unutilized rooftop space and underutilized potential locations of an educational institution are customized for renewable Solar-Wind power generation together with the conventional grid for effective and cost-optimal power solutions. A modified dragonfly algorithm (MDA) was adopted for mathematical modeling to reduce the power systems' net present value (NPV) over its lifespan. The model reckons various scenarios and found that the HRES with grid interaction is the best case to significantly improve the reliability economically. The result is encouraging to promote HRES in potential institutions to boost the growth of renewable energy, economically to achieve the net zero emission goal of IRENA by 2050. [ABSTRACT FROM AUTHOR]

Flexible job shop scheduling problem (FJSP) has attracted many research interests, in particular for meta-heuristic algorithm (MA) developers due to the superior optimization performance. Dragonfly algorithm (DA) is one of recent and popular MA approaches. However, it is inevitable for DA to be trapped into local optima, especially when dealing with the complex large-scale flexible job shop scheduling problem (LSFJSP). In this paper, an improved DA, adopting a dynamic opposite learning (DOL) strategy, is proposed (namely DOLDA) to solve the LSFJSP. DOL strategy is embedded into the population initialization stage and the generation jumping stage to raise the search ability of DA. This paper uses a T-test to testify whether there are differences between the proposed algorithm and other comparison algorithms, comparison results indicate that DOLDA shows noticeable differences with other algorithms that explain the effectiveness and innovation of the proposed algorithm. The jump rate is an important parameter that determines the probability of algorithms escaping from the algorithms' local optimal solution. This paper also considers the jump rate analysis experiments to maximize the power of the DOLDA. 28 test functions from CEC 2013 and CEC 2014 are applied to verify the performance of DOLDA, test results reveal that DOLDA owns strong search ability in coping with almost all test functions. The DOLDA also is applied to solve 15 LSFJSP instances generated by Brandimate rule, the results obtained show that DOLDA can efficiently achieve a better solution on the LSFJSP compare to compared algorithms. [ABSTRACT FROM AUTHOR]

The dragonfly algorithm is a swarm intelligence optimization algorithm based on simulating the swarming behavior of dragonfly individuals. An efficient algorithm must have a symmetry of information between the participating entities. An improved dragonfly algorithm is proposed in this paper to further improve the global searching ability and the convergence speed of DA. The improved DA is named GGBDA, which adds Gaussian mutation and Gaussian barebone on the basis of DA. Gaussian mutation can randomly update the individual positions to avoid the algorithm falling into a local optimal solution. Gaussian barebone can quicken the convergent speed and strengthen local exploitation capacities. Enhancing algorithm efficiency relative to the symmetric concept is a critical challenge in the field of engineering design. To verify the superiorities of GGBDA, this paper sets 30 benchmark functions, which are taken from CEC2014 and 4 engineering design problems to compare GGBDA with other algorithms. The experimental result show that the Gaussian mutation and Gaussian barebone can effectively improve the performance of DA. The proposed GGBDA, similar to the DA, presents improvements in global optimization competence, search accuracy, and convergence performance. [ABSTRACT FROM AUTHOR]

This paper proposes a hybrid metaheuristic based resource allocation framework named RAFL for load balancing in cloud computing environment. The objective is to proactively minimize the load imbalance across active physical machines and among their considered resource capacities (e.g., CPU and RAM). This prevents overloading/underloading of active physical machines and utilizes their considered resource capacities in a balanced manner. In the proposed framework, a phasor particle swarm optimization and dragonfly algorithm based hybrid optimization algorithm named PPSO-DA is used to generate an optimal resource allocation plan for balancing the load. Simulation experiments are performed using CloudSim simulator to measure the metrics of load imbalance across active physical machines and among their considered resource capacities. Results show that the proposed PPSO-DA algorithm outperforms phasor particle swarm optimization, dragonfly algorithm, comprehensive learning particle swarm optimization, memory based hybrid dragonfly algorithm, sine cosine algorithm, and elephant herding optimization, in finding an optimal resource allocation for balancing the load. The statistical analysis and benchmark testing also validates the relative superiority of PPSO-DA. [ABSTRACT FROM AUTHOR]

Swarm intelligence is a discipline which makes use of a number of agents for solving optimization problems by producing low cost, fast and robust solutions. The dragonfly algorithm (DA), a recently proposed swarm intelligence algorithm, is inspired by the dynamic and static swarming behaviors of dragonflies, and it has been found to have a higher performance in comparison to other swarm intelligence and evolutionary algorithms in numerous applications. There are only a few surveys about the dragonfly algorithm, and we have found that they are limited in certain aspects. Hence, in this paper, we present a more comprehensive survey about DA, its applications in various domains, and its performance as compared to other swarm intelligence algorithms. We also analyze the hybrids of DA, the methods they employ to enhance the original DA, their performance as compared to the original DA, and their limitations. Moreover, we categorize the hybrids of DA according to the type of problem that they have been applied to, their objectives, and the methods that they utilize. [ABSTRACT FROM AUTHOR]

The popularity of micro-machining is rapidly increasing due to the growing demands for miniature products. Among different micro-machining approaches, micro-turning and micro-milling are widely used in the manufacturing industry. The various cutting parameters of micro-turning and micro-milling has a significant effect on the machining performance. Thus, it is essential that the cutting parameters are optimized to obtain the most from the machining process. However, it is often seen that many machining objectives have conflicting parameter settings. For example, generally, a high material removal rate (MRR) is accompanied by high surface roughness (SR). In this paper, metaheuristic multi-objective optimization algorithms are utilized to generate Pareto optimal solutions for micro-turning and micro-milling applications. A comparative study is carried out to assess the performance of non-dominated sorting genetic algorithm II (NSGA-II), multi-objective ant lion optimization (MOALO) and multi-objective dragonfly optimization (MODA) in micro-machining applications. The complex proportional assessment (COPRAS) method is used to compare the NSGA-II, MOALO and MODA generated Pareto solutions. [ABSTRACT FROM AUTHOR]