Frilled Lizard Optimization: A Novel Bio-Inspired Optimizer for Solving Engineering Applications

This research presents a novel nature-inspired metaheuristic algorithm called Frilled Lizard Optimization(FLO),which emulates the unique hunting behavior of frilled lizards in their natural habitat.FLO draws its inspiration from the sit-and-wait hunting strategy of these lizards.The algorithm’s core principles are meticulously detailed and mathematically structured into two distinct phases:(i)an exploration phase,which mimics the lizard’s sudden attack on its prey,and(ii)an exploitation phase,which simulates the lizard’s retreat to the treetops after feeding.To assess FLO’s efficacy in addressing optimization problems,its performance is rigorously tested on fifty-two standard benchmark functions.These functions include unimodal,high-dimensional multimodal,and fixed-dimensional multimodal functions,as well as the challenging CEC 2017 test suite.FLO’s performance is benchmarked against twelve established metaheuristic algorithms,providing a comprehensive comparative analysis.The simulation results demonstrate that FLO excels in both exploration and exploitation,effectively balancing these two critical aspects throughout the search process.This balanced approach enables FLO to outperform several competing algorithms in numerous test cases.Additionally,FLO is applied to twenty-two constrained optimization problems from the CEC 2011 test suite and four complex engineering design problems,further validating its robustness and versatility in solving real-world optimization challenges.Overall,the study highlights FLO’s superior performance and its potential as a powerful tool for tackling a wide range of optimization problems.

Far and Near Optimization:A New Simple and Effective Metaphor-LessOptimization Algorithm for Solving Engineering Applications

In this article,a novel metaheuristic technique named Far and Near Optimization(FNO)is introduced,offeringversatile applications across various scientific domains for optimization tasks.The core concept behind FNO lies inintegrating global and local search methodologies to update the algorithm population within the problem-solvingspace based on moving each member to the farthest and nearest member to itself.The paper delineates the theoryof FNO,presenting a mathematical model in two phases:(i)exploration based on the simulation of the movementof a population member towards the farthest member from itself and(ii)exploitation based on simulating themovement of a population member towards the nearest member from itself.FNO’s efficacy in tackling optimizationchallenges is assessed through its handling of the CEC 2017 test suite across problem dimensions of 10,30,50,and 100,as well as to address CEC 2020.The optimization results underscore FNO’s adeptness in exploration,exploitation,and maintaining a balance between them throughout the search process to yield viable solutions.Comparative analysis against twelve established metaheuristic algorithms reveals FNO’s superior performance.Simulation findings indicate FNO’s outperformance of competitor algorithms,securing the top rank as the mosteffective optimizer across a majority of benchmark functions.Moreover,the outcomes derived by employing FNOon twenty-two constrained optimization challenges from the CEC 2011 test suite,alongside four engineering designdilemmas,showcase the effectiveness of the suggested method in tackling real-world scenarios.

Using the Novel Wolverine Optimization Algorithm for Solving Engineering Applications

This paper introduces the Wolverine Optimization Algorithm(WoOA),a biomimetic method inspired by the foraging behaviors of wolverines in their natural habitats.WoOA innovatively integrates two primary strategies:scavenging and hunting,mirroring the wolverine’s adeptness in locating carrion and pursuing live prey.The algorithm’s uniqueness lies in its faithful simulation of these dual strategies,which are mathematically structured to optimize various types of problems effectively.The effectiveness of WoOA is rigorously evaluated using the Congress on Evolutionary Computation(CEC)2017 test suite across dimensions of 10,30,50,and 100.The results showcase WoOA’s robust performance in exploration,exploitation,and maintaining a balance between these phases throughout the search process.Compared to twelve established metaheuristic algorithms,WoOA consistently demonstrates a superior performance across diverse benchmark functions.Statistical analyses,including paired t-tests,Friedman test,and Wilcoxon rank-sum tests,validate WoOA’s significant competitive edge over its counterparts.Additionally,WoOA’s practical applicability is illustrated through its successful resolution of twenty-two constrained scenarios from the CEC 2011 suite and four complex engineering design challenges.These applications underscore WoOA’s efficacy in tackling real-world optimization challenges,further highlighting its potential for widespread adoption in engineering and scientific domains.

Application of Stork Optimization Algorithm for Solving Sustainable Lot Size Optimization

The efficiency of businesses is often hindered by the challenges encountered in traditional Supply Chain Manage-ment(SCM),which is characterized by elevated risks due to inadequate accountability and transparency.To address these challenges and improve operations in green manufacturing,optimization algorithms play a crucial role in supporting decision-making processes.In this study,we propose a solution to the green lot size optimization issue by leveraging bio-inspired algorithms,notably the Stork Optimization Algorithm(SOA).The SOA draws inspiration from the hunting and winter migration strategies employed by storks in nature.The theoretical framework of SOA is elaborated and mathematically modeled through two distinct phases:exploration,based on migration simulation,and exploitation,based on hunting strategy simulation.To tackle the green lot size optimization issue,our methodology involved gathering real-world data,which was then transformed into a simplified function with multiple constraints aimed at optimizing total costs and minimizing CO_(2) emissions.This function served as input for the SOA model.Subsequently,the SOA model was applied to identify the optimal lot size that strikes a balance between cost-effectiveness and sustainability.Through extensive experimentation,we compared the performance of SOA with twelve established metaheuristic algorithms,consistently demonstrating that SOA outperformed the others.This study’s contribution lies in providing an effective solution to the sustainable lot-size optimization dilemma,thereby reducing environmental impact and enhancing supply chain efficiency.The simulation findings underscore that SOA consistently achieves superior outcomes compared to existing optimization methodologies,making it a promising approach for green manufacturing and sustainable supply chain management.

Magnificent Frigatebird Optimization: A New Bio-Inspired Metaheuristic Approach for Solving Optimization Problems

This paper introduces a groundbreaking metaheuristic algorithm named Magnificent Frigatebird Optimization(MFO),inspired by the unique behaviors observed in magnificent frigatebirds in their natural habitats.The foundation of MFO is based on the kleptoparasitic behavior of these birds,where they steal prey from other seabirds.In this process,a magnificent frigatebird targets a food-carrying seabird,aggressively pecking at it until the seabird drops its prey.The frigatebird then swiftly dives to capture the abandoned prey before it falls into the water.The theoretical framework of MFO is thoroughly detailed and mathematically represented,mimicking the frigatebird’s kleptoparasitic behavior in two distinct phases:exploration and exploitation.During the exploration phase,the algorithm searches for new potential solutions across a broad area,akin to the frigatebird scouting for vulnerable seabirds.In the exploitation phase,the algorithm fine-tunes the solutions,similar to the frigatebird focusing on a single target to secure its meal.To evaluate MFO’s performance,the algorithm is tested on twenty-three standard benchmark functions,including unimodal,high-dimensional multimodal,and fixed-dimensional multimodal types.The results from these evaluations highlight MFO’s proficiency in balancing exploration and exploitation throughout the optimization process.Comparative studies with twelve well-known metaheuristic algo-rithms demonstrate that MFO consistently achieves superior optimization results,outperforming its competitors across various metrics.In addition,the implementation of MFO on four engineering design problems shows the effectiveness of the proposed approach in handling real-world applications,thereby validating its practical utility and robustness.

Graphene oxide based carbon composite as adsorbent for Hg removal:Preparation, characterization, kinetics and isotherm studies

The presence of Hg in the aqueous media is known to cause severe health issues in both humans and animals.Many technologies and especially adsorbents have been applied for its removal. In this study, a graphene oxide–carbon composite(GO–CC) as a new adsorbent was prepared by sol gel procedure and characterized using field emission scanning electron microscopy, BET and EDX. The effects of different variables including solution p H, contact time, adsorbent dose and GO ratio in adsorbent matrix on the removal capacity of Hg were studied. The isotherm data correlated well with the Langmuir isotherm model. Further analysis recommended that the Hg^(2+) adsorption process is governed by the intra-particle and external mass transfer, in which the film diffusion was the rate restrictive step. The presented composite has maximum absorption capacity, q_(max) of 68.8 mg·g^(-1), which is comparable with carbon based adsorbent reported in the previous publications.

Archery Algorithm:A Novel Stochastic Optimization Algorithm for Solving Optimization Problems

Finding a suitable solution to an optimization problem designed in science is a major challenge.Therefore,these must be addressed utilizing proper approaches.Based on a random search space,optimization algorithms can find acceptable solutions to problems.Archery Algorithm(AA)is a new stochastic approach for addressing optimization problems that is discussed in this study.The fundamental idea of developing the suggested AA is to imitate the archer’s shooting behavior toward the target panel.The proposed algorithm updates the location of each member of the population in each dimension of the search space by a member randomly marked by the archer.The AA is mathematically described,and its capacity to solve optimization problems is evaluated on twenty-three distinct types of objective functions.Furthermore,the proposed algorithm’s performance is compared vs.eight approaches,including teaching-learning based optimization,marine predators algorithm,genetic algorithm,grey wolf optimization,particle swarm optimization,whale optimization algorithm,gravitational search algorithm,and tunicate swarm algorithm.According to the simulation findings,the AA has a good capacity to tackle optimization issues in both unimodal and multimodal scenarios,and it can give adequate quasi-optimal solutions to these problems.The analysis and comparison of competing algorithms’performance with the proposed algorithm demonstrates the superiority and competitiveness of the AA.

MLA:A New Mutated Leader Algorithm for Solving Optimization Problems

Optimization plays an effective role in various disciplines of science and engineering.Optimization problems should either be optimized using the appropriate method(i.e.,minimization or maximization).Optimization algorithms are one of the efficient and effective methods in providing quasioptimal solutions for these type of problems.In this study,a new algorithm called the Mutated Leader Algorithm(MLA)is presented.The main idea in the proposed MLA is to update the members of the algorithm population in the search space based on the guidance of a mutated leader.In addition to information about the best member of the population,themutated leader also contains information about the worst member of the population,as well as other normal members of the population.The proposed MLA is mathematically modeled for implementation on optimization problems.A standard set consisting of twenty-three objective functions of different types of unimodal,fixed-dimensional multimodal,and high-dimensional multimodal is used to evaluate the ability of the proposed algorithm in optimization.Also,the results obtained from theMLA are compared with eight well-known algorithms.The results of optimization of objective functions show that the proposed MLA has a high ability to solve various optimization problems.Also,the analysis and comparison of the performance of the proposed MLA against the eight compared algorithms indicates the superiority of the proposed algorithm and ability to provide more suitable quasi-optimal solutions.

Migration Algorithm:A New Human-BasedMetaheuristic Approach for Solving Optimization Problems

This paper introduces a newmetaheuristic algorithmcalledMigration Algorithm(MA),which is helpful in solving optimization problems.The fundamental inspiration of MA is the process of human migration,which aims to improve job,educational,economic,and living conditions,and so on.Themathematicalmodeling of the proposed MAis presented in two phases to empower the proposed approach in exploration and exploitation during the search process.In the exploration phase,the algorithm population is updated based on the simulation of choosing the migration destination among the available options.In the exploitation phase,the algorithm population is updated based on the efforts of individuals in the migration destination to adapt to the new environment and improve their conditions.MA’s performance is evaluated on fifty-two standard benchmark functions consisting of unimodal and multimodal types and the CEC 2017 test suite.In addition,MA’s results are compared with the performance of twelve well-known metaheuristic algorithms.The optimization results show the proposed MA approach’s high ability to balance exploration and exploitation to achieve suitable solutions for optimization problems.The analysis and comparison of the simulation results show that MA has provided superior performance against competitor algorithms in most benchmark functions.Also,the implementation of MA on four engineering design problems indicates the effective capability of the proposed approach in handling optimization tasks in real-world applications.

AMBO:All Members-Based Optimizer for Solving Optimization Problems

There are many optimization problems in different branches of science that should be solved using an appropriate methodology.Populationbased optimization algorithms are one of the most efficient approaches to solve this type of problems.In this paper,a new optimization algorithm called All Members-Based Optimizer(AMBO)is introduced to solve various optimization problems.The main idea in designing the proposedAMBOalgorithm is to use more information from the population members of the algorithm instead of just a few specific members(such as best member and worst member)to update the population matrix.Therefore,in AMBO,any member of the population can play a role in updating the population matrix.The theory of AMBO is described and then mathematically modeled for implementation on optimization problems.The performance of the proposed algorithm is evaluated on a set of twenty-three standard objective functions,which belong to three different categories:unimodal,high-dimensional multimodal,and fixed-dimensional multimodal functions.In order to analyze and compare the optimization results for the mentioned objective functions obtained by AMBO,eight other well-known algorithms have been also implemented.The optimization results demonstrate the ability of AMBO to solve various optimization problems.Also,comparison and analysis of the results show that AMBO is superior andmore competitive than the other mentioned algorithms in providing suitable solution.

Ab initio investigation of the structural and unusual electronic properties of α-CuSe (klockmannite)

In this article, a computational analysis has been performed on the structural properties and predominantly on the electronic properties of the α-CuSe （klockmannite） using density functional theory. The studies in this work show that the best structural results, in comparison to the experimental values, belong to the PBEsol-GGA and WC-GGA functionals. However, the best results for the bulk modulus and density of states （DOSs） are related to the local density approximation （LDA） functional. Through utilized approaches, the LDA is chosen to investigate the electronic structure. The results of the electronic properties and geometric optimization of α-CuSe respectively show that this compound is conductive and non-magnetic. The curvatures of the energy bands crossing the Fermi level explicitly reveal that major charge carriers in CuSe are holes, whose density is estimated to be 0.86×1022 hole/cm3. In particular, the Fermi surfaces in the first Brillouin zone demonstrate interplane conductivity between （001） planes. Moreover, the charge carriers among them are electrons and holes simultaneously. The conductivity in CuSe is mainly due to the hybridization between the d orbitals of Cu atoms and the p orbitals of Se atoms. The former orbitals have the dual nature of localization and itinerancy.

SSABA:Search Step Adjustment Based Algorithm

Finding the suitable solution to optimization problems is a fundamental challenge in various sciences.Optimization algorithms are one of the effective stochastic methods in solving optimization problems.In this paper,a new stochastic optimization algorithm called Search StepAdjustment Based Algorithm(SSABA)is presented to provide quasi-optimal solutions to various optimization problems.In the initial iterations of the algorithm,the step index is set to the highest value for a comprehensive search of the search space.Then,with increasing repetitions in order to focus the search of the algorithm in achieving the optimal solution closer to the global optimal,the step index is reduced to reach the minimum value at the end of the algorithm implementation.SSABA is mathematically modeled and its performance in optimization is evaluated on twenty-three different standard objective functions of unimodal and multimodal types.The results of optimization of unimodal functions show that the proposed algorithm SSABA has high exploitation power and the results of optimization of multimodal functions show the appropriate exploration power of the proposed algorithm.In addition,the performance of the proposed SSABA is compared with the performance of eight well-known algorithms,including Particle Swarm Optimization(PSO),Genetic Algorithm(GA),Teaching-Learning Based Optimization(TLBO),Gravitational Search Algorithm(GSA),Grey Wolf Optimization(GWO),Whale Optimization Algorithm(WOA),Marine Predators Algorithm(MPA),and Tunicate Swarm Algorithm(TSA).The simulation results show that the proposed SSABA is better and more competitive than the eight compared algorithms with better performance.

Language Education Optimization: A New Human-Based Metaheuristic Algorithm for Solving Optimization Problems

In this paper,based on the concept of the NFL theorem,that there is no unique algorithm that has the best performance for all optimization problems,a new human-based metaheuristic algorithm called Language Education Optimization(LEO)is introduced,which is used to solve optimization problems.LEO is inspired by the foreign language education process in which a language teacher trains the students of language schools in the desired language skills and rules.LEO is mathematically modeled in three phases:(i)students selecting their teacher,(ii)students learning from each other,and(iii)individual practice,considering exploration in local search and exploitation in local search.The performance of LEO in optimization tasks has been challenged against fifty-two benchmark functions of a variety of unimodal,multimodal types and the CEC 2017 test suite.The optimization results show that LEO,with its acceptable ability in exploration,exploitation,and maintaining a balance between them,has efficient performance in optimization applications and solution presentation.LEO efficiency in optimization tasks is compared with ten well-known metaheuristic algorithms.Analyses of the simulation results show that LEO has effective performance in dealing with optimization tasks and is significantly superior andmore competitive in combating the compared algorithms.The implementation results of the proposed approach to four engineering design problems show the effectiveness of LEO in solving real-world optimization applications.