Search

Abstract: Recently, Gandomi and Alavi proposed a meta-heuristic optimization algorithm, called Krill Herd (KH), for global optimization [Gandomi AH, Alavi AH. Krill Herd: A New Bio-Inspired Optimization Algorithm. Communications in Nonlinear Science and Numerical Simulation, 17(12), 4831–4845, 2012.]. This paper represents an optimization method to global optimization using a novel variant of KH. This method is called the Stud Krill Herd (SKH). Similar to genetic reproduction mechanisms added to KH method, an updated genetic reproduction schemes, called stud selection and crossover (SSC) operator, is introduced into the KH during the krill updating process dealing with numerical optimization problems. The introduced SSC operator is originated from original Stud genetic algorithm. In SSC operator, the best krill, the Stud, provides its optimal information for all the other individuals in the population using general genetic operators instead of stochastic selection. This approach appears to be well capable of solving various functions. Several problems are used to test the SKH method. In addition, the influence of the different crossover types on convergence and performance is carefully studied. Experimental results indicate an instructive addition to the portfolio of swarm intelligence techniques. [Copyright &y& Elsevier]

Abstract: Particle swarm optimization is a novel swarm-intelligence-based algorithm and a valid optimization technique. However, the algorithm suffers from the premature convergence problem when facing to complex optimization problem. In order to keep the balance between the global exploration and the local exploitation validly, the paper develops a knowledge-based cooperative particle swarm optimization (KCPSO). KCPSO mainly simulates the self-cognitive and self-learning process of evolutionary agents in special environment, and introduces a knowledge billboard to record varieties of search information. Moreover, KCPSO takes advantage of multi-swarm to maintain the swarm diversity and tries to guide their evolution by the shared information. Under the guide of the shared information, KCPSO manipulates each sub-swarm to go on with local exploitation in different local area, in which every particle follows a social learning behavior mode; at the same time, KCPSO carries out the global exploration through the escaping behavior and the cooperative behavior of the particles in different sub-swarms. KCPSO can maintain appropriate swarm diversity and alleviate the premature convergence validly. The proposed model was applied to some well-known benchmarks. The relative experimental results show KCPSO is a robust global optimization method for the complex multimodal functions. [Copyright &y& Elsevier]

Whale Optimization Algorithm (WOA) is a popular swarm-based algorithm with some spotted defects in its generated patterns during the searching phases. In this study, an enhanced WOA-based method is proposed in order to overcome the drawbacks of slow convergence speed and easy falling of WOA into the local optimum. The designed variant is called enhanced WOA (EWOA), which combines two strategies at the same time. First, a new communication mechanism (CM) is embedded into the basic WOA to promote the global optimal search ability and the exploitation tendency of the WOA. Then, the Biogeography-based Optimization (BBO) algorithm is partially utilized to harmonize the exploration and exploitation trends. A representative set of comprehensive benchmark cases and three engineering cases are utilized to verify the advantages of the proposed EWOA. The experimental results show that the exploration ability, exploitation ability, state of the balance, and convergence style of the algorithm has been improved significantly. Based on results, the proposed EWOA is a promising and excellent algorithm, and it has achieved better solution quality and faster convergence rate compared with other most advanced algorithms. For access to material and guide for users of this paper, we host an online page at https://aliasgharheidari.com. [ABSTRACT FROM AUTHOR]

• A modified COA (MCOA) approach based on chaotic sequences is proposed. • Chaotic sequences with Tinkerbell map and association probabilities were applied. • MCOA was validated by two truss optimization benchmark with discrete variables. • Results show that MCOA has competitive solutions compared with state-of-the-art. The optimization of truss structures is a complex computing problem with many local minima, while metaheuristics are naturally suited to deal with multimodal problems without the need of gradient information. The Coyote Optimization Algorithm (COA) is a population-based nature-inspired metaheuristic of the swarm intelligence field for global optimization that considers the social relations of the coyote proposed to single-objective optimization. Unlike most widespread algorithms, its population is subdivided in packs and the internal social influences are designed. The COA requires a few control hyperparameters including the number of packs, the population size, and the number maximum of generations. In this paper, a modified COA (MCOA) approach based on chaotic sequences generated by Tinkerbell map to scatter and association probabilities tuning and an adaptive procedure of updating parameters related to social condition is proposed. It is then validated by four benchmark problems of structures optimization including planar 52-bar truss, spatial 72-bar truss, 120-bar dome truss and planar 200 bar-truss with discrete design variables and focus in minimization of the structure weight under the required constraints. Simulation results collected in the mentioned problems demonstrate that the proposed MCOA presented competitive solutions when compared with other state-of-the-art metaheuristic algorithms in terms of results quality. [ABSTRACT FROM AUTHOR]

This paper introduces a bio-inspired metaheuristic optimization algorithm named Tunicate Swarm Algorithm (TSA). The proposed algorithm imitates jet propulsion and swarm behaviors of tunicates during the navigation and foraging process. The performance of TSA is evaluated on seventy-four benchmark test problems employing sensitivity, convergence and scalability analysis along with ANOVA test. The efficacy of this algorithm is further compared with several well-regarded metaheuristic approaches based on the generated optimal solutions. In addition, we also executed the proposed algorithm on six constrained and one unconstrained engineering design problems to further verify its robustness. The simulation results demonstrate that TSA generates better optimal solutions in comparison to other competitive algorithms and is capable of solving real case studies having unknown search spaces. Note that the source codes of the proposed TSA algorithm are available at [ABSTRACT FROM AUTHOR]