Detection of transformer faults avoids the transformer's undesirable loss from service and ensures utility service continuity. Diagnosis of transformer faults is determined using dissolved gas analysis (DGA). Several traditional DGA techniques, such as IEC code 60599, Rogers' ratio method, Dornenburg method, Key gas method, and Duval triangle method, but these DGA techniques suffer from poor diagnosis transformer faults. Therefore, more research was used to diagnose transformer fault and diagnostic accuracy by combining traditional DGA techniques with artificial intelligence and optimization techniques. In this paper, a proposed Adaptive Dynamic Polar Rose Guided Whale Optimization algorithm (AD-PRS-Guided WOA) improves the classification techniques' parameters that were used to enhance the transformer diagnostic accuracy. The results showed that the proposed AD-PRS-Guided WOA provides high diagnostic accuracy of transformer faults as 97.1%, which is higher than other DGA techniques in the literature. The statistical analysis based on different tests, including ANOVA and Wilcoxon's rank-sum, confirms the algorithm's accuracy.

Long-term load forecasting (LTLF) is an essential process for strategical planning of the future needed extension in the power systems of any country. Besides, deep learning has become the heart of the machine learning paradigm, which is wildly used nowadays in many fields, and it also has become the current revolution in Artificial Intelligence (AI). In this paper, an optimized deep learning model based on Stacked Long Short-Term Memory Network (SLSTMN) is proposed. The architecture of the model is optimized to get the best configuration using Genetic Algorithm (GA). In addition, the hyperparameters of the model network are optimized using many deep learning techniques. During the optimization process, hundreds of model configurations are tested. The accuracy of this model is compared with many deep learning models and is compared against the related work in the field of LTLF. The dataset of the South Australia State (SA) power system is used to test the compared models. This data includes maximum daily load, daily maximum temperature, daily minimum temperature, weekday, the month, and holidays for 12 years from 2005 to 2016. SLSTMN achieves excellent accuracy and the lowest error value (almost 1%) when compared with other models on the same dataset and with related work models on different datasets.

Several optimization problems can be abstracted into many-objective optimization problems (MaOPs). The key to solving MaOPs is designing an effective algorithm to balance the exploration and exploitation issues. This paper proposes a novel many-objective African vulture optimization algorithm (MaAVOA) that simulating the African vultures’ foraging and navigation behaviours to solve the MaOPs. MaAVOA is an updated version of the African Vulture Optimization Algorithm (AVOA), which was recently proposed to solve the MaOPs. A new social leader vulture for the selection process is introduced and integrated into the proposed model. In addition, an environmental selection mechanism based on the alternative pool is adapted to improve the selection process to maintain diversity for approximating different parts of the whole Pareto Front (PF). The best-nondominated solutions are saved in an external Archive based on the Fitness Assignment Method (FAM) during the population evolution. FAM is based on a convergence measure that promotes convergence and a density measure that promotes variety. Also, a Reproduction of Archive Solutions (RAS) procedure is developed to improve the quality of archiving solutions. RAS has been designed to help reach out to the missing areas of the PF that the vultures easily miss. Two experiments are conducted to verify and validate the suggested MaAVOA’s performance efficacy. First, MaAVOA was applied to the DTLZ functions, and its performance was compared to that of several popular many-objective algorithms and according to the results, MaAVOA outperforms the competitor algorithms in terms of inverted generational distance and hypervolume performance measures and has a beneficial adaptation ability in terms of both convergence and diversity performance measures. Also, statistical tests are implemented to demonstrate the suggested algorithm’s statistical relevance. Second, MaAVOA has been applied to solve two real-life constrained engineering MaOPs applications, namely, the series-parallel system and overspeed protection for gas turbine problems. The experiments show that the suggested algorithm can tackle many-objective real-world applications and provide promising choices for decision-makers.

Semantic Web Services (SWSs) represent the most recent and revolutionary technology developed for machine-to-machine interaction on the web 3.0. As for the conventional web services, the problem of discovering and selecting the most suitable web service represents a challenge for SWSs to be widely used. In this paper, we propose a mapping algorithm that facilitates the redefinition of the conventional web services annotations (i.e., WSDL) using semantic annotations (i.e., OWL-S). This algorithm will be a part of a new discovery mechanism that relies on the semantic annotations of the web services to perform its task. The “local ontology repository” and “ontology search and standardization engine” are the backbone of this algorithm. Both of them target to define any data type in the system using a standard ontology-based concept. The originality of the proposed mapping algorithm is its applicability and consideration of the standardization problem. The proposed algorithm is implemented and its components are validated using some test collections and real examples. An experimental test of the proposed techniques is reported, showing the impact of the proposed algorithm in decreasing the time and the effort of the mapping process. Moreover, the experimental results promises that the proposed algorithm will have a positive impact on the discovery process as a whole.

In the evolving landscape of logistics, drone technology presents a solution to the challenges posed by traditional ground-based deliveries, such as traffic congestion and unforeseen road closures. This research addresses the Truck–Drone Delivery Problem (TDDP), wherein a truck collaborates with a drone, acting as a mobile charging and storage unit. Although the Traveling Salesman Problem (TSP) can represent the TDDP, it becomes computationally burdensome when nodes are dynamically altered. Motivated by this limitation, our study’s primary objective is to devise a model that ensures swift execution without compromising the solution quality. We introduce two meta-heuristics: the Strawberry Plant, which refines the initial truck schedule, and Genetic Algorithms, which optimize the combined truck–drone schedule. Using “Dataset 1” and comparing with the Multi-Start Tabu Search (MSTS) algorithm, our model targeted costs to remain within 10% of the optimum and aimed for a 73% reduction in the execution time. Of the 45 evaluations, 37 met these cost parameters, with our model surpassing MSTS in eight scenarios. In contrast, using “Dataset 2” against the CPLEX solver, our model optimally addressed all 810 experiments, while CPLEX managed only 90 within the prescribed time. For 20-customer scenarios and more, CPLEX encountered memory limitations. Notably, when both methods achieved optimal outcomes, our model’s computational efficiency exceeded CPLEX by a significant margin. As the customer count increased, so did computational challenges, indicating the importance of refining our model’s strategies. Overall, these findings underscore our model’s superiority over established solvers like CPLEX and the economic advantages of drone-assisted delivery systems.