Recently, mobile edge computing (MEC) technology has been integrated with wireless blockchain networks to improve the computational capabilities of Internet of Things devices during the mining process. Jointly, optimizing miner selection (discrete) and resource allocation (continuous) in MEC-integrated blockchain networks is a challenging mixed-variable, NP-hard problem. Although several algorithms have been presented in the literature to solve it, they still suffer from low-quality results due to either slow convergence speed, local optima stagnation, or both, especially for small or medium problem sizes. To address this, we propose a transfer-function-guided encoding (TFE) framework that introduces a principled link between continuous metaheuristic search and discrete miner-operator control. Specifically, each individual maintains one discrete control variable determining insertion, deletion, or replacement of a miner and two continuous controls representing transmission power and computing resource allocation. Continuous metaheuristic outputs are converted to discrete decisions through families of S-shaped and V-shaped transfer functions, providing tunable exploration–exploitation balance and probabilistic control over operator selection. This mechanism is integrated with several state-of-the-art algorithms. Extensive experiments on MEC-blockchain networks with m ∈ [ 50 , 1000 ] miners demonstrate that TFE consistently accelerates convergence and improves system profit for small–medium scales, with HNOA-TFE achieving the best overall performance. The numerical results show that the hybrid nutcracker optimization algorithm with the TFE mechanism is effective across most problem instances. Also, the comparative study with recent MEC/blockchain resource-allocation and vehicular-edge benchmarks shows the robustness and scalability of the proposed method.

Mobile edge computing (MEC) servers integrated with multi‐unmanned aerial vehicles (multi‐UAVs) present a new system the multi‐UAV‐assisted MEC system. This system relies on the mobility of the UAVs to reduce the transmission distance between the servers and mobile users, thereby enhancing service quality and minimizing the overall energy consumption. Achieving optimal UAV deployment and precise task scheduling is crucial for improved coverage and service quality in this system. This problem is framed as a nonconvex optimization problem known as joint task scheduling and deployment optimization. Recently, an optimization technique based on a dual‐layer framework: Upper layer optimization and lower layer optimization have been proposed to tackle this problem and achieved superior performance compared to the alternative methods. In this framework, the lower layer was responsible for task scheduling optimization, while the upper layer was designed to assist in optimizing UAV deployment and thus achieving improved coverage and enhanced task scheduling for mobile users, thereby minimizing the total energy consumption. However, further refinement of upper layer optimization is needed to improve the deployment process. In this study, the upper layer undergoes enhancement through key modifications: First, random selection of the solutions is replaced with sequential selection to maintain the unique characteristics of each individual throughout the optimization process, fostering both exploration and exploitation. Second, a selection of recently reported metaheuristic algorithms, such as spider wasp optimizer (SWO), generalized normal distribution optimization (GNDO), and gradient‐based optimizer (GBO), are adapted to optimize UAV deployments. Both improved upper layer and lower layer optimization led to the development of novel, more effective optimization approaches, including IToGBOTaS, IToGNDOTaS, and IToSWOTaS. These techniques are evaluated using nine instances with a variety of mobile tasks ranging from 100 to 900 to test their stability and then compared to different optimization techniques to measure their effectiveness. This comparison is based on several statistical information to determine the superiority and difference between their outcomes. The results reveal that IToGBOTaS and IToSWOTaS exhibit slightly superior performance compared to all other algorithms, showcasing their competitiveness and efficacy in addressing the optimization challenges of the multi‐UAV‐assisted MEC system.

machine learning (ML) with 5G technology has revolutionized smart healthcare. It has helped improve the quality of care, such as real-time analysis, decision-making, patient monitoring, and personalized treatments. In this article, a 5G aware real-time diabetes prediction framework is proposed using optimized bidirectional long short-term memory (Bi-LSTM) with deep reinforcement learning (DRL). Bi-LSTM can analyze time-series data in forward and backward passes on patient health metrics, such as blood glucose (BG) levels of a diabetic patient, to identify patterns and trends and make predictions about future health outcomes. A local dataset using a wearable sensor is collected of ten Type-2 diabetic patients, encompassing daily BG levels at different times, alongside additional parameters, such as blood pressure and body weight. The proposed framework leverages a dataset of 1830 data points to forecast glucose levels for the following day. It also harnesses DRL to improve and optimize the model’s future predictive performance. The obtained results are evaluated with other ML algorithms to validate the effectiveness of the proposed framework, which shows an improvement from 93.1% to 98.6% accuracy. The patient’s diabetic condition is categorized using the surveillance error grid (SEG) to increase the clinical impact of glucose prediction and make informed decisions. The results show that Bi-LSTM-DRL is an effective approach to predicting glucose levels in real-time and can adapt to health-related changes and optimize its predictions accordingly.

In recent years, unmanned aerial vehicles (UAVs) have been broadly employed as a data collection platform to assist in efficiently collecting data from IoT devices. However, the deployment optimization of UAVs has been challenged due to the need to minimize the energy consumption of UAVs and IoT devices. Several algorithms have been recently proposed for tackling this challenge, but they still have room for improvement due to their slow convergence speed and memory-wasting problems. Therefore, in this study, a new energy-aware approach has been proposed for accurately optimizing the entire deployment of UAVs, which could minimize the total energy consumption. This approach is based on presenting a new encoding mechanism, namely an optimized population size mechanism, for representing both location and number of stop points in an effective manner. In this mechanism, similar to some studies in the literature, the whole population is responsible for the entire deployment, and each individual is responsible for a stop point in this deployment. However, this mechanism presents a novel way to optimize the number of stop points based on adding an auxiliary variable to each stop point to determine whether it will be removed, inserted, or replaced in the newly generated deployment. This variable will be optimized by the optimization techniques during the optimization process to search for the optimal choice for each stop point that could achieve a better deployment. Two well-known optimization techniques, known as differential evolution (DE) and gradient-based optimizer (GBO), are adapted using this mechanism to present new variants, namely DEoPS and GBoPS, for accurately tackling the deployment optimization problem. Two energy consumption formulations are used in our work to investigate the performance of DEoPS and GBoPS. Several experiments have been conducted to compare the performance of both DEoPS and GBoPS with several algorithms on eleven instances. The experimental findings show the effectiveness of GBoPS for the first formulation and the effectiveness of DEoPS for the second formulation.

Accurately estimating the unknown parameters of the photovoltaic (PV) models based on the measured voltage-current data is a challenging optimization problem due to its high nonlinearity and multimodality. An accurate solution to this problem is essential for efficiently simulating, controlling, and evaluating PV systems. There are three different PV models, including the single-diode model, the double-diode model, and the triple-diode model, with five, seven, and nine unknown parameters, respectively, proposed to represent the electrical characteristics of PV systems with varying levels of complexity and accuracy. In the literature, several deterministic and metaheuristic algorithms have been used to accurately solve this hard problem. However, due to the high nonlinearity of this problem, the deterministic methods could not achieve accurate solutions. On the other side, the metaheuristic algorithms, also known as gradient-free methods, could achieve somewhat good solutions for this problem, but they still need further improvements to strengthen their performance against stuck-in local optima and slow convergence speed problems. Over the last two years, several recent metaheuristic algorithms with better characteristics to improve convergence speed and avoid local optima have been proposed to tackle continuous optimization problems. However, the performance of the majority of those algorithms for estimating the parameters of PV models has not been investigated. Therefore, in this paper, the performance of nineteen recently published metaheuristic algorithms, such as the Mantis search algorithm (MSA), spider wasp optimizer (SWO), light spectrum optimizer (LSO), growth optimizer (GO), walrus optimization algorithm (WAOA), hippopotamus optimization algorithm (HOA), black-winged kite algorithm (BKA), quadratic interpolation optimization (QIO), sinh cosh optimizer (SCHA), exponential distribution optimizer (EDO), optical microscope algorithm (OMA), secretary bird optimization algorithm (SBOA), Parrot Optimizer (PO), Newton-Raphson-based optimizer (NRBO), crested porcupine optimizer (CPO), differentiated creative search (DCS), propagation search algorithm (PSA), one-to-one based optimizer (OOBO), and triangulation topology aggregation optimizer (TTAO), are studied to clarify their effectiveness in estimating the unknown parameters of PV models. In addition, those algorithms collaborate with two deterministic functions, namely the Lambert W-Function and the Newton-Raphson Method, to aid in solving the I-V curve equations more accurately, thereby improving the performance of PV systems. Those algorithms are assessed using four well-known PV solar cells and modules and compared with each other using several performance metrics, including best fitness, average fitness, worst fitness, standard deviation (SD), Friedman mean rank, and convergence speed; and a multiple-comparison test to compare the difference between their mean ranks. Results of this comparison show that SWO is more efficient and effective for SDM, DDM, and TDM over the majority of the studied PV solar cells and modules, and the Newton-Raphson Method is more efficient for solving the I-V curve equations. In addition, this study reports that the majority of the recently published metaheuristic algorithms perform poorly when applied to this problem.

The emergence of artificial intelligence (AI) and its related capabilities has led industries to rethink the existing practices of conventional supply chain management and data analysis. Machine learning (ML), Deep Learning (DL) and their unique ability to predict future data and classify data have led to important research in the supply chain (SC) domain, particularly in identifying and prioritising supply chain risks. This paper proposes several DL methodologies to exploit the benefit of DL, particularly to identify whether any product will be delivered late due to any unforeseen reason in a complex SC system. Four different DL architectures (Simple-LSTM, Deep-LSTM, 1D-CNN, and TCN-1DSPCNN models) are proposed to extract features, while six variant classifiers: Softmax, random trees (RT), random forest (RF), K-nearest neighbor (KNN), artificial neural network (ANN), and support vector machine (SVM), were used to classify delay or non-delay information. By seamlessly capturing intricate temporal dependencies, these DL models enhance accuracy in robustly identifying supply chain late orders. Leveraging their hierarchical feature learning, these proposed DL models excel in recognizing subtle patterns and correlations, making them ideal for classifying late orders within the supply chain. Their parallel processing prowess facilitates real-time decision support, allowing organizations to address potential delays and allocate resources effectively and proactively. Five-fold cross-validation is presented to avoid over-fitting and to prove the efficiency of the proposed DL models. The total accuracies of the six ML classifiers are 74.03, 75.81, 93.35, 87.72, 93.59, and 95.10, respectively, while the maximum accuracies obtained from four proposed DL methodologies obtained an accuracy of 97.6, 98.63, 100, 100% respectively using the SVM classifier for predicting late orders based on five-fold cross-validation.

Over the past few years, billions of unsecured Internet of Things (IoT) devices have been produced and released, and that number will only grow as wireless technology advances. As a result of their susceptibility to malware, effective methods have become necessary for identifying IoT malware. However, the low generalizability and the nonindependently and identically distributed data (non-IID) still pose a major challenge to achieving this goal. In this work, a new federated malware detection paradigm, termed FED-MAL, is introduced to collaboratively train multiple distributed edge devices to detect malware. In FED-MAL, the malware binaries are transformed into an image format to lessen the impact on non-IID, and then a compact convolutional model, named AM-NET, is proposed to learn the malware patterns as an image recognition task. The compact nature of AM-NET makes it an appropriate choice for deployment on resource-constrained IoT devices. Following, a refined edge-based adversarial training is given in FED-MAL to empower generalizability and resistibility by generating adversarial samples from various participating clients. Experimental evaluation on publicly available malware data sets shows that the FED-MAL is efficacious, reliable, expandable, generalizable, and communication efficient.

Abstract This paper investigates a wireless blockchain network with mobile edge computing in which Internet of Things (IoT) devices can behave as blockchain users (BUs). This blockchain network’s ultimate goal is to increase the overall profits of all BUs. Because not all BUs join in the mining process, using traditional swarm and evolution algorithms to solve this problem results in a high level of redundancy in the search space. To solve this problem, a modified chaotic Henry single gas solubility optimization algorithm, called CHSGSO, has been proposed. In CHSGSO, the allocation of resources to BUs who decide to engage in mining as an individual is encoded. This results in a different size for each individual in the entire population, which leads to the elimination of unnecessary search space regions. Because the individual size equals the number of participating BUs, we devise an adaptive strategy to fine-tune each individual size. In addition, a chaotic map was incorporated into the original Henry gas solubility optimization to improve resource allocation and accelerate the convergence rate. Extensive experiments on a set of instances were carried out to validate the superiority of the proposed CHSGSO. Its efficiency is demonstrated by comparing it to four well-known meta-heuristic algorithms.

Abstract To develop new meta-heuristic algorithms and evaluate on the benchmark functions is the most challenging task. In this paper, performance of the various developed meta-heuristic algorithms are evaluated on the recently developed CEC 2021 benchmark functions. The objective functions are parametrized by inclusion of the operators, such as bias, shift and rotation. The different combinations of the binary operators are applied to the objective functions which leads to the CEC2021 benchmark functions. Therefore, different meta-heuristic algorithms are considered which solve the benchmark functions with different dimensions. The performance of some basic, advanced meta-heuristics algorithms and the algorithms that participated in the CEC2021 competition have been experimentally investigated and many observations, recommendations, conclusions have been reached. The experimental results show the performance of meta-heuristic algorithms on the different combinations of binary parameterized operators.

The success of differential evolution algorithm depends on its offspring breeding strategy and the associated control parameters. Improved Multi-Operator Differential Evolution (IMODE) proved its efficiency and ranked first in the CEC2020 competition. In this paper, an improved IMODE, called IMODEII, is introduced. In IMODEII, Reinforcement Learning (RL), a computational methodology that simulates interaction-based learning, is used as an adaptive operator selection approach. RL is used to select the best-performing action among three of them in the optimization process to evolve a set of solution based on the population state and reward value. Different from IMODE, only two mutation strategies have been used in IMODEII. We tested the performance of the proposed IMODEII by considering 12 benchmark functions with 10 and 20 variables taken from CEC2022 competition on single objective bound constrained numerical optimisation. A comparison between the proposed IMODEII and the state-of-the-art algorithms is conducted, with the results demonstrating the efficiency of the proposed IMODEII.

The rapid growth of economic makes the process of manufacturing become a political, social, and community concerns. The manufacture selection is a complex multi-criteria decision making (MCDM) issue. The achievement of optimum alternative with respect to manufacture criteria have various diverse procedures. However, recognizing suitable MCDM methods to be adequate for manufacture process is critical for the success to achieve the ideal manufacture. The selection of ideal manufacture decisions is taken in conditions of uncertainty that difficult handled by the traditional methods. Therefore, a proposed hybrid methodology of neutrosophic theory with several MCDM techniques of Analytic Hierarchy Process (AHP), Multi-Objective Optimization based on Ratio Analysis (MULTIMOORA), Multi-Attributive Border Approximation Area Comparison (MABAC), and Technique for Order of Preference by Similarity to Ideal Solution (TOPSIS) to the purposes of manufacture selection. The assessment factors of computational complexity, adequacy to changes of criteria, and agility are applied on the proposed MCDM methods to evaluate sufficiency of the decision process. An empirical study is presented to illustrate the suitability and applicability for suggested methodology. The outcomes demonstrated that proposed hybrid methodology is convenient for manufacture selection. A comparative study is applied, and the results showed, the agility in decision process, AHP technique executed well than MABAC, MULTIMOORA and TOPSIS. The computational complexity, the MABAC technique executed well than AHP, MULTIMOORA and TOPSIS. Additionally, MABAC, MULTIMOORA and TOPSIS techniques are recommended to be the choice of the manufacture selection for adequacy to changes of criteria. Consequently, the comparative study contributes to decision makers and researchers to select the most proper methodology for the process of manufacture selection

Nowadays, firms are trying to execute and use blockchain technology (BT) for rising the products and service goodness in the supply chain (SC). Based on the specific requirements, the BT can be used in several areas. The BT assets various segments of Supply Chain Management (SCM) with consideration of several effective features that are characterized to be multi-criteria decision making (MCDM) issues with environmental restrictions of uncertainty conditions. This research illustrates the suitability of BT in SCM for various segments that are assessed using a neutrosophic model according to single-valued neutrosophic sets (SVNSs). Also, contributes as an evaluation model that combines neutrosophic set, with MCDM methods of Analytic Hierarchy Process (AHP), VIseKriterijumska Optimizacija I Kompromisno Resenje (VIKOR), and Technique for Order Performance by Similarity to Ideal Solution (TOPSIS). The proposed study uses the AHP method to generate weights of criteria considering the expert's perspectives. Moreover, uses the neutrosophic theory to handle uncertain situations. The alternatives ranked based on outcomes of applying TOPSIS and VIKOR methods. A case study presents a hierarchical MCDM issue of 7 criteria and 20 sub-criteria with alternative segments assessed. As a result, the medicine segment is recommended to be the best alternative according to the proposed methods of AHP, TOPSIS, and VIKOR while the insurance segment is not recommended by AHP and TOPSIS methods and jewelry segments are not recommended in the VIKOR method.

The need for energy sources in India has increased abnormally in recent years due to industrial and societal growth. To meet this demand, it was a necessary choice of renewable energy sources (RESs) as a solution to lack of nonrenewable energy sources. Due to the multiplicity of involved factors, selecting the most appropriate RESs is a multiattribute decision making (MADM) problem. There is a large number of work associated with the development of MADM techniques, especially under ambiguous and uncertain conditions. However, the effective embedding of uncertainty and ambiguity and in decision-making remains a difficult challenge, and thus this study introduces a new framework for solving the problem of selecting the most suitable RESs which is based on the neutrosophic set and TODIM (an acronym in Portuguese of interactive and multicriteria decision-making) method. It also reduces human intervention by being systematically applied. First, it transforms the linguistic terms presented into neutrosophic values and implements systematic techniques to compute missing values in the decision matrix using the case-based technique. Second, it calculates the weight of every linguistic variable as well as those of the decision-makers (DMs) and weighted attributes. Furthermore, it creates an aggregated single valued neutrosophic decision matrix for DMs. Finally, it calculates the overall dominance-degree matrix, derives the overall values, and ranks the alternatives. It is applied to select RESs in Karnataka, India, and the obtained results show that wind energy is the most suitable RES for India, with small hydroenergy second most appropriate.

Industrial Internet of Things (IIoT) and Industry 4.0 empower interrelation among manufacturing processes, industrial machines, and utility services. The time-critical data collected from heterogeneous sensing devices are usually communicated to processing points for analysis and aggregation as the basis of IIoT. The IIoTs’ service quality typically depends on data integrity and accuracy, which could be exploited by injecting malicious events, such as false data injection and data poisoning attacks. Thus, effective anomaly recognition and explanation are critical for ensuring quality services and empowering security administrators to interpret the causal reasoning of prediction decisions and underlying data evidence. This study proposes an autoencoder-based detection framework using convolutional and recurrent networks to discover cyber threats in IIoT networks and explain the model. A two-step sliding window (SW) is applied to learn the latent representations of data features better. Malicious points from the raw time series are transformed into fixed-length series through the first-step SW. Every series is converted into continuous-time-reliant subseries via another smaller SW to learn latent representations of malicious events. Fully connected networks use the extracted temporal and spatial features for the classification and explanation of attack events. The empirical results revealed that this framework effectively extracts features that include contexts of malicious patterns. This demonstrated that the proposed framework is robust in detecting malicious events using multiple evaluation metrics and outperforming the contemporary state-of-the-art methods, indicating its suitability as an operative application method in real-world IIoT-based networks.

Abstract Feature Selection (FS) is an important preprocessing step that is involved in machine learning and data mining tasks for preparing data (especially high-dimensional data) by eliminating irrelevant and redundant features, thus reducing the potential curse of dimensionality of a given large dataset. Consequently, FS is arguably a combinatorial NP-hard problem in which the computational time increases exponentially with an increase in problem complexity. To tackle such a problem type, meta-heuristic techniques have been opted by an increasing number of scholars. Herein, a novel meta-heuristic algorithm, called Sparrow Search Algorithm (SSA), is presented. The SSA still performs poorly on exploratory behavior and exploration-exploitation trade-off because it does not duly stimulate the search within feasible regions, and the exploitation process suffers noticeable stagnation. Therefore, we improve SSA by adopting: i) a strategy for Random Re-positioning of Roaming Agents (3RA); and ii) a novel Local Search Algorithm (LSA), which are algorithmically incorporated into the original SSA structure. To the FS problem, SSA is improved and cloned as a binary variant, namely, the improved Binary SSA (iBSSA), which would strive to select the optimal or near-optimal features from a given dataset while keeping the classification accuracy maximized. For binary conversion, the iBSSA was primarily validated against nine common S-shaped and V-shaped Transfer Functions (TFs), thus producing nine iBSSA variants. To verify the robustness of these variants, three well-known classification techniques, includingk-Nearest Neighbor (k-NN), Support Vector Machine (SVM), and Random Forest (RF) were adopted as fitness evaluators with the proposed iBSSA approach and many other competing algorithms, on 18 multifaceted, multi-scale benchmark datasets from the University of California Irvine (UCI) data repository. Then, the overall best-performing iBSSA variant for each of the three classifiers was compared with binary variants of 12 different well-known meta-heuristic algorithms, including the original SSA (BSSA), Artificial Bee Colony (BABC), Particle Swarm Optimization (BPSO), Bat Algorithm (BBA), Grey Wolf Optimization (BGWO), Whale Optimization Algorithm (BWOA), Grasshopper Optimization Algorithm (BGOA) SailFish Optimizer (BSFO), Harris Hawks Optimization (BHHO), Bird Swarm Algorithm (BBSA), Atom Search Optimization (BASO), and Henry Gas Solubility Optimization (BHGSO). Based on a Wilcoxon’s non-parametric statistical test ( $$\alpha =0.05$$ α=0.05 ), the superiority of iBSSA with the three classifiers was very evident against counterparts across the vast majority of the selected datasets, achieving a feature size reduction of up to 92% along with up to 100% classification accuracy on some of those datasets.

Processing data from Internet of Things (IoT) applications at the cloud centers has known limitations relating to latency, task scheduling, and load balancing. Hence, there have been a shift towards adopting fog computing as a complementary paradigm to cloud systems. In this article, we first propose a multi-objective task-scheduling optimization problem that minimizes both the makespans and total costs in a fog-cloud environment. Then, we suggest an optimization model based on a Discrete Non-dominated Sorting Genetic Algorithm II (DNSGA-II) to deal with the discrete multi-objective task-scheduling problem and to automatically allocate tasks that should be executed either on fog or cloud nodes. The NSGA-II algorithm is adapted to discretize crossover and mutation evolutionary operators, rather than using continuous operators that require high computational resources and not able to allocate proper computing nodes. In our model, the communications between the fog and cloud tiers are formulated as a multi-objective function to optimize the execution of tasks. The proposed model allocates computing resources that would effectively run on either the fog or cloud nodes. Moreover, it efficiently organizes the distribution of workloads through various computing resources at the fog. Several experiments are conducted to determine the performance of the proposed model compared with a continuous NSGA-II (CNSGA-II) algorithm and four peer mechanisms. The outcomes demonstrate that the model is capable of achieving dynamic task scheduling with minimizing the total execution times (i.e., makespans) and costs in fog-cloud environments.

The lightning convergence of industry 4.0 and the intelligent Internet of Things (IoT) technologies has significantly increased the vulnerability of industrial cyber-physical systems (ICPSs) to a large population of cyber threats. Intelligent threat detection for discovering cyber threats is a challenging task as it essentially deals with wide-scale, complicated, and heterogeneous ICPSs. This article presents a novel federated deep learning (DL) model (Fed-TH) for hunting cyber threats against ICPSs that captures the temporal and spatial representations of network data. Then, a container-based industrial edge computing framework is designed to deploy the Fed-TH as a threat-hunting microservice on suitable edge servers while maintaining decent resource orchestration. To tackle the latency issue of an ICSP, an exploratory microservice placement method is introduced to enable better microservice deployment based on the computational resources of the participants. The simulation results obtained from two public benchmarks validate the effectiveness of these approaches in terms of accuracy (92.97%, 92.84%) and f1-scores (91.61%, 90.49%).

With the integration of the Internet of Things (IoT) in the field of transportation, the Internet of Vehicles (IoV) turned to be a vital method for designing Smart Transportation Systems (STS). STS consist of various interconnected vehicles and transportation infrastructure exposed to cyber intrusion due to the broad usage of software and the initiation of wireless interfaces. This study proposes a federated deep learning-based intrusion detection framework (FED-IDS) to efficiently detect attacks by offloading the learning process from servers to distributed vehicular edge nodes. FED-IDS introduces a context-aware transformer network to learn spatial-temporal representations of vehicular traffic flows necessary for classifying different categories of attacks. Blockchain-managed federated training is presented to enable multiple edge nodes to offer secure, distributed, and reliable training without the need for centralized authority. In the blockchain, miners confirm the distributed local updates from participating vehicles to stop unreliable updates from being deposited on the blockchain. The experiments on two public datasets (i.e., Car-Hacking, TON_IoT) demonstrated the efficiency of FED-IDS against state-of-the-art approaches. It reveals the credibility of securing networks of intelligent transportation systems against cyber-attacks.

The initiative to introduce new benchmark problems has drawn attention to the development of new optimization algorithms. Recently, a set of constrained benchmark problems has been developed as a addition to CEC benchmark series. This paper proposed a hybrid variant of gaining sharing knowledge based algorithm with adaptive parameters and improved multi-operator differential evolution (IMODE) algorithm, called APGSK-IMODE. It enhanced the performance of recently developed adaptive gaining sharing knowledge based algorithm. The performance of APGSK-IMODE has been tested on CEC2021 benchmark problems which contains 10 test functions with dimensions 10 and 20. The results obtained from the proposed algorithm have been compared with those obtained from the rival algorithms. The results elaborate the superiority of APGSK-IMODE. APGSK-IMODE outperforms the competing algorithms with regard to quality of solution, robustness and convergence.

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.

Recently, many deferential evolution-based algorithms have been developed to solve constrained optimization problems. The performance of these methods outperforms the performance of single operator and/or algorithm-based ones. However, they do not perform consistently for all the problems tested in the literature. Also, the process of using the appropriate selection of algorithms and operators may be time-consuming since their designs are undertaken mainly through trial and error. In this paper, we propose an improved optimization algorithm that uses the benefits of multiple deferential evolution operators, with the best one is emphasized based on the quality and diversity of the population. The performance of the proposed algorithm is tested by solving 57 real-world constrained problems with different dimensions, number of equality and equality constraints, with its results showing a high success rate and that it outperformed different state-of-the-art algorithms.

Although many evolutionary algorithms (EAs) have successfully solved different optimization problems, no single EA has consistently been the best for all these problems. During the last decade, to alleviate this limitation, many proposals which utilize multiple EAs in a single algorithmic framework, called multi-methods or multi-operators, have been introduced. However, there is still room to enhance their performance. In this paper, an improved variant of a united multi-operator algorithm is introduced with few improvements that are capable of providing a balance between diversification and intensification properties during the optimization. The proposed algorithm is tested on the CEC2017 unconstrained benchmark problems, with the results revealing that the proposed algorithm is capable of producing high quality solutions compared with those of state-of-the-art algorithms.

Over the last two decades, many different differential evolution (DE) variants have been developed for solving constrained optimization problems. However, none of them performs consistently when solving different types of problems. To deal with this drawback, multiple search operators are used under a single DE algorithm structure where a higher selection pressure is placed on the best performing operator during the evolutionary process. In this paper, we propose to use the landscape information of the problem in the design of the selection mechanism. The performance of this algorithm with the proposed selection mechanism is analysed by solving 10 real-world constrained optimization problems. The experimental results revealed that the proposed algorithm is capable of producing high quality solutions compared to those of state-of-the-art algorithms.

Over the last two decades, many different evolutionary algorithms (EAs) have been proposed for solving optimization problems. However, no single EA has consistently been the best for solving a wide range of them. In the literature, this drawback has been tackled by using multiple EAs in a single framework. In this paper, a new multi-method based EA that utilizes the search ability of multi-operator differential evolution algorithm (MODE) and covariance matrix adaptation evolution strategy CMA-ES algorithm in a single framework, has been presented, with the orthogonal experimental design (OED) and factor analysis (FA) used to select the proper combination of mutation strategies, control parameters adaptation strategies, and crossover operators. To judge the performance of this algorithm, 30 problems are solved from the CEC2017 competition and their results are analyzed.

Recently, the success history based parameter adaptation for differential evolution algorithm with linear population size reduction has been claimed to be a great algorithm for solving optimization problems. Neuro-dynamic is another recent approach that has shown remarkable convergence for certain problems, even for high dimensional cases. In this paper, we proposed a new algorithm by embedding the concept of neuro-dynamic into a modified success history based parameter adaptation for differential evolution with linear population size reduction. We have also proposed an adaptive mechanism for the appropriate use of the success history based parameter adaptation for differential evolution with linear population size reduction and neuro-dynamic during the search process. The new algorithm has been tested on the CEC'2015 single objective real-parameter competition problems. The experimental results show that the proposed algorithm is capable of producing good solutions that are clearly better than those obtained from the success history based parameter adaptation for differential evolution with linear population size reduction and a few of the other state-of-the-art algorithms considered in this paper.