Zobrazeno 1 - 9
of 9
pro vyhledávání: '"Gino In"'
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
Publikováno v:
Mathematics, Vol 10, Iss 23, p 4575 (2022)
With the rapid development of global trade, ports and terminals are playing an increasingly important role, and automatic guided vehicles (AGVs) have been used as the main carriers performing the loading/unloading operations in automated container te
Externí odkaz:
https://doaj.org/article/32c09bff3c5b4504ad5a6b241c11aaba
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
Publikováno v:
Mathematics, Vol 8, Iss 6, p 1038 (2020)
Inventory models must consider the probability of sub-optimal manufacturing and careless shipping to prevent the delivery of defective products to retailers. Retailers seeking to preserve a reputation of quality must also perform inspections of all i
Externí odkaz:
https://doaj.org/article/b37c1d53c50a4e218730f74ae1abfcd5
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
Publikováno v:
Mathematics, Vol 9, Iss 21, p 2735 (2021)
In this paper, we develop an economic order quantity (EOQ) model for fixed shelf-life items and a non-increasing demand. The objective of this model is to maximize the total profit. We find the criterion to decide (i) the interior maximum solution or
Externí odkaz:
https://doaj.org/article/599bd3c2c9d449ccbfd5733dd46260f0
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
Publikováno v:
Mathematics, Vol 9, Iss 3, p 225 (2021)
The optimization methods and, in particular, metaheuristics must be constantly improved to reduce execution times, improve the results, and thus be able to address broader instances. In particular, addressing combinatorial optimization problems is cr
Externí odkaz:
https://doaj.org/article/596b379715c248a09f55a1fd7f88f97e