In this paper, a new kind of swarm-based metaheuristic search method, called Elephant Herding Optimization (EHO), is proposed for solving optimization tasks. The EHO method is inspired by the herding behavior of elephant group. In nature, the elephants belonging to different clans live together under the leadership of a matriarch, and the male elephants will leave their family group when they grow up. These two behaviors can be modelled into two following operators: clan updating operator and separating operator. In EHO, the elephants in each clan are updated by its current position and matriarch through clan updating operator. It is followed by the implementation of the separating operator which can enhance the population diversity at the later search phase. To demonstrate its effectiveness, EHO is benchmarked by fifteen test cases comparing with BBO, DE and GA. The results show that EHO can find the better values on most benchmark problems than those three metaheuristic algorithms.

The behavior of natural phenomena has become one of the most popular sources for researchers to design optimization algorithms for scientific, computing and engineering fields. As a result, a lot of nature-inspired algorithms have been proposed in the last decades. Due to the numerous issues of the global optimization process, new algorithms are always welcome in this research field. This paper introduces the Coyote Optimization Algorithm (COA), which is a population based metaheuristic for optimization inspired on the canis latrans species. It contributes with a new algorithmic structure and mechanisms for balancing exploration and exploitation. A set of boundary constrained real parameter optimization benchmarks is tested and a comparative study with other nature-inspired metaheuristics is provided to investigate the performance of the COA. Numerical results and non-parametric statistical significance tests indicate that the COA is capable of locating promising solutions and it outperforms other metaheuristics on most tested functions.

In this correspondence, an approach based on coevolutionary particle swarm optimization to solve constrained optimization problems formulated as min-max problems is presented. In standard or canonical particle swarm optimization (PSO), a uniform probability distribution is used to generate random numbers for the accelerating coefficients of the local and global s. We propose a Gaussian probability distribution to generate the accelerating coefficients of PSO. Two populations of PSO using Gaussian distribution are used on the optimization algorithm that is tested on a suite of well-known benchmark constrained optimization problems. Results have been compared with the canonical PSO (constriction factor) and with a coevolutionary genetic algorithm. Simulation results show the suitability of the proposed algorithm in terms of effectiveness and robustness