A carnivorous plant algorithm for solving global optimization problems

I-CPA: An Improved Carnivorous Plant Algorithm for Solar Photovoltaic Parameter Identification Problem

The carnivorous plant algorithm (CPA), which was recently proposed for solving optimization problems, is a population-based optimization algorithm inspired by plants. In this study, the exploitation phase of the CPA was improved with the teaching factor strategy in order to achieve a balance between the exploration and exploitation capabilities of CPA, minimize getting stuck in local minima, and produce more stable results. The improved CPA is called the I-CPA. To test the performance of the proposed I-CPA, it was applied to CEC2017 functions. In addition, the proposed I-CPA was applied to the problem of identifying the optimum parameter values of various solar photovoltaic modules, which is one of the real-world optimization problems. According to the experimental results, the best value of the root mean square error (RMSE) ratio between the standard data and simulation data was obtained with the I-CPA method. The Friedman mean rank statistical analyses were also performed for both problems. As a result of the analyses, it was observed that the I-CPA produced statistically significant results compared to some classical and modern metaheuristics. Thus, it can be said that the proposed I-CPA achieves successful and competitive results in identifying the parameters of solar photovoltaic modules.

Research and experiment on global path planning for indoor AGV via improved ACO and fuzzy DWA

In order to obtain an optimal trajectory for indoor AGV, this paper combined an improved ACO and fuzzy DWA (IACO-DWA) algorithm, which can provide an optimal path with collision-free under higher optimization efficiency. The highlights of this paper are detailed as follows: Firstly, an improved adaptive pseudo-random transition strategy is adopted in the state transition probability with an angle factor. A reward and punishment mechanism is introduced in the pheromone updating strategy, then a path optimization strategy called IACO is proposed for the more optimized path. Secondly, IDWA adopted three fuzzy controllers of direction, security and adjustment coefficients through evaluating directional and safety principles, then improving the angular velocity by processing the linear velocity with linear normalization. By adapting to the changes of the environment, the IDWA parameters can be dynamically adjusted to ensure the optimal running speed and reasonable path of AGV. Thirdly, aiming to deal with the path-planning problem in complex environments, we combined IACO with IDWA, the hybrid algorithm involves dividing the globally optimal path obtained from IACO planning into multiple virtual sub-target points. IDWA completes the path planning by switching between these local target points, thereby improving the efficiency of the path planning. Finally, simulations is verified by Matlab and experiment results on the QBot2e platform are given to verify IACO-DWA algorithm's effectiveness and high performance.

Multistrategy-Boosted Carnivorous Plant Algorithm: Performance Analysis and Application in Engineering Designs

Many pivotal and knotty engineering problems in practical applications boil down to optimization problems, which are difficult to resolve using traditional mathematical optimization methods. Metaheuristics are efficient algorithms for solving complex optimization problems while keeping computational costs reasonable. The carnivorous plant algorithm (CPA) is a newly proposed metaheuristic algorithm, inspired by its foraging strategies of attraction, capture, digestion, and reproduction. However, the CPA is not without its shortcomings. In this paper, an enhanced multistrategy carnivorous plant algorithm called the UCDCPA is developed. In the proposed framework, a good point set, Cauchy mutation, and differential evolution are introduced to increase the algorithm's calculation precision and convergence speed as well as heighten the diversity of the population and avoid becoming trapped in local optima. The superiority and practicability of the UCDCPA are illustrated by comparing its experimental results with several algorithms against the CEC2014 and CEC2017 benchmark functions, and five engineering designs. Additionally, the results of the experiment are analyzed again from a statistical point of view using the Friedman and Wilcoxon rank-sum tests. The findings show that these introduced strategies provide some improvements in the performance of the CPA, and the accuracy and stability of the optimization results provided by the proposed UCDCPA are competitive against all algorithms. To conclude, the proposed UCDCPA offers a good alternative to solving optimization issues.

A Multi-Objective Carnivorous Plant Algorithm for Solving Constrained Multi-Objective Optimization Problems

Satisfying various constraints and multiple objectives simultaneously is a significant challenge in solving constrained multi-objective optimization problems. To address this issue, a new approach is proposed in this paper that combines multi-population and multi-stage methods with a Carnivorous Plant Algorithm. The algorithm employs the ϵ-constraint handling method, with the ϵ value adjusted according to different stages to meet the algorithm’s requirements. To improve the search efficiency, a cross-pollination is designed based on the trapping mechanism and pollination behavior of carnivorous plants, thus balancing the exploration and exploitation abilities and accelerating the convergence speed. Moreover, a quasi-reflection learning mechanism is introduced for the growth process of carnivorous plants, enhancing the optimization efficiency and improving its global convergence ability. Furthermore, the quadratic interpolation method is introduced for the reproduction process of carnivorous plants, which enables the algorithm to escape from local optima and enhances the optimization precision and convergence speed. The proposed algorithm’s performance is evaluated on several test suites, including DC-DTLZ, FCP, DASCMOP, ZDT, DTLZ, and RWMOPs. The experimental results indicate competitive performance of the proposed algorithm over the state-of-the-art constrained multi-objective optimization algorithms.

Performance up-gradation of Symbiotic Organisms Search by Backtracking Search Algorithm

Symbiotic Organisms Search (SOS) algorithm is characterized based on the framework of relationships among the ecosystem species. Nevertheless, it is suffering from wasteful discovery, little productivity, and slack convergence rate. These deficiencies cause stagnation at the local optimum, which is hazardous in deciding the genuine optima of the optimization problem. Backtracking Search Algorithm (BSA) is likewise another streamlining method for comprehending the non-direct complex optimization problem. Consequently, in the current paper, an endeavor has been made toward the expulsion of the downsides from the traditional SOS by proposing a novel ensemble technique called e-SOSBSA to overhaul the degree of intensification and diversification. In e-SOSBSA, firstly, the mutation operator of BSA with the self-adaptive mutation rate is incorporated to produce a mutant of population and leap out from the local optima. Secondly, the crossover operator of BSA with the adaptive component of mixrate is incorporated to leverage the entire active search regions visited previously. The suggested e-SOSBSA has been tested with 20 classical benchmark functions, IEEE CEC2014, CEC2015, CEC2017, and the latest CEC 2020 test functions. Statistical analyses, convergence analysis, and diversity analysis are performed to show the stronger search capabilities of the proposed e-SOSBSA in contrast with the component algorithms and several state-of-the-art algorithms. Moreover, the proposed e-SOSBSA is applied to find the optimum value of the seven problems of engineering optimization. The numerical investigations and examinations show that the proposed e-SOSBSA can be profoundly viable in tackling real-world engineering optimization problems.

A Multi-Strategy Marine Predator Algorithm and Its Application in Joint Regularization Semi-Supervised ELM

A novel semi-supervised learning method is proposed to better utilize labeled and unlabeled samples to improve classification performance. However, there is exists the limitation that Laplace regularization in a semi-supervised extreme learning machine (SSELM) tends to lead to poor generalization ability and it ignores the role of labeled information. To solve the above problems, a Joint Regularized Semi-Supervised Extreme Learning Machine (JRSSELM) is proposed, which uses Hessian regularization instead of Laplace regularization and adds supervised information regularization. In order to solve the problem of slow convergence speed and the easy to fall into local optimum of marine predator algorithm (MPA), a multi-strategy marine predator algorithm (MSMPA) is proposed, which first uses a chaotic opposition learning strategy to generate high-quality initial population, then uses adaptive inertia weights and adaptive step control factor to improve the exploration, utilization, and convergence speed, and then uses neighborhood dimensional learning strategy to maintain population diversity. The parameters in JRSSELM are then optimized using MSMPA. The MSMPA-JRSSELM is applied to logging oil formation identification. The experimental results show that MSMPA shows obvious superiority and strong competitiveness in terms of convergence accuracy and convergence speed. Also, the classification performance of MSMPA-JRSSELM is better than other classification methods, and the practical application is remarkable.

Chaotic Search Based Equilibrium Optimizer for Dealing with Nonlinear Programming and Petrochemical Application

In this article, chaotic search based constrained equilibrium optimizer algorithm (CS-CEOA) is suggested by integrating a novel heuristic approach called equilibrium optimizer with a chaos theory-based local search algorithm for solving general non-linear programming. CS-CEOA is consists of two phases, the first one (phase I) aims to detect an approximate solution, avoiding being stuck in local minima. In phase II, the chaos-based search algorithm improves local search performance to obtain the best optimal solution. For every infeasible solution, repair function is implemented in a way such that, a new feasible solution is created on the line segment defined by a feasible reference point and the infeasible solution itself. Due to the fast globally converging of evolutionary algorithms and the chaotic search’s exhaustive search, CS-CEOA could locate the true optimal solution by applying an exhaustive local search for a limited area defined from Phase I. The efficiency of CS-CEOA is studied over multi-suites of benchmark problems including constrained, unconstrained, CEC’05 problems, and an application of blending four ingredients, three feed streams, one tank, and two products to create some certain products with specific chemical properties, also to satisfy the target costs. The results were compared with the standard evolutionary algorithms as PSO and GA, and many hybrid algorithms in the same simulation environment to approve its superiority of detecting the optimal solution over selected counterparts.