Now showing 1 - 7 of 7
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

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

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

Multi-threaded Spotted Hyena Optimizer with thread-crossing techniques

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

This paper presents a Multi-threaded version of the Spotted Hyena Optimizer algorithm with thread-crossing techniques (MT-SHO) to improve the ability of the algorithm to explore the search space. The original algorithm is inspired by the hunting behavior of the spotted hyena. Along the different sections of the work, we explain in detail how the original algorithm simulates the spotted hyena's behavior to optimize highly complex mathematical functions and how we handle the procedures and results of the multi-threaded version, with thread-crossing techniques that improve the ability to explore and exploit the search space by letting threads learn between them. We present the experiments used to determine the best value of the parameters used in the parallel version of the algorithm and to prove that our proposal obtains significantly good results we compare the results obtained by evaluating 24 benchmark functions with the results published for the original algorithm as well as other metaheuristic algorithms. © 2021 Elsevier B.V.. All rights reserved.

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.

No Thumbnail Available
Publication

A new heuristic algorithm to solve Circle Packing problem inspired by nanoscale electromagnetic fields and gravitational effects

2018 , Martínez Ríos, Félix Orlando , Marmolejo Saucedo, José Antonio , Murillo-Suarez, Alfonso

In this paper, we present a new algorithm for the fast and efficient solution of the Packing problem in two dimensions. The packing problem consists in finding the best arrangement of objects (many geometrical forms) in a specific space called container.This new algorithm is inspired by the observations of nanometric scale electromagnetic fields. We use the electromagnetic theory of the electric field to calculate the best position to place a circular object in a configuration of other circular objects previously packing. Also, in this new algorithm we simulate two processes called »gravity» and »shaken» that compact the distribution of the objects placed in the container and allow to minimize the unoccupied space. © 2018 IEEE.

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