Abstract

Multi-Objective Evolutionary Algorithms (MOEAs) is actually one of the most attractive and active research field in computer science. Significant research has been conducted in handling complex multi-objective optimization problems within this research area. The Non-Dominated Sorting Genetic Algorithm (NSGA-II) has garnered significant attention in various domains, emphasizing its specific popularity. However, the complexity of this algorithm is found to be O(MN2) with M objectives and N solutions, which is considered computationally demanding. In this paper, we are proposing a new variant of NSGA-II termed (Efficient-NSGA-II) based on our recently proposed quick non-dominated sorting algorithm with quasi-linear average time complexity; thereby making the NSGA-II algorithm efficient from a computational cost viewpoint. Experiments demonstrate that the improved version of the algorithm is indeed much faster than the previous one. Moreover, comparisons results against other multi-objective algorithms on a variety of benchmark problems show the effectiveness and the efficiency of this multi-objective version

Abstract

Drug target interaction is an important area of drug discovery, development, and repositioning. Knowing that in vitro experiments are time-consuming and computationally expensive, the development of an efficient predictive model is a promising challenge for Drug-Target Interactions (DTIs) prediction. Motivated by this problem, we propose in this paper a new prediction model called DeepCNN-DTI to efficiently solve such complex real-world activities. The main motivation behind this work is to explore the advantages of a deep learning strategy with feature extraction techniques, resulting in an advanced model that effectively captures the complex relationships between drug molecules and target proteins for accurate DTIs prediction. Experimental results generated based on a set of data in terms of accuracy, precision, sensitivity, specificity, and F1-score demonstrate the superiority of the model compared to other competing learning strategies.

Abstract

Among the well-known scheduling problems, the customer order scheduling problem (COSP) has
always been of great importance in manufacturing. To reflect the reality of COSPs as much as
possible, this study considers that jobs from different orders are classified in various classes. This
paper addresses a tri-criteria single-machine scheduling model with multiple job classes and
customer orders on which the measurement minimizes a linear combination of the sum of the ranges
of all orders, the tardiness of all orders, and the total completion times of all jobs. Due to the NPhard complexity of the problem, a lower bound and a property are developed and utilized in a
branch-and-bound for solving an exact solution. Afterward, four heuristics with three local
improved searching methods each and a water wave optimality algorithm with four variants of
wavelengths are proposed. The tested outputs report the performances of the proposed methods

Abstract

The multiple job class scheduling problem arises in contexts where a group of jobs belong to multiple classes and in which if all jobs in the same class are operated together, extra setup times would not be needed. On the other hand, the customer order scheduling problem focuses on finishing all jobs from the same order at the same time in order to reduce shipping costs. However, works on customer orders coupled with class setup times do not appear often in the literature. Hence we address here a bicriteria single machine customer order scheduling problem together with multiple job classes. The optimality criterion minimizes a linear combination of the sum of the ranges and sum of tardiness of all customer orders. In light of the high complexity of the concerned problem, we propose a lower bound formula and a property to be used in a branch-and-bound method for optimal solutions. To find approximate solutions, we then propose four heuristics together with a local search method, four cloudy theoretical simulated annealing and a cloudy theoretical simulated annealing hyperheuristic along with five low-level heuristics. The simulation results of the proposed heuristics and algorithms are analyzed.

Abstract

Green manufacturing imposes higher expectations on manufacturing engineering, not only with respect to classic competitive factors such as cost, time and quality, but also with sustainable factors such as resources and energy. In this paper, we investigate green flexible job shop scheduling problem (GFJSP) with variable processing speeds. To solve the GFJSP problem, we propose an adaptive Variable Neighborhood Search to minimize the makespan and the total energy consumption. A number of experiments have been conducted to evaluate the performance of our proposed adaptive VNS algorithm. A comparative study was presented and have verified the out performance of the proposed algorithm against other VNS variants.

Abstract

Fake news has a worldwide impact and the potential to change political scenarios and human behavior, especially in a critical time like the COVID-19 pandemic. This work suggests a Soft Three-Level Voting Model (Soft T-LVM) for automatically classifying COVID-19 fake news. We train different individual machine learning algorithms and different ensemble methods in order to overcome the weakness of individual models. This novel model is based on the soft-voting technique to calculate the class with the majority of votes and to choose the classifiers to merge and apply at every level. We use the Grid search method to tune the hyper-parameters during the process of classification and voting. The experimental evaluation confirms that our proposed model approach has superior performance compared to the other classifiers.

Abstract

Identifying opinion leaders in social networks, particularly in social media, is a crucial marketing strategy. These individuals have a considerable influence on the purchasing decisions of their communities. Companies can benefit from collaborating with relevant opinion leaders in their market as this can increase their visibility, establish their credibility, and gain consumer trust, leading to increased sales, improved brand perception, and an expanded market share. Additionally, by gaining a comprehensive understanding of opinion leaders, companies can better comprehend the trends and preferences of their target audience. This allows them to tailor their marketing and product strategies more effectively. Identifying suitable influencers to endorse their products or services is a significant challenge for companies. The identification of opinion leaders is complicated by their informal and unstructured nature, as well as the varying selection criteria depending on the marketing campaign’s goals. While numerous research studies have focused on detecting opinion leaders in social networks based on content, interactions, or a combination of both, few have explored sentiment analysis of post content, received interactions, and user comments in relation to published posts. The purpose of this paper is to present an hybrid approach to detect opinion leaders in Facebook. This approach involves analyzing the trajectory of post content by examining interactions on the post, as well as mining the text content of the post itself and analyzing the users’comments sentiments.

Abstract

Abstract

Fake news has a worldwide impact and the potential to change political scenarios and human behavior, especially in a critical time like the COVID-19 pandemic. This work suggests a Soft Three-Level Voting Model (Soft T-LVM) for automatically classifying COVID-19 fake news. We train different individual machine learning algorithms and different ensemble methods in order to overcome the weakness of individual models. This novel model is based on the soft-voting technique to calculate the class with the majority of votes and to choose the classifiers to merge and apply at every level. We use the Grid search method to tune the hyper-parameters during the process of classification and voting. The experimental evaluation confirms that our proposed model approach has superior performance compared to the other classifiers.

Abstract

Electrocardiogram (ECG) data are usually used to diagnose cardiovascular disease (CVD) with the help of a revolutionary algorithm. Feature selection is a crucial step in the development of accurate and reliable diagnostic models for CVDs. This research introduces the dynamic threshold genetic algorithm (DTGA) algorithm, a type of genetic algorithm that is used for optimization problems and discusses its use in the context of feature selection. This research reveals the success of DTGA in selecting relevant ECG features that ultimately enhance accuracy and efficiency in the diagnosis of CVD. This work also proves the benefits of employing DTGA in clinical practice, including a reduction in the amount of time spent diagnosing patients and an increase in the precision with which individuals who are at risk of CVD can be identified.