Martínez Ríos, Félix Orlando
Thumbnail Image
Preferred name
Martínez Ríos, Félix Orlando
Official Name
Martínez Ríos, Félix Orlando
Alternative Name
fmartin
Main Affiliation
ORCID
Scopus Author ID
24339038500
Researcher ID
N-7502-2018

Research Output
Now showing 1 - 6 of 6
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.

View
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

View
No Thumbnail Available
Publication

An Alternative Method for the Optimum Dynamic Balancing of the Four-Bar Mechanism

2014 , Acevedo, Mario , Haro-Sandoval, Eduardo , Martínez Ríos, Félix Orlando

This article presents the optimum dynamic balancing of the four-bar mechanism, in particular the crank-rocker, by the addition of counterweights. This is done by imposing as little restrictive as possible constraints on the counterweights parameters. First the general analytical equations of motion of the crank-rocker four-bar mechanism are obtained, using natural coordinates. This model allows expressing the dynamic equations of the mechanism just in terms of the mass, as opposed to the need of using also the moment of inertia, and the coordinates of the center of gravity of the counterweights, that are used as optimization variables. This implies that no particular counterweight shape is assumed in advance. The only constraints imposed on these optimization variables are that masses must be non-negative. As a novelty, the most influencing variables in the optimization are identified using a global sensitivity analysis based on polynomial chaos. This allows to impose different constraints an also to reduce the total number of optimization variables without affecting the global results. The results obtained are validated by simulations, and compared to those expressed in representative papers obtained by other authors. © Springer Nature

View
No Thumbnail Available
Publication

A new protocol based on blockchain technology for transparent operation of corporate social responsibility

2020 , Martínez Ríos, Félix Orlando , Marmolejo Saucedo, José Antonio , Abascal-Olascoaga, Gonzalo

This chapter proposes a protocol based on blockchain technology applied to corporate social responsibility (CSR). The first part discusses the characteristics associated with CSR actions and the main difficulties its development faces, such as transparency, security, fault tolerance, among others. Subsequently, the authors describe the characteristics and concepts related to blockchain-based developments to later describe our framework for the control and development of CSR actions based on blockchain. Herein, the authors also describe how to publicly and privately identify the participating elements of CSR and the operations and resources necessary for the implementation and operation of the proposed protocol. © 2020 Emerald Publishing Limited.

View
No Thumbnail Available
Publication

New Particle Swarm Optimizer Algorithm with Chaotic Maps for Combinatorial Global Optimization Problems. An Application to the Deconvolution of Mössbauer Spectra

2024-01-01 , Martínez Ríos, Félix Orlando , Jiménez-López, Omar , Alvarez Guillen, Luis Alejandro

In this chapter, we present a novel method for addressing global optimization problems inspired by evolutionary algorithms found in nature. We integrate the Comprehensive Learning Particle Swarm Optimization (CLPSO) algorithm with random value generation based on chaotic maps. The resulting algorithm is applied to the computationally complex task of deconvoluting Mossbauer spectra. We implement ten chaotic maps to generate random values and compare their performance with traditional random number generators. Through experiments, we demonstrate that the developed algorithm excels in exploring the search space and exhibits fast intensification in finding the global minimum. In addition, we perform a comprehensive review of existing solutions to the Mossbauer spectrum deconvolution problem, highlighting the scarce availability of developments in this area. We also present a user-friendly program designed with an intuitive interface to facilitate the deconvolution process by Spector Mossbauer. This program will be freely distributed without operational restrictions. Experimental validation is performed on Mossbauer spectra generated using the developed program and those obtained by experimental means, affirming the efficiency of the new algorithm conceived. ©Springer.

View
No Thumbnail Available
Publication

Correction to: Data Analysis and Optimization for Engineering and Computing Problems

2020 , Vasant, Pandian , Litvinchev, Igor , Marmolejo Saucedo, José Antonio , Rodríguez Aguilar, Román , Martínez Ríos, Félix Orlando

This book was inadvertently published without updating the following (or with the following error) © Springer Nature Switzerland AG 2020

View