Search

• 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]