José Carlos Ortiz-Bayliss
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
José Carlos Ortiz-Bayliss has a total of 85 co-authors. Here are the top co-authors by number of shared publications:
- Ivan Amaya
Tecnológico de Monterrey
42 shared publications - Jorge Mario Cruz-Duarte
University of Lille, CNRS, Inria, Centrale Lille, UMR 9189 CRIStAL
31 shared publications - Hugo Terashima-Marín
School of Engineering and Sciences, Tecnologico de Monterrey, Monterrey, Mexico
26 shared publications Hugo Terashima-Marín
18 shared publications- Santiago Enrique Conant-Pablos
School of Engineering and Sciences, Tecnolgico de Monterrey, Monterrey, Nuevo Leon, Mexico
16 shared publications Santiago Enrique Conant-Pablos
National School of Engineering and Sciences, Tecnológico de Monterrey, Avenida Eugenio Garza Sada 2501 Sur, Colonia Tecnológico, 64849 Monterrey, NL, Mexico
11 shared publications
Latest Publications
- 5 November 2026
- Published by Springer Nature
- p. 325-341
A Preliminary Study on Gene Expression Programming as a Generation Hyper-heuristic for Solving the 0/1 Knapsack Problem
- 5 November 2026
- Published by Springer Nature
- p. 325-341
A Preliminary Study on Gene Expression Programming as a Generation Hyper-heuristic for Solving the 0/1 Knapsack Problem
- Open Access
- 25 June 2026
- Published by MDPI AG in Machine Learning and Knowledge Extraction
- Vol. 8 (7) , 176
Autism Spectrum Disorder Detection Using a Weighted-Average Ensemble of Deep Convolutional Neural Networks on Eye-Tracking Images
Autism Spectrum Disorder is a long-term neurodevelopmental disorder. Early diagnosis is crucial for timely rehabilitation and intervention. Recently, machine learning and deep learning techniques have been widely explored and have produced encouraging results using eye-tracking scanpath images for the early detection of ASD. However, these approaches exhibit inconsistent performance and classification error rates, as well as limited generalization, due to differences in learning approaches and architectural designs across individual models. To address these problems, we employed a weighted-average ensemble of deep learning models using eye-tracking scanpath images. In this work, two different pretrained convolutional neural networks were selected, including Xception and VGG16, based on their proven efficacy and performance. Moreover, we fine-tuned each model individually and evaluated them on a dataset containing eye-tracking scanpath images. We implemented a weighted-average ensemble technique to combine the diverse predictions of the two models. It reduces classification errors and improves the model’s generalization and overall performance. The adopted weighted-average ensemble technique achieved an accuracy of 98.18%, with a perfect recall, and a competitive Area Under the Curve (AUC) of 99.59%. These findings highlight that applying a weighted average to integrate multiple models’ predictions strengthens the generalization and reliability of ASD detection.
- 25 June 2026
- Published by MDPI AG in Machine Learning and Knowledge Extraction
- Vol. 8 (7) , 176
Open AccessAutism Spectrum Disorder Detection Using a Weighted-Average Ensemble of Deep Convolutional Neural Networks on Eye-Tracking Images
Autism Spectrum Disorder is a long-term neurodevelopmental disorder. Early diagnosis is crucial for timely rehabilitation and intervention. Recently, machine learning and deep learning techniques have been widely explored and have produced encouraging results using eye-tracking scanpath images for the early detection of ASD. However, these approaches exhibit inconsistent performance and classification error rates, as well as limited generalization, due to differences in learning approaches and architectural designs across individual models. To address these problems, we employed a weighted-average ensemble of deep learning models using eye-tracking scanpath images. In this work, two different pretrained convolutional neural networks were selected, including Xception and VGG16, based on their proven efficacy and performance. Moreover, we fine-tuned each model individually and evaluated them on a dataset containing eye-tracking scanpath images. We implemented a weighted-average ensemble technique to combine the diverse predictions of the two models. It reduces classification errors and improves the model’s generalization and overall performance. The adopted weighted-average ensemble technique achieved an accuracy of 98.18%, with a perfect recall, and a competitive Area Under the Curve (AUC) of 99.59%. These findings highlight that applying a weighted average to integrate multiple models’ predictions strengthens the generalization and reliability of ASD detection.
- 5 May 2026
- Published by Elsevier in Applied Soft Computing
- Vol. 200
Optimizing microgrid controllers for enhanced power quality using metaheuristic approaches
- 5 May 2026
- Published by Elsevier in Applied Soft Computing
- Vol. 200
Optimizing microgrid controllers for enhanced power quality using metaheuristic approaches
- Open Access
- 12 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 14, 40899-40917
Automated Design and Selection of Metaheuristics for PID Control in Power Electronics
This work introduces an alternative approach that utilizes a Hyper-Heuristic framework under the umbrella of Automated Algorithm Design to dynamically tailor Metaheuristics (MHs) for fine-tuning PID controller parameters. Our findings emphasize the robust consistency, high precision, and adaptability of the method in creating custom, metaphor-free MHs. We employ this methodology in a case study of real-world engineering problems to develop a control-heuristic-based tuner that significantly improves the performance of DC-DC Buck converters across diverse operational conditions. The analysis reveals dominant trends in search operator preferences, highlighting the reliance on genetic crossover and swarm dynamics. These insights provide actionable directions for similar applications in power electronics. Through rigorous statistical comparisons, we verify the superior efficacy and reliability of our approach relative to conventional methods, remarking on its potential for broad application in the field.
- 12 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 14, 40899-40917
Open AccessAutomated Design and Selection of Metaheuristics for PID Control in Power Electronics
This work introduces an alternative approach that utilizes a Hyper-Heuristic framework under the umbrella of Automated Algorithm Design to dynamically tailor Metaheuristics (MHs) for fine-tuning PID controller parameters. Our findings emphasize the robust consistency, high precision, and adaptability of the method in creating custom, metaphor-free MHs. We employ this methodology in a case study of real-world engineering problems to develop a control-heuristic-based tuner that significantly improves the performance of DC-DC Buck converters across diverse operational conditions. The analysis reveals dominant trends in search operator preferences, highlighting the reliance on genetic crossover and swarm dynamics. These insights provide actionable directions for similar applications in power electronics. Through rigorous statistical comparisons, we verify the superior efficacy and reliability of our approach relative to conventional methods, remarking on its potential for broad application in the field.
- 13 February 2026
- Published by Springer Nature in Neural Computing and Applications
- Vol. 38 (3) , 42
Heuristic selection through neural networks: an extended analysis on the pod allocation problem within robotic mobile fulfillment systems
- 13 February 2026
- Published by Springer Nature in Neural Computing and Applications
- Vol. 38 (3) , 42
Heuristic selection through neural networks: an extended analysis on the pod allocation problem within robotic mobile fulfillment systems
- Open Access
- 2 December 2025
- Published by MDPI AG in International Journal of Molecular Sciences
- Vol. 26 (23) , 11685
Benchmarking Molecular Mutation Operators for Evolutionary Drug Design
This study investigates and compares different molecular mutation strategies to optimize their application as genetic algorithm operators in drug design. We evaluated five distinct mutation methods—Graph-Based Genetic Algorithm, Graph-Based Generative Model, SmilesClickChem, SELFIES Token, and SMILES Token Mutation—by assessing their computational efficiency, validity, and impact on molecular complexity and structural conservation. Our results reveal that the Graph-Based Genetic Algorithm achieves the highest molecular validity (96.5%) while maintaining computational efficiency, making it ideal for rapid iterative drug discovery. SmilesClickChem and Graph-Based Generative Model tend to increase molecular complexity, whereas SF-T simplifies molecular structures, suggesting different applications in lead optimization. Additionally, we analyzed mutation-induced changes in pIC50 potency and found that SELFIES Token caused the most substantial shifts in bioactivity, particularly in SRC-targeted molecules. These findings underscore the importance of selecting the appropriate mutation strategy to balance validity, structural diversity, and computational cost in AI-driven drug design. Our insights help refine evolutionary algorithms for molecular generation and optimize candidate selection in early-stage drug discovery.
- 2 December 2025
- Published by MDPI AG in International Journal of Molecular Sciences
- Vol. 26 (23) , 11685
Open AccessBenchmarking Molecular Mutation Operators for Evolutionary Drug Design
This study investigates and compares different molecular mutation strategies to optimize their application as genetic algorithm operators in drug design. We evaluated five distinct mutation methods—Graph-Based Genetic Algorithm, Graph-Based Generative Model, SmilesClickChem, SELFIES Token, and SMILES Token Mutation—by assessing their computational efficiency, validity, and impact on molecular complexity and structural conservation. Our results reveal that the Graph-Based Genetic Algorithm achieves the highest molecular validity (96.5%) while maintaining computational efficiency, making it ideal for rapid iterative drug discovery. SmilesClickChem and Graph-Based Generative Model tend to increase molecular complexity, whereas SF-T simplifies molecular structures, suggesting different applications in lead optimization. Additionally, we analyzed mutation-induced changes in pIC50 potency and found that SELFIES Token caused the most substantial shifts in bioactivity, particularly in SRC-targeted molecules. These findings underscore the importance of selecting the appropriate mutation strategy to balance validity, structural diversity, and computational cost in AI-driven drug design. Our insights help refine evolutionary algorithms for molecular generation and optimize candidate selection in early-stage drug discovery.
- Open Access
- 12 August 2025
- Published by MDPI AG in Algorithms
- Vol. 18 (8) , 502
How Much Is Too Much? Facing Practical Limitations in Hyper-Heuristic Design for Packing Problems
Hyper-heuristics, or simply heuristics to choose heuristics, represent a powerful approach to tackling complex optimization problems. These methods decide which heuristic to apply throughout the solving process, aiming to improve the solving process. While they have demonstrated significant success across various domains, their suitability for all problem instances, even within a specific domain, is not guaranteed. The literature provides many examples of successful hyper-heuristic models for packing problems. Among those models, we can mention rule-based and fixed-sequence-based hyper-heuristics. These two models have proven useful in various scenarios. This paper investigates a genetic-based approach that produces hybrid hyper-heuristics. Such hybrid hyper-heuristics combine rule-based decisions while firing heuristic sequences. The rationale behind this hybrid approach is that we aimed to combine the strengths of both approaches. Although we expected to improve on the individual performance of the methods, we obtained contradictory results that suggest that, at least in this work, combining the strengths of different hyper-heuristic models may not be a suitable approach.
- 12 August 2025
- Published by MDPI AG in Algorithms
- Vol. 18 (8) , 502
Open AccessHow Much Is Too Much? Facing Practical Limitations in Hyper-Heuristic Design for Packing Problems
Hyper-heuristics, or simply heuristics to choose heuristics, represent a powerful approach to tackling complex optimization problems. These methods decide which heuristic to apply throughout the solving process, aiming to improve the solving process. While they have demonstrated significant success across various domains, their suitability for all problem instances, even within a specific domain, is not guaranteed. The literature provides many examples of successful hyper-heuristic models for packing problems. Among those models, we can mention rule-based and fixed-sequence-based hyper-heuristics. These two models have proven useful in various scenarios. This paper investigates a genetic-based approach that produces hybrid hyper-heuristics. Such hybrid hyper-heuristics combine rule-based decisions while firing heuristic sequences. The rationale behind this hybrid approach is that we aimed to combine the strengths of both approaches. Although we expected to improve on the individual performance of the methods, we obtained contradictory results that suggest that, at least in this work, combining the strengths of different hyper-heuristic models may not be a suitable approach.
- Open Access
- 26 July 2025
- Published by Springer Nature in Scientific Reports
- Vol. 15 (1) , 1-21
A steady state micro genetic algorithm for hyper-heuristic generation in one-dimensional bin packing
The one-dimensional bin packing problem (1DBPP) is a well-known NP-hard problem in computer science and operations research that involves many real-world applications. Its primary objective is to allocate items into bins while minimizing the number of bins used. Due to the complexity of the problem, exact algorithms are often impractical for large instances, which has led to a reliance on tailored heuristics that may perform well on some instances but poorly on others. In this study, we propose a method to automatically generate selection hyper-heuristics (HHs), which are then applied to solve 1DBPP instances by leveraging the strengths of simple heuristics while avoiding their drawbacks. Specifically, we introduce a steady-state \(\mu\) Genetic Algorithm (SS\(\mu\)GA) to generate selection HHs, benefiting from the gradual population updates of steady-state GAs and the efficiency of \(\mu\)GAs with smaller populations for faster iterations. Our experimental results showcase the effectiveness of the SS\(\mu\)GA across multiple training and testing datasets for the 1DBPP. Compared to other evolutionary methodologies, also used as generative HH methods (i.e., generational GA, steady-state GA, and generational \(\mu\)GA), the SS\(\mu\)GA consistently achieves higher fitness values within the same number of evaluations, on the training set. Additionally, on both generated and literature 1DBPP instances for the testing set, the selection HHs generated by the SS\(\mu\)GA were highly competitive, often outperforming those produced by other methods. Furthermore, the SS\(\mu\)GA-generated HHs displayed both specialization for specific instance types and generalization across varied instances.- 26 July 2025
- Published by Springer Nature in Scientific Reports
- Vol. 15 (1) , 1-21
Open AccessA steady state micro genetic algorithm for hyper-heuristic generation in one-dimensional bin packing
The one-dimensional bin packing problem (1DBPP) is a well-known NP-hard problem in computer science and operations research that involves many real-world applications. Its primary objective is to allocate items into bins while minimizing the number of bins used. Due to the complexity of the problem, exact algorithms are often impractical for large instances, which has led to a reliance on tailored heuristics that may perform well on some instances but poorly on others. In this study, we propose a method to automatically generate selection hyper-heuristics (HHs), which are then applied to solve 1DBPP instances by leveraging the strengths of simple heuristics while avoiding their drawbacks. Specifically, we introduce a steady-state \(\mu\) Genetic Algorithm (SS\(\mu\)GA) to generate selection HHs, benefiting from the gradual population updates of steady-state GAs and the efficiency of \(\mu\)GAs with smaller populations for faster iterations. Our experimental results showcase the effectiveness of the SS\(\mu\)GA across multiple training and testing datasets for the 1DBPP. Compared to other evolutionary methodologies, also used as generative HH methods (i.e., generational GA, steady-state GA, and generational \(\mu\)GA), the SS\(\mu\)GA consistently achieves higher fitness values within the same number of evaluations, on the training set. Additionally, on both generated and literature 1DBPP instances for the testing set, the selection HHs generated by the SS\(\mu\)GA were highly competitive, often outperforming those produced by other methods. Furthermore, the SS\(\mu\)GA-generated HHs displayed both specialization for specific instance types and generalization across varied instances. - Open Access
- 19 July 2025
- Published by MDPI AG in Applied Sciences
- Vol. 15 (14) , 8056
Summarizing Recent Developments on Autism Spectrum Disorder Detection and Classification Through Machine Learning and Deep Learning Techniques
Autism Spectrum Disorder (ASD) encompasses various neurological disorders with symptoms varying by age, development, genetics, and other factors. Core symptoms include decreased pain sensitivity, difficulty sustaining eye contact, incorrect auditory responses, and social engagement issues. Diagnosing ASD poses challenges as signs can appear at early stages of life, leading to delayed diagnoses. Traditional diagnosis relies mainly on clinical observation, which is a subjective and time-consuming approach. However, AI-driven techniques, primarily those within machine learning and deep learning, are becoming increasingly prevalent for the efficient and objective detection and classification of ASD. In this work, we review and discuss the most relevant related literature between January 2016 and May 2024 by focusing on ASD detection or classification using diverse technologies, including magnetic resonance imaging, facial images, questionnaires, electroencephalogram, and eye tracking data. Our analysis encompasses works from major research repositories, including WoS, PubMed, Scopus, and IEEE. We discuss rehabilitation techniques, the structure of public and private datasets, and the challenges of automated ASD detection, classification, and therapy by highlighting emerging trends, gaps, and future research directions. Among the most interesting findings of this review are the relevance of questionnaires and genetics in the early detection of ASD, as well as the prevalence of datasets that are biased toward specific genders, ethnicities, or geographic locations, restricting their applicability. This document serves as a comprehensive resource for researchers, clinicians, and stakeholders, promoting a deeper understanding and advancement of AI applications in the evaluation and management of ASD.
- 19 July 2025
- Published by MDPI AG in Applied Sciences
- Vol. 15 (14) , 8056
Open AccessSummarizing Recent Developments on Autism Spectrum Disorder Detection and Classification Through Machine Learning and Deep Learning Techniques
Autism Spectrum Disorder (ASD) encompasses various neurological disorders with symptoms varying by age, development, genetics, and other factors. Core symptoms include decreased pain sensitivity, difficulty sustaining eye contact, incorrect auditory responses, and social engagement issues. Diagnosing ASD poses challenges as signs can appear at early stages of life, leading to delayed diagnoses. Traditional diagnosis relies mainly on clinical observation, which is a subjective and time-consuming approach. However, AI-driven techniques, primarily those within machine learning and deep learning, are becoming increasingly prevalent for the efficient and objective detection and classification of ASD. In this work, we review and discuss the most relevant related literature between January 2016 and May 2024 by focusing on ASD detection or classification using diverse technologies, including magnetic resonance imaging, facial images, questionnaires, electroencephalogram, and eye tracking data. Our analysis encompasses works from major research repositories, including WoS, PubMed, Scopus, and IEEE. We discuss rehabilitation techniques, the structure of public and private datasets, and the challenges of automated ASD detection, classification, and therapy by highlighting emerging trends, gaps, and future research directions. Among the most interesting findings of this review are the relevance of questionnaires and genetics in the early detection of ASD, as well as the prevalence of datasets that are biased toward specific genders, ethnicities, or geographic locations, restricting their applicability. This document serves as a comprehensive resource for researchers, clinicians, and stakeholders, promoting a deeper understanding and advancement of AI applications in the evaluation and management of ASD.
- Open Access
- 3 July 2025
- Published by MDPI AG in Preprints.org
How Much Is Too Much? Facing Practical Limitations in Hyper-Heuristic Design for Packing Problems
Hyper-heuristics, or simply heuristics to choose heuristics, represent a powerful approach to tackling complex optimization problems. These methods decide which heuristic to apply throughout the solving process, aiming to improve the solving process. While they have demonstrated significant success across various domains, their suitability for all problem instances, even within a specific domain, is not guaranteed. The literature provides many examples of successful hyper-heuristic models for packing problems. Among those models, we can mention rule-based and fixed-sequence-based hyper-heuristics. These two models have proven useful in various scenarios. This paper investigates a genetic-based approach that produces hybrid hyper-heuristics. Such hybrid hyper-heuristics combine rule-based decisions while firing heuristic sequences. The rationale behind this hybrid approach is that we aimed to combine the strengths of both approaches. Although we expected to improve on the individual performance of the methods, we obtained unexpected results.
- 3 July 2025
- Published by MDPI AG in Preprints.org
Open AccessHow Much Is Too Much? Facing Practical Limitations in Hyper-Heuristic Design for Packing Problems
Hyper-heuristics, or simply heuristics to choose heuristics, represent a powerful approach to tackling complex optimization problems. These methods decide which heuristic to apply throughout the solving process, aiming to improve the solving process. While they have demonstrated significant success across various domains, their suitability for all problem instances, even within a specific domain, is not guaranteed. The literature provides many examples of successful hyper-heuristic models for packing problems. Among those models, we can mention rule-based and fixed-sequence-based hyper-heuristics. These two models have proven useful in various scenarios. This paper investigates a genetic-based approach that produces hybrid hyper-heuristics. Such hybrid hyper-heuristics combine rule-based decisions while firing heuristic sequences. The rationale behind this hybrid approach is that we aimed to combine the strengths of both approaches. Although we expected to improve on the individual performance of the methods, we obtained unexpected results.