Search

Aiming at the shortcomings of Chimp optimization algorithm (ChOA), which is easy to fall into local optimal value and imbalance between global exploration ability and local exploitation ability. To improve ChOA from the perspective of multi-strategy mixing, MSChimp was proposed, and the algorithm was applied to global optimization and minimum spanning tree problems. The main research work of this paper is as follows: (1) In the initialization stage of ChOA, an opposition-based learning strategy was introduced to improve the population diversity; Sine Cosine Algorithm (SCA) was introduced in the exploitation process to improve the convergence speed and accuracy of the algorithm in the later stage, so as to balance the exploration and exploitation capabilities of the algorithm. (2) The improved algorithm was compared with different types of meta-heuristic algorithms in 20 benchmark functions and CEC 2019 test sets, and was used to solve the minimum spanning tree. The experimental results show that the improved ChOA has significantly improved the ability to find the optimal value, which verifies the effectiveness and feasibility of MSChimp. Compared with other algorithms, the algorithm proposed in this paper has strong competitiveness. [ABSTRACT FROM AUTHOR]

This paper presents an improved arithmetic optimization algorithm that incorporates hybrid elite pool strategies to address the limitations of the arithmetic optimization algorithm (AOA). In AOA, the linear mathematical optimization acceleration (MOA) function cannot balance global exploitation and local exploration well. Therefore, the accuracy and convergence speed of the algorithm cannot be guaranteed. To improve the performance of AOA, this paper reconstructed a nonlinear MOA function, which is expected to balance the exploitation and the exploration of AOA. Furthermore, four hybrid elite pool strategies are integrated to enhance the ability to escape local optima. The proposed algorithm inherits the fast convergence of AOA and develops the performance of escaping local optima. Numerical experiment results on benchmark functions and engineering problems show that the proposed algorithm outperforms other compared meta-heuristic algorithms in terms of convergence speed and accuracy. [ABSTRACT FROM AUTHOR]

In recent years, the Internet of Things (IoT) has led to the spread of cloud computing devices in all commercial, industrial and agricultural sectors. The use of cloud computing environment services is increasing exponentially with all technology applications based on IoT. Fog computing has led to addressing issues in cloud computing environments. Fog computing reduces load balancing, processing, bandwidth, and storage as data file replication from the cloud to the network closest to sensors in different geographic locations. There are three critical issues:—what data should be replicated?—when should the data be replicated? and—where the new replicas should be placed? These three main open questions must be tackled for data replication in the cloud environments. This strategy, the identification and mode of the data replication problem are designed as a multi-objective optimization with modern meta-heuristic optimization method. Therefore, a new hybrid method using Arithmetic Optimization Algorithm (AOA) and the salp swarm algorithm (SSA) is proposed in this paper. Firstly, a new hybrid metaheuristic method, using the Arithmetic Optimization Algorithm (AOA) and the salp swarm algorithm (SSA), is proposed to handle the problem of selection and placement data replication in fog computing. Secondly, the Floyd algorithm is used to strategy the least cost path, distance, and data transmission in different geographic locations. The performance of the designed AOASSA strategy to tackling the data replication problem is evaluated using different datasets of different sizes. To validate the AOASSA strategy, a set of experiments was carried out to validate the proposed strategy AOASSA. Experiment results show the superiority of AOASSA over its competitors in terms of performance measures, such as least cost path, distance, and bandwidth. [ABSTRACT FROM AUTHOR]