CRIS

Permanent URI for this communityhttps://scripta.up.edu.mx/handle/20.500.12552/1

Browse

Search Results

Now showing 1 - 2 of 2
  • Some of the metrics are blocked by your 
    Item type:Publication,
    Rain-Fall Optimization Algorithm with new parallel implementations
    (2018)
    Guerrero-Valadez, Juan Manuel
    ;
    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.
    Scopus© Citations 1  4  2
  • Some of the metrics are blocked by your 
    Item type:Publication,
    A new approach of the rain-fall optimization algorithm using parallelization
    (2020)
    Guerrero-Valadez, Juan Manuel
    ;
    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.
      50  1