Search

The Internet of Things (IoT) is the underlying technology that has enabled connecting daily apparatus to the Internet and enjoying the facilities of smart services. IoT marketing is experiencing an impressive 16.7% growth rate and is a nearly USD 300.3 billion market. These eye-catching figures have made it an attractive playground for cybercriminals. IoT devices are built using resource-constrained architecture to offer compact sizes and competitive prices. As a result, integrating sophisticated cybersecurity features is beyond the scope of the computational capabilities of IoT. All of these have contributed to a surge in IoT intrusion. This paper presents an LSTM-based Intrusion Detection System (IDS) with a Dynamic Access Control (DAC) algorithm that not only detects but also defends against intrusion. This novel approach has achieved an impressive 97.16% validation accuracy. Unlike most of the IDSs, the model of the proposed IDS has been selected and optimized through mathematical analysis. Additionally, it boasts the ability to identify a wider range of threats (14 to be exact) compared to other IDS solutions, translating to enhanced security. Furthermore, it has been fine-tuned to strike a balance between accurately flagging threats and minimizing false alarms. Its impressive performance metrics (precision, recall, and F1 score all hovering around 97%) showcase the potential of this innovative IDS to elevate IoT security. The proposed IDS boasts an impressive detection rate, exceeding 98%. This high accuracy instills confidence in its reliability. Furthermore, its lightning-fast response time, averaging under 1.2 s, positions it among the fastest intrusion detection systems available. [ABSTRACT FROM AUTHOR]

Many intrusion detection algorithms that use optimization have been developed and are commonly used to detect intrusions. The process of selecting features and the parameters of the classifier are essential parts of how well an intrusion detection system works. This paper provides a detailed explanation and discussion of an improved intrusion detection method for multiclass classification. The proposed solution uses a combination of the modified teaching–learning-based optimization (MTLBO) algorithm, the modified JAYA (MJAYA) algorithm, and a support vector machine (SVM). MTLBO is used with supervised machine learning (ML) to select subsets of features. Selection of the fewest features possible without impairing the accuracy of the results in feature subset selection (FSS) is a multiobjective optimization issue. This paper presents MTLBO as a mechanism and investigates its algorithm-specific, parameter-free idea. This study used the modified JAYA (MJAYA) algorithm to optimize the C and gamma parameters of the support vector machine (SVM) classifier. When the proposed MTLBO-MJAYA-SVM algorithm was compared with the original TLBO and JAYA algorithms on a well-known intrusion detection dataset, it was found to outperform them significantly. [ABSTRACT FROM AUTHOR]

Human beings have created numerous laws, sayings and proverbs that still influence behaviors and decision-making processes of people. Some of the laws, sayings or proverbs are used by people to understand the phenomena that may take place in daily life. For example, Murphy's law states that "Anything that can go wrong will go wrong." Murphy's law is helpful for project planning with analysis and the consideration of risk. Similar to Murphy's law, the old saying "Two heads are better than one" also influences the determination of the ways for people to get jobs done effectively. Although the old saying "Two heads are better than one" has been extensively discussed in different contexts, there is a lack of studies about whether this saying is valid and can be applied in evolutionary computation. Evolutionary computation is an important optimization approach in artificial intelligence. In this paper, we attempt to study the validity of this saying in the context of evolutionary computation approach to the decision making of ridesharing systems with trust constraints. We study the validity of the saying "Two heads are better than one" by developing a series of self-adaptive evolutionary algorithms for solving the optimization problem of ridesharing systems with trust constraints based on the saying, conducting several series of experiments and comparing the effectiveness of these self-adaptive evolutionary algorithms. The new finding is that the old saying "Two heads are better than one" is valid in most cases and hence can be applied to facilitate the development of effective self-adaptive evolutionary algorithms. Our new finding paves the way for developing a better evolutionary computation approach for ridesharing recommendation systems based on sayings created by human beings or human intelligence. [ABSTRACT FROM AUTHOR]

Deepfakes are digital audio, video, or images manipulated using machine learning algorithms. These manipulated media files can convincingly depict individuals doing or saying things they never actually did. Deepfakes pose significant risks to our lives, including national security, financial markets, and personal privacy. The ability to create convincing deep fakes can also harm individuals' reputations and can be used to spread disinformation and fake news. As such, there is a growing need for reliable and accurate methods to detect deep fakes and prevent their harmful effects. In this paper, a hybrid convolutional neural network (CNN) and recurrent neural network (RNN) with a particle swarm optimization (PSO) algorithm is utilized to demonstrate a deep learning strategy for detecting deepfake videos. High accuracy, sensitivity, specificity, and F1 score were attained by the proposed approach when tested on two publicly available datasets: Celeb-DF and the Deepfake Detection Challenge Dataset (DFDC). Specifically, the proposed method achieved an average accuracy of 97.26% on Celeb-DF and an average accuracy of 94.2% on DFDC. The results were compared to other state-of-the-art methods and showed that the proposed method outperformed many. The proposed method can effectively detect deepfake videos, which is essential for identifying and preventing the spread of manipulated content online. [ABSTRACT FROM AUTHOR]

This paper proposes a new time-respecting graph (TRG) representation for contact sequence temporal graphs. Our representation is more memory-efficient than previously proposed representations and has run-time advantages over the ordered sequence of edges (OSE) representation, which is faster than other known representations. While our proposed representation clearly outperforms the OSE representation for shallow neighborhood search problems, it is not evident that it does so for different problems. We demonstrate the competitiveness of our TRG representation for the single-source all-destinations fastest, min-hop, shortest, and foremost paths problems. [ABSTRACT FROM AUTHOR]

At present, in order to conduct non‐destructive testing on the grounding grid of substations under the condition of continuous power supply and no excavation, researchers have applied wireless technology based on electrochemical methods to remotely monitor the corrosion state of grounding conductors online. Nevertheless, wireless signals are affected by the environment when they are transmitted underground. In the field of grounding gird wireless monitoring, how to plan the information transmission path of wireless sensor network (WSN) with high accuracy of data transfer and low energy consumption earns growing research attention. To address the problem of WSN path planning in grounding grid area, a path planning method for WSN based on the hybrid algorithm of map‐matching algorithm and double‐pole search algorithm (MM‐DPS) is proposed in this paper. The map‐matching algorithm is employed to calculate the optimal sampling node number of the data transmission path. On the basis of the optimal sampling node number, the double‐pole search algorithm is employed in seeking out each sensor node of the path, and two groups of path plans are obtained. In the simulation experiment, compared with the A‐star algorithm, the MM‐DPS algorithm shortens the data transmission path length by about 39% and reduces the energy consumption by about 57%. The research work brings a method to alleviate the problem of data transmission underground of WSN in grounding grid area. The method not only ensures the accuracy of data transmission, but also shorts the transmission distance and reduces energy consumption. [ABSTRACT FROM AUTHOR]

Whenever a new supervised machine learning (ML) algorithm or solution is developed, it is imperative to evaluate the predictive performance it attains for diverse datasets. This is done in order to stress test the strengths and weaknesses of the novel algorithms and provide evidence for situations in which they are most useful. A common practice is to gather some datasets from public benchmark repositories for such an evaluation. But little or no specific criteria are used in the selection of these datasets, which is often ad-hoc. In this paper, the importance of gathering a diverse benchmark of datasets in order to properly evaluate ML models and really understand their capabilities is investigated. Leveraging from meta-learning studies evaluating the diversity of public repositories of datasets, this paper introduces an optimization method to choose varied classification and regression datasets from a pool of candidate datasets. The method is based on maximum coverage, circular packing, and the meta-heuristic Lichtenberg Algorithm for ensuring that diverse datasets able to challenge the ML algorithms more broadly are chosen. The selections were compared experimentally with a random selection of datasets and with clustering by k-medoids and proved to be more effective regarding the diversity of the chosen benchmarks and the ability to challenge the ML algorithms at different levels. [ABSTRACT FROM AUTHOR]

Emerging technology selection is crucial for enterprise integration, driving innovation, competitiveness, and streamlining operations across diverse sectors like finance and healthcare. However, the decision-making process for technology adoption is often complex and fraught with uncertainties. Bipolar fuzzy sets offer a nuanced representation of uncertainty, allowing for simultaneous positive and negative membership degrees, making them valuable in decision-making and expert systems. In this paper, we introduce dynamic averaging and dynamic geometric operators under bipolar fuzzy environment. We also establish some of the fundamental crucial features of these operators. Moreover, we present a step by step mechanism to solve MADM problem under bipolar fuzzy dynamic aggregation operators. In addition, these new techniques are successfully applied for the selection of the most promising emerging technology for enterprise integration. Finally, a comparative study is conducted to show the validity and practicability of the proposed techniques in comparison to existing methods. [ABSTRACT FROM AUTHOR]

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]

Population-based metaheuristics can be seen as a set of agents that smartly explore the space of solutions of a given optimization problem. These agents are commonly governed by movement operators that decide how the exploration is driven. Although metaheuristics have successfully been used for more than 20 years, performing rapid and high-quality parameter control is still a main concern. For instance, deciding the proper population size yielding a good balance between quality of results and computing time is constantly a hard task, even more so in the presence of an unexplored optimization problem. In this paper, we propose a self-adaptive strategy based on the on-line population balance, which aims for improvements in the performance and search process on population-based algorithms. The design behind the proposed approach relies on three different components. Firstly, an optimization-based component which defines all metaheuristic tasks related to carry out the resolution of the optimization problems. Secondly, a learning-based component focused on transforming dynamic data into knowledge in order to influence the search in the solution space. Thirdly, a probabilistic-based selector component is designed to dynamically adjust the population. We illustrate an extensive experimental process on large instance sets from three well-known discrete optimization problems: Manufacturing Cell Design Problem, Set covering Problem, and Multidimensional Knapsack Problem. The proposed approach is able to compete against classic, autonomous, as well as IRace-tuned metaheuristics, yielding interesting results and potential future work regarding dynamically adjusting the number of solutions interacting on different times within the search process. [ABSTRACT FROM AUTHOR]

The slime mould algorithm (SMA) is a new swarm intelligence algorithm inspired by the oscillatory behavior of slime moulds during foraging. Numerous researchers have widely applied the SMA and its variants in various domains in the field and proved its value by conducting various literatures. In this paper, a comprehensive review of the SMA is introduced, which is based on 130 articles obtained from Google Scholar between 2022 and 2023. In this study, firstly, the SMA theory is described. Secondly, the improved SMA variants are provided and categorized according to the approach used to apply them. Finally, we also discuss the main applications domains of the SMA, such as engineering optimization, energy optimization, machine learning, network, scheduling optimization, and image segmentation. This review presents some research suggestions for researchers interested in this algorithm, such as conducting additional research on multi-objective and discrete SMAs and extending this to neural networks and extreme learning machining. [ABSTRACT FROM AUTHOR]

This paper proposes extended-window algorithms for model prediction and applies them to optimize hybrid power systems. We consider a hybrid power system comprising solar panels, batteries, a fuel cell, and a chemical hydrogen generation system. The proposed algorithms enable the periodic updating of prediction models and corresponding changes in system parts and power management based on the accumulated data. We first develop a hybrid power model to evaluate system responses under different conditions. We then build prediction models using five artificial intelligence algorithms. Among them, the light gradient boosting machine and extreme gradient boosting methods achieve the highest accuracies for predicting solar radiation and load responses, respectively. Therefore, we apply these two models to forecast solar and load responses. Third, we introduce extended-window algorithms and investigate the effects of window sizes and replacement costs on system performance. The results show that the optimal window size is one week, and the system cost is 13.57% lower than the cost of the system that does not use the extended-window algorithms. The proposed method also tends to make fewer component replacements when the replacement cost increases. Finally, we design experiments to demonstrate the feasibility and effectiveness of systems using extended-window model prediction. [ABSTRACT FROM AUTHOR]

This paper presents a novel approach to optimize the thinning of an elliptical cylindrical array (ECA) composed of uniformly stimulated, isotropic antennas with the objective of achieving a directed beam characterized by a significantly reduced relative Sidelobe Level (SLL). The optimization process employs the Novel Particle Swarm Optimization (NPSO) method, which offers a fresh perspective on addressing electromagnetic optimization challenges by its ability to effectively explore solution spaces. By employing the NPSO algorithm, which emulates the collective behavior of swarming particles to search for optimal solutions, this study addresses complex optimization challenges inherent in antenna array design. This study focuses on identifying the optimal combination of ON–OFF components (use the minimum number of ON antenna elements) within the antenna array to produce a radiation pattern exhibiting the greatest decrease in SLL. Additionally, the First Null Beam Width (FNBW) is targeted for optimization without predefined values. The optimization approach also considers the effect of thinned array element spacing on the overall performance metrics. Out of total 36 elements, only 15 elements are switched ON and the remaining of the elements are OFF, so the total reduction or thinning of ECAA is 41.66%. Simulation results demonstrate that the proposed methodology enables a simultaneous reduction of more than half of the antenna array elements while achieving superior SLL minimization. This significant reduction in antenna elements not only contributes to simplifying the array design, but also enhances the array’s beamforming capabilities. [ABSTRACT FROM AUTHOR]

This paper proposes the Love Evolution Algorithm (LEA), a novel evolutionary algorithm inspired by the stimulus–value–role theory. The optimization process of the LEA includes three phases: stimulus, value, and role. Both partners evolve through these phases and benefit from them regardless of the outcome of the relationship. This inspiration is abstracted into mathematical models for global optimization. The efficiency of the LEA is validated through numerical experiments with CEC2017 benchmark functions, outperforming seven metaheuristic algorithms as evidenced by the Wilcoxon signed-rank test and the Friedman test. Further tests using the CEC2022 benchmark functions confirm the competitiveness of the LEA compared to seven state-of-the-art metaheuristics. Lastly, the study extends to real-world problems, demonstrating the performance of the LEA across eight diverse engineering problems. Source codes of the LEA are publicly available at https://ww2.mathworks.cn/matlabcentral/fileexchange/159101-love-evolution-algorithm. [ABSTRACT FROM AUTHOR]

The welding community faces a challenging problem in choosing the best welding methods since they are multi-input processes. Modern manufacturing industries have requirements to get fast and optimum process parameters to utilize complete resources in an optimum way. This work attempts to improve the performance of submerged arc welding (SAW), friction welding (FW), and gas tungsten arc welding (GTAW) processes by optimizing their parameters. The newly developed Rao algorithms and their modified versions known as quasi-oppositional Rao (QO Rao), self-adaptive multi-population elite Rao (SAMPE Rao), and improved Rao (I-Rao) are used. This paper contains four multi-objective optimization case studies of SAW, FW, and GTAW processes. A weighted approach is employed to tackle the multi-objective optimization problems effectively. The outcomes achieved using the Rao, QO Rao, SAMPE Rao, and I-Rao algorithms are compared with those obtained by the established optimization algorithms such as accelerated cuckoo optimization algorithm (ACCOA), cuckoo optimization algorithm (COA), plant propagation algorithm (PPA), teaching–learning-based optimization (TLBO) algorithm, Jaya algorithm, quasi-oppositional Jaya (QO Jaya) algorithm, genetic algorithm (GA), particle swarm optimization (PSO) algorithm, and heat transfer search (HTS) algorithm. The effectiveness of the Rao algorithms and their modified versions has been clearly demonstrated as these algorithms have provided superior solutions while requiring fewer generations to achieve them. [ABSTRACT FROM AUTHOR]

Ribonucleic acid (RNA) structure alignment is an important problem in computational biology to identify structural similarity of RNAs. Obtaining an efficient method for this problem is challenging due to the high computational time for the optimal solution and the low accuracy of a heuristic solution. In this paper, an efficient algorithm is proposed based on a mathematical model called longest arc-preserving common subsequence. The proposed algorithm uses a heuristic technique and high-performance computing to optimize the solution of RNA structure alignment, both in terms of the running time and the accuracy of the output. Extensive experimental studies on a multicore system are conducted to show the effectiveness of the proposed algorithm on two types of data. The first is simulated data that consists of 450 comparisons of RNA structures, while the second is real biological data that consists of 357 comparisons of RNA structures. The results show that the proposed algorithm outperforms the best-known heuristic algorithm in terms of execution time, with a percentage improvement of 71% and increasing the length of the output, i.e., accuracy, by approximately 45% in all studied cases. Finally, future approaches are discussed. [ABSTRACT FROM AUTHOR]

Let N = {n1, n2, ..., nk} be a finite set of positive numbers. The problem of finding the minimal number of additions required to compute all elements of N starting from 1 (called the addition sequence problem) is NP-complete. It is equivalent to finding the minimum number of multiplications needed to compute a group exponentiation gn1, gn2, ..., gnk, where g is an element in a group. This paper aims to propose a new metaheuristic algorithm using a simulated annealing strategy to generate a short addition sequence. The performance of the proposed algorithm is measured by considering two parameters: The size of N and the domain of ni,1 ≤ i ≤ k. The proposed algorithm is a new trade-off between the length of the generated addition sequence and the average running time of generating addition sequences. It sometimes produces longer addition sequences than exact algorithms that are slower, and it is slower than suboptimal algorithms that produce longer addition sequences. [ABSTRACT FROM AUTHOR]

A new swarm-based metaheuristic, namely the enriched coati osprey algorithm (ECOA), is proposed in this paper. As its name suggests, ECOA hybridizes two new metaheuristics, the coati optimization algorithm (COA) and the osprey optimization algorithm (OOA). ECOA is constructed by five searches performed sequentially by the swarm members. The first three are directed searches, while the last two are neighborhood searches. All three directed searches are adopted from COA and OOA. Meanwhile, the four-bordered neighborhood search is developed based on a new approach. During the assessment, ECOA was challenged to overcome the set of 23 functions and contended with five new metaheuristics: total interaction algorithm (TIA), golden search optimization (GSO), average and subtraction-based optimization (ASBO), COA, and OOA. The result shows that ECOA outperforms TIA, GSO, ASBO, COA, and OOA in 16, 23, 18, 21, and 21 functions. Meanwhile, the individual search test result shows that the directed searches perform better than the neighborhood searches. Moreover, the directed search toward the best member becomes the most dominant search. [ABSTRACT FROM AUTHOR]

Access points (APs) are used to define coordinates in an indoor positioning system with Wi-Fi. These systems utilize existing infrastructure and Wi-Fi APs to find out the exact location of a device based on its RSSI and MAC address. The accuracy of these devices usually depends on the number of APs located nearby and the environment in which they are deployed. Therefore, the ideal selection of these points increases the discernibility of the localization technique. The rapid development of metaheuristic algorithms in recent years has demonstrated their effectiveness in resolving challenging optimization issues. The primary research goal is to investigate how to enhance indoor localization accuracy with metaheuristic algorithms and to assess the efficacy of positioning using these methods. In this paper, we propose a novel optimization algorithm called the Improved Pathfinder Algorithm (IPFA) using metaheuristic hybridization, where our contribution is twofold. The IPFA's superiority in optimization is used to choose the important APs. Subsequently, to maintain the generality of the localization performance, we created a feature-based classification model for the chosen AP subsets. Two prominent benchmark datasets, UJIIndoorLoc and JUIndoorLoc, were used to test the proposed framework. The proposed Indoor Localization framework attained an accuracy of 98.26% with a mean absolute error (MAE) of approximately 0.79 m. The results demonstrate that the IPFA method is capable of accurately locating the position with minimal positioning errors. [ABSTRACT FROM AUTHOR]

This paper presents two hybrid optimization methods known as PSOHHO and DPSOHHO optimization algorithms. In the first method, using a number of formulae, the top populations are exchanged between the two algorithms and a new population is created and in the second method, we adopted the parallel optimization and optimized its performance. In this method, unlike other parallel methods, the population does not remain constant. With this ability, the strengths of an algorithm can be used to compensate for the weaknesses of the other algorithm. In these methods, no changes are made to the algorithms. The main goal is to use existing algorithms. These methods attain the optimal solution in the shortest time possible. Two algorithms of particle swarm optimization (PSO) and Harris Hawks's optimization (HHO) are used to present this method and two truss samples and CEC209 are considered to confirm the performance of this method. Based on the results, these methods have rapid convergence speed and acceptable results compared to other methods. [ABSTRACT FROM AUTHOR]

The coefficients of friction (COFs) is one of the most important parameters used to evaluate the braking performance of a friction brake. Many indicators that affect the safety and comfort of automobiles are associated with brake COFs. The manufacturers of friction brakes and their components are required to spend huge amounts of time and money to carry out experimental tests to ensure the COFs of a newly developed braking system meet the required standards. In order to save time and costs for the development of new friction brake applications, the GRU (Gate Recurrent Unit) algorithm optimized by the improved PSO (particle swarm optimization) global optimization method is employed in this work to predict brake COFs based on existing experimental data obtained from friction braking dynamometer tests. Compared with the LSTM (Long Short-Term Memory) method, the GRU algorithm optimized by PSO avoids the accuracy reduction problem caused by gradient descent in the training process and hence reduces the prediction error and computational cost. The combined PSO–GRU algorithm increases the coefficient of determination (R2) of the prediction by 4.7%, reduces the MAE (mean absolute error) by 14.3%, and increases the prediction speed by 40.1% compared with the standalone GRU method. The prediction method based on machine learning proposed in this study can not only be applied to the prediction of automobile braking COFs but also for other frictional system problems, such as the prediction of braking noise and the friction of various bearing transmission components. [ABSTRACT FROM AUTHOR]

The slime mould algorithm may not be enough and tends to trap into local optima, low population diversity, and suffers insufficient exploitation when real-world optimization problems become more complex. To overcome the limitations of SMA, the Gaussian mutation (GM) with a novel strategy is proposed to enhance SMA and it is named as SMA-GM. The GM is used to increase population diversity, which helps SMA come out of local optima and retain a robust local search capability. Additionally, the oscillatory parameter is updated and incorporated with GM to set the balance between exploration and exploitation. By using a greedy selection technique, this study retains an optimal slime mould position while ensuring the algorithm's rapid convergence. The SMA-GM performance was evaluated by using unconstrained, constrained, and CEC2022 benchmark functions. The results show that the proposed SMA-GM has a more robust capacity for global search, improved stability, a faster rate of convergence, and the ability to solve constrained optimization problems. Additionally, the Wilcoxon rank sum test illustrates that there is a significant difference between the optimization outcomes of SMA-GM and each compared algorithm. Furthermore, the engineering problem such as industrial refrigeration system (IRS), optimal operation of the alkylation unit problem, welded beam and tension/compression spring design problem are solved, and results prove that the proposed algorithm has a better optimization efficiency to reach the optimum value. [ABSTRACT FROM AUTHOR]

Phasor measurement units (PMUs) are deployed at power grid nodes around the transmission grid, determining precise power system monitoring conditions. In real life, it is not realistic to place a PMU at every power grid node; thus, the lowest PMU number is optimally selected for the full observation of the entire network. In this study, the PMU placement model is reconsidered, taking into account single- and multi-capacity placement models rather than the well-studied PMU placement model with an unrestricted number of channels. A restricted number of channels per monitoring device is used, instead of supposing that a PMU is able to observe all incident buses through the transmission connectivity lines. The optimization models are declared closely to the power dominating set and minimum edge cover problem in graph theory. These discrete optimization problems are directly related with the minimum set covering problem. Initially, the allocation model is declared as a constrained mixed-integer linear program implemented by mathematical and stochastic algorithms. Then, the 0 / 1 integer linear problem is reformulated into a non-convex constraint program to find optimality. The mathematical models are solved either in binary form or in the continuous domain using specialized optimization libraries, and are all implemented in YALMIP software in conjunction with MATLAB. Mixed-integer linear solvers, nonlinear programming solvers, and heuristic algorithms are utilized in the aforementioned software packages to locate the global solution for each instance solved in this application, which considers the transformation of the existing power grids to smart grids. [ABSTRACT FROM AUTHOR]

The exploration of premium and new locations is regarded as a fundamental function of every evolutionary algorithm. This is achieved using the crossover and mutation stages of the differential evolution (DE) method. A best-and-worst position-guided novel exploration approach for the DE algorithm is provided in this study. The proposed version, known as "Improved DE with Best and Worst positions (IDEBW)", offers a more advantageous alternative for exploring new locations, either proceeding directly towards the best location or evacuating the worst location. The performance of the proposed IDEBW is investigated and compared with other DE variants and meta-heuristics algorithms based on 42 benchmark functions, including 13 classical and 29 non-traditional IEEE CEC-2017 test functions and 3 real-life applications of the IEEE CEC-2011 test suite. The results prove that the proposed approach successfully completes its task and makes the DE algorithm more efficient. [ABSTRACT FROM AUTHOR]

Emerging technology selection is crucial for enterprise integration, driving innovation, competitiveness, and streamlining operations across diverse sectors like finance and healthcare. However, the decision-making process for technology adoption is often complex and fraught with uncertainties. Bipolar fuzzy sets offer a nuanced representation of uncertainty, allowing for simultaneous positive and negative membership degrees, making them valuable in decision-making and expert systems. In this paper, we introduce dynamic averaging and dynamic geometric operators under bipolar fuzzy environment. We also establish some of the fundamental crucial features of these operators. Moreover, we present a step by step mechanism to solve MADM problem under bipolar fuzzy dynamic aggregation operators. In addition, these new techniques are successfully applied for the selection of the most promising emerging technology for enterprise integration. Finally, a comparative study is conducted to show the validity and practicability of the proposed techniques in comparison to existing methods.

Here we introduce a new evolutionary algorithm called the Lotus Effect Algorithm, which combines efficient operators from the dragonfly algorithm, such as the movement of dragonflies in flower pollination for exploration, with the self-cleaning feature of water on flower leaves known as the lotus effect, for extraction and local search operations. The authors compared this method to other improved versions of the dragonfly algorithm using standard benchmark functions, and it outperformed all other methods according to Fredman's test on 29 benchmark functions. The article also highlights the practical application of LEA in reducing energy consumption in IoT nodes through clustering, resulting in increased packet delivery ratio and network lifetime. Additionally, the performance of the proposed method was tested on real-world problems with multiple constraints, such as the welded beam design optimization problem and the speed-reducer problem applied in a gearbox, and the results showed that LEA performs better than other methods in terms of accuracy. [ABSTRACT FROM AUTHOR]

In the optimization field, the ability to efficiently tackle complex and high-dimensional problems remains a persistent challenge. Metaheuristic algorithms, with a particular emphasis on their autonomous variants, are emerging as promising tools to overcome this challenge. The term "autonomous" refers to these variants' ability to dynamically adjust certain parameters based on their own outcomes, without external intervention. The objective is to leverage the advantages and characteristics of an unsupervised machine learning clustering technique to configure the population parameter with autonomous behavior, and emphasize how we incorporate the characteristics of search space clustering to enhance the intensification and diversification of the metaheuristic. This allows dynamic adjustments based on its own outcomes, whether by increasing or decreasing the population in response to the need for diversification or intensification of solutions. In this manner, it aims to imbue the metaheuristic with features for a broader search of solutions that can yield superior results. This study provides an in-depth examination of autonomous metaheuristic algorithms, including Autonomous Particle Swarm Optimization, Autonomous Cuckoo Search Algorithm, and Autonomous Bat Algorithm. We submit these algorithms to a thorough evaluation against their original counterparts using high-density functions from the well-known CEC LSGO benchmark suite. Quantitative results revealed performance enhancements in the autonomous versions, with Autonomous Particle Swarm Optimization consistently outperforming its peers in achieving optimal minimum values. Autonomous Cuckoo Search Algorithm and Autonomous Bat Algorithm also demonstrated noteworthy advancements over their traditional counterparts. A salient feature of these algorithms is the continuous nature of their population, which significantly bolsters their capability to navigate complex and high-dimensional search spaces. However, like all methodologies, there were challenges in ensuring consistent performance across all test scenarios. The intrinsic adaptability and autonomous decision making embedded within these algorithms herald a new era of optimization tools suited for complex real-world challenges. In sum, this research accentuates the potential of autonomous metaheuristics in the optimization arena, laying the groundwork for their expanded application across diverse challenges and domains. We recommend further explorations and adaptations of these autonomous algorithms to fully harness their potential. [ABSTRACT FROM AUTHOR]