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]

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]

TBM method construction is an important accompanying construction form vigorously developed in China, and its anomaly detection is an important link to provide a basis for system operation and maintenance decision-making. The abnormal operation state of TBM caused by different surrounding rock geology, jamming or rock burst will directly affect the tunneling speed and ability, and then affect the system safety and construction progress. In this paper, a TBM construction anomaly detection method based on historical tunneling speed and other construction monitoring data is proposed. Firstly, the preprocessing steps based on outlier removal and correlation analysis are used to remove the noise in the original data and select the best features. Secondly, the variational mode decomposition is used to decompose the data into multiple modal components to extract the periodic and aperiodic features of TBM tunneling. Furthermore, an improved VMD-XGBoost-BILSTM combination model is constructed, and the characteristics of combination weighting, attention mechanism and improved whale optimization algorithm are used to realize the normal prediction of accurate and stable tunneling speed. Finally, by comparing with the actual measured values, the set rules are used to judge the anomalies. The experiments are carried out on the actual mining data of YE long-distance water conveyance tunnel in Xinjiang. The results show that the method proposed in this paper improves the RMSE by more than 20% compared with the single BILSTM or XGBoost model. The attention mechanism and IWOA algorithm bring 5.53% and 10.73% results improvement respectively, which can achieve the effect of early warning of different geological information changes. [ABSTRACT FROM AUTHOR]

Orthopedic diseases are widespread worldwide, impacting the body's musculoskeletal system, particularly those involving bones or hips. They have the potential to cause discomfort and impair functionality. This paper aims to address the lack of supplementary diagnostics in orthopedics and improve the method of diagnosing orthopedic diseases. The study uses binary breadth-first search (BBFS), binary particle swarm optimization (BPSO), binary grey wolf optimizer (BGWO), and binary whale optimization algorithm (BWAO) for feature selections, and the BBFS makes an average error of 47.29% less than others. Then we apply six machine learning models, i.e., RF, SGD, NBC, DC, QDA, and ET. The dataset used contains 310 instances and six distinct features. Through experimentation, the RF model led to optimal outcomes during comparison to the remaining models, with an accuracy of 91.4%. The parameters of the RF model were optimized using four optimization algorithms: BFS, PSO, WAO, and GWO. To check how well the optimized RF works on the dataset, this paper uses prediction evaluation metrics such as accuracy, sensitivity, specificity, F-score, and the AUC curve. The results showed that the BFS-RF can improve the performance of the original classifier compared with others with 99.41% accuracy. [ABSTRACT FROM AUTHOR]

In engineering applications, optimal parameter design is crucial. While Slime Mould Algorithm (SMA) excels in parameter discovery under constrained conditions, it faces challenges in achieving global convergence and avoiding local opsecttimal traps in complex tasks. This paper introduces an enhanced variant of SMA, termed CCHSMA, which integrates a Chaotic Local Search (CLS) mechanism to improve initial population diversity and combines Covariance Matrix Adaptation (CMA) and Harris Hawks Optimization (HHO) strategies to enhance global search efficiency. CCHSMA aims to improve search quality and reduce the likelihood of getting trapped in local optima. We evaluated CCHSMA's effectiveness by benchmarking it against the standard SMA and its variants using 30 CEC2017 test functions, and compared its performance with seven notable meta-heuristic algorithms and ten advanced swarm intelligence variants. The experimental results demonstrate that CCHSMA outperforms the other algorithms tested on the benchmark functions. To further validate its practical utility, CCHSMA's performance was also benchmarked against leading algorithms in real-world engineering applications. This paper uses detailed statistical methods, including the Wilcoxon signed-rank test and the Friedman test, to validate the comparative results. Our findings show that CCHSMA outperforms other algorithms in solving complex engineering optimization problems such as tension/compression spring design, pressure vessel design, and three-bar truss design, proving to be a robust tool for complex engineering optimization. Its enhanced initial population diversity and improved global search efficiency are essential for effectively addressing diverse engineering challenges. [ABSTRACT FROM AUTHOR]

Financial Portfolio Optimization Problem (FPOP) is a cornerstone in quantitative investing and financial engineering, focusing on optimizing assets allocation to balance risk and expected return, a concept evolving since Harry Markowitz's 1952 Mean-Variance model. This paper introduces a novel meta-heuristic approach based on the Black Widow Algorithm for Portfolio Optimization (BWAPO) to solve the FPOP. The new method addresses three versions of the portfolio optimization problems: the unconstrained version, the equality cardinality-constrained version, and the inequality cardinality-constrained version. New features are introduced for the BWAPO to adapt better to the problem, including (1) mating attraction and (2) differential evolution mutation strategy. The proposed BWAPO is evaluated against other metaheuristic approaches used in portfolio optimization from literature, and its performance demonstrates its effectiveness through comparative studies on benchmark datasets using multiple performance metrics, particularly in the unconstrained Mean-Variance portfolio optimization version. Additionally, when encountering cardinality constraint, the proposed approach yields competitive results, especially noticeable with smaller datasets. This leads to a focused examination of the outcomes arising from equality versus inequality cardinality constraints, intending to determine which constraint type is more effective in producing portfolios with higher returns. The paper also presents a comprehensive mathematical model that integrates real-world constraints such as transaction costs, transaction lots, and a dollar-denominated budget, in addition to cardinality and bounding constraints. The model assesses both equality/inequality cardinality constraint versions of the problem, revealing that the inequality constraint tends to offer a wider range of feasible solutions with increased return potential. [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]

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]

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]

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]

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]

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]

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]

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]

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]

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]

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]

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]

Today, cloud computing technology has attracted the attention of many researchers. According to the needs of users to quickly execute requests and provide quality services, optimal allocation of resources and timing of task execution between virtual machines in cloud computing are of great importance. One of the important challenges that cloud service providers face is the effective management of resources by physical infrastructure. Therefore, in this paper, an autonomous system based on the Clipped Double Deep Q-Learning (CDDQL) Algorithm and the meta-heuristic Particle Swarm Optimization (PSO) for resource allocation is proposed in the Fog-cloud computing infrastructure. The PSO algorithm is used to prioritize the tasks and CDDQL is used as the core of the autonomous system (Auto-CDDQL) to allocate the desired VM resources to the tasks. The proposed Auto-CDDQL is implemented in the Fog and performs this process autonomously. By evaluating the results, it was observed that the amount of Make Span, response time, task completion, resource utilization, and energy consumption rate in the proposed AutoCDDQL on the c-hilo dataset, compared to the FCFS, RR, and PBTS methods, are significantly improved. [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]

Multi-period portfolio optimization (MPO) is one of the most important problems to be solved to help investors select optimal portfolios for investment plans. The portfolios are influenced by the risk factors in the market and it is important to select optimal portfolios that can maximize the returns with minimum risk values. Other than the risk factor, there are several other influential factors that reduce the optimality of the portfolios. Therefore, by considering all possible constraints, this study proposes a multi-constraint MPO model that selects the optimal portfolio based on the asset returns. To solve the multi-constrained problem, a novel quantum-inspired whale optimization algorithm (QWOA) is introduced in this paper. The proposed algorithm enhances the traditional optimization model to work in a multi-constrained scenario. Here, quantum entanglement is adapted to reduce the slow convergence issue of whale optimization. Apart from considering only the risk factors, this paper also considers certain higher-order moments (HOM), such as skewness, kurtosis, transaction cost, diversification, boundary and budget constraints. These factors affect the portfolios as the market is dynamic, and timely changes are always seen. Thus, optimizing the mentioned factors aids in attaining an optimal portfolio. Empirical evaluations are performed, and the results suggested that the proposed model provided beneficial outcomes as compared with other algorithms like whale optimization algorithm (WOA), gray wolf optimization (GWO), fruitfly optimization algorithm (FOA), particle swarm optimization (PSO) and fruitfly algorithm (FA). The overall net return rate of the proposed model is always above 0.85% for different values of upper bounds, and the obtained Sharpe ratio, Sortino ratio, STARR ratio, information ratio, Shannon entropy, and downside deviation values of the proposed algorithm are 5.016254, 0.89327, − 0.01987, 0.103826, 3.04452 and 0.2854. Hence, the proposed approach is highly effective for optimizing the constrained MPO. [ABSTRACT FROM AUTHOR]

The fundamental objective of a modern power system lies in ensuring reliable and effective energy access for its customers. The assessment and determination of optimal operating conditions for power systems involve the utilization of the optimal power flow (OPF) tool. By considering critical factors such as generator power, bus voltages, and line power flow limits while satisfying the power balance equations, the OPF tool enables the identification of the most favorable configuration for efficient power system operation. Traditional optimization methods have limitations in addressing complex power system problems due to poor convergence and long computational times. As a result, computational intelligence tools have gained popularity in recent years. These tools are versatile and enable efficient solution of power system problems by effectively handling qualitative constraints. This paper presents a well-organized and comprehensive review of the algorithms used in power system optimization in the existing literature, encompassing the most recent developments in the field. Specifically, it examines the application of various population-based artificial intelligence techniques that have gained widespread adoption over the past decade (2012–2022). The aim of these techniques is to resolve an OPF problem. This paper organizes the reviewed papers into various types of population-based metaheuristic algorithms, each one implemented sequentially to deal with the OPF problem in the same chronological order in which they appeared in the literature. [ABSTRACT FROM AUTHOR]

The phase-shifted full-bridge converter is often used as an on-board DC/DC converter because of its advantages of easy control and low loss. The use of a spread spectrum modulation technique can reduce the conducted common mode electromagnetic interference. However, the spectrum expansion of periodic pulse width modulation is not strong enough and is accompanied by spectral overlapping phenomenon in the high-frequency band. In addition, the chaotic pulse width modulation generates a large number of low-frequency components and the spectrum expansion is not controllable. In this paper, discrete chaotic sequences are used to modulate the modulation frequency of the periodic function for the second time to enhance the harmonic side-band extension capability of the periodic pulse width modulation, and to solve the problem of the accumulation of the low-frequency harmonic components caused by the chaotic pulse width modulation, and the introduction of the wide-band characteristics of the chaotic sequences can alleviate the overlapping phenomenon of the spectrum in the high-frequency band. Through the whale optimization algorithm, the relevant modulation parameters affecting the periodic-chaotic pulse width modulation–modulation frequency fm and frequency extension range Δf are optimized. Finally, a 500W phase-shifted full-bridge converter experimental prototype verifies that period-chaos pulse-width modulation has better common mode EMI attenuation characteristics when compared with period pulse-width modulation and chaotic pulse-width modulation. In addition, it verifies the accuracy of the optimized parameters. The modulation means and optimization methods proposed in this paper can be used to reduce the conducted electromagnetic interference in switching power supplies. [ABSTRACT FROM AUTHOR]

The integration of IoT systems into automotive vehicles has raised concerns associated with intrusion detection within these systems. Vehicles equipped with a controller area network (CAN) control several systems within a vehicle where disruptions in function can lead to significant malfunctions, injuries, and even loss of life. Detecting disruption is a primary concern as vehicles move to higher degrees of autonomy and the possibility of self-driving is explored. Tackling cyber-security challenges within CAN is essential to improve vehicle and road safety. Standard differences between different manufacturers make the implementation of a discreet system difficult; therefore, data-driven techniques are needed to tackle the ever-evolving landscape of cyber security within the automotive field. This paper examines the possibility of using machine learning classifiers to identify cyber assaults in CAN systems. To achieve applicability, we cover two classifiers: extreme gradient boost and K-nearest neighbor algorithms. However, as their performance hinges on proper parameter selection, a modified metaheuristic optimizer is introduced as well to tackle parameter optimization. The proposed approach is tested on a publicly available dataset with the best-performing models exceeding 89% accuracy. Optimizer outcomes have undergone rigorous statistical analysis, and the best-performing models were subjected to analysis using explainable artificial intelligence techniques to determine feature impacts on the best-performing model. [ABSTRACT FROM AUTHOR]

This paper proposes a novel hybrid metaheuristic algorithm called the remora crayfish optimization algorithm (HRCOA) designed for solving continuous optimization problems. The crayfish optimization algorithm (COA), recently proposed as a meta-heuristic algorithm (MA), exhibits certain limitations such as imbalanced exploration and exploitation capacities, susceptibility to premature optimization, and a propensity for stagnation. To address these shortcomings, we incorporate the exploitation operators from the remora optimization algorithm (ROA) to enhance the exploitative behaviors of COA. In addition, we simplify the summer resort operator in the original COA to streamline the search operator design, thus avoiding unnecessary complexity. Furthermore, numerical experiments on 10-dimensional (D) and 20-D CEC2022 benchmark functions, 50-D and 100-D CEC2020 benchmark functions, engineering optimization problems, and wireless sensor networks (WSNs) coverage optimization problems are conducted to investigate the performance of our proposed HRCOA comprehensively. We compare the proposed HRCOA against eight well-known state-of-the-art MAs, including CMAES and the original COA, as competitor algorithms. The experimental and statistical results confirm the effectiveness, competitiveness, and scalability of our proposal. Finally, we conclude that the proposed HRCOA possesses significant potential for addressing diverse optimization challenges in real-world scenarios. [ABSTRACT FROM AUTHOR]

This paper addresses the critical gap in the understanding of the effects of various configurations and feedback mechanisms on the performance of hybrid metaheuristics (HMs) in unsupervised clustering applications. Despite the widespread use of HMs due to their ability to leverage multiple optimization methods, the lack of comprehensive studies on their configuration and feedback mechanisms effects often results in sub-optimal clustering performances and premature convergence. To tackle these issues, we introduce two algorithms for implementing eight distinct HM schemes, focusing on the impacts of parallel and serial processing models along with different feedback mechanisms. Our approach involves selecting candidate metaheuristics based on a mix of evolutionary and swarm-based methods, including the k-means algorithm, to form various HM-based clustering schemes. These schemes were then rigorously evaluated across a range of datasets and feedback mechanisms, further assessing their efficiency in the deployment of smart grid base stations. Performance analysis was based on total fitness evaluations, timing capabilities, and clustering accuracy. The results revealed that parallel HMs with decoupled feedback mechanisms performed best in terms of accuracy but at the cost of slower convergence rates as compared to serial HMs. Our findings further suggest that serial HMs will be best suited for time-sensitive applications where a compromise between speed and accuracy is acceptable, while parallel HMs with decoupled feedback mechanisms are preferable for scenarios where precision is paramount. This research significantly contributes to the field by providing a detailed analysis of HM performance in varying conditions, thereby guiding the selection of appropriate HM schemes for specific clustering tasks. [ABSTRACT FROM AUTHOR]

For the problem of trajectory planning in the small-scale unmanned aerial vehicle (UAV) swarms, classical intelligent algorithms and newly emerged bio-inspired algorithms often suffer from being trapped in local optima, leading to suboptimal solutions. Moreover, these algorithms fail to ensure optimal solutions and convergence speed in high-speed dynamic UAV networking scenarios. In response to these challenges, this paper proposes an Improved Whale Optimization Algorithm (IWOA) that considers the global perspective. To address the issue of initial solution diversity, an opposition-based learning method is introduced by constructing a reverse population, enhancing the diversity of the initial population. To overcome the problem of the algorithm getting trapped in local optima, random convergence factors, and end-point random neighborhood perturbations are incorporated to accelerate the global convergence speed of the IWOA and prevent it from getting stuck in local optima. Additionally, a grid digital elevation model is employed when constructing the experimental environment model, considering various physical constraints of the UAV swarm. This ensures that the simulation validation of the IWOA algorithm is closer to real-world scenarios. Simulation results indicate that, compared to commonly used algorithms, the IWOA can generate more optimal trajectories for drone swarm planning under constraints resembling real-world scenarios. It exhibits better performance in trajectory evaluation, convergence speed, and stability, thereby meeting the requirements of trajectory planning for small-scale UAV swarms. The proposed IWOA enhances UAV swarm coordination and efficiency, significantly impacting real-world applications in various fields. [ABSTRACT FROM AUTHOR]

This paper introduces a novel multi-stage FOPD(1 + PI) controller for DC motor speed control, optimized using the Pelican Optimization Algorithm (POA). Traditional PID controllers often fall short in handling the complex dynamics of DC motors, leading to suboptimal performance. Our proposed controller integrates fractional-order proportional-derivative (FOPD) and proportional-integral (PI) control actions, optimized via POA to achieve superior control performance. The effectiveness of the proposed controller is validated through rigorous simulations and experimental evaluations. Comparative analysis is conducted against conventional PID and fractional-order PID (FOPID) controllers, fine-tuned using metaheuristic algorithms such as atom search optimization (ASO), stochastic fractal search (SFS), grey wolf optimization (GWO), and sine-cosine algorithm (SCA). Quantitative results demonstrate that the FOPD(1 + PI) controller optimized by POA significantly enhances the dynamic response and stability of the DC motor. Key performance metrics show a reduction in rise time by 28%, settling time by 35%, and overshoot by 22%, while the steady-state error is minimized to 0.3%. The comparative analysis highlights the superior performance, faster response time, high accuracy, and robustness of the proposed controller in various operating conditions, consistently outperforming the PID and FOPID controllers optimized by other metaheuristic algorithms. In conclusion, the POA-optimized multi-stage FOPD(1 + PI) controller presents a significant advancement in DC motor speed control, offering a robust and efficient solution with substantial improvements in performance metrics. This innovative approach has the potential to enhance the efficiency and reliability of DC motor applications in industrial and automotive sectors. [ABSTRACT FROM AUTHOR]

In this paper, a permanent magnet synchronous machine (PMSM) with an auxiliary winding (AW) on the rotor is analyzed by two-dimensional approach. This PMSM with AW (AWPMSM) can be used in many applications such as propulsion system, aircraft and traction because it includes rotor flux control capability. First, the magnetic field in different parts of AWPMSM is calculated based on Maxwell equations. Then, as a consequence of the magnetic field, the torque components, including cogging, reluctance, electromagnetic and instantaneous torque are computed. Next, torque-speed characteristic has been investigated. This AWPMSM can be located in the flux weakening mode in two ways, first one is to attenuate the rotor field by changing the direction of the AW field and the other one is to adjust the armature current angle, both of them have been investigated. After that, the overload capability and temperature effects have been analyzed. Finally, using the meta-heuristic algorithms such as genetic algorithm, particle swarm optimization, differential evolution and teaching learn base optimization the dimensions of AWPMSM and the initial angle of the rotor are determined in such a way that the torque-to-volume ratio is maximized. The influences of the type of armature winding and the magnetization patterns have also been investigated. The results obtained by the two-dimensional method have been confirmed numerically. [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]

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]

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]

Feature selection plays a critical role in reducing high-dimensional feature space in machine learning applications without affecting the accuracy of performance. The feature selection problem has been extensively studied in the literature. Nevertheless, few studies have been conducted on unsupervised text feature selection because of the absence of feature class labels and local optimization limitations. For that, this paper proposes three binary versions of the fire hawk optimizer based on different transfer functions for unsupervised text feature selection that can be used to select the most informative features for text clustering. The internal feature subset was evaluated using a mean absolute difference filter. The performance of the proposed methods is tested and compared with other state-of-the-art metaheuristic algorithms on several different benchmark text datasets from different sources using various evaluation metrics. The K-means clustering is applied to cluster documents based on the features selected by the methods. The results of the experiments indicate the effectiveness of the proposed method based on the S-shaped transfer function for improving the performance of document clustering compared with other feature selection methods. [ABSTRACT FROM AUTHOR]

Feature Selection (FS), a pre-processing step used in the majority of big data processing applications, aims to eliminate irrelevant and redundant features from the data. Its purpose is to select a final set of data characteristics that best represent the data as a whole. To achieve this, it explores every potential solution in order to identify the optimal subset. Meta-heuristic algorithms have been found to be particularly effective in solving FS problems, especially for high-dimensional datasets. This work adopts a recently developed meta-heuristic called the White Shark Optimizer (WSO) due to its simplicity and low computational overhead. However, WSO faces challenges in effectively balancing exploration and exploitation, particularly in complex multi-peak search problems. It tends to converge prematurely and get stuck in local optima, which can lead to poor search performance when dealing with FS problems. To overcome these issues, this paper presents three enhanced binary variants of WSO for well-known FS problems. These variants are as follows: (1) Binary Distribution-based WSO (BDWSO), where the algorithm refines the positions of white sharks by considering both the average and standard deviation of the current shark, the local best shark, and the global best shark. This strategy is designed to alleviate issues of premature convergence and stagnation during iterations , (2) Binary Sine Cosine WSO (BSCWSO), which uses sine and cosine adaptive functions for the social and cognitive components of the position update rule, and (3) Binary Hybrid Sine Cosine WSO (BHSCWSO), which employs sine and cosine acceleration factors to regulate local search and achieve convergence to the global optimal solution. Additionally, the population was initialized using the Opposition-Based Learning (OBL) mechanism, and the sine map was used to modify the inertia weight of WSO. These revised variants of WSO were established to have a better harmony between the exploration and exploitation facets. The proposed methods were extensively compared to the fundamental binary WSO and other well-known algorithms in the field. The experimental findings and comparisons demonstrate that the proposed methods outperform the conventional and most evaluated similar algorithms in terms of robustness and solution quality. In terms of classification accuracy, number of selected features, specificity, sensitivity, and fitness values, the proposed BHSCWSO optimizer performed better than all other proposed peer optimizers, including BSWO, BDWSO, and BSCWSO, in 11, 8, 13, 18, and 10 datasets, respectively. The proposed BHSCWSO optimizer showed performance levels of more than 90% in terms of accuracy, sensitivity, and specificity metric measures on 15, 14, and 11 of the 24 datasets deemed. [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]

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]

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]

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]

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 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]

The Internet of Things (IoT) is constantly evolving. The variety of IoT applications has caused new demands to emerge on users' part and competition between computing service providers. On the one hand, an IoT application may exhibit several important criteria, such as deadline and runtime simultaneously, and it is confronted with resource limitations and high energy consumption on the other hand. This has turned to adopting a computing environment and scheduling as a fundamental challenge. To resolve the issue, IoT applications are considered in this paper as a workflow composed of a series of interdependent tasks. The tasks in the same workflow (at the same level) are subject to priorities and deadlines for execution, making the problem far more complex and closer to the real world. In this paper, a hybrid Particle Swarm Optimization and Simulated Annealing algorithm (PSO–SA) is used for prioritizing tasks and improving fitness function. Our proposed method managed the task allocation and optimized energy consumption and makespan at the fog-cloud environment nodes. The simulation results indicated that the PSO–SA enhanced energy and makespan by 5% and 9% respectively on average compared with the baseline algorithm (IKH-EFT). [ABSTRACT FROM AUTHOR]

The design of underwater wireless sensor networks (UWSNs) faces many challenges, including power consumption, storage, battery life, and transmission bandwidth. UWSNs usually either use node clustering or multi-hop routing as their energy-efficient optimization algorithms. The cluster optimization technique will organize the sensor nodes into a cluster network, with each cluster led by a cluster head (CH). In contrast, the multi-hop optimization algorithm will create a multi-hop network by sending data to the base station (BS) while switching between different sensor nodes. However, the overburdens of CH nodes impact the performance of the cluster optimization method, whereas the overburdens of nodes close to the BS impact the performance of the multi-hop optimization algorithm. Therefore, clustering and routing procedures can be considered as a simultaneous NP-hard problem that metaheuristic algorithms can address. With this motivation, this paper proposes an energy-efficient clustering and multi-hop routing protocol using the metaheuristic-based algorithm to increase energy efficiency in UWSNs and lengthen the network life. However, the existing metaheuristic-based methods use two separate algorithms for clustering and multi-hop routing, increasing computational complexity, different initialization, and difficulty in hyperparameters' tuning. In order to address the mentioned shortcomings, this paper proposes a novel hierarchical structure called hierarchical chimp optimization (HChOA) for both clustering and multi-hop routing processes. The proposed HChOA is validated using various metrics after being simulated using an extended set of experiments. Results are compared to those from LEACH, TEEN, MPSO, PSO, and IPSO-GWO to validate the impact of the HChOA. According to the findings, the HChOA performed better than other lifespan and energy usage benchmarks. [ABSTRACT FROM AUTHOR]

Model-agnostic meta-learning (MAML) highlights the ability to quickly adapt to new tasks with only a small amount of labeled training data among many few-shot learning algorithms. However, the computational complexity is high, because the MAML algorithm generates a large number of second-order parameters in the secondary gradient update. In addition, due to the non-convex nature of the neural network, the loss landscape has many flat areas, leading to slow convergence during training, and excessively long training. In this paper, a second-order optimization method called Kronecker-factored Approximate Curvature (K-FAC) is proposed to approximate Natural Gradient Descent. K-FAC reduces the computational complexity by approximating the large matrix of the Fisher information as the Kronecker product of two much smaller matrices, and the second-order parameter information is fully utilized to accelerate the convergence. Moreover, in order to solve the problem that Natural Gradient Descent is sensitive to the learning rate, this paper proposes Kronecker-factored Approximate Curvature with adaptive learning rate for optimizing model-agnostic meta-learning (AK-MAML), which automatically adjusts the learning rate according to the curvature and improves the efficiency of training. Experimental results show that AK-MAML has the ability of faster convergence, lower computation, and higher accuracy on few-shot datasets. [ABSTRACT FROM AUTHOR]