Search

The case studies are introduced in this study, highlighting freight transportation via road and road rail between satellite cities in Pakistan's Punjab and Sindh provinces. The case study analysis contributes to developing environmentally friendly and cost-effective transportation solutions and reducing nitrous oxide (N2O) and carbon dioxide (CO2) emissions associated with road and intermodal freight transit. We developed a mixed-integer linear programming (MILP) model to formulate the bi-objective problem, including real-life constraints, emissions at starting nodes, ending notes, and between the arc. In the mathematical model, the cost and emissions functions are developed to minimize the primary and secondary objective functions in the road and intermodal transportation. Furthermore, five distinct sets (locations, starting stations, ending stations, transport orders, and transport service) with parameters relating to container movement between the starting and ending nodes are a necessary part of the MILP formulation. The multiobjective optimization problem is solved by metaheuristic techniques such as the multiobjective genetic algorithm as the goal of applying a metaheuristic algorithm is to find the search space to search the near to optimized solutions. The Pareto front solutions are provided for balancing the costs and emissions of transporting supplies from Punjab to Sindh using the MATLAB solver toolbox. We gathered data from one of Pakistan's most well-known logistics service providers in the paper industry. According to the findings, intermodal transportation is 72% more cost-effective than road transportation. Additionally, by substituting intermodal transportation for road transportation, N2O, and CO2 emissions can be reduced by 74% and 57%, respectively. [ABSTRACT FROM AUTHOR]

Experimental results on five public gene expression profile datasets verify that the proposed algorithm outperforms other methods in terms of diversity, distribution stability, and quality of generated samples. The fifth paper by I Tingyu Ye i et al. on "Artificial bee colony algorithm with an adaptive search manner and dimension perturbation" proposes a modified artificial bee colony (ABC) algorithm with an adaptive search manner and dimension perturbation (ASDABC). The tenth paper by I Fei Han i et al. on "Gene-CWGAN: A Data Enhancement Method for Gene Expression Profile Based on Improved CWGAN-GP" tackles the problem of high dimension and small sample size of gene expression profile data classification. [Extracted from the article]

As the number and cleverness of cyber-attacks keep increasing rapidly, it's more important than ever to have good ways to detect and prevent them. Recognizing cyber threats quickly and accurately is crucial because they can cause severe damage to individuals and businesses. This paper takes a close look at how we can use artificial intelligence (AI), including machine learning (ML) and deep learning (DL), alongside metaheuristic algorithms to detect cyber-attacks better. We've thoroughly examined over sixty recent studies to measure how effective these AI tools are at identifying and fighting a wide range of cyber threats. Our research includes a diverse array of cyberattacks such as malware attacks, network intrusions, spam, and others, showing that ML and DL methods, together with metaheuristic algorithms, significantly improve how well we can find and respond to cyber threats. We compare these AI methods to find out what they're good at and where they could improve, especially as we face new and changing cyber-attacks. This paper presents a straightforward framework for assessing AI Methods in cyber threat detection. Given the increasing complexity of cyber threats, enhancing AI methods and regularly ensuring strong protection is critical. We evaluate the effectiveness and the limitations of current ML and DL proposed models, in addition to the metaheuristic algorithms. Recognizing these limitations is vital for guiding future enhancements. We're pushing for smart and flexible solutions that can adapt to new challenges. The findings from our research suggest that the future of protecting against cyber-attacks will rely on continuously updating AI methods to stay ahead of hackers' latest tricks. [ABSTRACT FROM AUTHOR]

In the paper, I Traffic flow guidance algorithm in intelligent transportation systems considering the effect of non i - I floating vehicle i , Chen et al. ([4]) present the method of estimating non-floating vehicles' driving information according to floating vehicles' information. The authors presented the estimation method, a new traffic flow guidance algorithm, Estimated Weighted Vehicle Density Feedback Strategy (EWVDFS) based on Weighted Vehicle Density Feedback Strategy (WVDFS). In the paper, A I robust lane detection method based on hyperbolic model i , Li et al. ([9]) investigated a robust lane detection method under structured roads. The paper I Road network i - I based region of interest mining and social relationship recommendation i by Tan and Zhang ([17]) proposed road context-based active region extraction algorithm (RAREA) which explores the method to extract the specific regions within the road network. [Extracted from the article]

The aim of this special issue is to introduce the burgeoning topic of Autonomous System. Finally, in order to check the conformity of this enforcement with defined multi-cloud SLA, the authors propose an approach for multi-cloud SLA reporting inspired by conformance checking techniques. I In i I the i I paper i I authored i I by i I Jeremy i I Mechouche i , the authors propose a hierarchical representation of multi-cloud SLAs: sub-SLAs associated with a system's components deployed on distinct cloud service providers and global-SLA associated with the whole system. [Extracted from the article]

In recent years, due to the rapid growth of the world's population, the demand for agricultural products and food is growing increasingly. Therefore, the agricultural supply chain optimization has been grabbed by researchers to reduce food security concerns. On the other hand, the production amount of farmers is affected by various factors, including environmental conditions. In this paper, a supply chain network is investigated by developing a Mixed-Integer Linear Programming (MILP) model to effectively improve economic objectives under uncertainty. Then, a scenario-based robust optimization approach is employed to deal with the uncertainty. One of the novelities of our paper is considering weather conditions and economic fluctuations in different scenarios. The effectiveness of the proposed mathematical model has been confirmed by a real case study of dates farms. Dates and its by-products have a significant role in GDP, job creation, export, and the creation of various packaging and processing. Moreover, three meta-heuristic algorithms including Whale Optimization Algorithm (WOA), Particle Swarm Optimization (PSO), and a hybrid algorithm based on them (WOA–PSO) are adapted to deal with the NP-hardness of the problems. Moreover, the parameters of the proposed algorithms are improved by the Taguchi method, and to achieve more exact measurements, sensitivity analysis is performed. Finally, the numerical results confirmed that the accuracy of the hybrid algorithm was between 1.9 and 2.8%. Therefore, this approach could be practical and efficient for solving large-sized problems. The obtained outcomes demonstrated that the planned model provides tactical considerations for the related managers. [ABSTRACT FROM AUTHOR]

Data clustering has attracted the interest of scholars in many fields. In recent years, using heuristic algorithms to solve data clustering problems has gradually become a tendency. The black hole algorithm (BHA) is one of the popular heuristic algorithms among researchers because of its simplicity and effectiveness. In this paper, an improved self-adaptive logarithmic spiral path black hole algorithm (SLBHA) is proposed. SLBHA innovatively introduces a logarithmic spiral path and random vector path to BHA. At the same time, a parameter is used to control the randomness, which enhances the local exploitation ability of the algorithm. Besides, SLBHA designs a replacement mechanism to improve the global exploration ability. Finally, a self-adaptive parameter is introduced to control the replacement mechanism and maintain the balance between exploration and exploitation of the algorithm. To verify the effectiveness of the proposed algorithm, comparison experiments are conducted on 13 datasets creatively using the evaluation criteria including the Jaccard coefficient as well as the Folkes and Mallows index. The proposed methods are compared with the selected algorithms such as the whale optimization algorithm (WOA), compound intensified exploration firefly algorithm (CIEFA), improved black hole algorithm (IBH), etc. The experimental results demonstrate that the proposed algorithm outperforms the compared algorithms on both external criteria and quantization error of the clustering problem. [ABSTRACT FROM AUTHOR]

The energy management (EM) solution of the multi-microgrids (MMGs) is a crucial task to provide more flexibility, reliability, and economic benefits. However, the energy management (EM) of the MMGs became a complex and strenuous task with high penetration of renewable energy resources due to the stochastic nature of these resources along with the load fluctuations. In this regard, this paper aims to solve the EM problem of the MMGs with the optimal inclusion of photovoltaic (PV) systems, wind turbines (WTs), and biomass systems. In this regard, this paper proposed an enhanced Jellyfish Search Optimizer (EJSO) for solving the EM of MMGs for the 85-bus MMGS system to minimize the total cost, and the system performance improvement concurrently. The proposed algorithm is based on the Weibull Flight Motion (WFM) and the Fitness Distance Balance (FDB) mechanisms to tackle the stagnation problem of the conventional JSO technique. The performance of the EJSO is tested on standard and CEC 2019 benchmark functions and the obtained results are compared to optimization techniques. As per the obtained results, EJSO is a powerful method for solving the EM compared to other optimization method like Sand Cat Swarm Optimization (SCSO), Dandelion Optimizer (DO), Grey Wolf Optimizer (GWO), Whale Optimization Algorithm (WOA), and the standard Jellyfish Search Optimizer (JSO). The obtained results reveal that the EM solution by the suggested EJSO can reduce the cost by 44.75% while the system voltage profile and stability are enhanced by 40.8% and 10.56%, respectively. [ABSTRACT FROM AUTHOR]

As a field that focuses on optimizing resource utilization to improve operational efficiency and effectiveness, operations management (OM) has attracted increasing attention from researchers in the past decades. Experimental results on real food delivery application data demonstrated the superiority of the proposed algorithm compared to a set of popular metaheuristic optimization algorithms. The numerical results showed that the developed algorithm outperforms the particle swarm optimization algorithm and genetic algorithm, and is suitable for processing similar non-concave and non-smooth complex models. [Extracted from the article]

Inspired by cloud computing, cloud manufacturing (CMfg) is a service-oriented manufacturing paradigm on an on-demand and pay-as-you-go business model through the internet. More specifically, new challenges for production planning and decision-making process have emerged in that resource scheduling and have gained the most attention, and there is an urgent need to determine the current status and identify issues and matters to be addressed in the future. This review paper is aiming to discuss aspects of the cloud-based resource scheduling problem through investigating the literature to date to identify the existing gaps and recommending the potential paths moving forward for researchers in this field. So far, literature reviews focused on a broad scope of cloud-based scheduling, as a new approach taking a "narrow scope" by focusing on resource scheduling and various steps of it in the cloud environment are considered. Using the data gathered from the popular databases, a comprehensive statistical analysis on the existing literatures is provided, and the rational sequences of the systematic literature review (SLR) are elaborated. The mathematical models in resource scheduling are thoroughly elucidated. Then, a comprehensive analysis of the main aspects of resource scheduling including the objective functions, constraints, and optimization algorithms is presented. Discussion of the findings of the review paper illustrates that time and cost gain more attention (almost 80%) among all objective functions, and the metaheuristic algorithms are the most widely used in the recent research papers. Finally, suggestions for potential future research to further consolidate this field have been enumerated. [ABSTRACT FROM AUTHOR]

Mobile object detection and tracking is an important application of wireless sensor network. However, longevity of such application is a challenge as sensor nodes in wireless sensor network operates on battery power. Therefore, there is the requirement for increasing the lifetime of this application by optimal usage of energy while tracking. Of course, while optimizing the energy usage, tracking accuracy should not be compromised. A number of research works are carried out in the past to enhance the wireless sensor network lifetime but no work resolved the problem completely. This paper studies the issue of data routing to sink in energy constrained wireless sensor network based application where tracking information collected from different sensor nodes are processed to determine the object's presence in the monitoring area. This paper proposes an energy efficient hybrid artificial bee colony-modified Dijkstra (HABC-MD) algorithm for cluster based network for optimum usage of energy during routing of packet. The objective of this algorithm is to save the energy of the network by optimizing the number of node-to-node transmission while tracking. It uses metaheuristic approach based artificial bee colony algorithm for selection of cluster head in each round and heuristic approach-based Dijkstra algorithm for selection of optimum route between source node and sink for packet transmission. Modified Dijkstra algorithm considers both distance between source and destination and energy of the source node for determination of optimum route to sink. The performance of HABC-MD is compared with existing hybrid LEACH-Dijkstra algorithm and is found that performance of our algorithm is better in comparison to later algorithm. [ABSTRACT FROM AUTHOR]

The emergence of microgrids arises from the growing integration of Renewable Energy Resources (RES) and Energy Storage Systems (ESSs) into Distribution Networks (DNs). Effective integration, coordination, and control of Multiple Microgrids (MMGs) whereas navigating the complexities of energy transition within this context poses a significant challenge. The dynamic operation of MMGs is a challenge faced by the traditional distributed hierarchical control techniques. The application of Artificial Intelligence (AI) techniques is a promising way to improve the control and dynamic operation of MMGs in future smart DNs. In this paper, an innovative hybrid optimization technique that originates from Cheetah Optimization (CHO) and Particle Swarm Optimization (PSO) techniques is proposed, known as HYCHOPSO. Extensive benchmark testing validates HYCHOPSO's superiority over CHO and PSO in terms of convergence performance. The objective for this hybridization stems from the complementary strengths of CHO and PSO. CHO demonstrates rapid convergence in local search spaces, while PSO excels in global exploration. By combining these techniques, the aim is to leverage their respective advantages and enhance the algorithm's overall performance in addressing complex optimization problems. The contribution of this paper offering a unique approach to addressing optimization challenges in microgrid systems. Through a comprehensive comparative study, HYCHOPSO is evaluated against various metaheuristic optimization approaches, demonstrating superior performance, particularly in optimizing the design parameters of Proportional-Integral (PI) controllers for hierarchical control systems within microgrids. This contribution expands the repertoire of available optimization methodologies and offers practical solutions to critical challenges in microgrid optimization, enhancing the efficiency, reliability, and sustainability of microgrid operations. HYCHOPSO achieves its optimal score within fewer than 50 iterations, unlike CHO, GWO, PSO, Hybrid-GWO-PSO, and SSIA-PSO, which stabilize after around 200 iterations. Across various benchmark functions, HYCHOPSO consistently demonstrates the lowest mean values, attains scores closer to the optimal values of the benchmark functions, underscoring its robust convergence capabilities.the proposed HYCHOPSO algorithm, paired with a PI controller for distributed hierarchical control, minimizes errors and enhances system reliability during dynamic MMG operations. Using HYCHOPSO framework, an accurate power sharing, voltage/frequency stability, seamless grid-to-island transition, and smooth resynchronization are achieved. This enhances the real application's reliability, flexibility, scalability and robustness. [ABSTRACT FROM AUTHOR]

Harris Hawks Optimization (HHO) is a novel meta-heuristic optimization algorithm. The algorithm is inspired by the behavior of Harris Hawks collaborating with each other to pursue prey in nature. The algorithm has the advantages of simple structure, fewer parameters, easy implementation, and excellent performance on high-dimensional problems. However, the algorithm also suffers from the inability to strike a good balance between exploration and exploitation, low convergence accuracy, and slow convergence speed in the early stage. In response to these defects, this paper will introduce three strategies to the HHO: a non-negative stochastic shrinkage exponential energy function, a Cauchy-Gaussian-based dynamic variance reduction selection strategy, and a greedy-difference-based selection strategy. The improved algorithm TSHHO is analyzed on the well-established 28 benchmark test functions, and four industrial engineering design problems. The experimental results show that the TSHHO algorithm proposed in this paper can achieve a better balance in the exploration and development stages,the strategies significantly improve the search efficiency, convergence accuracy, and robustness of the algorithm. [ABSTRACT FROM AUTHOR]

Nowadays time series clustering is of great importance in manufacturing industries. Meanwhile, it is considerably challenging to achieve explainable solution as well as significant performance due to computation complexity and variable diversity. To efficaciously handle the difficulty, this paper presents a novel metaheuristic-based time series clustering method which can improve the effectiveness and logicality of existing clustering approaches. The proposed method collects candidate cluster references from hierarchical and partitional clustering through shape-based distance measure as well as dynamic time warping (DTW) on manufacturing time series data. By applying metaheuristics highlighting estimation of distribution algorithms (EDA), such as extended compact genetic algorithm (ECGA), on the collected candidate clusters, advanced cluster centroid combinations with minimal distances can be achieved. ECGA employs the least complicated and the most closely related probabilistic model structure regarding population space during generation cycle. This feature strengthens the comprehension of clustering results in how such optimal solutions were achieved. The proposed method was tested on real-world time series data, open to the public, from manufacturing industry, and showed noticeable performances compared to well-established methods. Accordingly, this paper demonstrates that obtaining both comprehensible result as well as prominent performance is feasible by employing metaheuristic techniques to time series data clustering methods. [ABSTRACT FROM AUTHOR]

The purpose of this paper is to develop and test three meta-heuristic algorithms to solve large size multi-objective supply chain network design problems. The algorithms are based on tabu search, genetic algorithm, and simulated annealing to find near-optimal global solutions. The three algorithms are designed, coded, and tested, and their parameters are fine tuned. The exact ε-constraint algorithm embedded in the General Algebraic Modeling System is used to validate the results of the three algorithms. The algorithms are compared using a typical multi-objective supply chain model utilizing several performance measures. The measures include the mean ideal distance, diversification metric, and percent of domination, inverted generational distance, and computation time. The results show that the tabu search algorithm outperformed the other two algorithms in terms of the percent of domination and computation time. On the other hand, the simulated annealing solutions are the best in terms of their diversity. The work in this paper is expected to help managers to solve large-scale supply chain problems that arise in oil and gas, petrochemical, and food supply chains. [ABSTRACT FROM AUTHOR]

The learning process and hyper-parameter optimization of artificial neural networks (ANNs) and deep learning (DL) architectures is considered one of the most challenging machine learning problems. Several past studies have used gradient-based back propagation methods to train DL architectures. However, gradient-based methods have major drawbacks such as stucking at local minimums in multi-objective cost functions, expensive execution time due to calculating gradient information with thousands of iterations and needing the cost functions to be continuous. Since training the ANNs and DLs is an NP-hard optimization problem, their structure and parameters optimization using the meta-heuristic (MH) algorithms has been considerably raised. MH algorithms can accurately formulate the optimal estimation of DL components (such as hyper-parameter, weights, number of layers, number of neurons, learning rate, etc.). This paper provides a comprehensive review of the optimization of ANNs and DLs using MH algorithms. In this paper, we have reviewed the latest developments in the use of MH algorithms in the DL and ANN methods, presented their disadvantages and advantages, and pointed out some research directions to fill the gaps between MHs and DL methods. Moreover, it has been explained that the evolutionary hybrid architecture still has limited applicability in the literature. Also, this paper classifies the latest MH algorithms in the literature to demonstrate their effectiveness in DL and ANN training for various applications. Most researchers tend to extend novel hybrid algorithms by combining MHs to optimize the hyper-parameters of DLs and ANNs. The development of hybrid MHs helps improving algorithms performance and capable of solving complex optimization problems. In general, the optimal performance of the MHs should be able to achieve a suitable trade-off between exploration and exploitation features. Hence, this paper tries to summarize various MH algorithms in terms of the convergence trend, exploration, exploitation, and the ability to avoid local minima. The integration of MH with DLs is expected to accelerate the training process in the coming few years. However, relevant publications in this way are still rare. [ABSTRACT FROM AUTHOR]

Software usability is usually used in reference to the hierarchical software usability model by researchers and is an important aspect of user experience and software quality. Thus, evaluation of software usability is an essential parameter for managing and regulating a software. However, it has been difficult to establish a precise evaluation method for this problem. A large number of usability factors have been suggested by many researchers, each covering a set of different factors to increase the degree of user friendliness of a software. Therefore, the selection of the correct determining features is of paramount importance. This paper proposes an innovative metaheuristic algorithm for the selection of most important features in a hierarchical software model. A hierarchy-based usability model is an exhaustive interpretation of the factors, attributes, and its characteristics in a software at different levels. This paper proposes a modified version of grey wolf optimisation algorithm (GWO) termed as modified grey wolf optimization (MGWO) algorithm. The mechanism of this algorithm is based on the hunting mechanism of wolves in nature. The algorithm chooses a number of features which are then applied to software development life cycle models for finding out the best among them. The outcome of this application is also compared with the conventional grey wolf optimization algorithm (GWO), modified binary bat algorithm (MBBAT), modified whale optimization algorithm (MWOA), and modified moth flame optimization (MMFO). The results show that MGWO surpasses all the other relevant optimizers in terms of accuracy and produces a lesser number of attributes equal to 8 as compared to 9 in MMFO and 12 in MBBAT and 19 in MWOA. [ABSTRACT FROM AUTHOR]

Fog computing aims to mitigate data communication delay by deploying fog nodes to provide servers in the proximity of users and offload resource-hungry tasks that would otherwise be sent to distant cloud servers. In this paper, we propose an effective fog device deployment algorithm based on a new metaheuristic algorithm–search economics–to solve the optimization problem for the deployment of fog computing systems. The term "effective" in this paper refers to that the developed algorithm can achieve better performance in terms of metrics such as lower latency and less resource usage. Compared with conventional metaheuristic algorithms, the proposed algorithm is unique in that it first divides the solution space into a set of regions to increase search diversity of the search and then allocates different computational resources to each region according to its potential. To verify the effectiveness of the proposed algorithm, we compare it with several classical fog computing deployment algorithms. The simulation results indicate that the proposed algorithm provides lower network latency and higher quality of service than the other deployment algorithms evaluated in this study. [ABSTRACT FROM AUTHOR]

This study seeks to plan and evaluate the cost of the logistics in manufacturing tetra duplex board using prime grade and recycled materials. The real-world data for this study is obtained from one of the largest paper and board industries in Asia. The bi-objective problem is formulated by developing a mixed integer linear programming (MILP) model considering the constraints related to raw material supplies, processing, and storage. The metaheuristic optimization techniques are applied based on the concept of epsilon dominance to balance the conflicting objectives to counter the complex problem in the real world of transportation for the ease of the decision-makers to make the best-informed decisions in the selection of raw material. The investigation results indicate that the cost of prime-grade material in the tetra duplex board supply chain is 71 percent higher than recycled fiber. Furthermore, this study can be extended by evaluating the environmental aspects of prime and recycled-grade transportation. Moreover, the logistics of the prime grade can further be narrowed down by investigating it in various modes of transportation such as highways, waterways, rail, and air. [ABSTRACT FROM AUTHOR]

Random grids are a method for visual secret sharing, whereby a secret image is encoded into a number of shares, each of which is maximally entropic. There has been growing interest in hiding multiple images in a scheme, such that additional images are revealed by stacking the shares in different ways. This paper proposes a metaheuristic method for generating schemes that allow for a wide range of transformations, or even combinations thereof, to reveal an arbitrary number of secret images. Up to 10 multi-secrets are shown in this paper, as well as hiding multiple secrets in a general access structure. To remove noise from these schemes an algorithm is proposed to extract the information from the noise, and in all cases, relative contrasts are given. In one example, six images are hidden in two shares, such that the mean relative contrast under OR-stacking is 0.152, under XOR-stacking 0.278, and with noise removed, it is 0.74. In an example hiding 10 images in two shares, the values are respectively 0.136, 0.206 and 0.679, respectively. [ABSTRACT FROM AUTHOR]

As a new network architecture, Software Defined Network (SDN) has been widely used in recent years. The continuous increase of network scale makes centralized SDN unable to meet network requirements, so distributed SDN comes into being. The application of the optimization algorithm to solve the Controller Placement Problem (CPP) can improve the performance of distributed SDN. The meta-heuristic algorithm has been widely concerned because it is not easy to fall into the local optimal solution. Based on the advantages of meta-heuristic algorithm, this paper uses the multi-point replacement method and the two-point replacement method which have low complexity to discretization African Vultures Optimization Algorithm (AVOA) in the search and development stages respectively to solve CPP in SDN. In addition, the performance of the improved optimization algorithm is compared with other algorithms on three real SDN topologies of different scales. The research results show that compared with other six latest meta-heuristic algorithms, the improved optimization algorithm in this paper can obtain the lowest average delay between the controller and switch in the shortest time. Compared with PHCPA with the best performance, IAVOA proposed in this paper improves the convergence speed of 38.16%. [ABSTRACT FROM AUTHOR]

Photovoltaic (PV) system performance and reliability can be improved through the detection of defects in PV modules and the evaluation of their effects on system operation. In this paper, a novel system is proposed to detect and classify defects based on electroluminescence (EL) images. This system is called Fault Detection and Classification (FDC) and splits into four modules, which are (1) Image Preprocessing Module (IPM), (2) Feature Extraction Module (FEM), (3) Feature Selection Module (FSM), and (4) Classification Module (CM). In the first module (i.e., IPM), the EL images are preprocessed to enhance the quality of the images. Next, the two types of features in these images are extracted and fused together through FEM. Then, during FSM, the most important and informative features are extracted from these features using a new feature selection methodology, namely, Feature Selection-based Chaotic Map (FS-CM). FS-CM consists of two stages: filter stage using chi-square to initially select the most effective features and a modified selection stage using an enhanced version of Butterfly Optimization Algorithm (BOA). In fact, BOA is a popular swarm-based metaheuristic optimization algorithm that has only recently found success. While BOA has many benefits, it also has some drawbacks, including a smaller population and an increased likelihood of getting stuck in a local optimum. In this paper, a new methodology is proposed to improve the performance of BOA, called chaotic-based butterfly optimization algorithm. Finally, these selected features are used to feed the proposed classification model through CM. During CM, Hybrid Classification Model (HCM) is proposed. HCM consists of two stages, which are binary classification stage using Naïve Bayes (NB) and multi-class classification stage using enhanced multi-layer perceptron. According to the experimental results, the proposed system FDC outperforms the most recent methods. FDC introduced 98.2%, 89.23%, 87.2%, 87.9%, 87.55%, and 88.20% in terms of accuracy, precision, sensitivity, specificity, g-mean, and f-measure in the same order. [ABSTRACT FROM AUTHOR]

This paper proposes a metaheuristic algorithm, called advanced differential evolution (ADE), by improving the DE algorithm. The ADE algorithm was developed with the goal of creating an optimization framework that addresses the challenges of exploration and exploitation balance, avoiding local minima, utilizing chaos theory for diverse initialization, and improving solution quality and convergence speed. By incorporating these features, ADE aims to enhance the effectiveness of optimization processes. The proposed algorithm utilizes chaos theory to generate the initial population, which is subsequently divided into two sub-populations with adaptive sizes. The size of each sub-population is determined using a formula based on the number of iterations during the algorithm's execution. The first sub-population has a larger size in the beginning and the second one has a smaller size, but the total size of these two populations is always constant. The main contribution of this paper is the proposal of two novel improved differential evolution algorithms, namely MDE1 and MDE2, which are utilized for exploration within these sub-populations. The proposed ADE is tested on 29 well-known benchmarks and six engineering problems, and the results are compared with seven other algorithms. Various statistical experiments are carried out showing that the proposed algorithm provides significant superiority over other well-known algorithms. [ABSTRACT FROM AUTHOR]

Metaheuristic methods have emerged as powerful tools for solving complex optimization problems in various domains, including the sustainability of water distribution systems. They provide efficient and effective solutions by mimicking natural processes and searching for the optimal option within a large solution space. Despite the existence of these methods in the water distribution field for several years, a direct comparison between the various proposed solutions often proves challenging, due to the different parameter definitions used by the authors. The present review presents the solutions proposed by a total of 36 research papers taken from the Web of Science, Scopus and Google Scholar databases focusing on the application of metaheuristic methods for leakage reduction and energy saving in water distribution networks. The review is intended to facilitate comparative analysis among the solutions proposed by authors concerning key aspects of the optimization process. These aspects include the definition of the algorithm, the specification of the objective function, and the strategies employed for reducing the search space. The characteristics of the networks used as case studies by the reviewed papers are also presented to allow the reader to evaluate the applicability of the solutions to specific networks. [ABSTRACT FROM AUTHOR]

In this paper, to synthesize grade uncertainty into the strategic mine schedule, a stochastic mixed-integer programming framework (SMIP) is presented for the long-term production scheduling optimization problem (LTPSOP) in open-pit mines. The objective function maximizes the net present value and minimizes the risk of deviation from the production targets considering grade uncertainty simultaneously while satisfying all technical constraints and operational requirements. The current study has proposed a hybrid model to solve the LTPSOP with the incorporation of augmented Lagrangian relaxation (ALR) and the human mental search metaheuristic algorithm (HMS). The ALR function is formulated and the HMS is used to update the Lagrange multipliers. Besides, a Gaussian process machine learning method is applied to estimate the grade in a mineral deposit. The results obtained from a supercomputer have indicated that the ALR–HMS method conducted on real case studies generates 18.29% and 31.56% more cumulative net present value; 9.75% and 13.98% larger pit size than the conventional method, respectively. Finally, while improving the solvability and optimality gap, the analysis of the outcomes has demonstrated that the proposed model yields a near-optimal solution with a rational time. [ABSTRACT FROM AUTHOR]

Economic dispatch is an important issue in the management of power systems and is the current focus of specialists. In this paper, a new metaheuristic optimization algorithm is proposed, named Social Small Group Optimization (SSGO), inspired by the psychosocial processes that occur between members of small groups to solve real-life problems. The starting point of the SSGO algorithm is a philosophical conception similar to that of the social group optimization (SGO) algorithm. The novelty lies in the introduction of the small group concept and the modeling of individuals' evolution based on the social influence between two or more members of the small group. This conceptual framework has been mathematically mapped through a set of heuristics that are used to update the solutions, and the best solutions are retained by employing a greedy selection strategy. SSGO has been applied to solve the economic dispatch problem by considering some practical aspects, such as valve-point loading effects, sources with multiple fuel options, prohibited operating zones, and transmission line losses. The efficiency of the SSGO algorithm was tested on several mathematical functions (unimodal, multimodal, expanded, and composition functions) and on power systems of varying sizes (ranging from 10-units to 1280-units). The SSGO algorithm was compared with SGO and other algorithms belonging to various categories (such as: evolution-based, swarm-based, human behavior-based, hybrid algorithms, etc.), and the results indicated that SSGO outperforms other algorithms applied to solve the economic dispatch problem in terms of quality and stability of the solutions, as well as computation time. [ABSTRACT FROM AUTHOR]

Supply chain efficiency is a major challenge in today's business environment, where efficient resource allocation and coordination of activities are essential for competitive advantage. Traditional efficiency strategies often struggle for resources for the complex and dynamic network. In response, bio-inspired metaheuristic algorithms have emerged as powerful tools to solve these optimization problems. Referring to the random search nature of metaheuristic algorithms and emphasizing that no metaheuristic algorithm is the best optimizer for all optimization applications, the No Free Lunch (NFL) theorem encourages researchers to design newer algorithms to be able to provide more effective solutions to optimization problems. Motivated by the NFL theorem, the innovation and novelty of this paper is in designing a new meta-heuristic algorithm called Bobcat Optimization Algorithm (BOA) that imitates the natural behavior of bobcats in the wild. The basic inspiration of BOA is derived from the hunting strategy of bobcats during the attack towards the prey and the chase process between them. The theory of BOA is stated and then mathematically modeled in two phases (i) exploration based on the simulation of the bobcat's position change while moving towards the prey and (ii) exploitation based on simulating the bobcat's position change during the chase process to catch the prey. The performance of BOA is evaluated in optimization to handle the CEC 2017 test suite for problem dimensions equal to 10, 30, 50, and 100, as well as to address CEC 2020. The optimization results show that BOA has a high ability in exploration, exploitation, and balance them during the search process in order to achieve a suitable solution for optimization problems. The results obtained from BOA are compared with the performance of twelve well-known metaheuristic algorithms. The findings show that BOA has been successful in handling the CEC 2017 test suite in 89.65, 79.31, 93.10, and 89.65% of the functions for the problem dimension equal to 10, 30, 50, and 100, respectively. Also, the findings show that in order to handle the CEC 2020 test suite, BOA has been successful in 100% of the functions of this test suite. The statistical analysis confirms that BOA has a significant statistical superiority in the competition with the compared algorithms. Also, in order to analyze the efficiency of BOA in dealing with real world applications, twenty-two constrained optimization problems from CEC 2011 test suite and four engineering design problems have been selected. The findings show that BOA has been successful in 90.90% of CEC2011 test suite optimization problems and in 100% of engineering design problems. In addition, the efficiency of BOA to handle SCM applications has been challenged to solve ten case studies in the field of sustainable lot size optimization. The findings show that BOA has successfully provided superior performance in 100% of the case studies compared to competitor algorithms. [ABSTRACT FROM AUTHOR]

The traditional energy market is being transformed with modern communication technology, with an interactive generation-load communication topology for energy management in a domestic utility connected over a micro smart grid (MSG). In the traditional energy market, the consumer's role is limited to power consumption. Modern microgrids allow the user to interact with the grid and have increased the energy efficiency of domestic utilities. It is very much necessary to study the role of distributed generation in demand-side management for a proper energy management system in MSG. This paper highlights the interactive areas for the user with the grid to minimize the losses and improve the grid efficiency, thereby minimizing the cost for the user. An agent-based system for the identification of priority and non-priority loads is discussed in this paper, along with an Adaptive Whale Optimization Algorithm (AWOA) for load switching based on priority. Simulation is conducted in MATLAB to validate the proposed technique. The effectiveness of the proposed framework is assessed by comparing it to the Whale optimization Algorithm (WOA) and cases without scheduling. By implementing AWOA, the following improvements were observed: the total electricity cost decreased by an average of 1.33% for 6 residential buildings. In the similar manner, the lad deviation of 1.36% is achieved by implementing AWOA compared to AWO Algorithm. [ABSTRACT FROM AUTHOR]

The continual increase in the amount of generated data by social media, IoT devices, and monitoring systems have motivated the use of Distributed Data Stream Processing (DSP) systems to harness data in a real-time manner. The scheduling of processing tasks in DSP systems across the machines in a cluster or cloud environment is an NP-Hard problem. Different scheduling schemes have been proposed to address the scheduling problem, but most fail to take into account the runtime adaptation and workload changes after initial scheduling. In this paper, we propose a new scheduler (GT-Scheduler) that leverages a heuristic and rule-based algorithm to schedule tasks at near-optimal performance alongside using a meta-heuristic algorithm to make runtime adaptation. Firstly, K-way graph partitioning divides the tasks in an application graph according to the communication patterns. It places tasks with the highest amount of communication near each other to limit an increase in the topology response time. Secondly, instead of assigning tasks to the worker nodes, a partition of tasks is assigned to the nodes by adopting a greedy strategy. If the capacity of nodes is insufficient to host a specific partition of tasks, this partition is iteratively divided by the k-partitioning algorithm to assign to a proper node. The idea of runtime adaptation lies in detecting overutilized worker nodes and reassigning their tasks by exploiting a Tabu-Search and a new scoring strategy to find the best solution in a way that no worker node is overutilized. GT-Scheduler is implemented on the standard Apache Storm and using the standard benchmarks, it is shown that GT-Scheduler outperforms the R-Storm and the Online-Scheduler by at least 35% in reducing the topology response time. [ABSTRACT FROM AUTHOR]

In the dynamic smart grid landscape, accurate probabilistic forecasting of electric load is critical. This paper presents a novel 24-hour-ahead probabilistic load forecasting model by integrating quantile regression with a parallel convolutional neural network (CNN) and bidirectional gated recurrent unit (BiGRU) architecture. Carefully tuning hyperparameters can enhance model performance and generalization capability. Consequently, we propose an improved whale optimization algorithm for automatic hyperparameter tuning of the forecasting model. Case studies demonstrate the proposed method's superior performance over benchmark models in terms of average interval score and pinball loss. In addition, it exhibits valid coverage and tight interval bandwidths. The model provides precise short-term load forecasts to support robust smart grid planning and operations. [ABSTRACT FROM AUTHOR]

In this paper, a new algorithm named the improved transient search optimization algorithm (ITSOA) is utilized to solve classical test functions, optimize the consumption of building energy, and optimize hybrid energy system production. The conventional TSOA draws inspiration from the fleeting behavior of electrical circuits with energy storage components. Rosenbrock's direct rotation technique is used to improve the traditional TSOA performance against exploration and exploitation unbalance. First, the ITSOA performance is investigated in solving 23 classical benchmark functions, and the outcomes have shown the superior capability of the recommended algorithm in comparison with the conventional TSOA, DMO, SHO, GA, MRFO, and PSO methods. Also, the ITSOA proficiency is verified in solving the building energy optimization (BEO) problem for minimizing the energy usage of two simple and detailed buildings. The optimization results showed that the optimized solutions of ITSOA in single and multi-objective optimizations compared to conventional TSOA, DMO, SHO, GA, MRFO, and PSO obtained a lower value of the cost function. Also, the superiority of ITSOA has been confirmed to solve the BEO compared to previous methods. Moreover, the multi-objective optimization results have shown that ITSOA is able to determine the ultimate solution among the Pareto front set based on the fuzzy decision-making approach and building energy utilization decisions. [ABSTRACT FROM AUTHOR]

In this paper, a novel Moth-Flame Optimization (MFO) algorithm, namely MFO algorithm enhanced by Multiple Improvement Strategies (MISMFO) is proposed for solving parameter optimization in Multi-Kernel Support Vector Regressor (MKSVR), and the MISMFO-MKSVR model is further employed to deal with the software effort estimation problems. In MISMFO, the logistic chaotic mapping is applied to increase initial population diversity, while the mutation and flame number phased reduction mechanisms are carried out to improve the search efficiency, as well the adaptive weight adjustment mechanism is used to accelerate convergence and balance exploration and exploitation. The MISMFO model is verified on fifteen benchmark functions and CEC 2020 test set. The results show that the MISMFO has advantages over other meta-heuristic algorithms and MFO variants in terms of convergence speed and accuracy. Additionally, the MISMFO-MKSVR model is tested by simulations on five software effort datasets and the results demonstrate that the proposed model has better performance in software effort estimation problem. The Matlab code of MISMFO can be found at https://github.com/loadstar1997/MISMFO. [ABSTRACT FROM AUTHOR]

In many engineering optimization problems, the number of function evaluations is severely limited by the time or cost constraints. These limitations present a significant challenge in the field of global optimization, because existing metaheuristic methods typically require a substantial number of function evaluations to find optimal solutions. This paper presents a new metaheuristic optimization algorithm that considers the information obtained by a radial basis function neural network (RBFNN) in terms of the objective function for guiding the search process. Initially, the algorithm uses the maximum design approach to strategically distribute a set of solutions across the entire search space. It then enters a cycle in which the RBFNN models the objective function values from the current solutions. The algorithm identifies and uses key neurons in the hidden layer that correspond to the highest objective function values to generate new solutions. The centroids and standard deviations of these neurons guide the sampling process, which continues until the desired number of solutions is reached. By focusing on the areas of the search space that yield high objective function values, the algorithm avoids exhaustive solution evaluations and significantly reduces the number of function evaluations. The effectiveness of the method is demonstrated through a comparison with popular metaheuristic algorithms across several test functions, where it consistently outperforms existing techniques, delivers higher-quality solutions, and improves convergence rates. [ABSTRACT FROM AUTHOR]

Communication quality is compromised when wireless sensor network (WSN) operate in harsh environments, which can be improved by supplementing the nodes. This paper proposes a deployment strategy to optimize the placement of new nodes in WSN, specifically in complex environments with limited communication. To achieve this, the paper introduces the concept of strong connectivity relationships and presents a novel metaheuristic algorithm, namely double-state differential evolution (DSDE), which divides the optimization process into two states and adopts different optimization strategies. The proposed DSDE can improve the overall network communication glowing at a lower computing cost. Extensive experiments show that the proposed DSDE has better performance than state-of-the-art algorithms. [ABSTRACT FROM AUTHOR]

The intrusion detection system is responsible for revealing different intrusion activities, including the denial of service, man-in-middle, Mirai, Scan, and other types of intrusion activities. It is used in many applications, including the smart home Internet of Things networks, where security risks threaten the privacy of individuals. In this context, many works were proposed for detecting and classifying the different types of attacks. However, many challenges are identified for this type of problem, such as the large amount of data available, the imbalanced nature of the data, and the quality of detection and classification outcomes. This paper aims to address these challenges by proposing an approach that considers a metaheuristic-based random weight neural network to detect intrusion activities and classify the different types and subtypes of activities. The following points summarize the contribution of this paper. First, the automatic tuning of the neural network parameters where the weights, biases, regularization value, the number of neurons, and the type of activation function are optimized by different metaheuristic algorithms to produce high-quality results. Second, the proposed approach adopts a clustering with reduction technique to tackle the challenge of processing large volumes of data. Third, oversampling the dataset is also embedded in the proposed approach to avoid a biased classification of the majority class. The experiments are conducted based on a large dataset with more than half a million instances. The results show that the proposed approach outperforms the other classification approaches in geometric mean (G-Mean) and has promising results. [ABSTRACT FROM AUTHOR]

This paper introduces a novel meta-heuristic algorithm named Rhinopithecus Swarm Optimization (RSO) to address optimization problems, particularly those involving high dimensions. The proposed algorithm is inspired by the social behaviors of different groups within the rhinopithecus swarm. RSO categorizes the swarm into mature, adolescent, and infancy individuals. Due to this division of labor, each category of individuals employs unique search methods, including vertical migration, concerted search, and mimicry. To evaluate the effectiveness of RSO, we conducted experiments using the CEC2017 test set and three constrained engineering problems. Each function in the test set was independently executed 36 times. Additionally, we used the Wilcoxon signed-rank test and the Friedman test to analyze the performance of RSO compared to eight well-known optimization algorithms: Dung Beetle Optimizer (DBO), Beluga Whale Optimization (BWO), Salp Swarm Algorithm (SSA), African Vultures Optimization Algorithm (AVOA), Whale Optimization Algorithm (WOA), Atomic Retrospective Learning Bare Bone Particle Swarm Optimization (ARBBPSO), Artificial Gorilla Troops Optimizer (GTO), and Harris Hawks Optimization (HHO). The results indicate that RSO exhibited outstanding performance on the CEC2017 test set for both 30 and 100 dimension. Moreover, RSO ranked first in both dimensions, surpassing the mean rank of the second-ranked algorithms by 7.69% and 42.85%, respectively. Across the three classical engineering design problems, RSO consistently achieves the best results. Overall, it can be concluded that RSO is particularly effective for solving high-dimensional optimization problems. [ABSTRACT FROM AUTHOR]

Differential Evolution (DE) is a population-based metaheuristic search algorithm that exhibits excellent performance. However, it is sensitive to mutation strategies and control parameters.To mitigate the impact of these factors, this paper proposes refining differential evolution with mutation rate and neighborhood weight local search(MRNLDE). The algorithm guides individuals in selecting an appropriate mutation mode through the mutation rate, effectively utilizing the evolutionary information inherent in the individuals themselves, thereby enhancing the search efficiency of the algorithm. Furthermore, the neighborhood individual information is utilized to re-explore the solution space, allowing for a comprehensive exploration of individual evolutionary potential and enhancing the algorithm's diversity. The performance of MRNLDE was validated under two sets of benchmark problems at the Institute of Electrical and Electronics Engineers (IEEE) Conference on Computing in Evolution (CEC), and the results show that MRNLDE performs well overall. [ABSTRACT FROM AUTHOR]

In order to mitigate/prevent the risks of landslides, one of the essential tools that can be used to manage and plan the development of human settlements is landslide susceptibility. The two metaheuristic algorithms explored in this paper are the SCE and VSA algorithms used to optimize the artificial neural network (ANN) model. By integrating the two algorithms with the artificial neural network model, we try to determine its optimum computational parameters in order to generate the landslide susceptibility mapping for the Kurdistan province in Iran. Sixteen causative factors of landslides are included in the spatial database. The landslide susceptibility maps were generated in a GIS medium, and in order to evaluate the employed predictive models, the criterion of the area under the curve (AUC) was employed. This investigation includes 1072 landslide events, which are divided as follows: one-third as testing data and two-thirds as training data (i.e., a 75:25 ratio). The results indicate that after using the abovementioned algorithms, the AUC increased noticeably from 0.708 to 0.788 for SCE-MLP and from 0.744 to 0.818 for VSA-MLP in the training phase. The criterion of the area under the curve was utilized in order to evaluate the accuracy of the employed probabilistic models. Incidentally, the comparable AUCs calculated for the VSA-MLP testing databases and the obtained AUCs were 0.818, 0.801, 0.791, 0.786, 0.784, 0.778, 0.777, 0.776, 0.754 and 0.744, respectively for population size in training databases equal to 50, 350, 500, 150, 450, 200, 400, 300, 100 to and 250. Also, in case of SCE-MLP, the training and testing AUC were found (0.878, 0.865, 0.851, 0.850, 0.819, 0.816, 0.815, 0.781, 0.760, and 0.756) and (0.788, 0.782, 0.759, 0.744, 0.727, 0.720, 0.718, 0.713 and 0.708). The best fit for swarm size conditions of the SCE-MLP and VSA-MLP model showed 150 and 350, respectively. The acquired results indicate that the VSA-ANN model has a better predictive capability in optimization of the structure of the artificial neural network model and computational parameters in comparison with the SCE-ANN. [ABSTRACT FROM AUTHOR]

Clustering is a technique that segregates a provided dataset into homogenous groups in accordance with the provided features. It aims to determine a structure in a group of unlabelled data. Cluster analysis is an unsupervised learning technology that determines the interesting patterns in data objects without class labels. K mode clustering algorithm seems to be effective in clustering categorical data due to its easy implementation and capability to handle the massive amount of data. But because of its random selectivity of initial centroids, it gives the local optimum solution. The main contribution of the paper is to evaluate the performance of clustering on the various dataset with the proposed system. The proposed method utilizes a genetic-based Metaheuristic encircle algorithm to select enriched features and novel dynamic K modes clustering based on Dimensionality Reduced PSO for clustering process with better computational time. The encircling Prey concept has been incorporated to choose the fitness function and overcome the genetic algorithm limitations in feature selection. This paper integrated the k-modes algorithm with particle swarm optimization algorithm to obtain a global optimum solution and update the initial centroid. Several dataset utilized for the evaluation of the proposed work has been found to achieve low accuracy in the previous work. But the proposed approach's effectiveness has been proved to be better by performing a comparative analysis with the state of art methods in terms of performance metrics such as F1 score, accuracy, NMI. [ABSTRACT FROM AUTHOR]

This paper studied the multilevel threshold image segmentation-based metaheuristics optimization methods and their applications. Image segmentation is a common problem in the image processing domain, and it is an essential process in image analysis, directly impacting image analysis results. Thresholding is one of the most manageable and extensively utilized methods for handling image segmentation problems. In this paper, four main parts are given; (1) We present the main procedures and definitions of the multilevel threshold image segmentation problem. The standard fitness function and the evaluation criteria are also given to facilitate the problem representation for the new researchers in this domain. (2) All the related works that have used optimization methods in solving the multilevel threshold image segmentation problems are presented in more detail, focusing on the image segmentation problem and its solutions. The given related works are outlined according to the used algorithms. (3) Comprehensive results and analysis of several well-known optimization algorithms are conducted to solve the multilevel threshold image segmentation problems. These comparative methods include Aquila Optimizer (AO), Whale Optimization Algorithm (WOA), Salp Swarm Algorithm (SSA), Arithmetic Optimization Algorithm (AOA), Particle Swarm Optimizer (PSO), Marine Predators Algorithm (MPA), Krill Herd Algorithm (KHA), Multi-verse Optimizer (MVO), and Gray Wolf Optimizer (GWO). Eight standard benchmark images are used to test the comparative methods. The results are evaluated using three standard measures: fitness function, PeakSignal-to-Noise Ratio (PSNR), and the Structural Similarity Index (SSIM). (4) Discussion, open challenging, and new trends are given to help the scholars in future research get near the common problems and defect in that domain. The collected data in this review has been taken from google scholar using the stander search method. The main keywords that have been used in the search are multilevel, threshold, image, segmentation, optimization, and algorithm. We covered all the published papers in detail according to the given information, focusing on finding the common problems that still need further investigation. Furthermore, future research directions based on recently evolving designs are outlined, which should undoubtedly aid current researchers and practitioners and pave the way for new researchers interested in multilevel threshold image segmentation to seek their research in the field. [ABSTRACT FROM AUTHOR]

The Jaya Algorithm is a relatively new population-based optimization, which has become a progressively valuable tool in swarm intelligence. The Jaya algorithm incorporates the survival of the fittest principle alike evolutionary algorithm by its victorious nature as well as the ideal of an inducement towards a global optimal, which represents its swarm intelligence nature. Nevertheless, it has been applied in various areas of optimization, mainly in engineering practice, which is discussed and abridged based on each problem's domain.The Jaya optimization's vast applicability can be explained by its ability to work without any algorithm-specific parameters. The successfully solved problems may also use some of this meta-heuristic's variants, in which the algorithm has been modified or hybridized. This paper focuses on a comprehensive review, as well as a bibliometric study of the Jaya algorithm, to imply its versatility. Hence, this study is likely to emphasize this optimization's abilities, inspiring new researchers to make use of this simple and efficient algorithm for problem-solving. [ABSTRACT FROM AUTHOR]

Threshold segmentation is a commonly used method to deal with image segmentation problems. Aiming at the problems of the traditional maximum inter-class variance method (Otsu) in multi-threshold image segmentation, such as large amount of computation, long computation time and low segmentation accuracy. This paper proposes a two-dimensional Otsu multi-threshold image segmentation algorithm based on hybrid whale optimization algorithm. Firstly, the two-dimensional Otsu single-threshold segmentation method is extended to the two-dimensional Otsu multi-threshold segmentation method to improve the segmentation effect. At the same time, in order to reduce the calculation time and improve the solution accuracy, the new hybrid whale optimization algorithm proposed in this paper is used to calculate the threshold. The test is carried out through a set of classical image threshold segmentation sets, and the widely used image segmentation evaluation standards PSNR and SSIM are used for judgment. The results of this paper are also compared with the results of other novel algorithms, including the results of one-dimensional Otsu multi-threshold segmentation method. The results show that the proposed two-dimensional Otsu single-threshold segmentation improves the segmentation efficiency and quality, it is an effective image segmentation method. [ABSTRACT FROM AUTHOR]

In this paper, we have proposed a hybrid bio-inspired algorithm which takes the merits of whale optimization algorithm (WOA) and adaptive particle swarm optimization (APSO). The proposed algorithm is referred as the hybrid WOA_APSO algorithm. We utilize a convolutional neural network (CNN) for classification purposes. Extensive experiments are performed to evaluate the performance of the proposed model. Here, pre-processing and segmentation are performed on 120 lung CT images for obtaining the segmented tumored and non-tumored region nodule. The statistical, texture, geometrical and structural features are extracted from the processed image using different techniques. The optimized feature selection plays a crucial role in determining the accuracy of the classification algorithm. The novel variant of whale optimization algorithm and adaptive particle swarm optimization, hybrid bio-inspired WOA_APSO, is proposed for selecting optimized features. The feature selection grouping is applied by embedding linear discriminant analysis which helps in determining the reduced dimensions of subsets. Twofold performance comparisons are done. First, we compare the performance against the different classification techniques such as support vector machine, artificial neural network (ANN) and CNN. Second, the computational cost of the hybrid WOA_APSO is compared with the standard WOA and APSO algorithms. The experimental result reveals that the proposed algorithm is capable of automatic lung tumor detection and it outperforms the other state-of-the-art methods on standard quality measures such as accuracy (97.18%), sensitivity (97%) and specificity (98.66%). The results reported in this paper are encouraging; hence, these results will motivate other researchers to explore more in this direction. [ABSTRACT FROM AUTHOR]

In this paper, new methods for increasing the efficiency of photovoltaic pumping systems are presented (PVPS). A feasible implementation of battery-free PVPS, as well as a cost-effective design, has been proposed. The variation of the PV power causes its behaviour to transit permanently between the characteristics of constant current sources and constant voltage sources, which is studied in this paper from a new perspective. The inconsistency of PV generator behaviour reveals an unexpected phenomenon in the operation of induction motors (IM). To overcome the effects of fluctuating PV behaviour on IM operation, a modified fractional order MPPT controller (FO-MPPT) has been proposed. FO-MPPT has improved as a result of the use of several metaheuristics approaches, including the Grey Wolf (GWO), Anti-lion (ALO), and Whale Optimizer (WOA). A comparison of the proposed FO-MPPT and conventional MPPT techniques is carried out. The steady-state power, rise time, and efficiency are used as three measures to demonstrate the reliability of the proposed controller, demonstrating that the FO-MPPT outperforms traditional MPPT techniques. The optimal FO-ability MPPT's to regulate nonlinear and unpredictable dynamic loads is demonstrated. [ABSTRACT FROM AUTHOR]

Photovoltaic panels (PVs) are solar panels that turn sunlight into electricity. Tracking the maximum power point (MPP) of PVs is especially important for economic issues. The most popular maximum power point tracking techniques are perturb and observation, hill climbing, constant voltage, parasitic capacitance, and incremental conductance (INC). However, these techniques give oscillated results about the MPP that causes low accuracy, especially in partial shading conditions. This paper is discussing the enhancement of photovoltaic energy system performance using several metaheuristic optimization algorithms. Using MATLAB SIMULINK, a comparative analysis of several algorithms for tracking MPP of PV systems under partially shadowed conditions was conducted. The metaheuristic optimization algorithms that are used in this paper are particle swarm optimization (PSO), cuckoo search algorithm (CSA), grey wolf optimization (GWO), and whale optimization algorithm (WOA). The results show that using WOA and GWO achieved the best efficiency in tracking MPP, whereas, using PSO and CSA achieved lower efficiency in tracking MPP. The MPP of the PV system was not tracked by INC under the partial shaded conditions. [ABSTRACT FROM AUTHOR]

In most Internet of Things (IoT) applications, network nodes are limited in terms of energy source. Therefore, the need for innovative methods to eliminate energy loss which shortens the life of networks is fully felt in such networks. One of the optimization techniques of energy consumption on the Internet of things is efficient energy routing that the required energy can be reduced by choosing an optimal path. In this paper, an informed or efficient energy approach is proposed for routing on the Internet of Things in which focus is on the sleep–wake schedule of nodes; therefore, a new optimization algorithm called chaos fuzzy grasshopper optimization algorithm was used. In chaos fuzzy grasshopper algorithm, the initial population of grasshoppers is generated by Lorenz chaos theory and the input and output parameters of the algorithm are adjusted by fuzzy approach. To evaluate the efficiency of the proposed method, three criteria of evaluation of remaining energy, network life and coverage rate were used. Investigating the findings in two different scenarios (efficiency over time and efficiency per number of different nodes) showed that the proposed method always is better than the base methods in all scenarios and for all performance evaluation criteria. So that in the study of the death of 30% of nodes which indicates the life of the network, results showed that the proposed method of the paper (FLGOA) has 9% better efficiency than FGOA, 12% better than GOA and 16% better than GSO. Also, the findings about the remaining energy of the network showed that the proposed method has 16% better efficiency than FGOA method, 21% better than GOA and 22% better than GSO. Finally, studies in the coverage rate evaluation criterion showed that the proposed method has 12% coverage rate better than FGOA method, 15% better than GOA and 16% better than GSO. [ABSTRACT FROM AUTHOR]

Wireless Sensor Networks are booming with the development of computer technology, network communication technology, and sensor technology. However, the question of how to use fewer nodes to achieve maximum coverage still exists. In this paper, a two-layer Surrogate-Assisted Phasmatodea Population Evolution (SAPPE) is proposed for 3D coverage of wireless sensors by combining the characteristics of meta-heuristic algorithms and surrogate models. In this algorithm, Radial Basis Function Networks are used to construct the surrogate model, and the two surrogate models are global surrogate-assisted and local surrogate-assisted, respectively. The global-surrogate model is used to smooth the fitness function, and the local surrogate-assisted model is used to find the optimal value accurately. They use the same archive DataBase (DB) to store particle positions and true fitness values. However, the number of particles involved in the creation of the surrogate-assisted model is different. Seven benchmark functions are used to test and analyze the algorithm, and the results show that the algorithm has good performance. Also, the algorithm verified the significance of the algorithm using Wilcoxon rank test. The result shows that the proposed algorithm is effective compared with PPE, PSO, PPSO, FMO, and BA. This paper compares the number of nodes and coverage radius using different algorithms to ensure maximum coverage. The result shows that the SAPPE algorithm has better performance in terms of 3D coverage. [ABSTRACT FROM AUTHOR]

Today's many giant sectors including energy, industry, tourism, and agriculture should closely track the variation trends of solar radiation to take more benefit from the sun. However, the scarcity of solar radiation measuring stations represents a significant obstacle. This has prompted research into the estimation of global solar radiation (GSR) for various regions using existing climatic and atmospheric parameters. While prediction methods cannot supplant the precision of direct measurements, they are invaluable for studying and utilizing solar energy on a global scale. From this point of view, this paper has focused on predicting daily GSR data in three provinces (Afyonkarahisar, Rize, and Ağrı) which exhibit disparate solar radiation distributions in Türkiye. In this context, Gradient-Based Optimizer (GBO), Harris Hawks Optimization (HHO), Barnacles Mating Optimizer (BMO), Sine Cosine Algorithm (SCA), and Henry Gas Solubility Optimization (HGSO) have been employed to model the daily GSR data. The algorithms were calibrated with daily historical data of five input variables including sunshine duration, actual pressure, moisture, wind speed, and ambient temperature between 2010 and 2017 years. Then, they were tested with daily data for the 2018 year. In the study, a series of statistical metrics (R2, MABE, RMSE, and MBE) were employed to elucidate the algorithm that predicts solar radiation data with higher accuracy. The prediction results demonstrated that all algorithms achieved the highest R2 value in Rize province. It has been found that SCA (MABE of 0.7023 MJ/m2, RMSE of 0.9121 MJ/m2, and MBE of 0.2430 MJ/m2) for Afyonkarahisar province and GBO (RMSE of 0.8432 MJ/m2, MABE of 0.6703 MJ/m2, and R2 of 0.8810) for Ağrı province are the most effective algorithms for estimating GSR data. The findings indicate that each of the metaheuristic algorithms tested in this paper has the potential to predict daily GSR data within a satisfactory error range. However, the GBO and SCA algorithms provided the most accurate predictions of daily GSR data. [ABSTRACT FROM AUTHOR]

This paper provides six metaheuristic algorithms, namely Fast Cuckoo Search (FCS), Salp Swarm Algorithm (SSA), Dynamic control Cuckoo search (DCCS), Gradient-Based Optimizer (GBO), Northern Goshawk Optimization (NGO), Opposition Flow Direction Algorithm (OFDA) to efficiently solve the optimal power flow (OPF) issue. Under standard and conservative operating settings, the OPF problem is modeled utilizing a range of objectives, constraints, and formulations. Five case studies have been conducted using IEEE 30-bus and IEEE 118-bus standard test systems to evaluate the effectiveness and robustness of the proposed algorithms. A performance evaluation procedure is suggested to compare the optimization techniques' strength and resilience. A fresh comparison methodology is created to compare the proposed methodologies with other well-known methodologies. Compared to previously reported optimization algorithms in the literature, the obtained results show the potential of GBO to solve various OPF problems efficiently. [ABSTRACT FROM AUTHOR]

The software-defined network paradigm, ensembled with a wireless sensor network, has emerged as a promising phenomenon to enable multi-tasking, re-configuration, and scalability. Termed the software-defined wireless sensor network (SDWSN), it divides the network into two planes: data and control. The data plane consists of software-defined sensor nodes (SDSN) that sense monitoring activity and generate data. On the other hand, the control plane has controller/control Nodes (CN) which collect data from SDSN, perform data aggregation, and then transmit toward the sink node. These CNs consume more amount of energy as compared to SDSNs as they perform multiple tasks. Following this scenario, this paper proposes an energy-efficient multi-objective optimization approach to solve the CNs placement problem through a meta-heuristic algorithm by considering the nodes' location, energy, and load distribution. This paper presents a particle swarm optimization-based controller placement and re-placement (PSO-CPR) algorithm for SDWSN. The PSO-CPR elects SDSNs to become CN based on their distance, residual energy, and capacity in the network. Moreover, the placement of a CN rotates within the cluster to avoid its failure and balance energy consumption. The simulation results show improved CN placement with respect to the state-of-the-art algorithms in terms of average delay by 23.5–37.4%, energy consumption by 18.6–32.6%, and probabilistic load distribution by 17.7–54.1%. Moreover, the comparative study also indicates that PSO-CPR achieve promising result by reducing packet loss by 14.4–27.5% and network re-clustering period by 32.3–68.3% and enhance the network lifetime by 22.6–42.5%. [ABSTRACT FROM AUTHOR]