A Competitive Volleyball Algorithm to Solve Global Optimization with the Engineering Problems

Abstract

In real life, many engineering problems are nonlineble NP problems, in order to solve some of these problems, we put forward a competitive volleyball algorithm.The algorithm proposed in this paper is a meta-heuristic technique based on swarm optimization. It is inspired by the competition between volleyball teams in a league and the improvement in players’ overall abilities in order to win the Most Valuable Player award. Several specific terms relating to competition, such as pre-match reinforcement, single round robin mechanism, optimal strategy constitute the structure of the algorithm. The sensitivity of several parameters of the algorithm is analyzed and tested for three types of benchmark functions: unimodal, high-dimensional multimodal and low-dimensional multimodal functions. Through the use of these three types of test functions, the performance of this algorithm is compared with nine classical metaheuristic algorithms: Genetic Algorithm (GA), Differential Evolution (DE), Harmony Search (HS), Artificial Bee Colony (ABC), Particle Swarm Optimization (PSO), Sine Cosine Algorithm (SCA), Soccer League Competition (SLC), League Championship Algorithm (LCA) and Volleyball Premier League (VPL). CVA has been used to solve three real-world engineering problems. The results show that the performance of the CVA is behaviorally promising and better than the other classical metaheuristic algorithms.

Three Generations of Semiconductors Research and Bottleneck of Development

“…The complexity of the wafer preparation process, with more than a dozen procedures, makes it easy to produce crystal defects and contamination by impurities. The larger the crystal diameter, the more difficult it is to produce [11]. In the space-limited hot field, to make larger diameter crystals, involving many technical difficulties, such as the unevenness of the hot field temperature, the diameter control of large crystals and so on.…”