Evolutionary framework with reinforcement learning-based mutation adaptation

Although several multi-operator and multi-method approaches for solving optimization problems have been proposed, their performances are not consistent for a wide range of optimization problems. Also, the task of ensuring the appropriate selection of algorithms and operators may be inefficient since their designs are undertaken mainly through trial and error. This research proposes an improved optimization framework that uses the benefits of multiple algorithms, namely, a multi-operator differential evolution algorithm and a co-variance matrix adaptation evolution strategy. In the former, reinforcement learning is used to automatically choose the best differential evolution operator. To judge the performance of the proposed framework, three benchmark sets of bound-constrained optimization problems (73 problems) with 10, 30 and 50 dimensions are solved. Further, the proposed algorithm has been tested by solving optimization problems with 100 dimensions taken from CEC2014 and CEC2017 benchmark problems. A real-world application data set has also been solved. Several experiments are designed to analyze the effects of different components of the proposed framework, with the best variant compared with a number of state-of-the-art algorithms. The experimental results show that the proposed algorithm is able to outperform all the others considered.</p

Deep-IFS:Intrusion Detection Approach for Industrial Internet of Things Traffic in Fog Environment

The extensive propagation of industrial Internet of Things (IIoT) technologies has encouraged intruders to initiate a variety of attacks that need to be identified to maintain the security of end-user data and the safety of services offered by service providers. Deep learning (DL), especially recurrent approaches, has been applied successfully to the analysis of IIoT forensics but their key challenge of recurrent DL models is that they struggle with long traffic sequences and cannot be parallelized. Multihead attention (MHA) tried to address this shortfall but failed to capture the local representation of IIoT traffic sequences. In this article, we propose a forensics-based DL model (called Deep-IFS) to identify intrusions in IIoT traffic. The model learns local representations using local gated recurrent unit (LocalGRU), and introduces an MHA layer to capture and learn global representation (i.e., long-range dependencies). A residual connection between layers is designed to prevent information loss. Another challenge facing the current IIoT forensics frameworks is their limited scalability, limiting performance in handling Big IIoT traffic data produced by IIoT devices. This challenge is addressed by deploying and training the proposed Deep-IFS in a fog computing environment. The intrusion identification becomes scalable by distributing the computation and the IIoT traffic data across worker fog nodes for training the model. The master fog node is responsible for sharing training parameters and aggregating worker node output. The aggregated classification output is subsequently passed to the cloud platform for mitigating attacks. Empirical results on the Bot-IIoT dataset demonstrate that the developed distributed Deep-IFS can effectively handle Big IIoT traffic data compared with the present centralized DL-based forensics techniques. Further, the results validate the robustness of the proposed Deep-IFS across various evaluation measures

FSS-2019-nCov:A deep learning architecture for semi-supervised few-shot segmentation of COVID-19 infection

The newly discovered coronavirus (COVID-19) pneumonia is providing major challenges to research in terms of diagnosis and disease quantification. Deep-learning (DL) techniques allow extremely precise image segmentation; yet, they necessitate huge volumes of manually labeled data to be trained in a supervised manner. Few-Shot Learning (FSL) paradigms tackle this issue by learning a novel category from a small number of annotated instances. We present an innovative semi-supervised few-shot segmentation (FSS) approach for efficient segmentation of 2019-nCov infection (FSS-2019-nCov) from only a few amounts of annotated lung CT scans. The key challenge of this study is to provide accurate segmentation of COVID-19 infection from a limited number of annotated instances. For that purpose, we propose a novel dual-path deep-learning architecture for FSS. Every path contains encoder–decoder (E-D) architecture to extract high-level information while maintaining the channel information of COVID-19 CT slices. The E-D architecture primarily consists of three main modules: a feature encoder module, a context enrichment (CE) module, and a feature decoder module. We utilize the pre-trained ResNet34 as an encoder backbone for feature extraction. The CE module is designated by a newly introduced proposed Smoothed Atrous Convolution (SAC) block and Multi-scale Pyramid Pooling (MPP) block. The conditioner path takes the pairs of CT images and their labels as input and produces a relevant knowledge representation that is transferred to the segmentation path to be used to segment the new images. To enable effective collaboration between both paths, we propose an adaptive recombination and recalibration (RR) module that permits intensive knowledge exchange between paths with a trivial increase in computational complexity. The model is extended to multi-class labeling for various types of lung infections. This contribution overcomes the limitation of the lack of large numbers of COVID-19 CT scans. It also provides a general framework for lung disease diagnosis in limited data situations

A Hybrid COVID-19 Detection Model Using an Improved Marine Predators Algorithm and a Ranking-Based Diversity Reduction Strategy

Many countries are challenged by the medical resources required for COVID-19 detection which necessitates the development of a low-cost, rapid tool to detect and diagnose the virus effectively for a large numbers of tests. Although a chest X-Ray scan is a useful candidate tool the images generated by the scans must be analyzed accurately and quickly if large numbers of tests are to be processed. COVID-19 causes bilateral pulmonary parenchymal ground-glass and consolidative pulmonary opacities, sometimes with a rounded morphology and a peripheral lung distribution. In this work, we aim to extract rapidly from chest X-Ray images the similar small regions that may contain the identifying features of COVID-19. This paper therefore proposes a hybrid COVID-19 detection model based on an improved marine predators algorithm (IMPA) for X-Ray image segmentation. The ranking-based diversity reduction (RDR) strategy is used to enhance the performance of the IMPA to reach better solutions in fewer iterations. RDR works on finding the particles that couldn't find better solutions within a consecutive number of iterations, and then moving those particles towards the best solutions so far. The performance of IMPA has been validated on nine chest X-Ray images with threshold levels between 10 and 100 and compared with five state-of-art algorithms: equilibrium optimizer (EO), whale optimization algorithm (WOA), sine cosine algorithm (SCA), Harris-hawks algorithm (HHA), and salp swarm algorithms (SSA). The experimental results demonstrate that the proposed hybrid model outperforms all other algorithms for a range of metrics. In addition, the performance of our proposed model was convergent on all numbers of thresholds level in the Structured Similarity Index Metric (SSIM) and Universal Quality Index (UQI) metrics.</p

A conceptual hybrid approach from a multicriteria perspective for sustainable third-party reverse logistics provider identification

Reverse logistics (RL) is considered the reverse manner of gathering and redeploying goods at the end of their lifetime span from consumers to manufacturers in order to reutilize, dispose, or remanufacture. Whereas RL has many economic benefits, it presents compromises to businesses that wish to remain competitive but be responsible global citizens in terms of social, environmental, risk, and safety aspects of sustainable development. Managing RL systems therefore is considered a multifaceted mission that necessities a significant level of technology, infrastructure, experience, and competence. Consequently, various commerce institutions are looking to outsourcing their RL actions to third-party reverse logistics providers (3PRLPs). In this work, a novel hybrid multiplecriteria decision-making (MCDM) framework is proposed to classify and choose 3PRLPs, which comprises the analytic hierarchy process (AHP) technique, and technique for order of preference by similarity to ideal solution (TOPSIS) technique under neutrosophic environment. Accordingly, AHP is availed for defining weights of key dimensions and their subindices. In addition, TOPSIS was adopted for ranking the specified 3PRLPs. The efficiency of the proposed approach is clarified through application on a considered car parts manufacturing industry case in Egypt, which shows the features of the combined MCDM methods. A comparative and sensitivity analyses were performed to highlight the benefits of the incorporated MCDM methods and for clarifying the effect of changing weights in selecting the sustainable 3PRLP alternative, respectively. The suggested framework is also shown to present more functional execution when dealing with uncertainties and qualitative inputs, demonstrating applicability to a broad range of applications. Ultimately, the best sustainable 3PRLPs were selected and results show that social, environmental, and risk and safety sustainability factors have the greatest influence when determining 3PRLPs alternatives.</p

An Efficient Marine Predators Algorithm for Solving Multi-Objective Optimization Problems:Analysis and Validations

Recently, a new strong optimization algorithm called marine predators algorithm (MPA) has been proposed for tackling the single-objective optimization problems and could dramatically fulfill good outcomes in comparison to the other compared algorithms. Those dramatic outcomes, in addition to our recently-proposed strategies for helping meta-heuristic algorithms in fulfilling better outcomes for the multi-objective optimization problems, motivate us to make a comprehensive study to see the performance of MPA alone and with those strategies for those optimization problems. Specifically, This paper proposes four variants of the marine predators' algorithm (MPA) for solving multi-objective optimization problems. The first version, called the multi-objective marine predators' algorithm (MMPA) is based on the behavior of marine predators in finding their prey. In the second version, a novel strategy called dominance strategy-based exploration-exploitation (DSEE) recently-proposed is effectively incorporated with MMPA to relate the exploration and exploitation phase of MPA to the dominance of the solutions - this version is called M-MMPA. DSEE counts the number of dominated solutions for each solution - the solutions with high dominance undergo an exploitation phase; the others with small dominance undergo the exploration phase. The third version integrates M-MMPA with a novel strategy called Gaussian-based mutation, which uses the Gaussian distribution-based exploration and exploitation strategy to search for the optimal solution. The fourth version uses the Nelder-Mead simplex method with M-MMPA (M-MMPA-NMM) at the start of the optimization process to construct a front of the non-dominated solutions that will help M-MMPA to find more good solutions. The effectiveness of the four versions is validated on a large set of theoretical and practical problems. For all the cases, the proposed algorithm and its variants are shown to be superior to a number of well-known multi-objective optimization algorithms. </p

A simple and effective approach for tackling the permutation flow shop scheduling problem

In this research, a new approach for tackling the permutation flow shop scheduling problem (PFSSP) is proposed. This algorithm is based on the steps of the elitism continuous genetic algorithm improved by two strategies and used the largest rank value (LRV) rule to transform the continuous values into discrete ones for enabling of solving the combinatorial PFSSP. The first strategy is combining the arithmetic crossover with the uniform crossover to give the algorithm a high capability on exploitation in addition to reducing stuck into local minima. The second one is re-initializing an individual selected randomly from the population to increase the exploration for avoiding stuck into local minima. Afterward, those two strategies are combined with the proposed algorithm to produce an improved one known as the improved efficient genetic algorithm (IEGA). To increase the exploitation capability of the IEGA, it is hybridized a local search strategy in a version abbreviated as HIEGA. HIEGA and IEGA are validated on three common benchmarks and compared with a number of well-known robust evolutionary and meta-heuristic algorithms to check their efficacy. The experimental results show that HIEGA and IEGA are competitive with others for the datasets incorporated in the comparison, such as Carlier, Reeves, and Heller.</p

An improved artificial jellyfish search optimizer for parameter identification of photovoltaic models

The optimization of photovoltaic (PV) systems relies on the development of an accurate model of the parameter values for the solar/PV generating units. This work proposes a modified artificial jellyfish search optimizer (MJSO) with a novel premature convergence strategy (PCS) to define effectively the unknown parameters of PV systems. The PCS works on preserving the diversity among the members of the population while accelerating the convergence toward the best solution based on two motions: (i) moving the current solution between two particles selected randomly from the population, and (ii) searching for better solutions between the best-so-far one and a random one from the population. To confirm its efficacy, the proposed method is validated on three different PV technologies and is being compared with some of the latest competitive computational frameworks. The numerical simulations and results confirm the dominance of the proposed algorithm in terms of the accuracy of the final results and convergence rate. In addition, to assess the performance of the proposed approach under different operation conditions for the solar cells, two additional PV modules (multi-crystalline and thin-film) are investigated, and the demonstrated scenarios highlight the utility of the proposed MJSO-based methodology.</p

An improved jellyfish algorithm for multilevel thresholding of magnetic resonance brain image segmentations

Image segmentation is vital when analyzing medical images, especially magnetic resonance (MR) images of the brain. Recently, several image segmentation techniques based onmultilevel thresholding have been proposed for medical image segmentation; however, the algorithms become trapped in local minima and have low convergence speeds, particularly as the number of threshold levels increases. Consequently, in this paper, we develop a new multilevel thresholding image segmentation technique based on the jellyfish search algorithm (JSA) (an optimizer).We modify the JSA to prevent descents into local minima, and we accelerate convergence toward optimal solutions. The improvement is achieved by applying two novel strategies: Rankingbased updating and an adaptive method. Ranking-based updating is used to replace undesirable solutions with other solutions generated by a novel updating scheme that improves the qualities of the removed solutions. We develop a new adaptive strategy to exploit the ability of the JSA to find a best-so-far solution; we allow a small amount of exploration to avoid descents into local minima. The two strategies are integrated with the JSA to produce an improved JSA (IJSA) that optimally thresholds brain MR images. To compare the performances of the IJSA and JSA, seven brain MR images were segmented at threshold levels of 3, 4, 5, 6, 7, 8, 10, 15, 20, 25, and 30. IJSA was compared with several other recent image segmentation algorithms, including the improved and standard marine predator algorithms, the modified salp and standard salp swarm algorithms, the equilibrium optimizer, and the standard JSA in terms of fitness, the Structured Similarity Index Metric (SSIM), the peak signal-to-noise ratio (PSNR), the standard deviation (SD), and the Features Similarity IndexMetric (FSIM). The experimental outcomes and theWilcoxon rank-sum test demonstrate the superiority of the proposed algorithm in terms of the FSIM, the PSNR, the objective values, and the SD; in terms of the SSIM, IJSA was competitive with the others.</p