José Villamayor
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
José Villamayor has a total of 11 co-authors. Here are the top co-authors by number of shared publications:
- Emanuel Vega
Escuela de Ingeniería Informática, Pontificia Universidad Católica de Valparaíso, Valparaíso 2362807, Chile
2 shared publications - Ricardo Soto
Escuela de Ingeniería Informática, Pontificia Universidad Católica de Valparaíso, Avenida Brasil 2241, Valparaíso 2362807, Chile
2 shared publications - Broderick Crawford
Escuela de Ingeniería Informática, Pontificia Universidad Católica de Valparaíso, Avenida Brasil 2241, Valparaíso 2362807, Chile
1 shared publication Carlos Parra
1 shared publicationEmanuel Vega
1 shared publication- Fabián Pizarro
Escuela de Ingeniería Informática, Pontificia Universidad Católica de Valparaíso, Avenida Brasil 2241, Valparaíso, Valparaíso 2362807, Chile
1 shared publication
Latest Publications
- Open Access
- 13 October 2026
- Published by MDPI AG in Mathematics
- Vol. 14 (20) , 3715
Search-Trajectory Patterns as Feedback for Adaptive Metaheuristic Configuration Control
Adaptive decisions are often based on algorithm-specific feedback or simple indicators that provide limited information about the evolving search dynamics. This work investigates explicit pattern-based analysis of the search trajectory as a source of feedback for adaptive configuration control. A trajectory-driven framework is proposed in which Derivative Dynamic Time Warping (DDTW) analyzes the recent best-so-far fitness trajectory against reference patterns representing sustained progress and lack of progress. The resulting information regulates switching between predefined exploration- and exploitation-oriented parameter configurations. Two control strategies are introduced: Binary-Simple, which reacts directly to trajectory evidence associated with a plateau, and Binary-Complex, which incorporates multiple search conditions, temporal persistence, and asymmetric switching. The framework is evaluated on 27 Multidimensional Knapsack Problem instances using BPSO, GA, BGWO, and BDE, with 31 independent runs per condition. Results show that no fixed configuration consistently dominates across metaheuristics and instances, while the effects of trajectory-driven adaptation depend on the underlying algorithm. Across 108 metaheuristic–instance conditions, Binary-Complex achieves the best mean rank (2.13). The Friedman test detects an overall difference among strategies (); Bonferroni-Dunn post-hoc comparisons favor Binary-Complex over both fixed configurations, but do not establish a difference from Binary-Simple. Moreover, a common trajectory-analysis parameterization produces different switching behaviors across the evaluated metaheuristics. These findings support explicit search-trajectory pattern analysis as a viable feedback mechanism for adaptive configuration control across different population-based metaheuristics.- 13 October 2026
- Published by MDPI AG in Mathematics
- Vol. 14 (20) , 3715
Open AccessSearch-Trajectory Patterns as Feedback for Adaptive Metaheuristic Configuration Control
Adaptive decisions are often based on algorithm-specific feedback or simple indicators that provide limited information about the evolving search dynamics. This work investigates explicit pattern-based analysis of the search trajectory as a source of feedback for adaptive configuration control. A trajectory-driven framework is proposed in which Derivative Dynamic Time Warping (DDTW) analyzes the recent best-so-far fitness trajectory against reference patterns representing sustained progress and lack of progress. The resulting information regulates switching between predefined exploration- and exploitation-oriented parameter configurations. Two control strategies are introduced: Binary-Simple, which reacts directly to trajectory evidence associated with a plateau, and Binary-Complex, which incorporates multiple search conditions, temporal persistence, and asymmetric switching. The framework is evaluated on 27 Multidimensional Knapsack Problem instances using BPSO, GA, BGWO, and BDE, with 31 independent runs per condition. Results show that no fixed configuration consistently dominates across metaheuristics and instances, while the effects of trajectory-driven adaptation depend on the underlying algorithm. Across 108 metaheuristic–instance conditions, Binary-Complex achieves the best mean rank (2.13). The Friedman test detects an overall difference among strategies (); Bonferroni-Dunn post-hoc comparisons favor Binary-Complex over both fixed configurations, but do not establish a difference from Binary-Simple. Moreover, a common trajectory-analysis parameterization produces different switching behaviors across the evaluated metaheuristics. These findings support explicit search-trajectory pattern analysis as a viable feedback mechanism for adaptive configuration control across different population-based metaheuristics. - Open Access
- 11 April 2026
- Published by Elsevier in SSRN Electronic Journal
Reducing Subjectivity in Liquid Penetrant Inspectionof Welds through Computer Vision
The inspection of welded joints is a critical process in industrial environments where structural integrity and safety must be ensured. Traditional liquid penetrant testing is effective but can be limited by subjective visual assessment, variability across inspectors, and human error. This work presents an automated inspection pipeline that integrates liquid penetrant testing with artificial intelligence and computer vision. The proposed approach employs convolutional neural networks to analyze weld images and classify five surface conditions/discontinuity types, aligned with standards such as American Society for Testing and Materials E165/E165M and International Organization for Standardization 3452. Model selection is performed on a development set via stratified 10-fold cross-validation with fixed, reproducible folds, and the final evaluation is reported on a held-out test set. Performance is quantified using accuracy, precision, recall, and F1-score, and interpretability is supported via Grad-CAM++ visual explanations. Under this protocol, the proposed convolutional network achieves the best overall cross-validation performance among the evaluated deep and shallow baselines.
- 11 April 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessReducing Subjectivity in Liquid Penetrant Inspectionof Welds through Computer Vision
The inspection of welded joints is a critical process in industrial environments where structural integrity and safety must be ensured. Traditional liquid penetrant testing is effective but can be limited by subjective visual assessment, variability across inspectors, and human error. This work presents an automated inspection pipeline that integrates liquid penetrant testing with artificial intelligence and computer vision. The proposed approach employs convolutional neural networks to analyze weld images and classify five surface conditions/discontinuity types, aligned with standards such as American Society for Testing and Materials E165/E165M and International Organization for Standardization 3452. Model selection is performed on a development set via stratified 10-fold cross-validation with fixed, reproducible folds, and the final evaluation is reported on a held-out test set. Performance is quantified using accuracy, precision, recall, and F1-score, and interpretability is supported via Grad-CAM++ visual explanations. Under this protocol, the proposed convolutional network achieves the best overall cross-validation performance among the evaluated deep and shallow baselines.
- Open Access
- 12 November 2025
- Published by MDPI AG in Biomimetics
- Vol. 10 (11) , 762
Low-Overhead Learning: Quantized Shallow Neural Networks at the Service of Genetic Algorithm Optimization
Online parameter tuning significantly enhances the performance of optimization algorithms by dynamically adjusting mutation and crossover rates. However, current approaches often suffer from high computational costs and limited adaptability to complex and dynamic fitness landscapes, particularly when machine learning methods are employed. This work proposes a quantized shallow neural network (SNN) as an efficient learning-based component for dynamically adjusting the mutation and crossover rates of a genetic algorithm (GA). By leveraging runtime-generated data and applying quantization techniques like Quantization-aware Training (QaT) and Post-training Quantization (PtQ), the proposed approach reduces computational overhead while maintaining competitive performance. Experimental evaluation on 15 continuous benchmark functions demonstrates that the quantized SNN achieves high-quality solutions while significantly reducing execution time compared to alternative shallow learning methods. This study highlights the potential of quantized SNNs to balance efficiency and performance, broadening the applicability of shallow learning in optimization.
- 12 November 2025
- Published by MDPI AG in Biomimetics
- Vol. 10 (11) , 762
Open AccessLow-Overhead Learning: Quantized Shallow Neural Networks at the Service of Genetic Algorithm Optimization
Online parameter tuning significantly enhances the performance of optimization algorithms by dynamically adjusting mutation and crossover rates. However, current approaches often suffer from high computational costs and limited adaptability to complex and dynamic fitness landscapes, particularly when machine learning methods are employed. This work proposes a quantized shallow neural network (SNN) as an efficient learning-based component for dynamically adjusting the mutation and crossover rates of a genetic algorithm (GA). By leveraging runtime-generated data and applying quantization techniques like Quantization-aware Training (QaT) and Post-training Quantization (PtQ), the proposed approach reduces computational overhead while maintaining competitive performance. Experimental evaluation on 15 continuous benchmark functions demonstrates that the quantized SNN achieves high-quality solutions while significantly reducing execution time compared to alternative shallow learning methods. This study highlights the potential of quantized SNNs to balance efficiency and performance, broadening the applicability of shallow learning in optimization.