Zobrazeno 1 - 10
of 32
pro vyhledávání: '"José Lemus-Romani"'
Autonomous Parameter Balance in Population-Based Approaches: A Self-Adaptive Learning-Based Strategy
Autor:
Emanuel Vega, José Lemus-Romani, Ricardo Soto, Broderick Crawford, Christoffer Löffler, Javier Peña, El-Gazhali Talbi
Publikováno v:
Biomimetics, Vol 9, Iss 2, p 82 (2024)
Population-based metaheuristics can be seen as a set of agents that smartly explore the space of solutions of a given optimization problem. These agents are commonly governed by movement operators that decide how the exploration is driven. Although m
Externí odkaz:
https://doaj.org/article/77278c5525bf49a79a95096118378657
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
Autor:
José Lemus-Romani, Diego Ossandón, Rocío Sepúlveda, Nicolás Carrasco-Astudillo, Victor Yepes, José García
Publikováno v:
Mathematics, Vol 11, Iss 9, p 2104 (2023)
The structural design of civil works is closely tied to empirical knowledge and the design professional’s experience. Based on this, adequate designs are generated in terms of strength, operability, and durability. However, such designs can be opti
Externí odkaz:
https://doaj.org/article/a1f2ec8e02194702bf3e2d36ff60434a
Autor:
Broderick Crawford, Ricardo Soto, Wenceslao Palma, Felipe Aballay, Gino Astorga, José Lemus-Romani, Sanjay Misra, Carlos Castro, Fernando Paredes, José-Miguel Rubio
Publikováno v:
Tehnički Vjesnik, Vol 27, Iss 5, Pp 1678-1684 (2020)
The need to make good use of resources has allowed metaheuristics to become a tool to achieve this goal. There are a number of complex problems to solve, among which is the Set-Covering Problem, which is a representation of a type of combinatorial op
Externí odkaz:
https://doaj.org/article/bc1bfd1074a041cfb709d47ab06657d5
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:
José Lemus-Romani, Marcelo Becerra-Rozas, Broderick Crawford, Ricardo Soto, Felipe Cisternas-Caneo, Emanuel Vega, Mauricio Castillo, Diego Tapia, Gino Astorga, Wenceslao Palma, Carlos Castro, José García
Publikováno v:
Mathematics, Vol 9, Iss 22, p 2887 (2021)
Currently, industry is undergoing an exponential increase in binary-based combinatorial problems. In this regard, metaheuristics have been a common trend in the field in order to design approaches to successfully solve them. Thus, a well-known strate
Externí odkaz:
https://doaj.org/article/8ca18ce3021a4d73bff5c1776622d0a9
Autor:
José García, José Lemus-Romani, Francisco Altimiras, Broderick Crawford, Ricardo Soto, Marcelo Becerra-Rozas, Paola Moraga, Alex Paz Becerra, Alvaro Peña Fritz, Jose-Miguel Rubio, Gino Astorga
Publikováno v:
Mathematics, Vol 9, Iss 20, p 2611 (2021)
Optimization techniques, specially metaheuristics, are constantly refined in order to decrease execution times, increase the quality of solutions, and address larger target cases. Hybridizing techniques are one of these strategies that are particular
Externí odkaz:
https://doaj.org/article/6e71ed41fcab43e48c8d239a09e3224c
Autor:
Broderick Crawford, Ricardo Soto, José Lemus-Romani, Marcelo Becerra-Rozas, José M. Lanza-Gutiérrez, Nuria Caballé, Mauricio Castillo, Diego Tapia, Felipe Cisternas-Caneo, José García, Gino Astorga, Carlos Castro, José-Miguel Rubio
Publikováno v:
Mathematics, Vol 9, Iss 16, p 1839 (2021)
One of the central issues that must be resolved for a metaheuristic optimization process to work well is the dilemma of the balance between exploration and exploitation. The metaheuristics (MH) that achieved this balance can be called balanced MH, wh
Externí odkaz:
https://doaj.org/article/6ce944acc1a842a38ea87a47e5843025
Autor:
Borja Alonso, Felipe González, Broderick Crawford, Ricardo Soto, Jose Luis Moura, José Lemus-Romani
Publikováno v:
IEEE Access 2021, 9, 30359-30373
UCrea Repositorio Abierto de la Universidad de Cantabria
Universidad de Cantabria (UC)
IEEE Access, Vol 9, Pp 30359-30373 (2021)
UCrea Repositorio Abierto de la Universidad de Cantabria
Universidad de Cantabria (UC)
IEEE Access, Vol 9, Pp 30359-30373 (2021)
This article proposes an optimization model to set frequencies, vehicle capacities, required fleet and the stops serving each route along a transit corridor which minimize the total user and operating costs. The optimization problem is solved by appl
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3188bc43f4b841f48af24c710661d554
https://doi.org/10.1109/access.2021.3059512
https://doi.org/10.1109/access.2021.3059512