Hybrid non-dominated sorting genetic algorithm with adaptive operators selection

Multiobjective optimization entails minimizing or maximizing multiple objective functions subject to a set of constraints. Many real world applications can be formulated as multi-objective optimization problems (MOPs), which often involve multiple conflicting objectives to be optimized simultaneously. Recently, a number of multi-objective evolutionary algorithms (MOEAs) were developed suggested for these MOPs as they do not require problem specific information. They find a set of non-dominated solutions in a single run. The evolutionary process on which they are based, typically relies on a single genetic operator. Here, we suggest an algorithm which uses a basket of search operators. This is because it is never easy to choose the most suitable operator for a given problem. The novel hybrid non-dominated sorting genetic algorithm (HNSGA) introduced here in this paper and tested on the ZDT (Zitzler-Deb-Thiele) and CEC’09 (2009 IEEE Conference on Evolutionary Computations) benchmark problems specifically formulated for MOEAs. Numerical results prove that the proposed algorithm is competitive with state-of-the-art MOEAs

A subclass of meromorphic Janowski-type multivalent q-starlike functions involving a q-differential operator

Keeping in view the latest trends toward quantum calculus, due to its various applications in physics and applied mathematics, we introduce a new subclass of meromorphic multivalent functions in Janowski domain with the help of the q-differential operator. Furthermore, we investigate some useful geometric and algebraic properties of these functions. We discuss sufficiency criteria, distortion bounds, coefficient estimates, radius of starlikeness, radius of convexity, inclusion property, and convex combinations via some examples and, for some particular cases of the parameters defined, show the credibility of these results. © 2022, The Author(s)

Coefficient Estimates for a Subclass of Meromorphic Multivalent q-Close-to-Convex Functions

By making use of the concept of basic (or q-) calculus, many subclasses of analytic and symmetric q-starlike functions have been defined and studied from different viewpoints and perspectives. In this article, we introduce a new class of meromorphic multivalent close-to-convex functions with the help of a q-differential operator. Furthermore, we investigate some useful properties such as sufficiency criteria, coefficient estimates, distortion theorem, growth theorem, radius of starlikeness, and radius of convexity for this new subclass.</p

Hybrid adaptive evolutionary algorithm based on decomposition

The performance of search operators varies across the different stages of the search/optimization process of evolutionary algorithms (EAs). In general, a single search operator may not do well in all these stages when dealing with different optimization and search problems. To mitigate this, adaptive search operator schemes have been introduced. The idea is that when a search operator hits a difficult patch (under-performs) in the search space, the EA scheme “reacts” to that by potentially calling upon a different search operator. Hence, several multiple-search operator schemes have been proposed and employed within EA. In this paper, a hybrid adaptive evolutionary algorithm based on decomposition (HAEA/D) that employs four different crossover operators is suggested. Its performance has been evaluated on the well-known IEEE CEC’09 test instances. HAEA/D has generated promising results which compare well against several well-known algorithms including MOEA/D, on a number of metrics such as the inverted generational distance (IGD), the hyper-volume, the Gamma and Delta functions. These results are included and discussed in this paper

Hankel inequalities for bounded turning functions in the domain of cosine Hyperbolic function

In the present article, we define and investigate a new subfamily of holomorphic functions connected with the cosine hyperbolic function with bounded turning. Further some interesting results like sharp coefficients bounds, sharp Fekete-Szegö estimate, sharp $2^{nd}$ Hankel determinant and non-sharp $3^{rd}$ order Hankel determinant. Moreover, the same estimates have been investigated for 2-fold, 3-fold symmetric functions, the first four initial sharp bounds of logarithmic coefficient and sharp second Hankel determinant of logarithmic coefficients fort his defined function family

Fuzzy adaptive teaching learning-based optimization for solving unconstrained numerical optimization problems

Teaching learning-based optimization is one of the widely accepted metaheuristic algorithms inspired by teaching and learning within classrooms. It has successfully addressed several real-world optimization problems, but it may still be trapped in local optima and may suffer from the problem of premature convergence in the case of solving some challenging optimization problems. To overcome these drawbacks and to achieve an appropriate percentage of exploitation and exploration, this study presents a new modified teaching learning-based optimization algorithm called the fuzzy adaptive teaching learning-based optimization algorithm. The proposed fuzzy adaptive teaching learning-based optimization algorithm uses three measures from the search space, namely, quality measure, diversification measure, and intensification measure. As the 50-50 probabilities for exploitation and exploration in the basic teaching learning-based optimization algorithm may be counterproductive, the Mamdani-type fuzzy inference system of the new algorithm takes these measures as a crisp inputs and generates selection as crisp output to choose either exploitation or exploration based on the current search requirement. This fuzzy-based adaptive selection helps to adequately balance global search or exploration and local search or exploitation operations during the search process as these operations are intrinsically dynamic. The performance of the fuzzy adaptive teaching learning-based optimization is evaluated against other metaheuristic algorithms including basic teaching learning-based optimization on 23 unconstrained global test functions. Moreover, adaptive teaching learning-based optimization is used to search for near-optimal values for the four parameters of the COCOMO II model, which are then tested for validity on a software project of NASA. Analysis and comparison of the obtained results indicate the efficiency and competitiveness of the proposed algorithm in addressing unconstrained continuous optimization tasks

Optimization of Interval Type-2 Fuzzy Logic System Using Grasshopper Optimization Algorithm

The estimation of the fuzzy membership function parameters for interval type 2 fuzzy logic system (IT2-FLS) is a challenging task in the presence of uncertainty and imprecision. Grasshopper optimization algorithm (GOA) is a fresh population based meta-heuristic algorithm that mimics the swarming behavior of grasshoppers in nature, which has good convergence ability towards optima. The main objective of this paper is to apply GOA to estimate the optimal parameters of the Gaussian membership function in an IT2-FLS. The antecedent part parameters (Gaussian membership function parameters) are encoded as a population of artificial swarm of grasshoppers and optimized using its algorithm. Tuning of the consequent part parameters are accomplished using extreme learning machine. The optimized IT2-FLS (GOAIT2FELM) obtained the optimal premise parameters based on tuned consequent part parameters and is then applied on the Australian national electricity market data for the forecasting of electricity loads and prices. The forecasting performance of the proposed model is compared with other population-based optimized IT2-FLS including genetic algorithm and artificial bee colony optimization algorithm. Analysis of the performance, on the same data-sets, reveals that the proposed GOAIT2FELM could be a better approach for improving the accuracy of the IT2-FLS as compared to other variants of the optimized IT2-FLS