---

Jellyfish Search (JS) is a recently developed population-based metaheuristic inspired by the food-finding behavior of jellyfish in the ocean. The purpose of this paper is to propose a quantum-based Jellyfish Search algorithm, named Quantum JS (QJS), for solving structural optimization problems. Compared to the classical JS, three main improvements are made in the proposed QJS: (1) a quantum-based update rule is adopted to encourage the diversification in the search space, (2) a new boundary handling mechanism is used to avoid getting trapped in local optima, and (3) modifications of the time control mechanism are added to strike a better balance between global and local searches. The proposed QJS is applied to solve frequency-constrained large-scale cyclic symmetric dome optimization problems. To the best of our knowledge, this is the first time that JS is applied in frequency-constrained optimization problems. An efficient eigensolution method for free vibration analysis of rotationally repetitive structures is employed to perform structural analyses required in the optimization process. The efficient eigensolution method leads to a considerable saving in computational time as compared to the existing classical eigensolution method. Numerical results confirm that the proposed QJS considerably outperforms the classical JS and has superior or comparable performance to other state-of-the-art optimization algorithms. Moreover, it is shown that the present eigensolution method significantly reduces the required computational time of the optimization process compared to the classical eigensolution method.

---

The optimal design of dome structures is a challenging task and therefore the computational performance of the currently available techniques needs improvement. This paper presents a combined algorithm, that is supported by the mixture of Charged System Search (CSS) and Teaching-Learning-based optimization (TLBO). Since the CSS algorithm features a strong exploration and may explore all unknown locations within the search space, it is an appropriate complement to enhance the optimization process by solving the weaknesses with using another optimization algorithm’s strong points. To enhance the exploitation ability of this algorithm, by adding two parts of Teachers phase and Student phase of TLBO algorithm to CSS, a method is obtained that is more efficient and faster than standard versions of these algorithms. In this paper, standard optimization methods and new hybrid method are tested on three kinds of dome structures, and the results show that the new algorithm is more efficient in comparison to their standard versions.

---

In this paper, the improved shuffled-based Jaya algorithm (IS-Jaya) is applied to the size optimization of the braced dome with the frequency constraints. IS-Jaya is the enhanced version of the Jaya algorithm that the shuffling process and escaping from local optima are added for it. These two modifications increase the population diversity and ability the escape from the local optima of the Jaya. The robustness and performance of the IS-Jaya are evaluated by the three design examples. The results show that the IS-Jaya algorithm outperforms other state-of-the-art optimization techniques considered in the literature.