Search

In the livestock industry, wireless sensor networks (WSNs) play a significant role in monitoring many fauna health statuses and behaviors. Energy preservation in WSNs is considered one of the critical, complicated tasks since the sensors are coupled to constrained resources. Therefore, the clustering approach has proved its efficacy in preserving energy in WSNs. In recent studies, various clustering approaches have been introduced that use optimization techniques to improve the network lifespan by decreasing energy depletion. Yet, they take longer to converge and choose the optimal cluster heads in the network. In addition, the energy is exhausted quickly in the network. This paper introduces a novel optimization technique, i.e., an artificial rabbits optimization algorithm-based energy efficient cluster formation (EECHS-ARO) approach in a WSN, to extend the network lifetime by minimizing the energy consumption rate. The EECHS-ARO technique balances the search process in terms of enriched exploration and exploitation while selecting the optimal cluster heads. The experimentation was carried out on a MATLAB 2021a platform with varying sensor nodes. The obtained results of EECHS-ARO are contrasted with other existing approaches via teaching–learning based optimization algorithm (TLBO), ant lion optimizer (ALO) and quasi oppositional butterfly optimization algorithm (QOBOA). The proposed EECHS-ARO enriches the network lifespan by ~15% and improves the packet delivery ratio by ~5%. [ABSTRACT FROM AUTHOR]

This article addresses the problem of converting a single-objective combinatorial problem into a multi-objective one using the Pareto front approach. Although existing algorithms can identify the optimal solution in a multi-objective space, they fail to satisfy constraints while achieving optimal performance. To address this issue, we propose a multi-objective artificial bee colony optimization algorithm with a classical multi-objective theme called fitness sharing. This approach helps the convergence of the Pareto solution set towards a single optimal solution that satisfies multiple objectives. This article introduces multi-objective optimization with an example of a non-dominated sequencing technique and fitness sharing approach. The experimentation is carried out in MATLAB 2018a. In addition, we applied the proposed algorithm to two different real-time datasets, namely the knapsack problem and the nurse scheduling problem (NSP). The outcome of the proposed MBABC-NM algorithm is evaluated using standard performance indicators such as average distance, number of reference solutions (NRS), overall count of attained solutions (TNS), and overall non-dominated generation volume (ONGV). The results show that it outperforms other algorithms. [ABSTRACT FROM AUTHOR]

The swarm-based Artificial Bee Colony (ABC) algorithm has a significant range of applications and is competent, compared to other algorithms, regarding many optimization problems. However, the ABC's performance in higher-dimension situations towards global optima is not on par with other models due to its deficiency in balancing intensification and diversification. In this research, two different strategies are applied for the improvement of the search capability of the ABC in a multimodal search space. In the ABC, the first strategy, Patron–Prophet, is assessed in the scout bee phase to incorporate a cooperative nature. This strategy works based on the donor–acceptor concept. In addition, a self-adaptability approach is included to balance intensification and diversification. This balancing helps the ABC to search for optimal solutions without premature convergence. The first strategy explores unexplored regions with better insight, and more profound intensification occurs in the discovered areas. The second strategy controls the trap of being in local optima and diversification without the pulse of intensification. The proposed model, named the PP-ABC, was evaluated with mathematical benchmark functions to prove its efficiency in comparison with other existing models. Additionally, the standard and statistical analyses show a better outcome of the proposed algorithm over the compared techniques. The proposed model was applied to a three-bar truss engineering design problem to validate the model's efficacy, and the results were recorded. [ABSTRACT FROM AUTHOR]

Economic Load Dispatch (ELD) belongs to a non-convex optimization problem that aims to reduce total power generation cost by satisfying demand constraints. However, solving the ELD problem is a challenging task, because of its parity and disparity constraints. The Pigeon-Inspired Optimizer (PIO) is a recently proposed optimization algorithm, which belongs to the family of swarm intelligence algorithms. The PIO algorithm has the benefit of conceptual simplicity, and provides better outcomes for various real-world problems. However, this algorithm has the drawback of premature convergence and local stagnation. Therefore, we propose an Oppositional Pigeon-Inspired Optimizer (OPIO) algorithm—to overcome these deficiencies. The proposed algorithm employs Oppositional-Based Learning (OBL) to enhance the quality of the individual, by exploring the global search space. The proposed algorithm would be used to determine the load demand of a power system, by sustaining the various equality and inequality constraints, to diminish the overall generation cost. In this work, the OPIO algorithm was applied to solve the ELD problem of small- (13-unit, 40-unit), medium- (140-unit, 160-unit) and large-scale (320-unit, 640-unit) test systems. The experimental results of the proposed OPIO algorithm demonstrate its efficiency over the conventional PIO algorithm, and other state-of-the-art approaches in the literature. The comparative results demonstrate that the proposed algorithm provides better results—in terms of improved accuracy, higher convergence rate, less computation time, and reduced fuel cost—than the other approaches. [ABSTRACT FROM AUTHOR]

The nurse scheduling problem (NSP) is an NP-Hard combinatorial optimization scheduling problem that allocates a set of shifts to the group of nurses concerning the schedule period subject to the constraints. The objective of the NSP is to create a schedule that satisfies both hard and soft constraints suggested by the healthcare management. This work explores the meta-heuristic approach to an artificial bee colony algorithm with the Nelder–Mead method (NM-ABC) to perform efficient nurse scheduling. Nelder–Mead (NM) method is used as a local search in the onlooker bee phase of ABC to enhance the intensification process of ABC. Thus, the author proposed an improvised solution strategy at the onlooker bee phase with the benefits of the NM method. The proposed algorithm NM-ABC is evaluated using the standard dataset NSPLib, and the experiments are performed on various-sized NSP instances. The performance of the NM-ABC is measured using eight performance metrics: best time, standard deviation, least error rate, success percentage, cost reduction, gap, and feasibility analysis. The results of our experiment reveal that the proposed NM-ABC algorithm attains highly significant achievements compared to other existing algorithms. The cost of our algorithm is reduced by 0.66%, and the gap percentage to move towards the optimum value is 94.30%. Instances have been successfully solved to obtain the best deal with the known optimal value recorded in NSPLib. [ABSTRACT FROM AUTHOR]

Intracranial hemorrhage (ICH) is a serious medical condition that necessitates a prompt and exhaustive medical diagnosis. This paper presents a multi-label ICH classification issue with six different types of hemorrhages, namely epidural (EPD), intraparenchymal (ITP), intraventricular (ITV), subarachnoid (SBC), subdural (SBD), and Some. A patient may experience numerous hemorrhages at the same time in some situations. A CT scan of a patient's skull is used to detect and classify the type of ICH hemorrhage(s) present. First, our model determines whether there is a hemorrhage or not; if there is a hemorrhage, the model attempts to identify the type of hemorrhage(s). In this paper, we present a hybrid deep learning approach that combines convolutional neural network (CNN) and Long-Short Term Memory (LSTM) approaches (Conv-LSTM). In addition, to propose viable solutions for the problem, we used a Systematic Windowing technique with a Conv-LSTM. To ensure the efficacy of the proposed model, experiments are conducted on the RSNA dataset. The suggested model provides higher sensitivity (93.87%), specificity (96.45%), precision (95.21%), and accuracy (95.14%). In addition, the obtained F1 score results outperform existing deep neural network-based algorithms. [ABSTRACT FROM AUTHOR]

Summary: The main aim of this paper is to address the problem of redundant broadcast packets using the extension of rough set concept. In general, a rough set is a mathematical tool for dealing with issues of uncertainty. In MANET, mobile nodes are moving from one place to another place in a simulation environment; hence, it creates uncertainty issues. Due to the fast mobility of mobile nodes, network metrics such as bandwidth and hop count vary. The findings were useful in identifying and improving the network's performance. The proposed NRS‐based route selection approach has been compared with conventional techniques such as rough set, covering rough set (CRS). The reduced control packets are obtained using pruning concept based on selection of one‐hop and two‐hop nodes. Eventually, the proposed approach proved that it attains a higher throughput (85%), reducing the route request packets (3406) and delay of data transmission (0.02274 s). Also, two well‐known ad hoc routing protocols were used such as Dynamic Source Routing (DSR) and Ad Hoc On‐Demand Distance Vector (AODV) protocols. [ABSTRACT FROM AUTHOR]

• A Hybrid deep learning mechanism is introduced to detect a Shilling Attack with improved accuracy and reduced data sparsity. • The proposed mechanism facilitates seeing shilling attacks by constructing a deep learning network with multiple convolutions, pooling, and fully connected layers. • Multiply-Rotated Piecewise Cubic Hermite Interpolation method is incorporated to aid in precise differentiation among attack and genuine profiles to minimize the rating matrix sparsity. • The performance of the proposed model shows high accuracy and statistically proves that the proposed model is better than other compared models. The degree of openness of the socially aware recommendation systems and the possibility of the attackers injecting vast numbers of fake profiles biases the prediction of the system. Most classical shilling attack discovery mechanisms rely on artificially derived features, generally determined from user-generated data. Moreover, these baseline approaches cannot comprehensively capture the fine-grained relation between users and objects, thereby lagging in detection accuracy. This work introduces a Hybrid deep learning mechanism to address the Shilling Attack discovery with improved accuracy. The proposed mechanism highly enhances the detection accuracy by determining significant feature vectors managed by recurrent gated units and other high dimensional attribute vectors attained by using CNN. The GRU component is incorporated for the dimensionality transition process for existing weight classification data to learn the inherent significant features. The CNN mechanism is mainly used for analyzing the conditions of spatial-temporal data and transforming the data into a dormant feature vector. The experimental analysis of our proposed method is conducted using the datasets of Amazon, Netflix, and Movielens to demonstrate its predominance by enhancing accuracy, precision, and F -score. [Display omitted] [ABSTRACT FROM AUTHOR]