Zobrazeno 1 - 10
of 27
pro vyhledávání: '"Felipe Cisternas-Caneo"'
Autor:
Fernando Lepe-Silva, Broderick Crawford, Felipe Cisternas-Caneo, José Barrera-Garcia, Ricardo Soto
Publikováno v:
Mathematics, Vol 12, Iss 20, p 3171 (2024)
This research presents a novel hybrid approach, which combines the White Shark Optimizer (WSO) metaheuristic algorithm with chaotic maps integrated into the binarization process. Inspired by the predatory behavior of white sharks, WSO has shown great
Externí odkaz:
https://doaj.org/article/d1a265e81b204419b8bdbf82ab92c654
Publikováno v:
Biomimetics, Vol 9, Iss 5, p 283 (2024)
The set-covering problem aims to find the smallest possible set of subsets that cover all the elements of a larger set. The difficulty of solving the set-covering problem increases as the number of elements and sets grows, making it a complex problem
Externí odkaz:
https://doaj.org/article/0812a8366ecc4af3aada3cc0fe454ebd
Autor:
Felipe Cisternas-Caneo, Broderick Crawford, Ricardo Soto, Giovanni Giachetti, Álex Paz, Alvaro Peña Fritz
Publikováno v:
Mathematics, Vol 12, Iss 2, p 262 (2024)
Chaotic maps are sources of randomness formed by a set of rules and chaotic variables. They have been incorporated into metaheuristics because they improve the balance of exploration and exploitation, and with this, they allow one to obtain better re
Externí odkaz:
https://doaj.org/article/ea5809d780db41008aab2a9142b7a7a5
Autor:
José Barrera-García, Felipe Cisternas-Caneo, Broderick Crawford, Mariam Gómez Sánchez, Ricardo Soto
Publikováno v:
Biomimetics, Vol 9, Iss 1, p 9 (2023)
Feature selection is becoming a relevant problem within the field of machine learning. The feature selection problem focuses on the selection of the small, necessary, and sufficient subset of features that represent the general set of features, elimi
Externí odkaz:
https://doaj.org/article/4093d69cccab40bd93a730923a9eca45
Autor:
Broderick Crawford, Felipe Cisternas-Caneo, Katherine Sepúlveda, Ricardo Soto, Álex Paz, Alvaro Peña, Claudio León de la Barra, Eduardo Rodriguez-Tello, Gino Astorga, Carlos Castro, Franklin Johnson, Giovanni Giachetti
Publikováno v:
Computers, Vol 12, Iss 12, p 249 (2023)
The digitization of information and technological advancements have enabled us to gather vast amounts of data from various domains, including but not limited to medicine, commerce, and mining. Machine learning techniques use this information to impro
Externí odkaz:
https://doaj.org/article/b73fe686fcb54964b87f7a8ff1dc4dfc
Autor:
José Lemus-Romani, Broderick Crawford, Felipe Cisternas-Caneo, Ricardo Soto, Marcelo Becerra-Rozas
Publikováno v:
Biomimetics, Vol 8, Iss 5, p 400 (2023)
In this work, an approach is proposed to solve binary combinatorial problems using continuous metaheuristics. It focuses on the importance of binarization in the optimization process, as it can have a significant impact on the performance of the algo
Externí odkaz:
https://doaj.org/article/405a7c60ac53459f8ec21a0494fdf73e
Publikováno v:
Mathematics, Vol 11, Iss 16, p 3475 (2023)
The Cell Formation Problem (CFP) involves the clustering of machines to enhance productivity and capitalize on various benefits. This study addresses a variant of the problem where alternative routes and machine reliability are included, which we cal
Externí odkaz:
https://doaj.org/article/287948dbc57546da9c10faef32261144
Autor:
Marcelo Becerra-Rozas, José Lemus-Romani, Felipe Cisternas-Caneo, Broderick Crawford, Ricardo Soto, José García
Publikováno v:
Mathematics, Vol 10, Iss 24, p 4776 (2022)
In recent years, continuous metaheuristics have been a trend in solving binary-based combinatorial problems due to their good results. However, to use this type of metaheuristics, it is necessary to adapt them to work in binary environments, and in g
Externí odkaz:
https://doaj.org/article/de68e0c979f245ea9e4582be31b040a3
Autor:
Marcelo Becerra-Rozas, José Lemus-Romani, Felipe Cisternas-Caneo, Broderick Crawford, Ricardo Soto, Gino Astorga, Carlos Castro, José García
Publikováno v:
Mathematics, Vol 11, Iss 1, p 129 (2022)
For years, extensive research has been in the binarization of continuous metaheuristics for solving binary-domain combinatorial problems. This paper is a continuation of a previous review and seeks to draw a comprehensive picture of the various ways
Externí odkaz:
https://doaj.org/article/5fa506880e734b56baa349576d0e92ee
Autor:
Marcelo Becerra-Rozas, Felipe Cisternas-Caneo, Broderick Crawford, Ricardo Soto, José García, Gino Astorga, Wenceslao Palma
Publikováno v:
Mathematics, Vol 10, Iss 23, p 4529 (2022)
When we face real problems using computational resources, we understand that it is common to find combinatorial problems in binary domains. Moreover, we have to take into account a large number of possible candidate solutions, since these can be nume
Externí odkaz:
https://doaj.org/article/9f88aad396d04afb83ab67f80b650996