Miguel Ángel Garcia Morales

Dr. Miguel Ángel Garcia Morales

Facultad de Arquitectura, Diseño y Urbanismo, Universidad Autónoma de Tamaulipas, Centro Universitario Sur, Tampico, Tamaulipas, Mexico
orcid
Universidad Autónoma de Tamaulipas

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
Verified
Journal Article
Open access
PDF file
JBJosé A. Brambila-Hernández
José A. Brambila-Hernández
Miguel Ángel Garcia MoralesMiguel Ángel Garcia Morales
Miguel Ángel Garcia Morales
Hector Fraire-HuacujaHector Fraire-Huacuja
Hector Fraire-Huacuja
EHEduardo Villegas Huerta
Eduardo Villegas Huerta
ABArmando Becerra-Del-Ángel
Armando Becerra-Del-Ángel
This paper proposes a hybrid harmony search algorithm that incorporates a method of reinitializing harmonies memory using a particle swarm optimization algorithm with an improved opposition-based learning method (IOBL) to solve continuous optimization problems. This method allows the algorithm to obtain better results by increasing the search space of the solutions. This approach has been validated by comparing the performance of the proposed algorithm with that of a state-of-the-art harmony search algorithm, solving fifteen standard mathematical functions, and applying the Wilcoxon parametric test at a 5% significance level. The state-of-the-art algorithm uses an opposition-based improvement method (IOBL). Computational experiments show that the proposed algorithm outperforms the state-of-the-art algorithm. In quality, it is better in fourteen of the fifteen instances, and in efficiency is better in seven of fifteen instances.

29 June 2024 in Computación y Sistemas
Verified
Journal Article
Closed access
PDF file
Miguel Ángel Garcia MoralesMiguel Ángel Garcia Morales
Miguel Ángel Garcia Morales
JBJosé A. Brambila-Hernández
José A. Brambila-Hernández
HFHéctor J. Fraire-Huacuja
Héctor J. Fraire-Huacuja
Juan Frausto SolisJuan Frausto Solis
Juan Frausto Solis
LCLaura Cruz-Reyes
Laura Cruz-Reyes
JVJuan Martín Carpio Valadez
Juan Martín Carpio Valadez
Multi-objective Evolutionary Algorithm based on Decomposition with Adaptive Adjustment of Control Parameters to Solve the Bi-objective Internet Shopping Optimization Problem (MOEA/D-AACPBIShOP)

1 October 2024 in International Journal of Combinatorial Optimization Problems and Informatics
Verified
Journal Article
Open access
PDF file
Miguel Ángel Garcia MoralesMiguel Ángel Garcia Morales
Miguel Ángel Garcia Morales
JBJosé A. Brambila-Hernández
José A. Brambila-Hernández
Hector Fraire-HuacujaHector Fraire-Huacuja
Hector Fraire-Huacuja
LCLaura Cruz-Reyes
Laura Cruz-Reyes
Juan Frausto SolisJuan Frausto Solis
Juan Frausto Solis
NRNelson Rangel-Valdez
Nelson Rangel-Valdez
In this paper, we approach the Internet Shopping Optimization Problem with Shipping Costs (IShOP), an NP-hard-relevant problem in the current e-commerce environment. To our knowledge, several solution metaheuristic algorithms have been reported in the literature. In this paper, we propose a novel Particle Swarm Optimization algorithm (PSO) to solve the problem. PSO incorporates a neighborhood diversification technique (NDT), a local search (LS) technique, and an adaptive parameter tuning (APT) method. The proposed algorithm (NDTLSAA-PSO) includes two techniques at the end of each iteration to avoid premature convergence in the search process, balancing exploration and exploitation in selecting candidate solutions. A comparison of the performance of the proposed algorithm has been made against the performance of the best state-of-the-art memetic algorithm solution of the IShOP. A total of 90 instances classified into three groups of small, medium, and large sizes were resolved. The Wilcoxon and Holm non-parametric tests were applied to validate the significance of the differences observed between these two algorithms. The results show that the proposed NDTLSAA-PSO algorithm is superior to the memetic algorithm. In addition, the proposed algorithm obtains the best results in all the in-stances evaluated in terms of quality.

Verified
Journal Article
Open access
PDF file
Miguel Ángel Garcia MoralesMiguel Ángel Garcia Morales
Miguel Ángel Garcia Morales
JBJosé A. Brambila-Hernández
José A. Brambila-Hernández
Hector Fraire-HuacujaHector Fraire-Huacuja
Hector Fraire-Huacuja
Juan Frausto SolisJuan Frausto Solis
Juan Frausto Solis
LCLaura Cruz-Reyes
Laura Cruz-Reyes
APAlfredo Pena-Ramos
Alfredo Pena-Ramos
In this research, two new methods for solving the Internet shopping optimization problem with sensitive prices are proposed, incorporating adaptive adjustment of control parameters. This problem is classified as NP-hard and is relevant to current electronic commerce. The first proposed solution method corresponds to a Memetic Algorithm incorporating improved local search and adaptive adjustment of control parameters. The second proposed solution method is a particle swarm optimization algorithm that adds a technique for diversification and adaptive adjustment of control parameters. We assess the effectiveness of the proposed algorithms by comparing them with the Branch and Bound algorithm, which presents the most favorable outcomes of the state-of-the-art method. Nine instances of three different sizes are used: small, medium, and large. For performance validation, the Wilcoxon and Friedman non-parametric tests are applied. The results show that the proposed algorithms exhibit comparable performance and outperform the Branch and Bound algorithm.

22 May 2024
Verified
Book Chapter
Closed access
PDF file
JBJosé Alfredo Brambila-Hernández
José Alfredo Brambila-Hernández
Miguel Ángel Garcia MoralesMiguel Ángel Garcia Morales
Miguel Ángel Garcia Morales
HFHéctor Joaquín Fraire-Huacuja
Héctor Joaquín Fraire-Huacuja
LCLaura Cruz-Reyes
Laura Cruz-Reyes
JFJuan Frausto-Solís
Juan Frausto-Solís

Verified
Journal Article
Open access
PDF file
JRJoel Rodríguez-Guillén
Joel Rodríguez-Guillén
RSRubén Salas-Cabrera
Rubén Salas-Cabrera
BGBarbara María-Esther Garcia-Morales
Barbara María-Esther Garcia-Morales
Miguel Ángel Garcia MoralesMiguel Ángel Garcia Morales
Miguel Ángel Garcia Morales
Juan Frausto SolisJuan Frausto Solis
Juan Frausto Solis
The Bond Graph (BG) methodology, a multi-domain graphical description formalism, is used to study a horizontal-axis two-mass drive train of a wind turbine. The main contribution of this work is to address the lack of wind energy literature dealing with fully unambiguous, traceable, and dimensionally homogeneous per-unit quantities for two-mass drive train models. Data in real quantities for the drive train are collected from open-access datasheets and their corresponding design information files. Wind turbines that may serve as Reference Wind Turbines (RWTs), with traceable calculations, are carefully selected. A lumped-parameter order-reduction method is employed to convert data from higher-order models into data for a reduced-order two-mass model. The BG methodology is then used to formally derive the per-unit drive train model and its corresponding dimensionally homogeneous per-unit parameters for a set of six representative Reference Wind Turbines, covering a nominal power range from 0.75 MW to 5 MW.