Owing to their global search capabilities and gradient-free operation,metaheuristic algorithms are widely applied to a wide range of optimization problems.However,their computational demands become prohibitive when ta...Owing to their global search capabilities and gradient-free operation,metaheuristic algorithms are widely applied to a wide range of optimization problems.However,their computational demands become prohibitive when tackling high-dimensional optimization challenges.To effectively address these challenges,this study introduces cooperative metaheuristics integrating dynamic dimension reduction(DR).Building upon particle swarm optimization(PSO)and differential evolution(DE),the proposed cooperative methods C-PSO and C-DE are developed.In the proposed methods,the modified principal components analysis(PCA)is utilized to reduce the dimension of design variables,thereby decreasing computational costs.The dynamic DR strategy implements periodic execution of modified PCA after a fixed number of iterations,resulting in the important dimensions being dynamically identified.Compared with the static one,the dynamic DR strategy can achieve precise identification of important dimensions,thereby enabling accelerated convergence toward optimal solutions.Furthermore,the influence of cumulative contribution rate thresholds on optimization problems with different dimensions is investigated.Metaheuristic algorithms(PSO,DE)and cooperative metaheuristics(C-PSO,C-DE)are examined by 15 benchmark functions and two engineering design problems(speed reducer and composite pressure vessel).Comparative results demonstrate that the cooperative methods achieve significantly superior performance compared to standard methods in both solution accuracy and computational efficiency.Compared to standard metaheuristic algorithms,cooperative metaheuristics achieve a reduction in computational cost of at least 40%.The cooperative metaheuristics can be effectively used to tackle both high-dimensional unconstrained and constrained optimization problems.展开更多
This study addresses the critical challenge of reconfiguration in unbalanced power distribution networks(UPDNs),focusing on the complex 123-Bus test system.Three scenarios are investigated:(1)simultaneous power loss r...This study addresses the critical challenge of reconfiguration in unbalanced power distribution networks(UPDNs),focusing on the complex 123-Bus test system.Three scenarios are investigated:(1)simultaneous power loss reduction and voltage profile improvement,(2)minimization of voltage and current unbalance indices under various operational cases,and(3)multi-objective optimization using Pareto front analysis to concurrently optimize voltage unbalance index,active power loss,and current unbalance index.Unlike previous research that oftensimplified system components,this work maintains all equipment,including capacitor banks,transformers,and voltage regulators,to ensure realistic results.The study evaluates twelve metaheuristic algorithms to solve the reconfiguration problem(RecPrb)in UPDNs.A comprehensive statistical analysis is conducted to identify the most efficient algorithm for solving the RecPrb in the 123-Bus UPDN,employing multiple performance metrics and comparative techniques.The Artificial Hummingbird Algorithm emerges as the top-performing algorithm and is subsequently applied to address a multi-objective optimization challenge in the 123-Bus UPDN.This research contributes valuable insights for network operators and researchers in selecting suitable algorithms for specific reconfiguration scenarios,advancing the field of UPDN optimization and management.展开更多
The optimization of reaction processes is crucial for the green, efficient, and sustainable development of the chemical industry. However, how to address the problems posed by multiple variables, nonlinearities, and u...The optimization of reaction processes is crucial for the green, efficient, and sustainable development of the chemical industry. However, how to address the problems posed by multiple variables, nonlinearities, and uncertainties during optimization remains a formidable challenge. In this study, a strategy combining interpretable machine learning with metaheuristic optimization algorithms is employed to optimize the reaction process. First, experimental data from a biodiesel production process are collected to establish a database. These data are then used to construct a predictive model based on artificial neural network (ANN) models. Subsequently, interpretable machine learning techniques are applied for quantitative analysis and verification of the model. Finally, four metaheuristic optimization algorithms are coupled with the ANN model to achieve the desired optimization. The research results show that the methanol: palm fatty acid distillate (PFAD) molar ratio contributes the most to the reaction outcome, accounting for 41%. The ANN-simulated annealing (SA) hybrid method is more suitable for this optimization, and the optimal process parameters are a catalyst concentration of 3.00% (mass), a methanol: PFAD molar ratio of 8.67, and a reaction time of 30 min. This study provides deeper insights into reaction process optimization, which will facilitate future applications in various reaction optimization processes.展开更多
Wireless Sensor Networks(WSNs)have become foundational in numerous real-world applications,ranging from environmental monitoring and industrial automation to healthcare systems and smart city development.As these netw...Wireless Sensor Networks(WSNs)have become foundational in numerous real-world applications,ranging from environmental monitoring and industrial automation to healthcare systems and smart city development.As these networks continue to grow in scale and complexity,the need for energy-efficient,scalable,and robust communication protocols becomes more critical than ever.Metaheuristic algorithms have shown significant promise in addressing these challenges,offering flexible and effective solutions for optimizing WSN performance.Among them,the Grey Wolf Optimizer(GWO)algorithm has attracted growing attention due to its simplicity,fast convergence,and strong global search capabilities.Accordingly,this survey provides an in-depth review of the applications of GWO and its variants for clustering,multi-hop routing,and hybrid cluster-based routing in WSNs.We categorize and analyze the existing GWO-based approaches across these key network optimization tasks,discussing the different problem formulations,decision variables,objective functions,and performance metrics used.In doing so,we examine standard GWO,multi-objective GWO,and hybrid GWO models that incorporate other computational intelligence techniques.Each method is evaluated based on how effectively it addresses the core constraints of WSNs,including energy consumption,communication overhead,and network lifetime.Finally,this survey outlines existing gaps in the literature and proposes potential future research directions aimed at enhancing the effectiveness and real-world applicability of GWO-based techniques for WSN clustering and routing.Our goal is to provide researchers and practitioners with a clear,structured understanding of the current state of GWO in WSNs and inspire further innovation in this evolving field.展开更多
ThePigeon-InspiredOptimization(PIO)algorithmconstitutes ametaheuristic method derived fromthe homing behaviour of pigeons.Initially formulated for three-dimensional path planning in unmanned aerial vehicles(UAVs),the ...ThePigeon-InspiredOptimization(PIO)algorithmconstitutes ametaheuristic method derived fromthe homing behaviour of pigeons.Initially formulated for three-dimensional path planning in unmanned aerial vehicles(UAVs),the algorithmhas attracted considerable academic and industrial interest owing to its effective balance between exploration and exploitation,coupled with advantages in real-time performance and robustness.Nevertheless,as applications have diversified,limitations in convergence precision and a tendency toward premature convergence have become increasingly evident,highlighting a need for improvement.This reviewsystematically outlines the developmental trajectory of the PIO algorithm,with a particular focus on its core applications in UAV navigation,multi-objective formulations,and a spectrum of variantmodels that have emerged in recent years.It offers a structured analysis of the foundational principles underlying the PIO.It conducts a comparative assessment of various performance-enhanced versions,including hybrid models that integrate mechanisms from other optimization paradigms.Additionally,the strengths andweaknesses of distinct PIOvariants are critically examined frommultiple perspectives,including intrinsic algorithmic characteristics,suitability for specific application scenarios,objective function design,and the rigor of the statistical evaluation methodologies employed in empirical studies.Finally,this paper identifies principal challenges within current PIO research and proposes several prospective research directions.Future work should focus on mitigating premature convergence by refining the two-phase search structure and adjusting the exponential decrease of individual numbers during the landmark operator.Enhancing parameter adaptation strategies,potentially using reinforcement learning for dynamic tuning,and advancing theoretical analyses on convergence and complexity are also critical.Further applications should be explored in constrained path planning,Neural Architecture Search(NAS),and other real-worldmulti-objective problems.For Multi-objective PIO(MPIO),key improvements include controlling the growth of the external archive and designing more effective selection mechanisms to maintain convergence efficiency.These efforts are expected to strengthen both the theoretical foundation and practical versatility of PIO and its variants.展开更多
Metaheuristic optimization algorithms continue to be essential for solving complex real-world problems,yet existingmethods often struggle with balancing exploration and exploitation across diverse problem landscapes.T...Metaheuristic optimization algorithms continue to be essential for solving complex real-world problems,yet existingmethods often struggle with balancing exploration and exploitation across diverse problem landscapes.This paper proposes a novel nature-inspired metaheuristic optimization algorithm named the Painted Wolf Optimization(PWO)algorithm.The main inspiration for the PWO algorithm is the group behavior and hunting strategy of painted wolves,also known as African wild dogs in the wild,particularly their unique consensus-based voting rally mechanism,a behavior fundamentally distinct fromthe social dynamics of grey wolves.In this innovative process,pack members explore different areas to find prey;then,they hold a pre-hunting voting rally based on the alpha member to determine who will begin the hunt and attack the prey.The efficiency of the proposed PWO algorithm is evaluated by a comparison study with other well-known optimization algorithms on 33 test functions,including the Congress on Evolutionary Computation(CEC)2017 suite and different real-world engineering design cases.Furthermore,the algorithm’s performance is further tested across a spectrum of optimization problems with extensive unknown search spaces.This includes its application within the field of cybersecurity,specifically in the context of training a machine learning-based intrusion detection system(ML-IDS),achieving an accuracy of 0.90 and an F-measure of 0.9290.Statistical analyses using the Wilcoxon signed-rank test(all p<0.05)indicate that the PWO algorithm outperforms existing state-of-the-art algorithms,providing superior solutions in diverse and unpredictable optimization landscapes.This demonstrates its potential as a robust method for tackling complex optimization problems in various fields.The source code for thePWOalgorithmis publicly available at https://github.com/saeidsheikhi/Painted-Wolf-Optimization.展开更多
Optimization algorithms are crucial for solving NP-hard problems in engineering and computational sciences.Metaheuristic algorithms,in particular,have proven highly effective in complex optimization scenarios characte...Optimization algorithms are crucial for solving NP-hard problems in engineering and computational sciences.Metaheuristic algorithms,in particular,have proven highly effective in complex optimization scenarios characterized by high dimensionality and intricate variable relationships.The Mountain Gazelle Optimizer(MGO)is notably effective but struggles to balance local search refinement and global space exploration,often leading to premature convergence and entrapment in local optima.This paper presents the Improved MGO(IMGO),which integrates three synergistic enhancements:dynamic chaos mapping using piecewise chaotic sequences to boost explo-ration diversity;Opposition-Based Learning(OBL)with adaptive,diversity-driven activation to speed up convergence;and structural refinements to the position update mechanisms to enhance exploitation.The IMGO underwent a comprehensive evaluation using 52 standardised benchmark functions and seven engineering optimization problems.Benchmark evaluations showed that IMGO achieved the highest rank in best solution quality for 31 functions,the highest rank in mean performance for 18 functions,and the highest rank in worst-case performance for 14 functions among 11 competing algorithms.Statistical validation using Wilcoxon signed-rank tests confirmed that IMGO outperformed individual competitors across 16 to 50 functions,depending on the algorithm.At the same time,Friedman ranking analysis placed IMGO with an average rank of 4.15,compared to the baseline MGO’s 4.38,establishing the best overall performance.The evaluation of engineering problems revealed consistent improvements,including an optimal cost of 1.6896 for the welded beam design vs.MGO’s 1.7249,a minimum cost of 5885.33 for the pressure vessel design vs.MGO’s 6300,and a minimum weight of 2964.52 kg for the speed reducer design vs.MGO’s 2990.00 kg.Ablation studies identified OBL as the strongest individual contributor,whereas complete integration achieved superior performance through synergistic interactions among components.Computational complexity analysis established an O(T×N×5×f(P))time complexity,representing a 1.25×increase in fitness evaluation relative to the baseline MGO,validating the favorable accuracy-efficiency trade-offs for practical optimization applications.展开更多
The failure of liquid storage tanks,one of the most critical infrastructure systems widely used,during severe earthquakes can have direct or indirect impacts on public safety.The significance of their safe performance...The failure of liquid storage tanks,one of the most critical infrastructure systems widely used,during severe earthquakes can have direct or indirect impacts on public safety.The significance of their safe performance even after destructive earthquakes and their potential for operational use underscores the necessity of appropriate seismic design.Hence,seismic isolation,specifically base isolation,has gained attention as a seismic control method to reduce damage to these infrastructures by increasing their vibration period.One prevalent type of seismic isolator used for tanks and other structures is the friction pendulum system(FPS)isolator.However,due to its fixed period or frequency,it may be susceptible to resonance effects during long-period earthquakes.This research explores an alternative solution by investigating the variable-curvature friction pendulum isolator(VFPI).This isolator type exhibits behavior similar to that of FPS isolators under low excitations and transforms into a pure friction system under high excitations.The study proposes optimizing this VFPI,which features a polynomial function termed the Polynomial Friction Pendulum Isolator(PFPI),by introducing a suitable optimization function to minimize the acceleration transmitted to the superstructure,thereby improving the dynamic performance of the elevated storage tank.The research utilizes two wellestablished metaheuristic algorithms for optimization.It evaluates the effectiveness of the proposed isolator through time history analysis using the state space procedure under various ground motion records.Results,particularly under long-period ground motions,indicate a substantial reduction in the dynamic response of an elevated liquid storage tank equipped with the optimized PFPI.This underscores the potential of the proposed solution in enhancing the seismic resilience of liquid storage tanks.展开更多
Lithology identificationwhile drilling technology can obtain rock information in real-time.However,traditional lithology identificationmodels often face limitations in feature extraction and adaptability to complex ge...Lithology identificationwhile drilling technology can obtain rock information in real-time.However,traditional lithology identificationmodels often face limitations in feature extraction and adaptability to complex geological conditions,limiting their accuracy in challenging environments.To address these challenges,a deep learning model for lithology identificationwhile drilling is proposed.The proposed model introduces a dual attention mechanism in the long short-term memory(LSTM)network,effectively enhancing the ability to capture spatial and channel dimension information.Subsequently,the crayfishoptimization algorithm(COA)is applied to optimize the model network structure,thereby enhancing its lithology identificationcapability.Laboratory test results demonstrate that the proposed model achieves 97.15%accuracy on the testing set,significantlyoutperforming the traditional support vector machine(SVM)method(81.77%).Field tests under actual drilling conditions demonstrate an average accuracy of 91.96%for the proposed model,representing a 14.31%improvement over the LSTM model alone.The proposed model demonstrates robust adaptability and generalization ability across diverse operational scenarios.This research offers reliable technical support for lithology identification while drilling.展开更多
This paper introduces a novel nature-inspired metaheuristic algorithm called the Gekko japonicus algorithm.The algo-rithm draws inspiration mainly from the predation strategies and survival behaviors of the Gekko japo...This paper introduces a novel nature-inspired metaheuristic algorithm called the Gekko japonicus algorithm.The algo-rithm draws inspiration mainly from the predation strategies and survival behaviors of the Gekko japonicus.The math-ematical model is developed by simulating various biological behaviors of the Gekko japonicus,such as hybrid loco-motion patterns,directional olfactory guidance,implicit group advantage tendencies,and the tail autotomy mechanism.By integrating multi-stage mutual constraints and dynamically adjusting parameters,GJA maintains an optimal balance between global exploration and local exploitation,thereby effectively solving complex optimization problems.To assess the performance of GJA,comparative analyses were performed against fourteen state-of-the-art metaheuristic algorithms using the CEC2017 and CEC2022 benchmark test sets.Additionally,a Friedman test was performed on the experimen-tal results to assess the statistical significance of differences between various algorithms.And GJA was evaluated using multiple qualitative indicators,further confirming its superiority in exploration and exploitation.Finally,GJA was utilized to solve four engineering optimization problems and further implemented in robotic path planning to verify its practical applicability.Experimental results indicate that,compared to other high-performance algorithms,GJA demonstrates excep-tional performance as a powerful optimization algorithm in complex optimization problems.We make the code publicly available at:https://github.com/zhy1109/Gekko-japonicusalgorithm.展开更多
The large-scale optimization problem requires some optimization techniques, and the Metaheuristics approach is highly useful for solving difficult optimization problems in practice. The purpose of the research is to o...The large-scale optimization problem requires some optimization techniques, and the Metaheuristics approach is highly useful for solving difficult optimization problems in practice. The purpose of the research is to optimize the transportation system with the help of this approach. We selected forest vehicle routing data as the case study to minimize the total cost and the distance of the forest transportation system. Matlab software helps us find the best solution for this case by applying three algorithms of Metaheuristics: Genetic Algorithm (GA), Ant Colony Optimization (ACO), and Extended Great Deluge (EGD). The results show that GA, compared to ACO and EGD, provides the best solution for the cost and the length of our case study. EGD is the second preferred approach, and ACO offers the last solution.展开更多
Hard rock pillar is one of the important structures in engineering design and excavation in underground mines.Accurate and convenient prediction of pillar stability is of great significance for underground space safet...Hard rock pillar is one of the important structures in engineering design and excavation in underground mines.Accurate and convenient prediction of pillar stability is of great significance for underground space safety.This paper aims to develop hybrid support vector machine(SVM)models improved by three metaheuristic algorithms known as grey wolf optimizer(GWO),whale optimization algorithm(WOA)and sparrow search algorithm(SSA)for predicting the hard rock pillar stability.An integrated dataset containing 306 hard rock pillars was established to generate hybrid SVM models.Five parameters including pillar height,pillar width,ratio of pillar width to height,uniaxial compressive strength and pillar stress were set as input parameters.Two global indices,three local indices and the receiver operating characteristic(ROC)curve with the area under the ROC curve(AUC)were utilized to evaluate all hybrid models’performance.The results confirmed that the SSA-SVM model is the best prediction model with the highest values of all global indices and local indices.Nevertheless,the performance of the SSASVM model for predicting the unstable pillar(AUC:0.899)is not as good as those for stable(AUC:0.975)and failed pillars(AUC:0.990).To verify the effectiveness of the proposed models,5 field cases were investigated in a metal mine and other 5 cases were collected from several published works.The validation results indicated that the SSA-SVM model obtained a considerable accuracy,which means that the combination of SVM and metaheuristic algorithms is a feasible approach to predict the pillar stability.展开更多
Network Intrusion Detection System(IDS)aims to maintain computer network security by detecting several forms of attacks and unauthorized uses of applications which often can not be detected by firewalls.The features s...Network Intrusion Detection System(IDS)aims to maintain computer network security by detecting several forms of attacks and unauthorized uses of applications which often can not be detected by firewalls.The features selection approach plays an important role in constructing effective network IDS.Various bio-inspired metaheuristic algorithms used to reduce features to classify network traffic as abnormal or normal traffic within a shorter duration and showing more accuracy.Therefore,this paper aims to propose a hybrid model for network IDS based on hybridization bio-inspired metaheuristic algorithms to detect the generic attack.The proposed model has two objectives;The first one is to reduce the number of selected features for Network IDS.This objective was met through the hybridization of bioinspired metaheuristic algorithms with each other in a hybrid model.The algorithms used in this paper are particle swarm optimization(PSO),multiverse optimizer(MVO),grey wolf optimizer(GWO),moth-flame optimization(MFO),whale optimization algorithm(WOA),firefly algorithm(FFA),and bat algorithm(BAT).The second objective is to detect the generic attack using machine learning classifiers.This objective was met through employing the support vector machine(SVM),C4.5(J48)decision tree,and random forest(RF)classifiers.UNSW-NB15 dataset used for assessing the effectiveness of the proposed hybrid model.UNSW-NB15 dataset has nine attacks type.The generic attack is the highest among them.Therefore,the proposed model aims to identify generic attacks.My data showed that J48 is the best classifier compared to SVM and RF for the time needed to build the model.In terms of features reduction for the classification,my data show that the MFO-WOA and FFA-GWO models reduce the features to 15 features with close accuracy,sensitivity and F-measure of all features,whereas MVO-BAT model reduces features to 24 features with the same accuracy,sensitivity and F-measure of all features for all classifiers.展开更多
Real-world engineering design problems with complex objective functions under some constraints are relatively difficult problems to solve.Such design problems are widely experienced in many engineering fields,such as ...Real-world engineering design problems with complex objective functions under some constraints are relatively difficult problems to solve.Such design problems are widely experienced in many engineering fields,such as industry,automotive,construction,machinery,and interdisciplinary research.However,there are established optimization techniques that have shown effectiveness in addressing these types of issues.This research paper gives a comparative study of the implementation of seventeen new metaheuristic methods in order to optimize twelve distinct engineering design issues.The algorithms used in the study are listed as:transient search optimization(TSO),equilibrium optimizer(EO),grey wolf optimizer(GWO),moth-flame optimization(MFO),whale optimization algorithm(WOA),slimemould algorithm(SMA),harris hawks optimization(HHO),chimp optimization algorithm(COA),coot optimization algorithm(COOT),multi-verse optimization(MVO),arithmetic optimization algorithm(AOA),aquila optimizer(AO),sine cosine algorithm(SCA),smell agent optimization(SAO),and seagull optimization algorithm(SOA),pelican optimization algorithm(POA),and coati optimization algorithm(CA).As far as we know,there is no comparative analysis of recent and popular methods against the concrete conditions of real-world engineering problems.Hence,a remarkable research guideline is presented in the study for researchersworking in the fields of engineering and artificial intelligence,especiallywhen applying the optimization methods that have emerged recently.Future research can rely on this work for a literature search on comparisons of metaheuristic optimization methods in real-world problems under similar conditions.展开更多
This paper proposes to apply the genetic algorithm and the firefly algorithm to enhance the estimation of the direction of arrival (DOA) angle of electromagnetic signals of a smart antenna array. This estimation is es...This paper proposes to apply the genetic algorithm and the firefly algorithm to enhance the estimation of the direction of arrival (DOA) angle of electromagnetic signals of a smart antenna array. This estimation is essential for beamforming, where the antenna array radiating pattern is steered to provide faster and reliable data transmission with increased coverage. This work proposes using metaheuristics to improve a maximum likelihood DOA estimator for an antenna array arranged in a uniform cuboidal geometry. The DOA estimation performance of the proposed algorithm was compared to that of MUSIC on different two dimensions scenarios. The metaheuristic algorithms present better performance than the well-known MUSIC algorithm.展开更多
Bioactive compounds in plants,which can be synthesized using N-arylationmethods such as the Buchwald-Hartwig reaction,are essential in drug discovery for their pharmacological effects.Important descriptors are necessa...Bioactive compounds in plants,which can be synthesized using N-arylationmethods such as the Buchwald-Hartwig reaction,are essential in drug discovery for their pharmacological effects.Important descriptors are necessary for the estimation of yields in these reactions.This study explores ten metaheuristic algorithms for descriptor selection and model a voting ensemble for evaluation.The algorithms were evaluated based on computational time and the number of selected descriptors.Analyses show that robust performance is obtained with more descriptors,compared to cases where fewer descriptors are selected.The essential descriptor was deduced based on the frequency of occurrence within the 50 extracted data subsets,and better performance was achieved with the voting ensemble than other algorithms with RMSE of 6.4270 and R^(2) of 0.9423.The results and deductions from this study can be readily applied in the decision-making process of chemical synthesis by saving the computational cost associated with initial descriptor selection for yield estimation.The ensemble model has also shown robust performance in its yield estimation ability and efficiency.展开更多
Robots in the medical industry are becoming more common in daily life because of various advantages such as quick response,less human interference,high dependability,improved hygiene,and reduced aging effects.That is ...Robots in the medical industry are becoming more common in daily life because of various advantages such as quick response,less human interference,high dependability,improved hygiene,and reduced aging effects.That is why,in recent years,robotic aid has emerged as a blossoming solution to many challenges in the medical industry.In this manuscript,meta-heuristics(MH)algorithms,specifically the Firefly Algorithm(FF)and Genetic Algorithm(GA),are applied to tune PID controller constraints such as Proportional gain Kp Integral gain Ki and Derivative gain Kd.The controller is used to control Mobile Robot System(MRS)at the required set point.The FF arrangements are made based on various pre-analysis.A detailed simulation study indicates that the proposed PID controller tuned with Firefly Algorithm(FF-PID)for MRSis beneficial and suitable to achieve desired closed-loop system response.The FF is touted as providing an easy,reliable,and efficient tuning technique for PID controllers.The most suitable ideal performance is accomplished with FF-PID,according to the display in the time response.Further,the observed response is compared to those received by applying GA and conventional off-line tuning techniques.The comparison of all tuning methods exhibits supremacy of FF-PID tuning of the given nonlinear Mobile Robot System than GA-PID tuning and conventional controller.展开更多
Recent technological advancements have been used to improve the quality of living in smart cities.At the same time,automated detection of vehicles can be utilized to reduce crime rate and improve public security.On th...Recent technological advancements have been used to improve the quality of living in smart cities.At the same time,automated detection of vehicles can be utilized to reduce crime rate and improve public security.On the other hand,the automatic identification of vehicle license plate(LP)character becomes an essential process to recognize vehicles in real time scenarios,which can be achieved by the exploitation of optimal deep learning(DL)approaches.In this article,a novel hybrid metaheuristic optimization based deep learning model for automated license plate character recognition(HMODL-ALPCR)technique has been presented for smart city environments.The major intention of the HMODL-ALPCR technique is to detect LPs and recognize the characters that exist in them.For effective LP detection process,mask regional convolutional neural network(Mask-RCNN)model is applied and the Inception with Residual Network(ResNet)-v2 as the baseline network.In addition,hybrid sunflower optimization with butterfly optimization algorithm(HSFO-BOA)is utilized for the hyperparameter tuning of the Inception-ResNetv2 model.Finally,Tesseract based character recognition model is applied to effectively recognize the characters present in the LPs.The experimental result analysis of the HMODL-ALPCR technique takes place against the benchmark dataset and the experimental outcomes pointed out the improved efficacy of the HMODL-ALPCR technique over the recent methods.展开更多
Mobile commerce(m-commerce)contributes to increasing the popularity of electronic commerce(e-commerce),allowing anybody to sell or buy goods using a mobile device or tablet anywhere and at any time.As demand for e-com...Mobile commerce(m-commerce)contributes to increasing the popularity of electronic commerce(e-commerce),allowing anybody to sell or buy goods using a mobile device or tablet anywhere and at any time.As demand for e-commerce increases tremendously,the pressure on delivery companies increases to organise their transportation plans to achieve profits and customer satisfaction.One important planning problem in this domain is the multi-vehicle profitable pickup and delivery problem(MVPPDP),where a selected set of pickup and delivery customers need to be served within certain allowed trip time.In this paper,we proposed hybrid clustering algorithms with the greedy randomised adaptive search procedure(GRASP)to construct an initial solution for the MVPPDP.Our approaches first cluster the search space in order to reduce its dimensionality,then use GRASP to build routes for each cluster.We compared our results with state-of-the-art construction heuristics that have been used to construct initial solutions to this problem.Experimental results show that our proposed algorithms contribute to achieving excellent performance in terms of both quality of solutions and processing time.展开更多
This paper presents state-of-art cryptanalysis studies on attacks of the substitution and transposition ciphers using various metaheuristic algorithms.Traditional cryptanalysis methods employ an exhaustive search,whic...This paper presents state-of-art cryptanalysis studies on attacks of the substitution and transposition ciphers using various metaheuristic algorithms.Traditional cryptanalysis methods employ an exhaustive search,which is computationally expensive.Therefore,metaheuristics have attracted the interest of researchers in the cryptanalysis field.Metaheuristic algorithms are known for improving the search for the optimum solution and include Genetic Algorithm,Simulated Annealing,Tabu Search,Particle Swarm Optimization,Differential Evolution,Ant Colony,the Artificial Bee Colony,Cuckoo Search,and Firefly algorithms.The most important part of these various applications is deciding the fitness function to guide the search.This review presents how these algorithms have been implemented for cryptanalysis purposes.The paper highlights the results and findings of the studies and determines the gaps in the literature.展开更多
基金funded by National Natural Science Foundation of China(Nos.12402142,11832013 and 11572134)Natural Science Foundation of Hubei Province(No.2024AFB235)+1 种基金Hubei Provincial Department of Education Science and Technology Research Project(No.Q20221714)the Opening Foundation of Hubei Key Laboratory of Digital Textile Equipment(Nos.DTL2023019 and DTL2022012).
文摘Owing to their global search capabilities and gradient-free operation,metaheuristic algorithms are widely applied to a wide range of optimization problems.However,their computational demands become prohibitive when tackling high-dimensional optimization challenges.To effectively address these challenges,this study introduces cooperative metaheuristics integrating dynamic dimension reduction(DR).Building upon particle swarm optimization(PSO)and differential evolution(DE),the proposed cooperative methods C-PSO and C-DE are developed.In the proposed methods,the modified principal components analysis(PCA)is utilized to reduce the dimension of design variables,thereby decreasing computational costs.The dynamic DR strategy implements periodic execution of modified PCA after a fixed number of iterations,resulting in the important dimensions being dynamically identified.Compared with the static one,the dynamic DR strategy can achieve precise identification of important dimensions,thereby enabling accelerated convergence toward optimal solutions.Furthermore,the influence of cumulative contribution rate thresholds on optimization problems with different dimensions is investigated.Metaheuristic algorithms(PSO,DE)and cooperative metaheuristics(C-PSO,C-DE)are examined by 15 benchmark functions and two engineering design problems(speed reducer and composite pressure vessel).Comparative results demonstrate that the cooperative methods achieve significantly superior performance compared to standard methods in both solution accuracy and computational efficiency.Compared to standard metaheuristic algorithms,cooperative metaheuristics achieve a reduction in computational cost of at least 40%.The cooperative metaheuristics can be effectively used to tackle both high-dimensional unconstrained and constrained optimization problems.
基金supported by the Scientific and Technological Research Council of Turkey(TUBITAK)under Grant No.124E002(1001-Project).
文摘This study addresses the critical challenge of reconfiguration in unbalanced power distribution networks(UPDNs),focusing on the complex 123-Bus test system.Three scenarios are investigated:(1)simultaneous power loss reduction and voltage profile improvement,(2)minimization of voltage and current unbalance indices under various operational cases,and(3)multi-objective optimization using Pareto front analysis to concurrently optimize voltage unbalance index,active power loss,and current unbalance index.Unlike previous research that oftensimplified system components,this work maintains all equipment,including capacitor banks,transformers,and voltage regulators,to ensure realistic results.The study evaluates twelve metaheuristic algorithms to solve the reconfiguration problem(RecPrb)in UPDNs.A comprehensive statistical analysis is conducted to identify the most efficient algorithm for solving the RecPrb in the 123-Bus UPDN,employing multiple performance metrics and comparative techniques.The Artificial Hummingbird Algorithm emerges as the top-performing algorithm and is subsequently applied to address a multi-objective optimization challenge in the 123-Bus UPDN.This research contributes valuable insights for network operators and researchers in selecting suitable algorithms for specific reconfiguration scenarios,advancing the field of UPDN optimization and management.
基金supported by the National Natural Science Foundation of China(22408227,22238005)the Postdoctoral Research Foundation of China(GZC20231576).
文摘The optimization of reaction processes is crucial for the green, efficient, and sustainable development of the chemical industry. However, how to address the problems posed by multiple variables, nonlinearities, and uncertainties during optimization remains a formidable challenge. In this study, a strategy combining interpretable machine learning with metaheuristic optimization algorithms is employed to optimize the reaction process. First, experimental data from a biodiesel production process are collected to establish a database. These data are then used to construct a predictive model based on artificial neural network (ANN) models. Subsequently, interpretable machine learning techniques are applied for quantitative analysis and verification of the model. Finally, four metaheuristic optimization algorithms are coupled with the ANN model to achieve the desired optimization. The research results show that the methanol: palm fatty acid distillate (PFAD) molar ratio contributes the most to the reaction outcome, accounting for 41%. The ANN-simulated annealing (SA) hybrid method is more suitable for this optimization, and the optimal process parameters are a catalyst concentration of 3.00% (mass), a methanol: PFAD molar ratio of 8.67, and a reaction time of 30 min. This study provides deeper insights into reaction process optimization, which will facilitate future applications in various reaction optimization processes.
文摘Wireless Sensor Networks(WSNs)have become foundational in numerous real-world applications,ranging from environmental monitoring and industrial automation to healthcare systems and smart city development.As these networks continue to grow in scale and complexity,the need for energy-efficient,scalable,and robust communication protocols becomes more critical than ever.Metaheuristic algorithms have shown significant promise in addressing these challenges,offering flexible and effective solutions for optimizing WSN performance.Among them,the Grey Wolf Optimizer(GWO)algorithm has attracted growing attention due to its simplicity,fast convergence,and strong global search capabilities.Accordingly,this survey provides an in-depth review of the applications of GWO and its variants for clustering,multi-hop routing,and hybrid cluster-based routing in WSNs.We categorize and analyze the existing GWO-based approaches across these key network optimization tasks,discussing the different problem formulations,decision variables,objective functions,and performance metrics used.In doing so,we examine standard GWO,multi-objective GWO,and hybrid GWO models that incorporate other computational intelligence techniques.Each method is evaluated based on how effectively it addresses the core constraints of WSNs,including energy consumption,communication overhead,and network lifetime.Finally,this survey outlines existing gaps in the literature and proposes potential future research directions aimed at enhancing the effectiveness and real-world applicability of GWO-based techniques for WSN clustering and routing.Our goal is to provide researchers and practitioners with a clear,structured understanding of the current state of GWO in WSNs and inspire further innovation in this evolving field.
基金supported by the National Natural Science Foundation of China under grant number 62066016the Natural Science Foundation of Hunan Province of China under grant number 2024JJ7395+2 种基金International and Regional Science and Technology Cooperation and Exchange Program of the Hunan Association for Science and Technology under grant number 025SKX-KJ-04Hunan Provincial Postgraduate Research Innovation Project under grant numberCX20251611Liye Qin Bamboo Slips Research Special Project of JishouUniversity 25LYY03.
文摘ThePigeon-InspiredOptimization(PIO)algorithmconstitutes ametaheuristic method derived fromthe homing behaviour of pigeons.Initially formulated for three-dimensional path planning in unmanned aerial vehicles(UAVs),the algorithmhas attracted considerable academic and industrial interest owing to its effective balance between exploration and exploitation,coupled with advantages in real-time performance and robustness.Nevertheless,as applications have diversified,limitations in convergence precision and a tendency toward premature convergence have become increasingly evident,highlighting a need for improvement.This reviewsystematically outlines the developmental trajectory of the PIO algorithm,with a particular focus on its core applications in UAV navigation,multi-objective formulations,and a spectrum of variantmodels that have emerged in recent years.It offers a structured analysis of the foundational principles underlying the PIO.It conducts a comparative assessment of various performance-enhanced versions,including hybrid models that integrate mechanisms from other optimization paradigms.Additionally,the strengths andweaknesses of distinct PIOvariants are critically examined frommultiple perspectives,including intrinsic algorithmic characteristics,suitability for specific application scenarios,objective function design,and the rigor of the statistical evaluation methodologies employed in empirical studies.Finally,this paper identifies principal challenges within current PIO research and proposes several prospective research directions.Future work should focus on mitigating premature convergence by refining the two-phase search structure and adjusting the exponential decrease of individual numbers during the landmark operator.Enhancing parameter adaptation strategies,potentially using reinforcement learning for dynamic tuning,and advancing theoretical analyses on convergence and complexity are also critical.Further applications should be explored in constrained path planning,Neural Architecture Search(NAS),and other real-worldmulti-objective problems.For Multi-objective PIO(MPIO),key improvements include controlling the growth of the external archive and designing more effective selection mechanisms to maintain convergence efficiency.These efforts are expected to strengthen both the theoretical foundation and practical versatility of PIO and its variants.
文摘Metaheuristic optimization algorithms continue to be essential for solving complex real-world problems,yet existingmethods often struggle with balancing exploration and exploitation across diverse problem landscapes.This paper proposes a novel nature-inspired metaheuristic optimization algorithm named the Painted Wolf Optimization(PWO)algorithm.The main inspiration for the PWO algorithm is the group behavior and hunting strategy of painted wolves,also known as African wild dogs in the wild,particularly their unique consensus-based voting rally mechanism,a behavior fundamentally distinct fromthe social dynamics of grey wolves.In this innovative process,pack members explore different areas to find prey;then,they hold a pre-hunting voting rally based on the alpha member to determine who will begin the hunt and attack the prey.The efficiency of the proposed PWO algorithm is evaluated by a comparison study with other well-known optimization algorithms on 33 test functions,including the Congress on Evolutionary Computation(CEC)2017 suite and different real-world engineering design cases.Furthermore,the algorithm’s performance is further tested across a spectrum of optimization problems with extensive unknown search spaces.This includes its application within the field of cybersecurity,specifically in the context of training a machine learning-based intrusion detection system(ML-IDS),achieving an accuracy of 0.90 and an F-measure of 0.9290.Statistical analyses using the Wilcoxon signed-rank test(all p<0.05)indicate that the PWO algorithm outperforms existing state-of-the-art algorithms,providing superior solutions in diverse and unpredictable optimization landscapes.This demonstrates its potential as a robust method for tackling complex optimization problems in various fields.The source code for thePWOalgorithmis publicly available at https://github.com/saeidsheikhi/Painted-Wolf-Optimization.
文摘Optimization algorithms are crucial for solving NP-hard problems in engineering and computational sciences.Metaheuristic algorithms,in particular,have proven highly effective in complex optimization scenarios characterized by high dimensionality and intricate variable relationships.The Mountain Gazelle Optimizer(MGO)is notably effective but struggles to balance local search refinement and global space exploration,often leading to premature convergence and entrapment in local optima.This paper presents the Improved MGO(IMGO),which integrates three synergistic enhancements:dynamic chaos mapping using piecewise chaotic sequences to boost explo-ration diversity;Opposition-Based Learning(OBL)with adaptive,diversity-driven activation to speed up convergence;and structural refinements to the position update mechanisms to enhance exploitation.The IMGO underwent a comprehensive evaluation using 52 standardised benchmark functions and seven engineering optimization problems.Benchmark evaluations showed that IMGO achieved the highest rank in best solution quality for 31 functions,the highest rank in mean performance for 18 functions,and the highest rank in worst-case performance for 14 functions among 11 competing algorithms.Statistical validation using Wilcoxon signed-rank tests confirmed that IMGO outperformed individual competitors across 16 to 50 functions,depending on the algorithm.At the same time,Friedman ranking analysis placed IMGO with an average rank of 4.15,compared to the baseline MGO’s 4.38,establishing the best overall performance.The evaluation of engineering problems revealed consistent improvements,including an optimal cost of 1.6896 for the welded beam design vs.MGO’s 1.7249,a minimum cost of 5885.33 for the pressure vessel design vs.MGO’s 6300,and a minimum weight of 2964.52 kg for the speed reducer design vs.MGO’s 2990.00 kg.Ablation studies identified OBL as the strongest individual contributor,whereas complete integration achieved superior performance through synergistic interactions among components.Computational complexity analysis established an O(T×N×5×f(P))time complexity,representing a 1.25×increase in fitness evaluation relative to the baseline MGO,validating the favorable accuracy-efficiency trade-offs for practical optimization applications.
文摘The failure of liquid storage tanks,one of the most critical infrastructure systems widely used,during severe earthquakes can have direct or indirect impacts on public safety.The significance of their safe performance even after destructive earthquakes and their potential for operational use underscores the necessity of appropriate seismic design.Hence,seismic isolation,specifically base isolation,has gained attention as a seismic control method to reduce damage to these infrastructures by increasing their vibration period.One prevalent type of seismic isolator used for tanks and other structures is the friction pendulum system(FPS)isolator.However,due to its fixed period or frequency,it may be susceptible to resonance effects during long-period earthquakes.This research explores an alternative solution by investigating the variable-curvature friction pendulum isolator(VFPI).This isolator type exhibits behavior similar to that of FPS isolators under low excitations and transforms into a pure friction system under high excitations.The study proposes optimizing this VFPI,which features a polynomial function termed the Polynomial Friction Pendulum Isolator(PFPI),by introducing a suitable optimization function to minimize the acceleration transmitted to the superstructure,thereby improving the dynamic performance of the elevated storage tank.The research utilizes two wellestablished metaheuristic algorithms for optimization.It evaluates the effectiveness of the proposed isolator through time history analysis using the state space procedure under various ground motion records.Results,particularly under long-period ground motions,indicate a substantial reduction in the dynamic response of an elevated liquid storage tank equipped with the optimized PFPI.This underscores the potential of the proposed solution in enhancing the seismic resilience of liquid storage tanks.
基金supported by the National Key Research and Development Program for Young Scientists,Chin(Grant No.2021YFC2900400)the Sichuan-Chongqing Science and Technology Innovation Cooperation Program Project,China(Grant No.2024TIAD-CYKJCXX0269)the National Natural Science Foundation of China,China(Grant No.52304123).
文摘Lithology identificationwhile drilling technology can obtain rock information in real-time.However,traditional lithology identificationmodels often face limitations in feature extraction and adaptability to complex geological conditions,limiting their accuracy in challenging environments.To address these challenges,a deep learning model for lithology identificationwhile drilling is proposed.The proposed model introduces a dual attention mechanism in the long short-term memory(LSTM)network,effectively enhancing the ability to capture spatial and channel dimension information.Subsequently,the crayfishoptimization algorithm(COA)is applied to optimize the model network structure,thereby enhancing its lithology identificationcapability.Laboratory test results demonstrate that the proposed model achieves 97.15%accuracy on the testing set,significantlyoutperforming the traditional support vector machine(SVM)method(81.77%).Field tests under actual drilling conditions demonstrate an average accuracy of 91.96%for the proposed model,representing a 14.31%improvement over the LSTM model alone.The proposed model demonstrates robust adaptability and generalization ability across diverse operational scenarios.This research offers reliable technical support for lithology identification while drilling.
基金CHINA POSTDOCTORAL SCIENCE FOUNDATION(Grant No.2025M771925)Young Scientists Fund(C Class)(Grant No.32501636)Special Fund of Fundamental Scientific Research Business Expense for Higher School of Central Government(Grant No.2572025JT04).
文摘This paper introduces a novel nature-inspired metaheuristic algorithm called the Gekko japonicus algorithm.The algo-rithm draws inspiration mainly from the predation strategies and survival behaviors of the Gekko japonicus.The math-ematical model is developed by simulating various biological behaviors of the Gekko japonicus,such as hybrid loco-motion patterns,directional olfactory guidance,implicit group advantage tendencies,and the tail autotomy mechanism.By integrating multi-stage mutual constraints and dynamically adjusting parameters,GJA maintains an optimal balance between global exploration and local exploitation,thereby effectively solving complex optimization problems.To assess the performance of GJA,comparative analyses were performed against fourteen state-of-the-art metaheuristic algorithms using the CEC2017 and CEC2022 benchmark test sets.Additionally,a Friedman test was performed on the experimen-tal results to assess the statistical significance of differences between various algorithms.And GJA was evaluated using multiple qualitative indicators,further confirming its superiority in exploration and exploitation.Finally,GJA was utilized to solve four engineering optimization problems and further implemented in robotic path planning to verify its practical applicability.Experimental results indicate that,compared to other high-performance algorithms,GJA demonstrates excep-tional performance as a powerful optimization algorithm in complex optimization problems.We make the code publicly available at:https://github.com/zhy1109/Gekko-japonicusalgorithm.
文摘The large-scale optimization problem requires some optimization techniques, and the Metaheuristics approach is highly useful for solving difficult optimization problems in practice. The purpose of the research is to optimize the transportation system with the help of this approach. We selected forest vehicle routing data as the case study to minimize the total cost and the distance of the forest transportation system. Matlab software helps us find the best solution for this case by applying three algorithms of Metaheuristics: Genetic Algorithm (GA), Ant Colony Optimization (ACO), and Extended Great Deluge (EGD). The results show that GA, compared to ACO and EGD, provides the best solution for the cost and the length of our case study. EGD is the second preferred approach, and ACO offers the last solution.
基金supported by the National Natural Science Foundation Project of China(Nos.72088101 and 42177164)the Distinguished Youth Science Foundation of Hunan Province of China(No.2022JJ10073)The first author was funded by China Scholarship Council(No.202106370038).
文摘Hard rock pillar is one of the important structures in engineering design and excavation in underground mines.Accurate and convenient prediction of pillar stability is of great significance for underground space safety.This paper aims to develop hybrid support vector machine(SVM)models improved by three metaheuristic algorithms known as grey wolf optimizer(GWO),whale optimization algorithm(WOA)and sparrow search algorithm(SSA)for predicting the hard rock pillar stability.An integrated dataset containing 306 hard rock pillars was established to generate hybrid SVM models.Five parameters including pillar height,pillar width,ratio of pillar width to height,uniaxial compressive strength and pillar stress were set as input parameters.Two global indices,three local indices and the receiver operating characteristic(ROC)curve with the area under the ROC curve(AUC)were utilized to evaluate all hybrid models’performance.The results confirmed that the SSA-SVM model is the best prediction model with the highest values of all global indices and local indices.Nevertheless,the performance of the SSASVM model for predicting the unstable pillar(AUC:0.899)is not as good as those for stable(AUC:0.975)and failed pillars(AUC:0.990).To verify the effectiveness of the proposed models,5 field cases were investigated in a metal mine and other 5 cases were collected from several published works.The validation results indicated that the SSA-SVM model obtained a considerable accuracy,which means that the combination of SVM and metaheuristic algorithms is a feasible approach to predict the pillar stability.
基金funded by The World Islamic Sciences and Education University。
文摘Network Intrusion Detection System(IDS)aims to maintain computer network security by detecting several forms of attacks and unauthorized uses of applications which often can not be detected by firewalls.The features selection approach plays an important role in constructing effective network IDS.Various bio-inspired metaheuristic algorithms used to reduce features to classify network traffic as abnormal or normal traffic within a shorter duration and showing more accuracy.Therefore,this paper aims to propose a hybrid model for network IDS based on hybridization bio-inspired metaheuristic algorithms to detect the generic attack.The proposed model has two objectives;The first one is to reduce the number of selected features for Network IDS.This objective was met through the hybridization of bioinspired metaheuristic algorithms with each other in a hybrid model.The algorithms used in this paper are particle swarm optimization(PSO),multiverse optimizer(MVO),grey wolf optimizer(GWO),moth-flame optimization(MFO),whale optimization algorithm(WOA),firefly algorithm(FFA),and bat algorithm(BAT).The second objective is to detect the generic attack using machine learning classifiers.This objective was met through employing the support vector machine(SVM),C4.5(J48)decision tree,and random forest(RF)classifiers.UNSW-NB15 dataset used for assessing the effectiveness of the proposed hybrid model.UNSW-NB15 dataset has nine attacks type.The generic attack is the highest among them.Therefore,the proposed model aims to identify generic attacks.My data showed that J48 is the best classifier compared to SVM and RF for the time needed to build the model.In terms of features reduction for the classification,my data show that the MFO-WOA and FFA-GWO models reduce the features to 15 features with close accuracy,sensitivity and F-measure of all features,whereas MVO-BAT model reduces features to 24 features with the same accuracy,sensitivity and F-measure of all features for all classifiers.
文摘Real-world engineering design problems with complex objective functions under some constraints are relatively difficult problems to solve.Such design problems are widely experienced in many engineering fields,such as industry,automotive,construction,machinery,and interdisciplinary research.However,there are established optimization techniques that have shown effectiveness in addressing these types of issues.This research paper gives a comparative study of the implementation of seventeen new metaheuristic methods in order to optimize twelve distinct engineering design issues.The algorithms used in the study are listed as:transient search optimization(TSO),equilibrium optimizer(EO),grey wolf optimizer(GWO),moth-flame optimization(MFO),whale optimization algorithm(WOA),slimemould algorithm(SMA),harris hawks optimization(HHO),chimp optimization algorithm(COA),coot optimization algorithm(COOT),multi-verse optimization(MVO),arithmetic optimization algorithm(AOA),aquila optimizer(AO),sine cosine algorithm(SCA),smell agent optimization(SAO),and seagull optimization algorithm(SOA),pelican optimization algorithm(POA),and coati optimization algorithm(CA).As far as we know,there is no comparative analysis of recent and popular methods against the concrete conditions of real-world engineering problems.Hence,a remarkable research guideline is presented in the study for researchersworking in the fields of engineering and artificial intelligence,especiallywhen applying the optimization methods that have emerged recently.Future research can rely on this work for a literature search on comparisons of metaheuristic optimization methods in real-world problems under similar conditions.
文摘This paper proposes to apply the genetic algorithm and the firefly algorithm to enhance the estimation of the direction of arrival (DOA) angle of electromagnetic signals of a smart antenna array. This estimation is essential for beamforming, where the antenna array radiating pattern is steered to provide faster and reliable data transmission with increased coverage. This work proposes using metaheuristics to improve a maximum likelihood DOA estimator for an antenna array arranged in a uniform cuboidal geometry. The DOA estimation performance of the proposed algorithm was compared to that of MUSIC on different two dimensions scenarios. The metaheuristic algorithms present better performance than the well-known MUSIC algorithm.
基金The work described in this paper was substantially supported by the grant from the Research Grants Council of the Hong Kong Special Administrative Region[CityU 11200218]one grant from the Health and Medical Research Fund,the Food and Health Bureau,The Government of the Hong Kong Special Administrative Region[07181426]+1 种基金and the funding from Hong Kong Institute for Data Science(HKIDS)at City University of Hong Kong.The work described in this paper was partially supported by two grants from City University of Hong Kong(CityU 11202219,CityU 11203520)This research was substantially sponsored by the research project(Grant No.32000464)supported by the National Natural Science Foundation of China and was substantially supported by the Shenzhen Research Institute,City University of Hong Kong.The authors extend their appreciation to the Deputyship for Research&Innovation,Ministry of Education in Saudi Arabia for funding this research with the project number(442/77).
文摘Bioactive compounds in plants,which can be synthesized using N-arylationmethods such as the Buchwald-Hartwig reaction,are essential in drug discovery for their pharmacological effects.Important descriptors are necessary for the estimation of yields in these reactions.This study explores ten metaheuristic algorithms for descriptor selection and model a voting ensemble for evaluation.The algorithms were evaluated based on computational time and the number of selected descriptors.Analyses show that robust performance is obtained with more descriptors,compared to cases where fewer descriptors are selected.The essential descriptor was deduced based on the frequency of occurrence within the 50 extracted data subsets,and better performance was achieved with the voting ensemble than other algorithms with RMSE of 6.4270 and R^(2) of 0.9423.The results and deductions from this study can be readily applied in the decision-making process of chemical synthesis by saving the computational cost associated with initial descriptor selection for yield estimation.The ensemble model has also shown robust performance in its yield estimation ability and efficiency.
文摘Robots in the medical industry are becoming more common in daily life because of various advantages such as quick response,less human interference,high dependability,improved hygiene,and reduced aging effects.That is why,in recent years,robotic aid has emerged as a blossoming solution to many challenges in the medical industry.In this manuscript,meta-heuristics(MH)algorithms,specifically the Firefly Algorithm(FF)and Genetic Algorithm(GA),are applied to tune PID controller constraints such as Proportional gain Kp Integral gain Ki and Derivative gain Kd.The controller is used to control Mobile Robot System(MRS)at the required set point.The FF arrangements are made based on various pre-analysis.A detailed simulation study indicates that the proposed PID controller tuned with Firefly Algorithm(FF-PID)for MRSis beneficial and suitable to achieve desired closed-loop system response.The FF is touted as providing an easy,reliable,and efficient tuning technique for PID controllers.The most suitable ideal performance is accomplished with FF-PID,according to the display in the time response.Further,the observed response is compared to those received by applying GA and conventional off-line tuning techniques.The comparison of all tuning methods exhibits supremacy of FF-PID tuning of the given nonlinear Mobile Robot System than GA-PID tuning and conventional controller.
文摘Recent technological advancements have been used to improve the quality of living in smart cities.At the same time,automated detection of vehicles can be utilized to reduce crime rate and improve public security.On the other hand,the automatic identification of vehicle license plate(LP)character becomes an essential process to recognize vehicles in real time scenarios,which can be achieved by the exploitation of optimal deep learning(DL)approaches.In this article,a novel hybrid metaheuristic optimization based deep learning model for automated license plate character recognition(HMODL-ALPCR)technique has been presented for smart city environments.The major intention of the HMODL-ALPCR technique is to detect LPs and recognize the characters that exist in them.For effective LP detection process,mask regional convolutional neural network(Mask-RCNN)model is applied and the Inception with Residual Network(ResNet)-v2 as the baseline network.In addition,hybrid sunflower optimization with butterfly optimization algorithm(HSFO-BOA)is utilized for the hyperparameter tuning of the Inception-ResNetv2 model.Finally,Tesseract based character recognition model is applied to effectively recognize the characters present in the LPs.The experimental result analysis of the HMODL-ALPCR technique takes place against the benchmark dataset and the experimental outcomes pointed out the improved efficacy of the HMODL-ALPCR technique over the recent methods.
基金Deanship of scientific research for funding and supporting this research through the initiative of DSR Graduate Students Research Support(GSR).
文摘Mobile commerce(m-commerce)contributes to increasing the popularity of electronic commerce(e-commerce),allowing anybody to sell or buy goods using a mobile device or tablet anywhere and at any time.As demand for e-commerce increases tremendously,the pressure on delivery companies increases to organise their transportation plans to achieve profits and customer satisfaction.One important planning problem in this domain is the multi-vehicle profitable pickup and delivery problem(MVPPDP),where a selected set of pickup and delivery customers need to be served within certain allowed trip time.In this paper,we proposed hybrid clustering algorithms with the greedy randomised adaptive search procedure(GRASP)to construct an initial solution for the MVPPDP.Our approaches first cluster the search space in order to reduce its dimensionality,then use GRASP to build routes for each cluster.We compared our results with state-of-the-art construction heuristics that have been used to construct initial solutions to this problem.Experimental results show that our proposed algorithms contribute to achieving excellent performance in terms of both quality of solutions and processing time.
基金This study is supported by Erciyes University Research Projects Unit with grant number FDK-2016-7085the initials of authors who received the grant are A and B and the URL to sponsors’websites is http://bap.erciyes.edu.tr/。
文摘This paper presents state-of-art cryptanalysis studies on attacks of the substitution and transposition ciphers using various metaheuristic algorithms.Traditional cryptanalysis methods employ an exhaustive search,which is computationally expensive.Therefore,metaheuristics have attracted the interest of researchers in the cryptanalysis field.Metaheuristic algorithms are known for improving the search for the optimum solution and include Genetic Algorithm,Simulated Annealing,Tabu Search,Particle Swarm Optimization,Differential Evolution,Ant Colony,the Artificial Bee Colony,Cuckoo Search,and Firefly algorithms.The most important part of these various applications is deciding the fitness function to guide the search.This review presents how these algorithms have been implemented for cryptanalysis purposes.The paper highlights the results and findings of the studies and determines the gaps in the literature.
