Now showing 1 - 4 of 4
No Thumbnail Available
Publication

A new swarm algorithm for global optimization of multimodal functions over multi-threading architecture hybridized with simulating annealing

2018 , Martínez Ríos, Félix Orlando , Murillo-Suarez, Alfonso

This paper presents a new algorithm, PCLPSO, based on particle swarm optimization, which uses comprehensive learning particle swarm optimizer. Our algorithm executes C parallel CLPSO algorithms. We adopted as a criterion of completion a maximum value of evaluations of the objective function. During the execution of the CLPSO algorithms, when a certain evaluation value of the functions is reached, the best k are selected, and different initialization criteria are applied to continue the execution of the CLPSO algorithms: restarting the worst ones for the best solution or restores the worst ones to a random solution. For this restart, we use the Boltzmann criterion in a similar way as Simulating Annealing (SA) does. In this work, the experimental results obtained for the search of the minimum of 16 multimodal test functions such as Rosenbrock, Griewank, Rastrigin, Brannin, Schwefel, and others. Our algorithm proved to be more efficient than the traditional CLPSO in its experimental results, and the nonparametric Wilcoxon test confirmed this.

No Thumbnail Available
Publication

A new approach of the rain-fall optimization algorithm using parallelization

2020 , Guerrero-Valadez, Juan Manuel , Martínez Ríos, Félix Orlando

This chapter introduces a new implementation of the Rain-Fall Optimization Algorithm (RFO) proposed by Kaboli, Sevbaraj, and Rahim in “Rain-Fall Optimization Algorithm. A Population-Based Algorithm for Solving Constrained Optimization Problems” by Kaboli et al. (J Comput Sci 19:31–42, 2017). RFO is a nature-inspired algorithm, which is based on the behavior of the water drops produced by a rainfall going down through a mountain to find the minimum values of specific functions. The algorithm was tested on four multidimensional benchmark functions: Ackley, Griewank, Rosenbrock, and Sphere functions. It was also tested in a four-dimensional function, the Kowalik function. The first step was to match the results of the rewritten algorithm with the results obtained by the original authors. Then the algorithm had to be modified to make some efficiency improvements and to get better results. The main modifications were a new equation to modify the step size for a function called explosion process and a parallel execution of the algorithm with two different restarting techniques: restart to the best and genetic restart to the best. © Springer Nature Switzerland AG 2020.

No Thumbnail Available
Publication

Rain-Fall Optimization Algorithm with new parallel implementations

2018 , Guerrero-Valadez, Juan Manuel , Martínez Ríos, Félix Orlando

Rainfall Optimization Algorithm (RFO) is a nature-inspired metaheuristic optimization algorithm. RFO mimics the movement of water drops generated during rainfall to optimize a function. The paper study new implementations for RFO to offer more reliable results. Moreover, it studies three restarting techniques that can be applied to the algorithm with multithreading. The different implementations for the RFO are benchmarked to test and verify the performance and accuracy of the solutions. The paper presents and compares the results using several multidimensional testing functions, as well as the visual behavior of the raindrops inside the benchmark functions. The results confirm that the movement of the artificial drops corresponds to the natural behavior of raindrops. The results also show the effectiveness of this behavior to minimize an optimization function and the advantages of parallel computing restarting techniques to improve the quality of the solutions.

No Thumbnail Available
Publication

MTGWA: A Multithreaded Gray Wolf Algorithm with Strategies Based on Simulated Annealing and Genetic Algorithms

2021 , Martínez Ríos, Félix Orlando , Murillo-Suarez, Alfonso , García-Jacas, Cesar Raúl , Guerrero-Valadez, Juan Manuel

In this paper, we present an improvement of the Gray Wolf algorithm (GWO) based on a multi-threaded implementation of the original algorithm. The paper demonstrates how to combine the solutions obtained in each of the threads to achieve a final solution closer to the absolute minimum or even equal to it. To properly combine the solutions of each of the threads of execution, we use strategies based on simulated annealing and genetic algorithms. Also, we show the results obtained for twenty-nine functions: unimodal, multimodal, fixed dimension and composite functions. Experiments show that our proposed improves the results of the original algorithm. © Springer Nature