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

Filters

4
4
3 1
Reset filters

Settings
Now showing 1 - 4 of 4
No Thumbnail Available
Publication

A multiprocess Salp swarm optimization with a heuristic based on crossing partial solutions

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

The Salp swarm algorithm (SSA) is one of the most recent metaheuristic optimization algorithms. SSA has been used succesfully to solve optimization problems in different research areas such as machine learning, engineering design, wireless networks, image processing, mobile robotics, and energy. In this article, we present a multi-threaded implementation of the SSA algorithm. Each thread executes an SSA algorithm that shares information among the swarms to get a better solution. The best partial solutions of each swarm intersect in a similar way of genetic algorithms. The experiments with nineteen benchmark functions (unimodal, multimodal, and composite) show the results obtained with this new algorithm are better than those achieved with the original algorithm. © 2020 The Authors. Published by Elsevier B.V.

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

μ𝜃-EGF: A New Multi-Thread and Nature-Inspired Algorithm for the Packing Problem

2020 , Martínez Ríos, Félix Orlando , Marmolejo Saucedo, José Antonio , García-Jacas, César R. , Murillo-Suarez, Alfonso

In this paper, the authors present a new algorithm efficient solution to the packing problem in two dimensions. The authors propose a new heuristic using the value of the electromagnetic field to determine the best position to place a circular object in a configuration of other circular objects previously packed. Also, this algorithm simulates two processes to compact objects already placed, inspired by gravitational forces, to minimize the empty space in the container and maximizing the number of objects in the container. To determine the efficacy of this algorithm, the authors carried out experiments with twenty-four instances. Parallel computing can contribute to making decision processes such as optimization and prediction more agile and faster. Real-time decision making involves the use of solution methodologies and algorithms. For this reason the present manuscript shows an alternative for the solution of a classic industry problem that must be solved quickly. Packaging optimization can help reduce waste of container material. The material used to transport the products can reduce its environmental impact due to an efficient packaging process. Light-weighting can also be accomplished by reducing the amount of packaging material used. © Springer Nature

View
No Thumbnail Available
Publication

Packing algorithm inspired by gravitational and electromagnetic effects

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

This paper introduces a faster and more efficient algorithm for solving a two-dimension packing problem. This common optimization problem takes a set of geometrical objects and tries to find the best form of packing them in a space with specific characteristics, called container. The visualization of nanoscale electromagnetic fields was the inspiration for this new algorithm, using the electromagnetic field between the previously placed objects, this paper explains how to determine the best positions for to place the remaining ones. Two gravitational phenomena are also simulated to achieve better results: shaken and gravity. They help to compact the objects to reduce the occupied space. This paper shows the executions of the packing algorithm for four types of containers: rectangles, squares, triangles, and circles. © Springer Nature

View