Bárbara María-Esther García-Morales
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Bárbara María-Esther García-Morales has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
- Joel Rodríguez-Guillén
Tecnológico Nacional de México, Instituto Tecnológico de Ciudad Madero, Ciudad Madero 89440, Tamaulipas, Mexico
2 shared publications - Juan Frausto-Solís
Graduate Program Division, Tecnológico Nacional de México/Instituto Tecnológico de Ciudad Madero, Ciudad Madero 89440, Mexico
2 shared publications - Miguel Ángel García-Morales
Facultad de Arquitectura, Diseño y Urbanismo, Universidad Autónoma de Tamaulipas, Tampico 89336, Tamaulipas, Mexico
2 shared publications - Rubén Salas-Cabrera
Tecnológico Nacional de México, Instituto Tecnológico de Ciudad Madero, Ciudad Madero 89440, Tamaulipas, Mexico
2 shared publications
Latest Publications
- Open Access
- 1 April 2026
- Published by MDPI AG in Mathematical and Computational Applications
- Vol. 31 (2) , 51
On the Unambiguous, Traceable and Dimensionally Homogeneous Calculation of Per-Unit Parameters for the Two-Mass Drive Train Model of a Set of Reference Wind Turbines
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.
- 1 April 2026
- Published by MDPI AG in Mathematical and Computational Applications
- Vol. 31 (2) , 51
Open AccessOn the Unambiguous, Traceable and Dimensionally Homogeneous Calculation of Per-Unit Parameters for the Two-Mass Drive Train Model of a Set of Reference Wind Turbines
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.
- Open Access
- 2 February 2026
- Published by MDPI AG in Mathematical and Computational Applications
- Vol. 31 (1) , 20
New Adaptive Echolocation Radar Technique Incorporated into the Bat Algorithm Applied to Benchmark Functions (Radar-Bat)
This article proposes a bat algorithm that incorporates novel techniques inspired by maritime radars, referred to as the Radar-Bat algorithm. This proposed method allows each virtual bat to identify the position of the best solution at a given distance within the search space. It incorporates an adaptive threshold to maintain a constant false alarm rate (CFAR), enabling the acceptance of solutions based on the best value found, thus improving the exploitation of the search space. Furthermore, a systematic directional sweep balances exploration and exploitation effectively. This algorithm is used to solve complex optimization problems, essentially those with multimodal functions, demonstrating that the proposed algorithm achieves better convergence and robustness compared to the basic bat algorithm, highlighting its potential as a novel contribution to the field of metaheuristics. To evaluate the performance of the proposed algorithm against the basic bat algorithm, the Wilcoxon and Friedman non-parametric tests are applied, with a significance level of 5%. Computational experiments show that the proposed algorithm outperforms the state-of-the-art algorithm. In terms of quality, the proposed algorithm shows clear superiority over the basic bat algorithm across most benchmark functions. Regarding efficiency, although Radar Bat incorporates additional mechanisms, the experimental results do not indicate a consistent disadvantage in execution time, with both algorithms exhibiting comparable performance depending on the problem and dimensionality.
- 2 February 2026
- Published by MDPI AG in Mathematical and Computational Applications
- Vol. 31 (1) , 20
Open AccessNew Adaptive Echolocation Radar Technique Incorporated into the Bat Algorithm Applied to Benchmark Functions (Radar-Bat)
This article proposes a bat algorithm that incorporates novel techniques inspired by maritime radars, referred to as the Radar-Bat algorithm. This proposed method allows each virtual bat to identify the position of the best solution at a given distance within the search space. It incorporates an adaptive threshold to maintain a constant false alarm rate (CFAR), enabling the acceptance of solutions based on the best value found, thus improving the exploitation of the search space. Furthermore, a systematic directional sweep balances exploration and exploitation effectively. This algorithm is used to solve complex optimization problems, essentially those with multimodal functions, demonstrating that the proposed algorithm achieves better convergence and robustness compared to the basic bat algorithm, highlighting its potential as a novel contribution to the field of metaheuristics. To evaluate the performance of the proposed algorithm against the basic bat algorithm, the Wilcoxon and Friedman non-parametric tests are applied, with a significance level of 5%. Computational experiments show that the proposed algorithm outperforms the state-of-the-art algorithm. In terms of quality, the proposed algorithm shows clear superiority over the basic bat algorithm across most benchmark functions. Regarding efficiency, although Radar Bat incorporates additional mechanisms, the experimental results do not indicate a consistent disadvantage in execution time, with both algorithms exhibiting comparable performance depending on the problem and dimensionality.