Search

Electrical power systems are the lifeblood of modern civilization, providing the essential energy infrastructure that powers our homes, industries, and technologies. As our world increasingly relies on electricity, and modern power systems incorporate renewable energy sources, the challenges have become more complex, necessitating advanced forecasting and optimization to ensure effective operation and sustainability. This review paper provides a comprehensive overview of electrical power systems and delves into the crucial roles that forecasting and optimization play in ensuring future sustainability. The paper examines various forecasting methodologies from traditional statistical approaches to advanced machine learning techniques, and it explores the challenges and importance of renewable energy forecasting. Additionally, the paper offers an in-depth look at various optimization problems in power systems including economic dispatch, unit commitment, optimal power flow, and network reconfiguration. Classical optimization methods and newer approaches such as meta-heuristic algorithms and artificial intelligence-based techniques are discussed. Furthermore, the review paper examines the integration of forecasting and optimization, demonstrating how accurate forecasts can enhance the effectiveness of optimization algorithms. This review serves as a reference for electrical engineers developing sophisticated forecasting and optimization techniques, leading to changing consumer behaviors, addressing environmental concerns, and ensuring a reliable, efficient, and sustainable energy future. [ABSTRACT FROM AUTHOR]

Massive MIMO technology is recognized as a key enabler for beyond 5G (B5G) and next-generation wireless networks. By utilizing large-scale antenna arrays at the base station (BS), it significantly improves both system capacity and energy efficiency. Despite these advantages, the deployment of a high number of antennas at the BS presents considerable challenges, particularly in the design of signal detectors that can operate with low computational complexity. While the minimum mean square error (MMSE) detector offers optimal performance in these large-scale systems, it suffers from the computational burden that makes its practical implementation challenging. To mitigate this, various iterative methods and their improved versions have been introduced. However, these iterative methods often converge slowly and are less accurate. To address these challenges, this study introduces an improved variant of traditional accelerated over-relaxation (AOR), called optimized AOR (OAOR). AOR is an over-relaxation method, and its performance is highly dependent on its relaxation parameters. To find the optimal parameters, we have developed an innovative approach that integrates a nature-inspired meta-heuristic algorithm known as Particle Swarm Optimization (PSO). Specifically, we introduce a novel variant of PSO that improves upon basic PSO by enhancing the cognitive coefficients to optimize the relaxation parameters for OAOR. These key modifications to the standard PSO improve its ability to explore various solutions efficiently and help to find the optimal parameters more quickly for signal detection. It facilitates the OAOR with faster convergence towards the optimal solution by reducing the error rate, resulting in high detection accuracy and simultaneously decreasing computational complexity from O (K 3) to O (K 2) making it suitable for modern wireless communication systems. We conduct extensive simulations across various configurations of massive MIMO systems. The results indicate that our proposed method achieves better performance compared to existing techniques. This improvement is particularly evident in terms of both computational complexity and error rate. [ABSTRACT FROM AUTHOR]

In recent years, quadcopter-type unmanned aerial vehicles have been preferred in many engineering applications. Because of its nonlinear dynamic model that makes it hard to create optimal control, quadcopter control is one of the main focuses of control engineering and has been studied by many researchers. A quadcopter has six degrees of freedom movement capability and multi-input multi-output structure in its dynamic model. The full nonlinear model of the quadcopter is derived using the results of the experimental studies in the literature. In this study, the control of the quadcopter is realized using the symbolic limited optimal discrete controller synthesis (S-DCS) method. The attitude, altitude, and horizontal movement control of the quadcopter are carried out. To validate the success of the SDCS controller, the control of the quadcopter is realized with fractional order proportional-integral-derivative (FOPID) controllers. The parameters of the FOPID controllers are calculated using Fire Hawk Optimizer, Flying Fox Optimization Algorithm, and Puma Optimizer, which are recently developed meta-heuristic (MH) algorithms. The performance of the S-DCS controller is compared with the performance of the optimal FOPID controllers. In the path planning part of this study, the optimal path planning performances of the SDCS method and the MH algorithms are tested and compared. The optimal solution of the traveling salesman problem (TSP) for a single quadcopter and min-max TSP with multiple depots for multi quadcopters are obtained. The methods and the cases that optimize the dynamic behavior and the path planning of the quadcopter are investigated and determined. [ABSTRACT FROM AUTHOR]

This study presents a novel method, termed RBAVO-DE (Relief Binary African Vultures Optimization based on Differential Evolution), aimed at addressing the Gene Selection (GS) challenge in high-dimensional RNA-Seq data, specifically the rnaseqv2 lluminaHiSeq rnaseqv2 un edu Level 3 RSEM genes normalized dataset, which contains over 20,000 genes. RNA Sequencing (RNA-Seq) is a transformative approach that enables the comprehensive quantification and characterization of gene expressions, surpassing the capabilities of micro-array technologies by offering a more detailed view of RNA-Seq gene expression data. Quantitative gene expression analysis can be pivotal in identifying genes that differentiate normal from malignant tissues. However, managing these high-dimensional dense matrix data presents significant challenges. The RBAVO-DE algorithm is designed to meticulously select the most informative genes from a dataset comprising more than 20,000 genes and assess their relevance across twenty-two cancer datasets. To determine the effectiveness of the selected genes, this study employs the Support Vector Machine (SVM) and k-Nearest Neighbor (k-NN) classifiers. Compared to binary versions of widely recognized meta-heuristic algorithms, RBAVO-DE demonstrates superior performance. According to Wilcoxon's rank-sum test, with a 5% significance level, RBAVO-DE achieves up to 100% classification accuracy and reduces the feature size by up to 98% in most of the twenty-two cancer datasets examined. This advancement underscores the potential of RBAVO-DE to enhance the precision of gene selection for cancer research, thereby facilitating more accurate and efficient identification of key genetic markers. [ABSTRACT FROM AUTHOR]

Cloud computing is considered suitable for organizations thanks to its flexibility and the provision of digital services via the Internet. The cloud provides nearly limitless computing resources on demand without any upfront costs or long-term contracts, enabling organizations to meet their computing needs more economically. Furthermore, cloud computing provides higher security, scalability, and reliability levels than traditional computing solutions. The efficiency of the platform affects factors such as Quality of Service (QoS), congestion, lifetime, energy consumption, dependability, and scalability. Load balancing refers to managing traffic flow to spread it across several channels. Asymmetric network traffic results in increased traffic processing, more congestion on specific routes, and fewer packets delivered. The paper focuses on analyzing the use of the meta-optimization algorithm based on the principles of natural selection to solve the imbalance of loads in cloud systems. To sum up, it offers a detailed literature review on the essential meta-heuristic algorithms for load balancing in cloud computing. The study also assesses and analyses meta-heuristic algorithm performance in load balancing, as revealed by past studies, experiments, and case studies. Key performance indicators encompass response time, throughput, resource utilization, and scalability, and they are used to assess how these algorithms impact load balance efficiency. [ABSTRACT FROM AUTHOR]

Recently, Japan's discharge of wastewater from the Fukushima nuclear disaster into the ocean has attracted widespread attention. To effectively address the challenge of separating uranium, the focus is on finding a healthy and environmentally friendly way to adsorb uranium using biochar. In this paper, a BP neural network is combined with each of the four meta-heuristic algorithms, namely Particle Swarm Optimization (PSO), Differential Evolution (DE), Cheetah Optimization (CO) and Fick's Law Algorithm (FLA), to construct four prediction models for the uranium adsorption capacity in the treatment of radioactive wastewater with biochar: PSO-BP, DE-BP, CO-BP, FLA-BP. The coefficient of certainty (R2), error rate and CEC test set are used to judge the accuracy of the model based on the BP neural network. The results show that the Fick's Law Algorithm (FLA) has a better search ability and convergence speed than the other algorithms. The importance of the input parameters is quantitatively assessed and ranked using XGBoost in order to analyze which parameters have a greater impact on the predictions of the model, which indicates that the parameters with the greatest impact are the initial concentration of uranium (C0, mg/L) and the mass percentage of total carbon (C, %). To sum up, four prediction models can be applied to study the adsorption of uranium by biochar materials during actual experiments, and the advantage of Fick's Law Algorithm (FLA) is more obvious. The method of model prediction can significantly reduce the radiation risk caused by uranium to human health during the actual experiment and provide some reference for the efficient treatment of uranium wastewater by biochar. [ABSTRACT FROM AUTHOR]

The sparse recovery (SR) space-time adaptive processing (STAP) method has excellent clutter suppression performance under the condition of limited observation samples. However, when the cluttering is nonlinear in a spatial-Doppler profile, it will cause an off-grid effect and reduce the sparse recovery performance. A meshless search using a meta-heuristic algorithm (MH) can completely eliminate the off-grid effect in theory. Therefore, genetic algorithm (GA), differential evolution (DE), particle swarm optimization (PSO), and grey wolf optimization (GWO) methods are applied to SR-STAP for selecting exact clutter atoms in this paper. The simulation results show that MH-STAP can estimate the clutter subspace more accurately than the traditional algorithm; PSO-STAP and GWO-STAP showed better clutter suppression performance in four MH-STAP methods. To search for more accurate clutter atoms, PSO and GWO are combined to improve the method's capacity for global optimization. Meanwhile, the fitness function is improved by using prior knowledge of the clutter distribution. The simulation results show that the improved PSO-GWO-STAP algorithm provides excellent clutter suppression performance, which solves the off-grid problem better than does single MH-STAP. [ABSTRACT FROM AUTHOR]

The potential of four different neuro-fuzzy embedded meta-heuristic algorithms, particle swarm optimization, genetic algorithm, harmony search, and teaching–learning-based optimization algorithm, was investigated in this study in estimating the water quality of the Yamuna River in Delhi, India. A cross-validation approach was employed by splitting data into three equal parts, where the models were evaluated using each part. The main aim of this study was to find an accurate prediction model for estimating the water quality of the Yamuna River. It is worth noting that the hybrid neuro-fuzzy and LSSVM methods have not been previously compared for this issue. Monthly water quality parameters, total kjeldahl nitrogen, free ammonia, total coliform, water temperature, potential of hydrogen, and fecal coliform were considered as inputs to model chemical oxygen demand (COD). The performance of hybrid neuro-fuzzy models in predicting COD was compared with classical neuro-fuzzy and least square support vector machine (LSSVM) methods. The results showed higher accuracy in COD prediction when free ammonia, total kjeldahl nitrogen, and water temperature were used as inputs. Hybrid neuro-fuzzy models improved the root mean square error of the classical neuro-fuzzy model and LSSVM by 12% and 4%, respectively. The neuro-fuzzy models optimized with harmony search provided the best accuracy with the lowest root mean square error (13.659) and mean absolute error (11.272), while the particle swarm optimization and teaching–learning-based optimization showed the highest computational speed (21 and 24 min) compared to the other models. [ABSTRACT FROM AUTHOR]

This study performed a comparative analysis of five new meta-heuristic algorithms specifically adopted based on two general classifications; namely, nature-inspired, which includes artificial eco-system optimization (AEO), African vulture optimization algorithm (AVOA), gorilla troop optimization (GTO), and non-nature-inspired or based on mathematical and physics concepts, which includes gradient-based optimization (GBO) and Runge Kutta optimization (RUN) for optimal tuning of multi-machine power system stabilizers (PSSs). To achieve this aim, the algorithms were applied in the PSS design for a multi-machine smart power system. The PSS design was formulated as an optimization problem, and the eigenvalue-based objective function was adopted to improve the damping of electromechanical modes. The expressed objective function helped to determine the stabilizer parameters and enhanced the dynamic performance of the multi-machine power system. The performance of the algorithms in the PSS's design was evaluated using the Western System Coordinating Council (WSCC) multi-machine power test system. The results obtained were compared with each other. When compared to nature-inspired algorithms (AEO, AVOA, and GTO), non-nature-inspired algorithms (GBO and RUN) reduced low-frequency oscillations faster by improving the damping of electromechanical modes and providing a better convergence ratio and statistical performance. [ABSTRACT FROM AUTHOR]

The famous McCulloch–Pitts neuron model has been criticized for being overly simplistic in the long term. At the same time, the dendritic neuron model (DNM) has been shown to be effective in prediction problems, and it accounts for the nonlinear information-processing capacity of synapses and dendrites. Furthermore, since the classical error back-propagation (BP) algorithm typically experiences problems caused by the overabundance of saddle points and local minima traps, an efficient learning approach for DNMs remains desirable but difficult to implement. In addition to BP, the mainstream DNM-optimization methods include meta-heuristic algorithms (MHAs). However, over the decades, MHAs have developed a large number of different algorithms. How to screen suitable MHAs for optimizing DNMs has become a hot and challenging area of research. In this study, we classify MHAs into different clusters with different population interaction networks (PINs). The performance of DNMs optimized by different clusters of MHAs is tested in the financial time-series-forecasting task. According to the experimental results, the DNM optimized by MHAs with power-law-distributed PINs outperforms the DNM trained based on the BP algorithm. [ABSTRACT FROM AUTHOR]

Driven by new regulations concerning greenhouse gas (GHG) emissions in the transportation sector, battery-electric trucks (BETs) are considered one of the sustainable freight transportation solutions. In this paper, a dispatching problem of the BET fleet is formulated as a capacitated electric vehicle routing problem (VRP) with pick-up and delivery. As the BET dispatching problem is NP-hard, the performance of existing approaches deteriorates in large instance problems, especially when the customers have different preferences and constraints. This article proposes a bi-level strategy that incorporates routing zone partitioning and metaheuristic-based vehicle routing to solve the large-scale BET dispatching problem, considering the delivery types, limited travel distances, and cargo payloads. We apply this strategy to a real-world fleet dispatching scenario with around 300 customer positions for pickups and drop-offs. The experimental results demonstrate that the proposed bi-level strategy can reduce total travel distance and travel time by 24–31%, compared to the baseline strategy implemented in the real world. [ABSTRACT FROM AUTHOR]

A hybrid machine learning (ML) model is becoming a common trend in predicting reference evapotranspiration (ETo) research. This study aims to systematically review ML models that are integrated with meta-heuristic algorithms (i.e., parameter optimisation-based hybrid models, OBH) for predicting ETo data. Over five years, from 2018–2022, the articles published in three reliable databases, including Web of Science, ScienceDirect, and IEEE Xplore, were considered. According to the protocol search, 1485 papers were selected. After three filters were applied, the final set contained 33 papers related to the nominated topic. The final set of papers was categorised into five groups. The first group, swarm intelligence-based algorithms, had the highest proportion of papers, (23/33) and was superior to all other algorithms. The second group (evolution computation-based algorithms), third group (physics-based algorithms), fourth group (hybrid-based algorithms), and fifth group (reviews and surveys) had (4/33), (1/33), (2/33), and (3/33), respectively. However, researchers have not treated OBH models in much detail, and there is still room for improvement by investigating both newly single and hybrid meta-heuristic algorithms. Finally, this study hopes to assist researchers in understanding the options and gaps in this line of research. [ABSTRACT FROM AUTHOR]

Evolutionary Population Dynamics (EPD) refers to eliminating poor individuals in nature, which is the opposite of survival of the fittest. Although this method can improve the median of the whole population of the meta-heuristic algorithms, it suffers from poor exploration capability to handle high-dimensional problems. This paper proposes a novel EPD operator to improve the search process. In other words, as the primary EPD mainly improves the fitness of the worst individuals in the population, and hence we name it the Fitness-Based EPD (FB-EPD), our proposed EPD mainly improves the diversity of the best individuals, and hence we name it the Diversity-Based EPD (DB-EPD). The proposed method is applied to the Grey Wolf Optimizer (GWO) and named DB-GWO-EPD. In this algorithm, the three most diversified individuals are first identified at each iteration, and then half of the best-fitted individuals are forced to be eliminated and repositioned around these diversified agents with equal probability. This process can free the merged best individuals located in a closed populated region and transfer them to the diversified and, thus, less-densely populated regions in the search space. This approach is frequently employed to make the search agents explore the whole search space. The proposed DB-GWO-EPD is tested on 13 high-dimensional and shifted classical benchmark functions as well as 29 test problems included in the CEC2017 test suite, and four constrained engineering problems. The results obtained by the proposal upon implemented on the classical test problems are compared to GWO, FB-GWO-EPD, and four other popular and newly proposed optimization algorithms, including Aquila Optimizer (AO), Flow Direction Algorithm (FDA), Arithmetic Optimization Algorithm (AOA), and Gradient-based Optimizer (GBO). The experiments demonstrate the significant superiority of the proposed algorithm when applied to a majority of the test functions, recommending the application of the proposed EPD operator to any other meta-heuristic whenever decided to ameliorate their performance. [ABSTRACT FROM AUTHOR]

This paper addresses an integrated scheduling problem of batch manufacturing and delivery processes with a single batch machine and direct-shipping trucks. In the manufacturing process, some jobs in the same family are simultaneously processed as a production batch in a single machine. The batch production time depends only on the family type assigned to the production batch and it is dynamically adjusted by batch deterioration and rate-modifying activities. Each job after the batch manufacturing is reassigned to delivery batches. In the delivery process, each delivery batch is directly shipped to the corresponding customer. The delivery time of delivery batches is determined by the distance between the manufacturing site and customer location. The total volume of jobs in each production or delivery batch must not exceed the machine or truck capacity. The objective function is to minimize the total tardiness of jobs delivered to customers with different due dates. To solve the problem, a mixed-integer linear programming model to find the optimal solution for small problem instances is formulated and meta-heuristic algorithms to find effective solutions for large problem instances are presented. Sensitivity analyses are conducted to find the effect of problem parameters on the manufacturing and delivery time. [ABSTRACT FROM AUTHOR]

Support vector regression (SVR) and the adaptive neuro-fuzzy inference system (ANFIS) are two well-known and powerful artificial intelligence techniques which have been frequently used for hazard mapping. So far, a plethora of hybrid models have been developed using a combination of either the SVR or ANFIS and evolutionary algorithms, but there are only a handful of studies that compare the performance of these models when integrated with evolutionary algorithms, especially in forest fire susceptibility mapping (FFSM). The aim of this study was to compare performance of ANFIS-, and SVR-based evolutionary algorithms, namely, the genetic algorithm (GA) and the shuffled frog-leaping algorithm (SFLA) in FFSM in Ajloun Governorate in Jordan. Accordingly, four hybrid models, SVR-GA, SVR-SFLA, ANFIS-GA, and ANFIS-SFLA, were developed and compared. One hundred and one forest fire locations were used in this study to assess and model susceptibility of forests to fires. The forest fire inventory data were divided into a training data subset (70%) and a testing data subset (30%). Fourteen factors affecting incidence of forest fires were employed as conditioning factors. The area under the receiver operating characteristic (AUROC) curve was used to assess performance of the models in the validation phase. The results revealed that the SVR-based hybrid algorithms had better AUROC values than the ANFIS-based algorithms. Of the four integrated models, the SVR-GA model proved to be the model with the highest accuracy and best performance. It had AUROC values of 0.97 and 0.89 in the training and the testing phases, respectively. [ABSTRACT FROM AUTHOR]

There are many machine learning approaches available and commonly used today, however, the extreme learning machine is appraised as one of the fastest and, additionally, relatively efficient models. Its main benefit is that it is very fast, which makes it suitable for integration within products that require models taking rapid decisions. Nevertheless, despite their large potential, they have not yet been exploited enough, according to the recent literature. Extreme learning machines still face several challenges that need to be addressed. The most significant downside is that the performance of the model heavily depends on the allocated weights and biases within the hidden layer. Finding its appropriate values for practical tasks represents an NP-hard continuous optimization challenge. Research proposed in this study focuses on determining optimal or near optimal weights and biases in the hidden layer for specific tasks. To address this task, a multi-swarm hybrid optimization approach has been proposed, based on three swarm intelligence meta-heuristics, namely the artificial bee colony, the firefly algorithm and the sine–cosine algorithm. The proposed method has been thoroughly validated on seven well-known classification benchmark datasets, and obtained results are compared to other already existing similar cutting-edge approaches from the recent literature. The simulation results point out that the suggested multi-swarm technique is capable to obtain better generalization performance than the rest of the approaches included in the comparative analysis in terms of accuracy, precision, recall, and f1-score indicators. Moreover, to prove that combining two algorithms is not as effective as joining three approaches, additional hybrids generated by pairing, each, two methods employed in the proposed multi-swarm approach, were also implemented and validated against four challenging datasets. The findings from these experiments also prove superior performance of the proposed multi-swarm algorithm. Sample code from devised ELM tuning framework is available on the GitHub. [ABSTRACT FROM AUTHOR]

Traumatic Brain Injury (TBI) is a devastating and life-threatening medical condition that can result in long-term physical and mental disabilities and even death. Early and accurate detection of Intracranial Hemorrhage (ICH) in TBI is crucial for analysis and treatment, as the condition can deteriorate significantly with time. Hence, a rapid, reliable, and cost-effective computer-aided approach that can initially capture the hematoma features is highly relevant for real-time clinical diagnostics. In this study, the Gray Level Occurrence Matrix (GLCM), the Gray Level Run Length Matrix (GLRLM), and Hu moments are used to generate the texture features. The best set of discriminating features are obtained using various meta-heuristic algorithms, and these optimal features are subjected to different classifiers. The synthetic samples are generated using ADASYN to compensate for the data imbalance. The proposed CAD system attained 95.74% accuracy, 96.93% sensitivity, and 94.67% specificity using statistical and GLRLM features along with KNN classifier. Thus, the developed automated system can enhance the accuracy of hematoma detection, aid clinicians in the fast interpretation of CT images, and streamline triage workflow. [ABSTRACT FROM AUTHOR]

Integration of distributed generators (DGs) into a distribution network (DN) can cause coordination challenges of overcurrent relays (OCRs) because of different fault-current contributions of DGs as well as the directional change in fault currents. Therefore, the OCRs should be properly coordinated to maintain their adaptability and scalability to protect the DG-integrated distribution network. In this study, an adaptive and scalable protection coordination (ASPC) approach has been developed for the OCRs in a DG-contained distribution network based on two implementation stages. At the first stage, the reliability improvement of fault-current calculation results is performed by determining the min-max confidence interval of fault current for each different fault type, which is the basis for properly selecting tripping and pick-up thresholds of definite-time and inverse-time OC functions in the same OCR. At the second stage, optimization algorithms are used for calculating protection-curve coefficients and Time-Dial Setting (TDS) multiplier for the inverse-time OC functions in the OCR. A real 22 kV DG-integrated distribution network which is simulated by ETAP software is considered a reliable test-bed to validate the proposed ASPC system of OCRs in the multiple-DG-contained distribution network. In addition, the coordination results of OCRs can be obtained by three common optimization algorithms, Particle Swarm Optimization (PSO), Gravitational Search Algorithm (GSA), and Genetic Algorithm (GA). These relay coordination results have shown an effective protection combination of the definite-time OC functions (50P and 50G) and the inverse-time OC functions (51P and 51G) in the same OCR to get the adaptable and scalable DN protection system. [ABSTRACT FROM AUTHOR]

Predicting student academic performance with a high accuracy facilitates admission decisions and enhances educational services at educational institutions. This raises the need to propose a model that predicts student performance, based on the results of standardized exams, including university entrance exams, high school graduation exams, and other influential factors. In this study, an approach to the problem based on the artificial neural network (ANN) with the two meta-heuristic algorithms inspired by cuckoo birds and their lifestyle, namely, Cuckoo Search (CS) and Cuckoo Optimization Algorithm (COA) is proposed. In particular, we used previous exam results and other factors, such as the location of the student's high school and the student's gender as input variables, and predicted the student academic performance. The standard CS and standard COA were separately utilized to train the feed-forward network for prediction. The algorithms optimized the weights between layers and biases of the neuron network. The simulation results were then discussed and analyzed to investigate the prediction ability of the neural network trained by these two algorithms. The findings demonstrated that both CS and COA have potential in training ANN and ANN-COA obtained slightly better results for predicting student academic performance in this case. It is expected that this work may be used to support student admission procedures and strengthen the service system in educational institutions. [ABSTRACT FROM AUTHOR]

The use of renewable and sustainable energy sources (RSESs) has become urgent to counter the growing electricity demand and reduce carbon dioxide emissions. However, the current studies are still lacking to introduce a planning model that measures to what extent the networks can host RSESs in the planning phase. In this paper, a stochastic power system planning model is proposed to increase the hosting capacity (HC) of networks and satisfy future load demands. In this regard, the model is formulated to consider a larger number and size of generation and transmission expansion projects installed than the investment costs, without violating operating and reliability constraints. A load forecasting technique, built on an adaptive neural fuzzy system, was employed and incorporated with the planning model to predict the annual load growth. The problem was revealed as a non-linear large-scale optimization problem, and a hybrid of two meta-heuristic algorithms, namely, the weighted mean of vectors optimization technique and sine cosine algorithm, was investigated to solve it. A benchmark system and a realistic network were used to verify the proposed strategy. The results demonstrated the effectiveness of the proposed model to enhance the HC. Besides this, the results proved the efficiency of the hybrid optimizer for solving the problem. [ABSTRACT FROM AUTHOR]

This paper proposes a novel variant of the Grey Wolf Optimization (GWO) algorithm, named Velocity-Aided Grey Wolf Optimizer (VAGWO). The original GWO lacks a velocity term in its position-updating procedure, and this is the main factor weakening the exploration capability of this algorithm. In VAGWO, this term is carefully set and incorporated into the updating formula of the GWO. Furthermore, both the exploration and exploitation capabilities of the GWO are enhanced in VAGWO via stressing the enlargement of steps that each leading wolf takes towards the others in the early iterations while stressing the reduction in these steps when approaching the later iterations. The VAGWO is compared with a set of popular and newly proposed meta-heuristic optimization algorithms through its implementation on a set of 13 high-dimensional shifted standard benchmark functions as well as 10 complex composition functions derived from the CEC2017 test suite and three engineering problems. The complexity of the proposed algorithm is also evaluated against the original GWO. The results indicate that the VAGWO is a computationally efficient algorithm, generating highly accurate results when employed to optimize high-dimensional and complex problems. [ABSTRACT FROM AUTHOR]

Optimal power flow (OPF), a mathematical programming problem extending power flow relationships, is one of the essential tools in the operation and control of power grids. To name but a few, the primary goals of OPF are to meet system demand at minimum production cost, minimum emission, and minimum voltage deviation. Being at the heart of power system problems for half a century, the OPF can be split into two significant categories, namely optimal active power flow (OAPF) and optimal reactive power flow (ORPF). The OPF is spontaneously a complicated non-linear and non-convex problem; however, it becomes more complex by considering different constraints and restrictions having to do with real power grids. Furthermore, power system operators in the modern-day power networks implement new limitations to the problem. Consequently, the OPF problem becomes more and more complex which can exacerbate the situation from mathematical and computational standpoints. Thus, it is crucially important to decipher the most appropriate methods to solve different types of OPF problems. Although a copious number of mathematical-based methods have been employed to handle the problem over the years, there exist some counterpoints, which prevent them from being a universal solver for different versions of the OPF problem. To address such issues, innovative alternatives, namely heuristic algorithms, have been introduced by many researchers. Inasmuch as these state-of-the-art algorithms show a significant degree of convenience in dealing with a variety of optimization problems irrespective of their complexities, they have been under the spotlight for more than a decade. This paper provides an extensive review of the latest applications of heuristic-based optimization algorithms so as to solve different versions of the OPF problem. In addition, a comprehensive review of the available methods from various dimensions is presented. Reviewing about 200 works is the most significant characteristic of this paper that adds significant value to its exhaustiveness. [ABSTRACT FROM AUTHOR]

Fires are one of the most destructive forces in natural ecosystems. This study aims to develop and compare four hybrid models using two well-known machine learning models, support vector regression (SVR) and the adaptive neuro-fuzzy inference system (ANFIS), as well as two meta-heuristic models, the whale optimization algorithm (WOA) and simulated annealing (SA) to map wildland fires in Jerash Province, Jordan. For modeling, 109 fire locations were used along with 14 relevant factors, including elevation, slope, aspect, land use, normalized difference vegetation index (NDVI), rainfall, temperature, wind speed, solar radiation, soil texture, topographic wetness index (TWI), distance to drainage, and population density, as the variables affecting the fire occurrence. The area under the receiver operating characteristic (AUROC) was used to evaluate the accuracy of the models. The findings indicated that SVR-based hybrid models yielded a higher AUROC value (0.965 and 0.949) than the ANFIS-based hybrid models (0.904 and 0.894, respectively). Wildland fire susceptibility maps can play a major role in shaping firefighting tactics. [ABSTRACT FROM AUTHOR]

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. [ABSTRACT FROM AUTHOR]

The quality of machine learning models can suffer when inappropriate data is used, which is especially prevalent in high-dimensional and imbalanced data sets. Data preparation and preprocessing can mitigate some problems and can thus result in better models. The use of meta-heuristic and nature-inspired methods for data preprocessing has become common, but these approaches are still not readily available to practitioners with a simple and extendable application programming interface (API). In this paper the EvoPreprocess open-source Python framework, that preprocesses data with the use of evolutionary and nature-inspired optimization algorithms, is presented. The main problems addressed by the framework are data sampling (simultaneous over- and under-sampling data instances), feature selection and data weighting for supervised machine learning problems. EvoPreprocess framework provides a simple object-oriented and parallelized API of the preprocessing tasks and can be used with scikit-learn and imbalanced-learn Python machine learning libraries. The framework uses self-adaptive well-known nature-inspired meta-heuristic algorithms and can easily be extended with custom optimization and evaluation strategies. The paper presents the architecture of the framework, its use, experiment results and comparison to other common preprocessing approaches. [ABSTRACT FROM AUTHOR]

Evacuation planning is an important activity in disaster management to reduce the effects of disasters on urban communities. It is regarded as a multi-objective optimization problem that involves conflicting spatial objectives and constraints in a decision-making process. Such problems are difficult to solve by traditional methods. However, metaheuristics methods have been shown to be proper solutions. Well-known classical metaheuristic algorithms—such as simulated annealing (SA), artificial bee colony (ABC), standard particle swarm optimization (SPSO), genetic algorithm (GA), and multi-objective versions of them—have been used in the spatial optimization domain. However, few types of research have applied these classical methods, and their performance has not always been well evaluated, specifically not on evacuation planning problems. This research applies the multi-objective versions of four classical metaheuristic algorithms (AMOSA, MOABC, NSGA-II, and MSPSO) on an urban evacuation problem in Rwanda in order to compare the performances of the four algorithms. The performances of the algorithms have been evaluated based on the effectiveness, efficiency, repeatability, and computational time of each algorithm. The results showed that in terms of effectiveness, AMOSA and MOABC achieve good quality solutions that satisfy the objective functions. NSGA-II and MSPSO showed third and fourth-best effectiveness. For efficiency, NSGA-II is the fastest algorithm in terms of execution time and convergence speed followed by AMOSA, MOABC, and MSPSO. AMOSA, MOABC, and MSPSO showed a high level of repeatability compared to NSGA-II. It seems that by modifying MOABC and increasing its effectiveness, it could be a proper algorithm for evacuation planning. [ABSTRACT FROM AUTHOR]

This paper presents a hybrid method of Simulated Annealing (SA) algorithm and Sine Cosine Algorithm (SCA) to solve unrelated parallel machine scheduling problems (UPMSPs) with sequence-dependent and machine-dependent setup times. The proposed method, called SASCA, aims to improve the SA algorithm using the SCA as a local search method. The SCA provides a good tool for the SA to avoid getting stuck in a focal point and improving the convergence to an efficient solution. SASCA algorithm is used to solve UPMSPs by minimizing makespan. To evaluate the performance of SASCA, a set of experiments were performed using 30 tests for 4 problems. Moreover, the performance of the proposed method was compared with other meta-heuristic algorithms. The comparison results showed the superiority of SASCA over other methods in terms of performance dimensions. [ABSTRACT FROM AUTHOR]

It can be predicted that the infrastructure of the existing wireless networks will not fill the requirement of the fifth generation (5G) wireless network due to the high data rates and a large number of expected traffic. Thus, a novel deployment method is crucial to satisfy 5G features. Meta-heuristic is expected to be a promising method for the complex deployment optimization problem of the 5G network. This work presents an implementation of a meta-heuristic algorithm based on swarm intelligence, to minimize the number of base stations (BSs) and optimize their placements in millimeter wave (mmWave) frequencies (e.g., 28 GHz and 38 GHz) in the context of the 5G network while satisfying user data rates requirement. Then, an iterative method is applied to remove redundant BSs. We formulate an optimization problem that takes into account multiple 5G network deployment scenarios. Further, a comparative study is conducted with the well-known simulated annealing (SA) using Monte Carlo simulations to assess the performance of the developed model. In our simulation results, we divide the region of interest into two subareas with different user distributions for different network scenarios while considering the intercell interference. The results demonstrate that the proposed approach has better network coverage with low percentage users in outage. In addition, the developed approach has less computational times to reach the desired target network quality of service (QoS). [ABSTRACT FROM AUTHOR]

Multiphase machines are complex multi-variable electro-mechanical systems that are receiving special attention from industry due to their better fault tolerance and power-per-phase splitting characteristics compared with conventional three-phase machines. Their utility and interest are restricted to the definition of high-performance controllers, which strongly depends on the knowledge of the electrical parameters used in the multiphase machine model. This work presents the proof-of-concept of a new method based on particle swarm optimization and standstill time-domain tests. This proposed method is tested to estimate the electrical parameters of a five-phase induction machine. A reduction of the estimation error higher than 2.5% is obtained compared with gradient-based approaches. [ABSTRACT FROM AUTHOR]