Hydrodynamic dispersion of reactive solute in a Hagen–Poiseuille flow of a layered liquid

An analysis of the solute dispersion in the liquid flowing through a pipe by means of Aris–Barton's ‘method of moments', under the joint effect of some finite yield stress and irreversible absorption into the wall is presented in this paper. The liquid is considered as a three-layer liquid where the center region is Casson liquid surrounded by Newtonian liquid layer. A significant change from previous modelling exercises in the study of hydrodynamic dispersion, different molecular diffusivity has been considered for the different region yet to be constant. For all time period, finite difference implicit scheme has been adopted to solve the integral moment equation arising from the unsteady convective diffusion equation. The purpose of the study is to find the dependency of solute transport coefficients on absorption parameter, yield stress, viscosity ratio, peripheral layer variation and in addition with various diffusivity coefficients in different liquid layers. This kind of study may be useful for understanding the dispersion process in the blood flow analysis.

A Novel Variant of Moth Flame Optimizer for Higher Dimensional Optimization Problems

Moth Flame Optimization(MFO)is a nature-inspired optimization algorithm,based on the principle of navigation technique of moth toward moon.Due to less parameter and easy implementation,MFO is used in various field to solve optimization problems.Further,for the complex higher dimensional problems,MFO is unable to make a good trade-off between global and local search.To overcome these drawbacks of MFO,in this work,an enhanced MFO,namely WF-MFO,is introduced to solve higher dimensional optimization problems.For a more optimal balance between global and local search,the original MFO’s exploration ability is improved by an exploration operator,namely,Weibull flight distribution.In addition,the local optimal solutions have been avoided and the convergence speed has been increased using a Fibonacci search process-based technique that improves the quality of the solutions found.Twenty-nine benchmark functions of varying complexity with 1000 and 2000 dimensions have been utilized to verify the projected WF-MFO.Numerous popular algorithms and MFO versions have been compared to the achieved results.In addition,the robustness of the proposed WF-MFO method has been evaluated using the Friedman rank test,the Wilcoxon rank test,and convergence analysis.Compared to other methods,the proposed WF-MFO algorithm provides higher quality solutions and converges more quickly,as shown by the experiments.Furthermore,the proposed WF-MFO has been used to the solution of two engineering design issues,with striking success.The improved performance of the proposed WF-MFO algorithm for addressing larger dimensional optimization problems is guaranteed by analyses of numerical data,statistical tests,and convergence performance.

Non-dominated Sorting Advanced Butterfly Optimization Algorithm for Multi-objective Problems

This paper uses the Butterfly Optimization Algorithm(BOA)with dominated sorting and crowding distance mechanisms to solve multi-objective optimization problems.There is also an improvement to the original version of BOA to alleviate its drawbacks before extending it into a multi-objective version.Due to better coverage and a well-distributed Pareto front,non-dominant rankings are applied to the modified BOA using the crowding distance strategy.Seven benchmark functions and eight real-world problems have been used to test the performance of multi-objective non-dominated advanced BOA(MONSBOA),including unconstrained,constrained,and real-world design multiple-objective,highly nonlinear constraint problems.Various performance metrics,such as Generational Distance(GD),Inverted Generational Distance(IGD),Maximum Spread(MS),and Spacing(S),have been used for performance comparison.It is demonstrated that the new MONSBOA algorithm is better than the compared algorithms in more than 80%occasions in solving problems with a variety of linear,nonlinear,continuous,and discrete characteristics based on the Pareto front when compared quantitatively.From all the analysis,it may be concluded that the suggested MONSBOA is capable of producing high-quality Pareto fronts with very competitive results with rapid convergence.

mLBOA:A Modified Butterfly Optimization Algorithm with Lagrange Interpolation for Global Optimization

Though the Butterfly Bptimization Algorithm(BOA)has already proved its effectiveness as a robust optimization algorithm,it has certain disadvantages.So,a new variant of BOA,namely mLBOA,is proposed here to improve its performance.The proposed algorithm employs a self-adaptive parameter setting,Lagrange interpolation formula,and a new local search strategy embedded with Levy flight search to enhance its searching ability to make a better trade-off between exploration and exploitation.Also,the fragrance generation scheme of BOA is modified,which leads for exploring the domain effectively for better searching.To evaluate the performance,it has been applied to solve the IEEE CEC 2017 benchmark suite.The results have been compared to that of six state-of-the-art algorithms and five BOA variants.Moreover,various statistical tests,such as the Friedman rank test,Wilcoxon rank test,convergence analysis,and complexity analysis,have been conducted to justify the rank,significance,and complexity of the proposed mLBOA.Finally,the mLBOA has been applied to solve three real-world engineering design problems.From all the analyses,it has been found that the proposed mLBOA is a competitive algorithm compared to other popular state-of-the-art algorithms and BOA variants.

A Hybrid Moth Flame Optimization Algorithm for Global Optimization

The Moth Flame Optimization(MFO)algorithm shows decent performance results compared to other meta-heuristic algorithms for tackling non-linear constrained global optimization problems.However,it still suffers from obtaining quality solution and slow convergence speed.On the other hand,the Butterfly Optimization Algorithm(BOA)is a comparatively new algorithm which is gaining its popularity due to its simplicity,but it also suffers from poor exploitation ability.In this study,a novel hybrid algorithm,h-MFOBOA,is introduced,which integrates BOA with the MFO algorithm to overcome the shortcomings of both the algorithms and at the same time inherit their advantages.For performance evaluation,the proposed h-MFOBOA algorithm is applied on 23 classical benchmark functions with varied complexity.The tested results of the proposed algorithm are compared with some well-known traditional meta-heuristic algorithms as well as MFO variants.Friedman rank test and Wilcoxon signed rank test are employed to measure the performance of the newly introduced algorithm statistically.The computational complexity has been measured.Moreover,the proposed algorithm has been applied to solve one constrained and one unconstrained real-life problems to examine its problem-solving capability of both type of problems.The comparison results of benchmark functions,statistical analysis,real-world problems confirm that the proposed h-MFOBOA algorithm provides superior results compared to the other conventional optimization algorithms.

Comparative Performance Analysis of Differential Evolution Variants on Engineering Design Problems

Because of their superior problem-solving ability,nature-inspired optimization algorithms are being regularly used in solving complex real-world optimization problems.Engineering academics have recently focused on meta-heuristic algorithms to solve various optimization challenges.Among the state-of-the-art algorithms,Differential Evolution(DE)is one of the most successful algorithms and is frequently used to solve various industrial problems.Over the previous 2 decades,DE has been heavily modified to improve its capabilities.Several DE variations secured positions in IEEE CEC competitions,establishing their efficacy.However,to our knowledge,there has never been a comparison of performance across various CEC-winning DE versions,which could aid in determining which is the most successful.In this study,the performance of DE and its eight other IEEE CEC competition-winning variants are compared.First,the algorithms have evaluated IEEE CEC 2019 and 2020 bound-constrained functions,and the performances have been compared.One unconstrained problem from IEEE CEC 2011 problem suite and five other constrained mechanical engineering design problems,out of which four issues have been taken from IEEE CEC 2020 non-convex constrained optimization suite,have been solved to compare the performances.Statistical analyses like Friedman's test and Wilcoxon's test are executed to verify the algorithm’s ability statistically.Performance analysis exposes that none of the DE variants can solve all the problems efficiently.Performance of SHADE and ELSHADE-SPACMA are considerable among the methods used for comparison to solve such mechanical design problems.

A new parameter setting-based modified differential evolution for function optimization

The population-based efficient iterative evolutionary algorithm(EA)is differential evolution(DE).It has fewer control parameters but is useful when dealing with complex problems of optimization in the real world.A great deal of progress has already been made and implemented in various fields of engineering and science.Nevertheless,DE is prone to the setting of control parameters in its performance evaluation.Therefore,the appropriate adjustment of the time-consuming control parameters is necessary to achieve optimal DE efficiency.This research proposes a new version of the DE algorithm control parameters and mutation operator.For the justifiability of the suggested method,several benchmark functions are taken from the literature.The test results are contrasted with other literary algorithms.