Search

In numerous scientific disciplines and practical applications, addressing optimization challenges is a common imperative. Nature-inspired optimization algorithms represent a highly valuable and pragmatic approach to tackling these complexities. This paper introduces Dendritic Growth Optimization (DGO), a novel algorithm inspired by natural branching patterns. DGO offers a novel solution for intricate optimization problems and demonstrates its efficiency in exploring diverse solution spaces. The algorithm has been extensively tested with a suite of machine learning algorithms, deep learning algorithms, and metaheuristic algorithms, and the results, both before and after optimization, unequivocally support the proposed algorithm's feasibility, effectiveness, and generalizability. Through empirical validation using established datasets like diabetes and breast cancer, the algorithm consistently enhances model performance across various domains. Beyond its working and experimental analysis, DGO's wide-ranging applications in machine learning, logistics, and engineering for solving real-world problems have been highlighted. The study also considers the challenges and practical implications of implementing DGO in multiple scenarios. As optimization remains crucial in research and industry, DGO emerges as a promising avenue for innovation and problem solving. [ABSTRACT FROM AUTHOR]

In this paper, a new bio-inspired metaheuristic algorithm called Giant Armadillo Optimization (GAO) is introduced, which imitates the natural behavior of giant armadillo in the wild. The fundamental inspiration in the design of GAO is derived from the hunting strategy of giant armadillos in moving towards prey positions and digging termite mounds. The theory of GAO is expressed and mathematically modeled in two phases: (i) exploration based on simulating the movement of giant armadillos towards termite mounds, and (ii) exploitation based on simulating giant armadillos' digging skills in order to prey on and rip open termite mounds. The performance of GAO in handling optimization tasks is evaluated in order to solve the CEC 2017 test suite for problem dimensions equal to 10, 30, 50, and 100. The optimization results show that GAO is able to achieve effective solutions for optimization problems by benefiting from its high abilities in exploration, exploitation, and balancing them during the search process. The quality of the results obtained from GAO is compared with the performance of twelve well-known metaheuristic algorithms. The simulation results show that GAO presents superior performance compared to competitor algorithms by providing better results for most of the benchmark functions. The statistical analysis of the Wilcoxon rank sum test confirms that GAO has a significant statistical superiority over competitor algorithms. The implementation of GAO on the CEC 2011 test suite and four engineering design problems show that the proposed approach has effective performance in dealing with real-world applications. [ABSTRACT FROM AUTHOR]

In this paper, a new bio-inspired metaheuristic algorithm named the Kookaburra Optimization Algorithm (KOA) is introduced, which imitates the natural behavior of kookaburras in nature. The fundamental inspiration of KOA is the strategy of kookaburras when hunting and killing prey. The KOA theory is stated, and its mathematical modeling is presented in the following two phases: (i) exploration based on the simulation of prey hunting and (ii) exploitation based on the simulation of kookaburras' behavior in ensuring that their prey is killed. The performance of KOA has been evaluated on 29 standard benchmark functions from the CEC 2017 test suite for the different problem dimensions of 10, 30, 50, and 100. The optimization results show that the proposed KOA approach, by establishing a balance between exploration and exploitation, has good efficiency in managing the effective search process and providing suitable solutions for optimization problems. The results obtained using KOA have been compared with the performance of 12 well-known metaheuristic algorithms. The analysis of the simulation results shows that KOA, by providing better results in most of the benchmark functions, has provided superior performance in competition with the compared algorithms. In addition, the implementation of KOA on 22 constrained optimization problems from the CEC 2011 test suite, as well as 4 engineering design problems, shows that the proposed approach has acceptable and superior performance compared to competitor algorithms in handling real-world applications. [ABSTRACT FROM AUTHOR]

To cope with increasingly complex models of engineering design problems and to obtain more accurate design solutions, this paper proposed an improved population-based, bio-inspired optimization algorithm, called the pity beetle algorithm based on pheromone dispersion model (PBA-PDM). PBA-PDM enables a local and global search for optimization problems through the pheromone release mechanisms in female beetles and the interaction relationship between male beetles. The experimental results compared with other state-of-the-art metaheuristic optimization algorithms show that PBA-PDM has an ideal performance when dealing with both classical test functions and CEC2017 benchmark test functions. Then, the PBA-PDM is applied in dealing with real-world constrained engineering design problems to verify the effectiveness and applicability. The above experimental results show that the PBA-PDM proposed in this paper is an effective and efficient algorithm for solving real-world optimization problems. [ABSTRACT FROM AUTHOR]

In classical power systems, frequency measurements are transferred via a specialised communication channel, resulting in time delay. The time delay plays a major role in a power system, which can reduce the dynamic performance of the load–frequency control (LFC) system and can destabilise the system. The research to date has tended to focus on developing a new algorithm to determine the delay margin (DM) rather than looking into a hybrid algorithm which includes a nature-inspired metaheuristic optimisation technique. This paper introduces a novel method for computing the DM based on grey wolf optimisation (GWO), specifically for the constant time delay. In the proposed method, GWO is employed to optimise the minimum error of the spectral radius and to determine the best design variable of the crossing frequency. With the help of the proposed method, the sweeping range is no longer required, which improves the accuracy of the result. To evaluate the proposed method, a two-area network power system is considered as a case study. Furthermore, the effect of the PI controller gains on the DM is taken into account. The proposed method efficacy is demonstrated by comparing it with the most recently published methods. The results demonstrate that the proposed method is remarkably better than the existing methods found in the literature, where the smallest percentage inaccuracy using the simulation-based DM based on GWO is found to be 0.000%. [ABSTRACT FROM AUTHOR]

The Internet of Things is widely used, which results in the collection of enormous amounts of data with numerous redundant, irrelevant, and noisy features. In addition, many of these features need to be managed. Consequently, developing an effective feature selection (FS) strategy becomes a difficult goal. Many FS techniques, based on bioinspired metaheuristic methods, have been developed to tackle this problem. However, these methods still suffer from limitations; so, in this paper, we developed an alternative FS technique, based on integrating operators of the chameleon swarm algorithm (Cham) with the quantum-based optimization (QBO) technique. With the use of eighteen datasets from various real-world applications, we proposed that QCham is investigated and compared to well-known FS methods. The comparisons demonstrate the benefits of including a QBO operator in the Cham because the proposed QCham can efficiently and accurately detect the most crucial features. Whereas the QCham achieves nearly 92.6%, with CPU time(s) nearly 1.7 overall the tested datasets. This indicates the advantages of QCham among comparative algorithms and high efficiency of integrating the QBO with the operators of Cham algorithm that used to enhance the process of balancing between exploration and exploitation. [ABSTRACT FROM AUTHOR]

In this paper, an algorithm for the maximum extraction of energy generated by photovoltaic (PV) systems was presented. The tracking of the global maximum point of the system is complex due to the non-linearity of the current-voltage (I-V) characteristic curve of the photovoltaic modules, as they vary according to the temperature and solar irradiation in the module. To obtain the best energy efficiency in these systems, it is important that the generation is delivering the maximum power available through the arrangement. In order to solve such problems, in this work an efficient MPPT-FA method was proposed, which showed good traceability when compared to traditional methods. Most traditional MPPT techniques are not able to find the global maximum point to extract the maximum power provided by the PV system. Finally, the Firefly Metaheuristic MPPT method proved to be robust against several partial shading scenarios. Simulations were presented to demonstrate the effectiveness of the proposal when compared to the traditional MPPT-PO method. [ABSTRACT FROM AUTHOR]

Operation of distribution networks involves a series of criteria that should be met, aiming for the correct and optimal behavior of such systems. Some of the major drawbacks found when studying these networks is the real losses related to them. To overcome this problem, distribution network reconfiguration (DNR) is an efficient tool due to the low costs involved in its implementation. The majority of studies regarding this subject treat the problem by considering networks only as three-phase balanced, modeled as single-phase grids with fixed power demand, which is far from representing the characteristics of real networks (e.g., unbalanced loads, variable power and unbalance indexes). Due to the combinatorial nature of the problem, metaheuristic techniques are powerful tools for the inclusion of such characteristics. In this sense, this paper proposes a study of DNR considering balanced and unbalanced systems with variable power demand. An analysis of the direct influence of voltage unbalance index (VUI) and current unbalance index (CUI) is carried out for unbalanced cases. To solve the DNR problem, a selective bio-inspired metaheuristic based on micro bats' behavior named the selective bat algorithm (SBAT) is used together with the EPRI-OpenDSS software (California, US, EPRI). Tests are initially conducted on balanced systems, aiming to validate the technique proposed for both demands and state their differences, and then they are conducted on unbalanced systems to study the influence of VUI and CUI in the DNR solution. [ABSTRACT FROM AUTHOR]

In the world of optimization, especially concerning metaheuristics, solving complex problems represented by applying big data and constraint instances can be difficult. This is mainly due to the difficulty of implementing efficient solutions that can solve complex optimization problems in adequate time, which do exist in different industries. Big data has demonstrated its efficiency in solving different concerns in information management. In this paper, an approach based on multiprocessing is proposed wherein clusterization and parallelism are used together to improve the search process of metaheuristics when solving large instances of complex optimization problems, incorporating collaborative elements that enhance the quality of the solution. The proposal deals with machine learning algorithms to improve the segmentation of the search space. Particularly, two different clustering methods belonging to automatic learning techniques, are implemented on bio-inspired algorithms to smartly initialize their solution population, and then organize the resolution from the beginning of the search. The results show that this approach is competitive with other techniques in solving a large set of cases of a well-known NP-hard problem without incorporating too much additional complexity into the metaheuristic algorithms. [ABSTRACT FROM AUTHOR]

This paper introduces a novel population-based bio-inspired meta-heuristic optimization algorithm, called Blood Coagulation Algorithm (BCA). BCA derives inspiration from the process of blood coagulation in the human body. The underlying concepts and ideas behind the proposed algorithm are the cooperative behavior of thrombocytes and their intelligent strategy of clot formation. These behaviors are modeled and utilized to underscore intensification and diversification in a given search space. A comparison with various state-of-the-art meta-heuristic algorithms over a test suite of 23 renowned benchmark functions reflects the efficiency of BCA. An extensive investigation is conducted to analyze the performance, convergence behavior and computational complexity of BCA. The comparative study and statistical test analysis demonstrate that BCA offers very competitive and statistically significant results compared to other eminent meta-heuristic algorithms. Experimental results also show the consistent performance of BCA in high dimensional search spaces. Furthermore, we demonstrate the applicability of BCA on real-world applications by solving several real-life engineering problems. [ABSTRACT FROM AUTHOR]