Search

This review aims to exploit a study on different benchmark test functions used to evaluate the performance of Meta-Heuristic (MH) optimization techniques. The performance of the MH optimization techniques is evaluated with the different sets of mathematical benchmark test functions and various real-world engineering design problems. These benchmark test functions can help to identify the strengths and weaknesses of newly proposed MH optimization techniques. This review paper presents 215 mathematical test functions, including mathematical equations, characteristics, search space and global minima of the objective function and 57 real-world engineering design problems, including mathematical equations, constraints, and boundary conditions of the objective functions carried out from the literature. The MATLAB code references for mathematical benchmark test functions and real-world design problems, including the Congress of Evolutionary Computation (CEC) and Genetic and Evolutionary Computation Conference (GECCO) test suite, are presented in this paper. Also, the winners of CEC are highlighted with their reference papers. This paper also comprehensively reviews the literature related to benchmark test functions and real-world engineering design challenges using a bibliometric approach. This bibliometric analysis aims to analyze the number of publications, prolific authors, academic institutions, and country contributions to assess the field's growth and development. This paper will inspire researchers to innovate effective approaches for handling inequality and equality constraints. [ABSTRACT FROM AUTHOR]

This paper presents an improved arithmetic optimization algorithm that incorporates hybrid elite pool strategies to address the limitations of the arithmetic optimization algorithm (AOA). In AOA, the linear mathematical optimization acceleration (MOA) function cannot balance global exploitation and local exploration well. Therefore, the accuracy and convergence speed of the algorithm cannot be guaranteed. To improve the performance of AOA, this paper reconstructed a nonlinear MOA function, which is expected to balance the exploitation and the exploration of AOA. Furthermore, four hybrid elite pool strategies are integrated to enhance the ability to escape local optima. The proposed algorithm inherits the fast convergence of AOA and develops the performance of escaping local optima. Numerical experiment results on benchmark functions and engineering problems show that the proposed algorithm outperforms other compared meta-heuristic algorithms in terms of convergence speed and accuracy. [ABSTRACT FROM AUTHOR]

Teaching–learning-based optimization (TLBO) algorithm is an excellent human-inspired optimization technique. This paper proposes an innovative improved version of TLBO—collectivism teaching–learning-based optimization (CTLBO) algorithm. This algorithm imitates group and individual behaviours in the reality of teaching and learning, applies group-individual multi-mode cooperation strategies to form new search mechanism. The CTLBO contains three phases, i.e. preparation phase, teaching and learning phases. In the preparation phase, there are two operators, i.e. teacher self-learning and teacher-learner interaction operators. In the teaching phase, class teaching and performance-based group teaching operators are implied. In the learning phase, neighbour learning, student self-learning and team-learning strategies are mixed together to form three operators. Two sets of experiments are conducted to test the performance of CTLBO. The first set of experiments validates the improvement effect of CTLBO by comparing it with the original TLBO and other authors' improved versions of TLBO. The second set of experiments illustrates the advantage of CTLBO by comparing it with other 17 meta-heuristic algorithms in solving 30 general benchmark functions and 15 CEC2015 test suit functions. The results of experiments show that CTLBO algorithm has significant improvement effect compared with TLBO. It is the most effective one amongst the improved versions of TLBO selected for comparison, and outperforms all other 17 meta-heuristic algorithms. The algorithm can significantly improve the convergence ability and the accuracy in solving different-scale complex optimization models. [ABSTRACT FROM AUTHOR]

In large-scale multi-objective optimization problems (LSMOPs), multiple conflicting objectives and hundreds even thousands of decision variables are contained. Therefore, it is a great challenge to address LSMOPs due to the curse of dimensionality. To tackle LSMOPs, this paper proposes a resource allocation-based multi-objective optimization evolutionary algorithm. In the proposed algorithm, decision variables are firstly divided into convergence-related variables and diversity-related variables by the proposed layer thickness-based variable classification (LTVC) method. Then, a resource allocation-based convergence optimization strategy is introduced for the convergence-related variables, which can allocate more computational resource to the sub-component with the best contribution. For the diversity-related variables, diversity optimization technique is adopted. Finally, the experimental results verify that the proposed algorithm has a competitive performance compared with some state-of-the-art algorithms. [ABSTRACT FROM AUTHOR]

This paper analyzes the numerical stability of Markowitz portfolio optimization model, by identifying and studying a source of instability, that strictly depends on the mathematical structure of the optimization problem and its constraints. As a consequence, it is shown how standard portfolio optimization models can result in an unstable model also when the covariance matrix is well conditioned and the objective function is numerically stable. This depends on the fact that the linear equality constraints of the model very often suffer of almost collinearity and/or bad scaling. A theoretical approach is proposed that exploiting an equivalent formulation of the original optimization problem considerably reduces such structural component of instability. The effectiveness of the proposal is empirically certified through applications on real financial data when numerical optimization approaches are needed to compute the optimal portfolio. Gurobi and MATLAB's solvers quadprog and fmincon are compared in terms of convergence performances. [ABSTRACT FROM AUTHOR]

Archimedes optimization algorithm (AOA) is a new meta-heuristic algorithm which is based on Archimedes principle and mimics the buoyancy force received by an object in water. The AOA is designed according to physical principles and has been the object of many scholars' research because of its simple and reliable performance. In the course of the study, this paper finds that the AOA is flawed. In the iterative update of the algorithm, the buoyancy principle applied to the object is not completely followed. Through the investigation and analysis of this problem, it is found that the algorithm design which follows the buoyancy principle completely is more advantageously and persuasively, and named the corrected algorithm CAOA. The performance of the CAOA and other comparison optimization algorithms is tested in benchmark functions CEC2017 under equal conditions to verify the ideas proposed in this paper. In the solution accuracy with dimensions of 30 and 50, the comprehensive score of the CAOA is 31 and 33 and ranks first in all algorithms. In the statistical analysis, the CAOA compared with other algorithms one by one, and achieved the best results in all test functions. When compared with other algorithms, the CAOA ranked first. It is hoped that the verification of the ideas in this paper will help the AOA to develop better and optimize the development of the algorithm. [ABSTRACT FROM AUTHOR]

This paper presents a new hybrid genetic-particle swarm optimization (GPSO) algorithm for solving multi-constrained optimization problems. This algorithm is different from the traditional GPSO algorithm, which adopts genetic algorithm (GA) and particle swarm optimization (PSO) in series, and it combines PSO and GA through parallel architecture, so as to make full use of the high efficiency of PSO and the global optimization ability of GA. The algorithm takes PSO as the main body and runs PSO at the initial stage of optimization, while GA does not participate in operation. When the global best value (gbest) does not change for successive generations, it is assumed that it falls into local optimum. At this time, GA is used to replace PSO for particle selection, crossover and mutation operations to update particles and help particles jump out of local optimum. In addition, the GPSO adopts adaptive inertia weight, adaptive mutation parameters and multi-point crossover operation between particles and personal best value (pbest) to improve the optimization ability of the algorithm. Finally, this paper uses a nonlinear constraint problem (Himmelblau's nonlinear optimization problem) and three structural optimization problems (pressure vessel design problem, the welded beam design problem and the gear train design problem) as test functions and compares the proposed GPSO with the traditional GPSO, dingo optimization algorithm, whale optimization algorithm and grey wolf optimizer. The performance evaluation of the proposed algorithm is carried out by using the evaluation indexes such as best value, mean value, median value, worst value, standard deviation, operation time and convergence speed. The comparison results show that the proposed GPSO has obvious advantages in finding the optimal value, convergence speed and time overhead. [ABSTRACT FROM AUTHOR]

Human facial analysis (HFA) has recently become an attractive topic for computer vision research due to technological progress and mobile applications. HFA explores several issues as gender recognition (GR), facial expression, age, and race recognition for automatically understanding social life. This study explores HFA from the angle of recognizing a person's gender from their face. Several hard challenges are provoked, such as illumination, occlusion, facial emotions, quality, and angle of capture by cameras, making gender recognition more difficult for machines. The Archimedes optimization algorithm (AOA) was recently designed as a metaheuristic-based population optimization method, inspired by the Archimedes theory's physical notion. Compared to other swarm algorithms in the realm of optimization, this method promotes a good balance between exploration and exploitation. The convergence area is increased By incorporating extra data into the solution, such as volume and density. Because of the preceding benefits of AOA and the fact that it has not been used to choose the best area of the face, we propose utilizing a wrapper feature selection technique, which is a real motivation in the field of computer vision and machine learning. The paper's primary purpose is to automatically determine the optimal face area using AOA to recognize the gender of a human person categorized by two classes (Men and women). In this paper, the facial image is divided into several subregions (blocks), where each area provides a vector of characteristics using one method from handcrafted techniques as the local binary pattern (LBP), histogram-oriented gradient (HOG), or gray-level co-occurrence matrix (GLCM). Two experiments assess the proposed method (AOA): The first employs two benchmarking datasets: the Georgia Tech Face dataset (GT) and the Brazilian FEI dataset. The second experiment represents a more challenging large dataset that uses Gallagher's uncontrolled dataset. The experimental results show the good performance of AOA compared to other recent and competitive optimizers for all datasets. In terms of accuracy, the AOA-based LBP outperforms the state-of-the-art deep convolutional neural network (CNN) with 96.08% for the Gallagher's dataset. [ABSTRACT FROM AUTHOR]

Complex system optimization is an emerging research topic in the field of evolutionary computation, whose goal is to handle complex systems with multiple coupled subsystems, each including multiple objectives and multiple constraints in real-world applications. This paper proposes a multi-system genetic algorithm (MSGA), stemming from implicit parallelism in population-based search algorithms, to solve multiple coupled subsystems simultaneously in a complex system. The proposed MSGA is composed of within-subsystem evolution and cross-subsystem migration operators. The objective of the former is to optimize each subsystem by appropriate search strategies, and the objective of the latter is to exchange information between multiple subsystems by migration, which is based on the similarity probability of objectives and constraints, and the intersection probability of solutions in different subsystems. During migration across subsystems, three statistical approaches of measuring similarity and three metrics of solution intersection in information theory are used to calculate these probabilities. Performance is tested on a set of multi-subsystem benchmark functions, and the simulation results show that cross-subsystem migration plays the key role for the performance of MSGA. Furthermore, the proposed MSGA is compared with other competitive algorithms, and results show that it is a promising multi-system optimization algorithm. In summary, the contribution of this paper is the introduction of multi-system optimization to the EA community. [ABSTRACT FROM AUTHOR]

The application of three different categories such as swarm-based, physics-based, and evolutionary-based techniques to various optimization problems related to different fields gained importance due to accuracy, speed and least chance to fall in local minima. Although there are number of physics based optimization techniques available to solve the optimization problems, however, they suffer from their complexity and may require multiple runs to achieve the optimum value. This paper focuses on a simple physics based problem which outperforms few of the existing algorithms. This work investigates the physics-based Lens formula integration using a population-based approach. The contender for a population-level solution to picture obstructions created by a convex, concave, or combination of the two lenses is the item with multiple dimensional locations. The object's location is updated using the image position. The fundamental goals of population-based optimization algorithms are highlighted by the concave, convex, or combination of both lenses, which enhances the speed of exploration, exploitation, and local optimum avoidance of the search space. The focal length equation, controls how the object's picture is produced, may be altered by specifying a number of random and adaptive factors to highlight the exploitation and exploration of the search space. The capacity of the proposed algorithm for exploitation, exploration, utilisation of the search space, avoidance of local minima, and attainment of global maxima is validated using unimodal, multimodal, and composite benchmark functions. In addition, a variety of real-world engineering issues taken into account to verify the performance of the proposed algorithm. The observations compared with few fundamental optimization techniques of the same category and found the proposed solution better performing in some context than the existing ones. [ABSTRACT FROM AUTHOR]

The transportation problems, which consist of multiple objectives with heterogeneous conveyances, are the pragmatic representation of the transportation occurring in the real world. However, situations do exist where the solutions obtained by the classical optimization techniques do not reflect the acumen of the decision-maker. Against this backdrop, a systematic algorithm is proposed in this paper to generate an initial population to tackle the multi-objective solid transportation problem efficiently. In addition, the non-dominated sorting genetic algorithm (NSGA) III is carried out to acquire solutions that can demonstrate the varying degrees of objectives. Furthermore, two problems of different sizes are framed, and their performance is compared via NSGA II, hybrid genetic algorithm, and fuzzy programming technique. [ABSTRACT FROM AUTHOR]

In this paper Enhanced Heat Transfer Search algorithm and Enriched Replicated Coronary Circulation System Optimization algorithm are applied to solve the real power loss reduction problem. Key objectives of the paper are Voltage stability enhancement, Voltage deviation minimization and real power loss reduction. Heat transfer algorithm has been designed on the basis of law of thermodynamic state. It is regular procedure that any organism will try to attain to reach the state of equilibrium with respect to the environments. Heat transfer will occur by conduction, convection and radiation. Through arbitrarily engendered population, Heat transfer algorithm is designed with molecules and the temperature conditions. Population is modernized in every generation through arbitrarily designated heat transmission methods. In the enhanced heat transfer search algorithm reinforcement of population has been intermingled with the algorithm. Synchronized heat transfer and population reinforcement are amalgamated into the Heat Transfer Search algorithm to augment the quickness in the exploration procedure, to progress the convergence degree, and to evade local optimum. Replicated Coronary Circulation System Optimization Algorithm has been designed by emulating the activities of human heart veins (coronary artery progress). In the proposed algorithm contender solution is formulated by considering capillaries actions. Subsequently the Coronary progress factor evaluates the solution and population the area has been originated capriciously. In the Enhanced Replicated Coronary Circulation System Optimization Algorithm the Heart memory will stock pile the finest solutions and modernize them sequentially. The HMYempowers to have a sturdier exploitation and improved convergence. Additionally, method applied to modify some modules of capillaries frontrunners which helps the procedure to spurt from local optima solution. Proposed Enhanced Heat Transfer Search algorithm and Enriched Replicated Coronary Circulation System Optimization algorithm are appraised in IEEE 30 bus system and IEEE 14, 30, 57, 118, 300 bus test systems without considering the voltage constancy index. True power loss lessening, voltage divergence curtailing, and voltage constancy index augmentation have been attained. [ABSTRACT FROM AUTHOR]

In this paper, Belleville Washer Search optimization algorithm, Papilionoidea Optimization Algorithm, Opposition-based Learning integrated with Papilionoidea Optimization Algorithm, Chaotic Local Search integrated with Papilionoidea Optimization Algorithm and then both the Opposition-based Learning and Chaotic Local Search combined with Papilionoidea Optimization Algorithm are designed to solve the optimization problem. Key objectives of the paper are the minimization of voltage deviation, voltage stability enhancement and power loss reduction. Belleville washer is coned-disc spring, which can encumber the length of its axis by static and dynamic mode. Belleville washers are helpful for modification since dissimilar breadth can be exchanged within and away and it can be used to attain vast tune of coil rate. They are perfect in circumstances wherever a weighty coil power is necessary with least complimentary distance end to end and firmness previous to attainment of firm elevation. Fundamental law of force has been employed to design the Belleville Washer Search optimization algorithm. Belleville washer impresses a force on the particle in horizontal direction and an external force pressure the particle in anti-clockwise direction. Belleville washer's force is equal to the peripheral force in the period of time the particle will be in balanced condition. Initially, the particle moves certain distance, and Belleville washer's force will tender a resistance over the particle during the time peripheral force acting over the particle. Stiffness property of the Belleville washer is tailored relative to the objective function. Force and movement of the particle have been observed. Papilionoidea Optimization Algorithm is based on performance of the Papilionoidea in nutrition foraging. Opposition-based Learning is a technique integrated with Papilionoidea Optimization Algorithm. Through this, exploration capability of the process will be enriched and convergence rate will be augmented. Then, in this work, Chaotic Local Search integrated with Papilionoidea Optimization Algorithm. Through this integration, the algorithm will balance the exploration and exploitation equally. Then, both the Opposition-based Learning and Chaotic Local Search has been integrated with Papilionoidea Optimization Algorithm. With and without voltage stability, index Belleville Washer Search optimization algorithm, Papilionoidea Optimization Algorithm, Opposition-based Learning integrated with Papilionoidea Optimization Algorithm, Chaotic Local Search integrated with Papilionoidea Optimization Algorithm and then both the Opposition-based Learning and Chaotic Local Search combined with Papilionoidea Optimization Algorithm are corroborated in standard IEEE 30-bus test systems. Proposed algorithms condensed the power loss competently with augmentation in voltage stability and minimization of voltage deviation. [ABSTRACT FROM AUTHOR]

This paper proposes a new population-based optimization algorithm called hunter–prey optimizer (HPO). This algorithm is inspired by the behavior of predator animals such as lions, leopards and wolves, and preys such as stag and gazelle. There are many scenarios of animal hunting behavior, and some of them have transformed into optimization algorithms. The scenario used in this paper is different from the scenario of the previous algorithms. In the proposed approach, a prey and predator population, and a predator attacks a prey that moves away from the prey population. The hunter adjusts his position toward this far prey, and the prey adjusts his position toward a safe place. The search agent's position that was the best value of the fitness function considered a safe place. The HPO algorithm implemented on several test functions to evaluate its performance. Also, to performance verification, the proposed algorithm is applied to several engineering problems. The results showed that the proposed algorithm performed effective in solving test functions and engineering problems. [ABSTRACT FROM AUTHOR]

In PV power generation systems, flexible power point tracking control needs to be introduced to regulate the output power on the PV side for meeting the grid connection requirements. However, traditional FPPT control methods tend to cause certain oscillations in the system. This paper proposes an FPPT method based on the adaptive lion swarm optimization algorithm (ALSO). First, an ALSO algorithm is proposed, which adds adaptive scaling parameters to the lion swarm optimization algorithm, so that the number of adult lions can be adjusted adaptively with increasing iterations to coordinate the local exploitation and global search abilities of the algorithm. Then the ALSO is used to selectively optimize the operation of different intervals so as to achieve the FPPT control on the left or right side of the maximum power point. The test experiments for the ALSO algorithm show that the ALSO algorithm has strong local exploitation and global search abilities, which is better than the compared algorithms. Through the simulations on the PV grid-connected system, the validity and superiority of the ALSO-based method over the traditional FPPT algorithm in terms of dynamic and steady-state performance are verified under different operating conditions. [ABSTRACT FROM AUTHOR]

Because of the complexity of data sets from the real world, it is difficult to classify the data sets clearly and effectively, thus we prefer to adopt fuzzy clustering approaches to analyze the data sets. However, due to the variety of fuzzy clustering algorithms, the different number of clusters will lead to different clustering results. The number of clusters is closely related to the clustering division, so how to determine the number of fuzzy clustering (k) has become a problem. Until now, many researchers have proposed utilizing fuzzy clustering validity indexes to deal with this kind of problem. However, the effectiveness index of fuzzy clustering can only be evaluated on the basis of the fuzzy clustering algorithm FCM to divide the clusters. When the range of k value is too large, FCM's clustering for different k values is quite time-consuming. From this perspective, this paper proposes a fuzzy clustering optimal k selection method based on multi-objective optimization (FMOEA-K). Different from the traditional methods, this method combines the fuzzy clustering effectiveness index with multi-objective optimization algorithm (MOEA), and uses multi-objective optimization algorithm to search the appropriate cluster center concurrently. Because of the concurrency of the multi-objective optimization algorithm, the calculation time is shortened. The experimental results show that compared with the traditional method, the FMOEA-K can shorten the calculation time and improve the accuracy of calculating the optimal k value. [ABSTRACT FROM AUTHOR]

This paper presents a novel medical image processing technique for analyzing different peripheral blood cells such as monocytes, lymphocytes, neutrophils, eosinophils, basophils, and macrophages. However, the existing systems suffered from low accuracy while classifying the different blood cell images and also consume higher processing power. The proposed model consists of two major steps such as segmentation and classification of peripheral blood cells. The modified local-information weighted intuitionistic Fuzzy C-means clustering (MLWIFCM)-based golden eagle optimization algorithm performs the nucleus segmentation. Finally, the peripheral blood cell classes such as Basophil, Lymphocyte, Neutrophil, Monocyte, and Eosinophil are effectively classified using hybrid-parameter RNN-based remora optimization algorithm. The MATLAB R2019b is used as the implementation platform. To analyze the performances of our proposed method, we have taken two datasets; they are BCCD and LISC datasets. Meanwhile, the classification performances were analyzed with the aid of different performance metrics such as mean accuracy, mean intersection over union, mean average precision, and mean BF score values. [ABSTRACT FROM AUTHOR]

Segmentation refers to the process of dividing an image into multiple regions based on some criteria such as intensity and color. In recent years, color image segmentation has received considerable attention from the researchers. However, it is still a highly complicated task due to the presence of more attributes or components as compared to monochrome images. Numerous meta-heuristics algorithms are developed to determine the optimal threshold value for segmenting color images efficiently. This paper presents an enhanced sine cosine algorithm (ESCA) to seek threshold for segmenting color images. Sine cosine algorithm (SCA) is a population-based optimization algorithm which has the ability of preventing local minima problem. First an input image is transformed to CIE L*a*b* color reduced space. ESCA is applied to determine the optimal threshold values for segmentation. The performance of the proposed method is tested on color images from Berkeley database, and segmentation results are compared with two metaheuristic algorithms, namely particle swarm optimization (PSO) and standard SCA. Experimental results are validated by measuring peak signal–noise ratio (PSNR), structural similarity index and computation time for all the images investigated. Results revealed that the proposed method outperforms the other methods like PSO and SCA by achieving PSNR of 23 dB and SSIM of 0.93 and also require less time for finding optimal threshold values than PSO and SCA. [ABSTRACT FROM AUTHOR]

Cloud computing provides a wide variety of services, from small to big businesses, to individual consumers. Cloud computing's features entice users to migrate their operations from traditional platforms to cloud platforms. In comparison to traditional systems, cloud computing has an extremely powerful processing capacity. Requests for resources are considered tasks in the cloud, and appropriate resources are allocated depending on user needs. However, owing to high demand and volume of requests, cloud struggles to allocate resources. Task schedulers are employed in cloud computing to address these issues. Various task scheduling methods have been presented in several research publications, and the quest for a better scheduling model continues. In this paper, a task scheduling method based on a hybrid optimization algorithm is presented, which effectively schedules jobs with the least amount of waiting time. In addition to these, other parameters, such as the overall production time, execution time, waiting time, efficiency, and utilization are included in this study. The simulation results show that the proposed scheduling method is superior to conventional Ant Colony and Particle Swarm Optimization-based scheduling algorithms in terms of performance. [ABSTRACT FROM AUTHOR]

Traditional folk crafts are handicrafts and corresponding activities created by Chinese working people in all ages to meet their material and spiritual needs by using various material materials and handicrafts. It reflects the general characteristics of arts and crafts, but also shows the distinctive personality of national culture. The folk printing and dyeing process of Miao Nationality in Xiangxi and Southeast Guizhou has this characteristic, which once brought a lot of convenience to people's life and became an important part of people's life at that time. Traditional art carries a lot of spiritual things in its material form, so it has high esthetic value, cultural value and profound spiritual connotation. Therefore, the optimization design of traditional printing and dyeing process framework in Xiangxi is worth studying. In this paper, through using big data pattern mining algorithm and scene understanding algorithm, a framework optimization system of traditional printing and dyeing process in Xiangxi is constructed, for the optimization of the traditional model, the edge-driven scene model is applied for the systematic study. The designed model is simulated through the testing on different data sets. Reflecting from the experimental result, we can conclude that the proposed model is efficient. [ABSTRACT FROM AUTHOR]

Combined heat and power economic dispatch (CHPED) problem is one of the challenging issues in power system control, and operation, that searches for the optimal values of power and heat generation of different units to minimize the total operation cost. The interdependency of heat and power outputs of CHP units and valve point loading effects of power-only units make this problem very nonlinear and non-convex. So far, a wide variety of optimization algorithms based on simulation of various natural phenomena have been proposed and applied to solve this complex problem, claiming that the proposed algorithm is better than the similar optimization algorithms in terms of accuracy and run-time. In this paper, the CHPED problem is investigated in different case studies by using the imperialist competitive Harris hawks optimization (ICHHO) algorithm, as a combination of the imperialist competitive algorithm and Harris hawks optimization. The effectiveness of the proposed algorithm is first evaluated by testing it on the standard cases of 5, and 7 units as small-scale systems and 48-unit as the large-scale test system, considering the electrical losses. Also for the first time, the multi-zone CHPED (MZCHPED) problem is solved by a metaheuristic algorithm. The obtained results show that ICHHO algorithm reduces the operating costs in the range of 0.02–1.1%, compared to the best-reported results, in different single-zone CHPED (SZCHPED) problems. Also, the MZCHPED results, prove the effective performance of the algorithm compared to the similar SZCHPED problem. [ABSTRACT FROM AUTHOR]

The feed forward neural network (FNN) has a significant breakthrough in recent times in solving different real-life complex problems. The success of FNN is primarily attributed to its architecture, the optimization technique used, and the tuning of hyper-parameters to identify different patterns in data. This study tries to find an optimization technique that will play a vital role in an FNN to get better results. Whale optimization algorithm (WOA) is one of the popular nature-inspired optimization techniques used to solve real-time sciences and engineering problems. A new optimization approach namely chaotic oppositional-based whale optimization algorithm (COWOA) is developed in this paper, for the first time, to discuss the FNN problems of four different dataset by integrating chaotic function and oppositional-based learning with WOA. Simulation results are presented to validate the success of the suggested COWOA approach and demonstrate its dominance over basic WOA, chaotic WOA (CWOA), particle swarm optimization (PSO), Adam optimization algorithm (AOA), and stochastic gradient descent (SGD) for both unimodal and multimodal dataset problems. The comparative analysis with other optimization techniques validates its superiority and robustness on four standard dataset of FNN problem. Furthermore, to validate the performance of the proposed algorithm, a statistical analysis is performed. The outcome of the statistical results validates the superiority and acceptability of COWOA over other optimization methods. [ABSTRACT FROM AUTHOR]

A biomedical application of a novel metaheuristic optimizer is proposed in this paper by constructing an enhanced arithmetic optimization algorithm (AOA). The latter algorithm was constructed using the logarithmic spiral (Ls) search mechanism from the whale optimization algorithm and the greedy selection scheme from the differential evolution algorithm. The proposed algorithm (Ls-AOA) was tested against unimodal and multimodal benchmark functions and demonstrated better capability comparatively using other efficient metaheuristic algorithms reported in the literature. The constructed Ls-AOA algorithm was then proposed to design a proportional-integral-derivative (PID) controller employed in a functional electrical stimulation (FES) system for the first time. The initial statistical and convergence profile assessment showed better performance of the proposed algorithm. The comparative analyses for transient and frequency responses were performed for the PID-controlled FES system using the original AOA, sine–cosine and particle swarm optimization algorithms and the traditional Ziegler-Nichols tuning scheme. Similarly, the FES system tuned with the latter methods was also assessed for disturbance rejection and noise elimination. All the comparative analyses demonstrated that the proposed Ls-AOA has the greater capability for the challenging biomedical FES system. [ABSTRACT FROM AUTHOR]

In industrial applications and automation, the robotic manipulators exhibit a significant role. Several complex robotic systems performed a number of industrial works named spray painting, welding, assembly, pick and place action, etc. The end-effector's position and the joint angles play a vital role since any task is activated inside the pre-defined robotic manipulator's work space. Also, the problem of trajectory planning is a very challenging task in the robotic fields. To solve these problems, this paper proposes a kinematics analysis and trajectory planning of an Industrial robotic manipulators (IRMs) based on the hybrid optimization algorithms. Here, three IRMs such as PUMA 560 (6 DOF), KUKA LBR iiwa 14 R820 (7DOF) and ABB IRB 140 (6DOF) are considered. For each robot, the forward and the inverse kinematics (IK) are analysed and also the trajectory planning of each robot is discussed using the hybrid optimization algorithms. In this work, 18 optimization algorithms such as PSO (particle swarm optimization), SSO (social spider optimization), DFO (dragonfly optimization), BOA (butterfly optimization), CSA (crow search algorithm), BSA (bird swarm algorithm), SHO (selfish herd optimization), KHO (krill herd optimization), ALO (antlion optimization), ACO (ant colony optimization), GWO (Grey wolf optimization), GOA (grasshopper optimization), SBO (satin bowerbird optimizer), WCO (world cup optimization), COA (cuckoo optimization algorithm), CFA (cuttlefish algorithm), SOA (seagull optimization algorithm), and TSA (tunicate swarm algorithm) are utilized for both forward and inverse kinematic analysis and the trajectory planning problem. For the PUMA 560, KUKA LBR iiwa 14 R820, and ABB IRB 140 IRMs, forward kinematics (FK) are solved by the hybrid combination of PSO-SSO, SHO-KHO, and SBO-WCO individually. Also, the IK are solved by the DFO-BOA, ALO-ACO and COA-CFA for each IRMs. The trajectory planning problem is solved by the CSA-BSA, GWO-GOA and SOA-TSA for each robot individually. These optimization techniques give number of solution for kinematics and trajectory problem but it converses the best solution for the minimum multi-objective function value. Each robot obtained the minimum travelling time for without and with an obstacle which is 0.0118 and 0.0313 s for PUMA and 0.0117 and 0.0310 s for KUKA, and 0.0114 and 0.0120 s for ABB IRB 140 robot. The advantages of these hybrid algorithm are shorter computation time, and fewer iterations. The kinematics and trajectory analysis of each IRM is simulated using robotic tool box in MATLAB with GUI interface. For each IRM, optimized position values of the end effector, joint angles and the best optimal path are computed with minimum objective function. Finally, the performance of each robot is compared to the existing robotic works. [ABSTRACT FROM AUTHOR]

In this paper, the combination of particle swarm optimization (PSO) and gravitational search algorithm (GSA) is enhanced by the first-order gradient method and a new optimization algorithm is introduced as GPSG. In metaheuristic methods, some search directions are randomly selected and the resulting information gradually progresses toward the optimal solution. Since along the gradient direction usually yields the largest decrease in the desired function, it is added to the GSA and PSO process to allow for faster and more accurate convergence. By integrating the metaheuristic methods with the gradient directions, a powerful method for optimizing functions has been made possible. A novel approach is introduced by merging two metaheuristic methods with the randomly generated steepest decent directions. Numerous examples of unconstrained problems of mathematical functions of CEC2005 and CEC2017 together with some constrained examples of stress and displacement structural design problems have been chosen to demonstrate the reliability and capability of the presented method. Comparison of the numerical results with some methods indicates that the average rank of the proposed technique is better. [ABSTRACT FROM AUTHOR]

Cloud services with the property of elasticity are always bearing different loads over time. The efficiency of cloud management can be improved through the accurate prediction for cloud loads, which can be served as the foundation and recommendation for the future developing of the network scheme. As the basis and premise for management and decision making, a good prediction depends on suitable models and research methods. However, the interaction of users and the cloud network is high variability in the time and spatial dimensions, so traditional linear forecasting models cannot always process cloud computing loads well because of nonlinear changes. In this paper, a novel cloud load prediction model is proposed by improving whale optimization algorithm based on the hybrid strategy (HWOA) and combined with extreme learning machine (ELM) for strong nonlinear mapping ability. The proposed cloud load forecasting model is to employ HWOA optimizer to optimize the ELM model random parameters. Main research work includes that (1) the HWOA optimizer is to solve the whale optimizer local extremum problem; (2) the proposed HWOA optimizer reduces the ELM random parameters on cloud load forecasting; (3) the convergence performance is verified by benchmark testing functions; and (4) three groups of simulation experiments are conducted to evaluate the cloud load forecasting results. The results prove that the HWOA optimizer has a good convergence and outperforms the several conventional popular swarm intelligence optimizers. Also, the prediction results verify that our proposed model is more competitive for providing a solid foundation for efficient resource management and maximized economic benefits in cloud environment. For cloud load research groups and practitioners, this paper provides a new idea of cloud load forecasting. [ABSTRACT FROM AUTHOR]

The optimal operation of microgrids consists of renewable energy sources (RESs) play a key role in reducing greenhouse gasses and costs of operation. This paper suggests a stochastic optimal operation for an MG consisting of several RESs, storage systems and plug-in hybrid electric vehicles (PHEVs). The uncertainties of the MG are modeled through Monte Carlo simulation. The grasshopper optimization algorithm is employed here for optimizing the power management of the MG and various charging uncertain characteristics of PHEVs. Several simulations are provided to confirm the usefulness of the proposed model. The results validate that the recommended model can properly minimize the operation cost of the MG and reduce environmental pollution. Moreover, the optimal operation of the MG is promoted with several economic and technical benefits when integrating storage and PHEVs into the system. [ABSTRACT FROM AUTHOR]

In this paper, an enhanced version of the salp swarm algorithm (SSA) for global optimization problems was developed. Two improvements have been proposed: (i) Diversification of the SSA population referred as SSA std , (ii) SSA parameters are tuned using a self-adaptive technique-based genetic algorithm (GA) referred as SSA G A - t u n e r . The novelty of developing a self-adaptive SSA is to enhance its performance through balancing search exploration and exploitation. The enhanced SSA versions are evaluated using twelve benchmark functions. The diversified population of SSA std enhances convergence behavior, and self-adaptive parameter tuning of SSA G A - t u n e r improves the convergence behavior as well, thus improving performance. The comparative evaluation against nine well-established methods shows the superiority of the proposed SSA versions. The enhancement amount in accuracy was between 2.97 and 99% among all versions of algorithm. In a nutshell, the proposed SSA version shows a powerful enhancement that can be applied to a wide range of optimization problems. [ABSTRACT FROM AUTHOR]

In this paper, a cascade control structure with the modified Smith delay compensator for controlling nonsquare MIMO process is proposed. The proposed structure is designed with two disturbance estimators and a setpoint tracking controller. The estimators reject the disturbances in the forward path. These estimators also take part in delay compensation. The design of setpoint tracking controllers and disturbance estimators uses simple mathematical calculations as compared to the conventional IMC-based controllers. In the proposed design, Grey wolf optimization technique has been used to optimize the predictor. The closed-loop system produces the desired servo and regulatory response. The internal stability and robustness of the proposed MIMO cascade control structure have been analyzed. An example of a physical process has been included to illustrate the novelty of the proposed control strategy over multivariable PID controllers in terms of the time-domain performance and delay compensation. query Please check the edit made in the article title. [ABSTRACT FROM AUTHOR]

In recent years, face hallucination (FH) techniques are developed to generate the high-resolution (HR) version of the captured blurry low-resolution face images. The popular FH techniques transform the face hallucination problem as a least square representation (LSR) formulation. The performance of these FH techniques entirely depends on how optimally the LSR problem is minimized. Hence, in this paper, a new FH model using a sparsity-based grey wolf optimization algorithm (named S-GWO-FH) is developed which optimizes the LSR problem more efficiently. The concept of sparsity with GWO helps the proposed FH model in ignoring the dislike training images; consequently, reconstructed images have better personal characteristics. It also helps in minimizing computational overhead as it reduces the population size. Moreover, a domain-specific prior is incorporated to initialize the positions of the grey wolves, which helps the GWO algorithm to converse with the more appropriate solution. Several state-of-the-art nature-inspired optimization algorithms and conventional super-resolution techniques are considered for performance comparison. The experiments results show that the proposed S-GWO-FH model is superior to competitive algorithms in terms of reconstruction capability as well as computation time. [ABSTRACT FROM AUTHOR]

Grasshopper optimization algorithm (GOA) is one of the promising optimization algorithms for optimization problems. However, it has the main drawback of trapping into a local minimum, which causes slow convergence or inability to detect a solution. Several modifications and combinations were suggested to overcome this problem. This paper presents a modified grasshopper optimization algorithm (MGOA)-based genetic algorithm to overcome this problem. Modifications rely on certain mathematical assumptions and varying the domain of the control parameter, Cmax, to escape from the local minimum and move the search process to an improved point. Parameter C is one of the essential parameters in GOA, where it balances the exploration and exploitation of the search space. These modifications aim to speed up the convergence rate by reducing the repeated solutions and the number of iterations. Both the original GOA and the proposed algorithms are tested with 19 main test functions to investigate the influence of the proposed modifications. In addition, the algorithm will be applied to solve five different cases of nonlinear systems with different types of dimensions and regularity to show the reliability and efficiency of the proposed algorithm. Promising results are achieved compared to the original GOA. The proposed approach shows an average percentage of improvement of 96.18 as illustrated in the detailed results. [ABSTRACT FROM AUTHOR]

Indoor air quality (IAQ) is a significant concern for occupant comfort, productivity levels, health, and well-being. The presence of harmful chemicals, inhalable particles, and toxic materials can be ten times worse as compared to outdoor air pollution. The increased concentration of PM10 pollutants in the indoor environment is a serious threat to human health in terms of critical respiratory health issues. Literature supports the application of artificial intelligence for the prediction of pollutant concentrations in building environments. In this paper, we proposed a novel application of fuzzy inference system (FIS) optimized using particle swarm optimization (PSO) and genetic algorithm (GA) for forecasting PM10 concentration. The study was conducted on experimental data obtained from an Internet of Things-based IAQ monitoring system. The real-time monitoring system measures four indoor air pollutants: PM10, PM2.5, CO2, and VOC, along with two crucial thermal comfort parameters (Temperature and Humidity). The forecasting performance of the FIS with normalized dataset was measured in terms of MSE = 4.3656; MAE = 1.9351; MAPE = 9.633% and RMSE = 2.0894. Two optimization algorithms have improved RMSE FIS-PSO = 1.0746; and FIS-GA = 0.998. The optimized FIS can be used to develop real-time air quality prediction systems for indoor environments to promote health and well-being for building occupants. [ABSTRACT FROM AUTHOR]

Out of the various types of skin cancers, melanoma is observed to be the most malignant and fatal type. Early detection of melanoma increases the chances of survival which necessitates the need to develop an intelligent classifier that classifies the dermoscopic images accurately as melanoma or non-melanoma. Features extracted from an image have a major impact on the performance of a classifier. In this paper, handcrafted feature extraction techniques are used to extract features from dermoscopic images. It is quite possible that not all the features extracted from dermoscopic images contribute in the process of classification which imposes the need of selection of significant features from the feature set. Here, two binary variants of Harris Hawk Optimization (HHO) algorithm namely BHHO-S and BHHO-V are presented that employ S-shaped and V-shaped transfer functions with time-dependent behavior, respectively, for feature selection. The selected features are given to a classifier that classifies the dermoscopic image as melanoma or non-melanoma. Comparison of the performance of the proposed methods is done with existing metaheuristic algorithms. The results obtained after experimentation show the superiority of classifier that uses features selected using BHHO-S over BHHO-V and the classifiers that use existing state-of-the-art metaheuristic algorithms. The experimental results also reveal that texture features extracted using local binary pattern along with color features provides higher classification accuracy as compared to global and other local texture feature extraction techniques. [ABSTRACT FROM AUTHOR]

Due to the rapid development of photovoltaic (PV) system and spreading of its application, the accuracy of modeling of solar cells, as the main and basic element of PV systems, is gaining relevance. In this paper, an Enhanced Harris Hawk Optimization Algorithm (EHHO) is proposed and applied for estimating the required parameters of different PV models in an effective and accurate way. Harris Hawk Algorithm (HHO) is based on Hawks ways in hunting and catching their preys. The HHO utilizes two phases including exploration and exploitation. The main purpose of proposed enhancement is to improve the second phase of HHO. This enhancement is performed on the exploration phase by fluctuating toward or outward the best optimal solution using sine and cosine functions. Both conventional and proposed algorithms are applied for single, double and triple diode PV models. In order to test the applicability and robustness of proposed algorithm, it is applied for estimating the parameters of different real PV systems and compared with other recent optimization algorithms. The results show that the proposed EHHO is more accurate than conventional HHO and other algorithms. [ABSTRACT FROM AUTHOR]

The lattice structures use has increased in several sectors due to the potential for mass reduction without significant rigidity loss. In this paper, an isogrid tube multi-objective optimization considering six objectives is presented. The finite element method was applied to develop a numerical model for this complex structure, and a new optimization algorithm called the Multi-objective Lichtenberg Algorithm was used to find all the best possible designs. The optimizations were made considering two methodologies: (i) using a surrogate model derived from the design of experiments considering the response surface model and (ii) finite element updating, a direct link between the meta-heuristic and the numerical model. The latter is unprecedented in the literature for isogrid tubes and proved to be the best methodology, besides not even needing explicit equations. It discovered isogrid tube designs using TOPSIS that reduced at least 45.69% of the mass, 18.4% of the instability coefficient, 61.76% of the TW, and increased the natural frequency by at least 52.57%. The results show that optimizations via finite element updating associated with meta-heuristics not only allow the true interpretation of complex problems nature through real Pareto fronts, but can also deliver innovative results. [ABSTRACT FROM AUTHOR]

With the increasing hazard to the environment and progressions in renewable energy technologies, hybrid renewable energy systems can meet the energy demand. Total dependability can be attained by adding battery banks to hybrid systems. This paper aims to optimally design a multi-source grid isolated hybrid generation system for future smart cities in the state of Tamil Nadu, India. This off-grid power generation consists of wind turbine generators, photovoltaic panels, inverters, diesel generators, and batteries. The design intents at minimizing Net Present Cost, Unmet Load, and CO2 emissions which are conventionally contradictory to each other. This paper analyzes the optimal off-grid combination of components and control strategies, utilizing improved Hybrid Optimization using the Genetic Algorithm. The results obtained portrays that a mix of hybrid renewable energy generators at off-grid locations without diesel generators can be a cost-effective choice of new smart cities, and it is sustainable, environmentally viable, and techno-economically feasible. Subvention is imperative to take on the large-scale system due to the high capital cost. [ABSTRACT FROM AUTHOR]

Most production scheduling problems, including standard flexible job shop scheduling problems, assume that machines are continuously available. However, in most cases, due to preventive maintenance activities, machines may not be available for a certain time. Meanwhile, in the entire workshop production process, the transportation process of workpieces cannot be ignored. Therefore, the impact of transportation on the production planning should be considered in the scheduling process. To consider both preventive maintenance and transportation processes in the flexible job shop scheduling problem, this paper proposes a flexible job shop scheduling problem considering preventive maintenance activities and transportation processes and establishes a multi-objective flexible job shop scheduling model optimizing the total energy consumption and total makespan. Furthermore, a multi-region division sampling strategy-based multi-objective optimization algorithm integrated with a genetic algorithm and a differential evolution algorithm (MDSS-MOGA-DE) is proposed to solve the model. In the proposed algorithm, a multi-region division sampling strategy and two evaluation functions are utilized to improve the diversity of solutions. In addition, this paper combines a genetic operation and a differential operation to further enhance the search ability of the algorithm. The validity of the algorithm is verified by a real case. The computational results reveal that the proposed model and algorithm obtain appropriate results and have the potential to be applied to other similar problems. [ABSTRACT FROM AUTHOR]

Several population-based techniques have subsequently been proposed. Despite their broad use in a variety of applications, we are still investigating the use of proposed methods to tackle real-world challenges. As a result, researchers must considerably modify and enhance their approaches based on the primary evolutionary processes in order to achieve rapid convergence, consistent equilibrium with high-quality data, and optimization. The paper proposes a fusion method (AOA–GOA) meta-heuristic optimization methods for global optimization tasks. They can be applied to different problems, including image processing, machine learning, wireless networks, power systems, engineering design, etc. The method fusion proposed is analyzed in context with GOA and AOA. To evaluate the performance, each method is tested on the same parameters like population size and number of iteration. The proposed IAOA is evaluated by varying the dimensions. The impact of varying dimensions is a standard test used in previous studies for optimizing test functions that show the effect of varying dimensions on efficiency of IAOA. From this, it is noted that it works efficiently for both high and low dimensional problems. In high dimensional problem, the proposed method gives efficient search results. [ABSTRACT FROM AUTHOR]

In the present paper, a physics-inspired metaheuristic algorithm is presented to solve multi-objective optimization problems. The algorithm is developed based on the concept of Newtonian cooling law that recently has been employed by the thermal exchange optimization (TEO) algorithm to solve single-objective optimization problems efficiently. The performance of the multi-objective version of TEO (MOTEO) is examined through bi- and tri-objective mathematical and engineering problems as well as bi-objective structural design examples. According to the comparisons between the MOTEO and several well-known algorithms, the proposed algorithm can provide quality Pareto fronts with appropriate accuracy, uniformity, and coverage for multi-objective problems. [ABSTRACT FROM AUTHOR]

Nowadays, the power system security investigation performs a vital part so as to step up the system security with a view to keep at bay the prospect of system breakdown scenarios. With the ever-zooming power transfer, the hassles encountered by the power system have assumed alarming proportions of added intricacy with dwindling security of the power system in the power industry. In the paper, an enhanced optimal technique is proposed for solving the optimal power flow (OPF) issues with uncertainties. An enhanced technique is the Yin–Yang Pair Optimization algorithm, which is based on maintaining a balance between exploration and exploitation of the search space. Initially, the OPF is analyzed with the N–R approach and after that, the FACTS devices-based power flow is analyzed. The FACTS devices are considered as STATCOM, UPFC and IPFC devices, after the placement of FACTS devices as contingency is relived. Initially, the multi-objective function is defined and the power losses, voltage deviation, investment cost and fuel cost are analyzed. For the OPF analysis, multi-objective functions are considered under the uncertainty period. The proposed method is tested with the IEEE 30- and IEEE 118-bus system, and the corresponding line loading, line outage, generator outage, both outage and bus voltage impact are analyzed. To verify the performances of the proposed method, it is compared with the traditional methods such as Particle Swarm Optimization, Firefly Algorithm, ant Lion Optimization and Bat Optimization. The proposed method is implemented in MATLAB platform and tested with the various cases. [ABSTRACT FROM AUTHOR]

A technique to perform the synthesis of sum patterns which can achieve beam shaping using individual heights of side lobes is presented. The side lobes can be adjusted to any arbitrary specification, and flat-top far-field radiation patterns are generated using enhanced flower pollination algorithm (EFPA) which is discussed in this paper. The problem of designing an array can be expressed as an optimization problem that aims to reduce the first two side lobes to − 50 dB and by reducing the remaining side lobes to − 40 dB in case 1. The EFPA is applied to determine the excitation coefficients of their amplitudes so as to obtain the required pattern. The objective for case 2 is to obtain the flat-top sector beam for specified angular regions. Complex excitation coefficients are determined using EFPA for various beam widths. The radiation patterns are generated numerically using the obtained excitation coefficients. The results reveal that not only the ripples are controlled in the trade-in region, but the side lobe levels are also maintained in the acceptable limits. The results presented are very much useful for marine radar applications. [ABSTRACT FROM AUTHOR]

Multiobjective optimization techniques have much importance while solving real-life problems. There may get chances of neutral thoughts and hesitations in real-life problems. This paper has studied the multiobjective programming problems (MOPPs) under neutrosophic hesitant fuzzy uncertainty. The degrees of neutrality and hesitations in MOPPs were introduced, and simultaneously, we have developed the neutrosophic hesitant fuzzy multiobjective programming problems (NHFMOPPs) under a neutrosophic hesitant fuzzy environment. Besides, a new robust solution scheme, namely neutrosophic hesitant fuzzy Pareto optimal solution to the NHFMOPPs, is investigated, and two different optimization techniques are suggested to evaluate it. The validity and applicability of the proposed methods are unanimously implemented on different multiobjective real-life problems. Finally, conclusions, comparative study, and future research direction are addressed based on the presented work. [ABSTRACT FROM AUTHOR]

Over the last decade, the size and complexity of real-world problems have grown dramatically, necessitating more effective tools. Nature-inspired metaheuristic algorithms have proven to be a promising tool for solving such problems due to their performance in a variety of fields. JAYA algorithm is a novel population-based algorithm which could have been able to present reliable results. This is because it does not need any parameters to be set other than the population size and the maximum number of iteration. Despite its positive feedbacks, this algorithm should be modified to witness more efficiency. This paper aims to amend the original version of Jaya to present a high-efficiency version named Powerful Enhanced Jaya (PEJAYA). In other words, the methodology of updating position in Jaya is modified to enhance the convergence and search capabilities. This approach is assessed according to solve 20 well-known benchmark functions, feature selection, and statistical tests. The output results of proposed optimization algorithm are then evaluated by comparing it with other recent algorithms including crow search algorithm (CSA), standard version of JAYA, particle swarm optimization (PSO), dragonfly algorithm (DA), grasshopper optimization algorithm (GOA), moth-flame optimization (MFO) and sine–cosine algorithm (SCA). Solving a real-world problem is another way of checking the efficiency of this approach with other published works. Prompt escape from local minima, superior convergence, and stability demonstrate that the suggested approach is a very powerful instrument that may be employed in a variety of optimization situations. [ABSTRACT FROM AUTHOR]

This paper introduces a new swarm intelligence strategy, anti-coronavirus optimization (ACVO) algorithm. This algorithm is a multi-agent strategy, in which each agent is a person that tries to stay healthy and slow down the spread of COVID-19 by observing the containment protocols. The algorithm composed of three main steps: social distancing, quarantine, and isolation. In the social distancing phase, the algorithm attempts to maintain a safe physical distance between people and limit close contacts. In the quarantine phase, the algorithm quarantines the suspected people to prevent the spread of disease. Some people who have not followed the health protocols and infected by the virus should be taken care of to get a full recovery. In the isolation phase, the algorithm cared for the infected people to recover their health. The algorithm iteratively applies these operators on the population to find the fittest and healthiest person. The proposed algorithm is evaluated on standard multi-variable single-objective optimization problems and compared with several counterpart algorithms. The results show the superiority of ACVO on most test problems compared with its counterparts. [ABSTRACT FROM AUTHOR]

In this paper, we introduced some new concepts of a neutrosophic set such as neutrosophic convex set, strongly neutrosophic convex set, neutrosophic convex function, strongly neutrosophic convex function, the minimum and maximum of a function f with respect to neutrosophic set, min , and max neutrosophic variational inequality, neutrosophic general convex set, neutrosophic general convex function, and min , max neutrosophic general variational inequality. We introduced some basic results on these new concepts. Moreover, we discussed the application of the neutrosophic set in optimization theory. We developed an algorithm using neutrosophic min and max variational inequalities and identified the maximum and minimum profit of the company. [ABSTRACT FROM AUTHOR]

Many population-dependent solutions have recently been suggested. Despite their widespread adoption in many applications, we are still researching using suggested methods to solve real-world problems. As a result, researchers must significantly adjust and refine their procedures based on the main evolutionary processes to ensure faster convergence, consistent equilibrium with high-quality results, and optimization. Thus, a new hybrid method using Aquila optimizer (AO) and arithmetic optimization algorithm (AOA) is proposed in this paper. AO and AOA are both modern meta-heuristic optimization methods. They can be applied to different problems, including image processing, machine learning, wireless networks, power systems, engineering design etc. The proposed approach is examined concerning AO and AOA. To determine results, each procedure is evaluated using the same parameters, such as population size and several iterations. By changing the dimensions, the proposed approach (AO–AOA) is evaluated. The impact of varying dimensions is a standard test that has been used in previous studies to optimize test functions that demonstrate the influence of varying dimensions on the efficiency of AO–AOA. It is clear from this that it fits well with both high- and low-dimensional problems. Population-based methods achieve efficient search results in high-dimensional problems. [ABSTRACT FROM AUTHOR]

In defence and other personal communication systems, the multicarrier modulation (MCM) is a means to achieve high amount of data rate and proven to be immune to multipath fading channels. Offset quadrature amplitude modulation (OQAM)-based filter bank multicarrier (FBMC) is one of the MCM schemes to satisfy the necessities of destiny Wi-Fi configuration. Like OFDM and different multicarrier schemes, FBMC also exhibits excessive peak-to-average power ratio (PAPR), which leads us to the use of excessive amplifiers with high dynamic range. In this paper, ant colony optimization (ACO) approach is used to reduce the PAPR. A partial transmit sequence (PTS) technique for PAPR reduction of FBMC-OQAM scheme is proposed. PTS combined with optimization technique helps in decreasing the PAPR to a greater extent with the aid of minimizing the PAPR of every facts block and optimizing the usage of every unit. The clipping technique is used to get better the alerts compressed, and the bit error rate (BER) is evaluated on the receiving end. The simulation outcomes show that the proposed approach successfully reduces the excessive peaks inside the FBMC-OQAM system. The experimental results are performed using MATLAB. [ABSTRACT FROM AUTHOR]

An efficient optimization of network weights has been the primary goal of the artificial neural network (ANN) research community since decades. The aim of every optimization problem is to minimize the network cost which is some form of error function between the desired and the actual network outputs, during the training phase. The conventional gradient-based optimization algorithms like backpropagation are likely to get trapped in local minima and are sensitive to choices of initial weights. The evolutionary algorithms have proved their usefulness in introducing randomness into the optimization procedure, since they work on a global search strategy and induce a globally minimum solution for the network weights. In this paper, we particularly focus on ANN trained by Particle Swarm Optimization (ANN-PSO), in which the local-best and global-best particle positions represent possible solutions to the set of network weights. The global-best position of the swarm, which corresponds to the minimum cost function over time, is determined in our work by minimizing a new non-extensive cross-entropy error cost function. The non-extensive cross-entropy is derived from the non-extensive entropy with Gaussian gain that has proven to give minimum values for regular textures containing periodic information represented by uneven probability distributions. The new cross-entropy is defined, and its utility for optimizing the network weights to a globally minimum solution is analyzed in this paper. Extensive experimentation on two different versions: the baseline ANN-PSO and one of its most recent variants IOPSO-BPA, on benchmark datasets from the UCI repository, with comparisons to the state of the art, validates the efficacy of our method. [ABSTRACT FROM AUTHOR]

In this paper, the problem of safe global maximization (it should not be confused with robust optimization) of expensive noisy black-box functions satisfying the Lipschitz condition is considered. The notion "safe" means that the objective function f(x) during optimization should not violate a "safety" threshold, for instance, a certain a priori given value h in a maximization problem. Thus, any new function evaluation (possibly corrupted by noise) must be performed at "safe points" only, namely, at points y for which it is known that the objective function f (y) > h . The main difficulty here consists in the fact that the used optimization algorithm should ensure that the safety constraint will be satisfied at a point ybefore evaluation of f(y) will be executed. Thus, it is required both to determine the safe region Ω within the search domain D and to find the global maximum within Ω . An additional difficulty consists in the fact that these problems should be solved in the presence of the noise. This paper starts with a theoretical study of the problem, and it is shown that even though the objective function f(x) satisfies the Lipschitz condition, traditional Lipschitz minorants and majorants cannot be used due to the presence of the noise. Then, a δ -Lipschitz framework and two algorithms using it are proposed to solve the safe global maximization problem. The first method determines the safe area within the search domain, and the second one executes the global maximization over the found safe region. For both methods, a number of theoretical results related to their functioning and convergence is established. Finally, numerical experiments confirming the reliability of the proposed procedures are performed. [ABSTRACT FROM AUTHOR]

In the recent years, the optimization problems show that they are a big challenge for engineering regarding the fast growth of new nature-inspired optimization algorithms. Therefore, this paper presents a novel nature-inspired meta-heuristic algorithm for optimization which is called as bear smell search algorithm (BSSA) that takes into account the powerful global and local search operators. The proposed algorithm imitates both dynamic behaviors of bear based on sense of smell mechanism and the way bear moves in the search of food in thousand miles farther. Among all animals, bears have inconceivable sense of smell due to their huge olfactory bulbs that manage the sense of different odors. Since the olfactory bulb is a neural model of the vertebrate forebrain, it can make a strong exploration and exploitation for optimization. According to the odors value, bear moves the next location. Therefore, this paper mathematically models these structures. To demonstrate and evaluate the BSSA ability, numerous types of benchmark functions and four engineering problems are employed to compare the obtained results of BSSA with other available optimization methods with several analyzed indices such as pair-wise test, Wilcoxon rank and statistical analysis. The numerical results revealed that proposed BSSA presents competitive and greater results compared to other optimization algorithms. [ABSTRACT FROM AUTHOR]