Many real-world problems are optimizable in nature. These problems often have numerous decision variables and constraints, making it difficult to optimize their objective function. To solve these problems, a group of algorithms known as metaheuristic algorithms has been introduced, which, considering the problem constraints, can find the optimal values of the decision variables in a reasonable amount of time to optimize the value of the objective function(s). Due to the importance and high application of these algorithms, a new metaheuristic optimization algorithm called Gray Langurs Optimizer (GLO) has been introduced in this research. The fundamental inspiration for the GLO is the group behavior of gray langurs in nature. The gray langurs are observed in three groups: one-male, multi-male, and all-male groups. The GLO mathematically simulates the group behavior and social hierarchy of gray langurs in all three groups. The migration of gray langurs between groups due to the death of the alpha or other group members, mate finding, and puberty is formulated by GLO. Additionally, the GLO models the arbitrary behavior of gray langurs within their territory. The GLO is tested on twenty-three classical test functions, including unimodal, multimodal, and fixed-dimension benchmarks, as well as twenty-seven CEC17 test functions, which comprise shifted, rotated, and composite benchmarks. The GLO is also applied to six real-world applications, and its results are compared with those of eight state-of-the-art algorithms both numerically and visually. The experimental results demonstrate the high capability of GLO in optimizing the various test functions and real-world applications. The MATLAB and Python implementations of GLO are available at https://nimakhodadadi.com.
Bag-of-Tasks (BoT) scheduling over cloud computing resources called Cloud Bag-of-Tasks Scheduling (CBS) problem, which is a well-known NP-hard optimization problem. Whale Optimization Algorithm (WOA) is an effective method for CBS problems, which still requires further improvement in exploration ability, solution diversity, convergence speed, and ensuring adequate exploration–exploitation tradeoff to produce superior scheduling solutions. In order to remove WOA limitations, a hybrid oppositional differential evolution-enabled WOA (called h-DEWOA) approach is introduced to tackle CBS problems to minimize workload makespan and energy consumption. The proposed h-DEWOA incorporates chaotic maps, opposition-based learning (OBL), differential evolution (DE), and a fitness-based balancing mechanism into the standard WOA method, resulting in enhanced exploration, faster convergence, and adequate exploration–exploitation tradeoff throughout the algorithm execution. Besides this, an efficient allocation heuristic is added to the h-DEWOA method to improve resource assignment. CEA-Curie and HPC2N real cloud workloads are used for performance evaluation of scheduling algorithms using the CloudSim simulator. Two series of experiments have been conducted for performance comparison: one with WOA-based heuristics and another with non-WOA-based metaheuristics. Experimental results of the first series of experiments reveal that the h-DEWOA approach results in makespan improvement in the range of 5.79–13.38% (for CEA-Curie workloads), 5.03–13.80% (for HPC2N workloads), and energy consumption in the range of 3.21–14.70% (for CEA-Curie workloads) and 10.84–19.30% (for HPC2N workloads) over well-known WOA-based metaheuristics. Similarly, h-DEWOA also resulted in significant performance in comparison with recent state-of-the-art non-WOA-based metaheuristics in the second series of experiments. Statistical tests and box plots also revealed the robustness of the proposed h-DEWOA algorithm.
19 April 2023 in Journal of the Operational Research Society
A cloud is made up of many data centers, with its own set of data and resources. The reasons for employing several cloud sites to operate a workflow are that the data is already dispersed, the required resources surpass the constraints of a single site. This paper presents a hybrid multi-objective optimization algorithm denoted as HSOS-SOA, achieved by combining the Symbiotic Organisms Search and Seagull Optimization Algorithm. The HSOS-SOA uses chaotic maps to generate random numbers and performs a good trade-off between exploration and exploitation, resulting in a higher convergence rate. HSOS-SOA is used to solve scientific workflow scheduling problems in multisite cloud computing by taking into consideration elements such as makespan, cost, and reliability. A solution is chosen from the Pareto front using the knee-point approach in this approach. Extensive analyses are performed out in Microsoft Azure multisite cloud and the results exhibited that the HSOS-SOA can outperform other algorithms in terms of metrics such as IGD, Coverage Ratio, and so on. Experimental results of experiments reveal that the results in makespan improvement in the range of 5.72–28.61%, cost in the range of 5.16–45.16%, and reliability in the range of 3.11–25% over well-known metaheuristic algorithms.