An improved chimpanzee optimization algorithm incorporating multiple strategies (IMSChoA) is proposed to address the problems of initialized population boundary aggregation distribution, slow convergence speed, low precision, and proneness to fall into local optimality of the chimpanzee search algorithm. Firstly, the improved sine chaotic mapping is used to initialize the population to solve the population boundary aggregation distribution problem. Secondly, a linear weighting factor and an adaptive acceleration factor are added to join the particle swarm idea and cooperate with the improved nonlinear convergence factor to balance the global search ability of the algorithm, accelerate the convergence of the algorithm, and improve the convergence accuracy. Finally, the sparrow elite mutation and Bernoulli chaos mapping strategy improved by adaptive change water wave factor are added to improve the ability of individuals to jump out of the local optimum. Through the comparative analysis of benchmark functions seeking optimization and the comparison of Wilcoxon rank sum statistical test seeking results, it can be seen that the IMSChoA optimization algorithm has stronger robustness and applicability. Further, the IMSChoA optimization algorithm is applied to two engineering examples to verify the superiority of the IMSChoA optimization algorithm in dealing with mechanical structure optimization design problems.

Cluster-based protocol is a kind of important routing in wireless sensor networks. However, due to the uneven distribution of cluster heads in classical clustering algorithm, some nodes may run out of energy too early, which is not suitable for large-scale wireless sensor networks. In this paper, a distributed clustering algorithm based on fuzzy weighted attributes is put forward to ensure both energy efficiency and extensibility. On the premise of a comprehensive consideration of all attributes, the corresponding weight of each parameter is assigned by using the direct method of fuzzy engineering theory. Then, each node works out property value. These property values will be mapped to the time axis and be triggered by a timer to broadcast cluster headers. At the same time, the radio coverage method is adopted, in order to avoid collisions and to ensure the symmetrical distribution of cluster heads. The aggregated data are forwarded to the sink node in the form of multihop. The simulation results demonstrate that clustering algorithm based on fuzzy weighted attributes has a longer life expectancy and better extensibility than LEACH-like algorithms.