Salvador Ibarra Martínez
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Salvador Ibarra Martínez has a total of 36 co-authors. Here are the top co-authors by number of shared publications:
- José Antonio Castán Rocha
Universidad Autónoma de Tamaulipas
21 shared publications - Jesús David Terán-Villanueva
Facultad de Ingeniería Tampico, Universidad Autónoma de Tamaulipas, Centro Universitario Sur, Tampico 89109, Tamaulipas, Mexico
16 shared publications - Alejandro Santiago
Autonomous University of Tamaulipas
15 shared publications - Julio Laria-Menchaca
Facultad de Ingenieria Tampico, Universidad Autonoma de Tamaulipas, Tampico 89336, Mexico
14 shared publications - Mayra Guadalupe Treviño-Berrones
Facultad de Ingeniería Tampico, Universidad Autónoma de Tamaulipas, Centro Universitario Sur, Tampico 89109, Tamaulipas, Mexico
11 shared publications - Mirna Patricia Ponce-Flores
División de Estudios de Posgrado e Investigación, Tecnológico Nacional de México/Instituto Tecnológico de Ciudad Madero, Ciudad Madero 89440, Mexico
10 shared publications
Latest Publications
- 27 May 2026
- Published by Springer Nature
- p. 3-40
A Comparative Analysis of LightGBM and ES-RNN Applied to Time Series Forecasting
- 27 May 2026
- Published by Springer Nature
- p. 3-40
A Comparative Analysis of LightGBM and ES-RNN Applied to Time Series Forecasting
- Open Access
Assessing Performance and Crossover Operators on Differential Evolution for Attribute Weighting
Machine learning has a wide range of applications, including classification, which categorizes elements based on their characteristics. This paper addresses the challenge of optimizing attribute weighting while assessing two crossover operators on differential evolution optimization and increasing the performance of the k-nearest neighbors classification algorithm (KNN). We use a differential evolution optimization method and assess the performance of both the differential evolution and the harmony crossover operators. Finally, the optimization method uses the accuracy of a KNN classification algorithm as a fitness function. The results show that the proposed method significantly enhances the KNN performance while proposing an alternative for other classification models such as neural networks and Random Forest.
Open AccessAssessing Performance and Crossover Operators on Differential Evolution for Attribute Weighting
Machine learning has a wide range of applications, including classification, which categorizes elements based on their characteristics. This paper addresses the challenge of optimizing attribute weighting while assessing two crossover operators on differential evolution optimization and increasing the performance of the k-nearest neighbors classification algorithm (KNN). We use a differential evolution optimization method and assess the performance of both the differential evolution and the harmony crossover operators. Finally, the optimization method uses the accuracy of a KNN classification algorithm as a fitness function. The results show that the proposed method significantly enhances the KNN performance while proposing an alternative for other classification models such as neural networks and Random Forest.
- Open Access
- 10 December 2025
- Published by MDPI AG in Journal of Imaging
- Vol. 11 (12) , 439
Application of Artificial Intelligence and Computer Vision for Measuring and Counting Oysters
One of the most important activities in any oyster farm is the measurement of oyster size; this activity is time-consuming and conducted manually, generally using a caliper, which leads to high measurement variability. This paper proposes a methodology to count and obtain the length and width averages of a sample of oysters from an image, relying on artificial intelligence (AI), which refers to systems capable of learning and decision-making, and computer vision (CV), which enables the extraction of information from digital images. The proposed approach employs the DBScan clustering algorithm, an artificial neural network (ANN), and a random forest classifier to enable automatic oyster classification, counting, and size estimation from images. As a result of the proposed methodology, the speed in measuring the length and width of the oysters was 86.7 times faster than manual measurement. Regarding the counting, the process missed the total count of oysters in two of the ten images. These results demonstrate the feasibility of using the proposed methodology to measure oyster size and count in oyster farms.
- 10 December 2025
- Published by MDPI AG in Journal of Imaging
- Vol. 11 (12) , 439
Open AccessApplication of Artificial Intelligence and Computer Vision for Measuring and Counting Oysters
One of the most important activities in any oyster farm is the measurement of oyster size; this activity is time-consuming and conducted manually, generally using a caliper, which leads to high measurement variability. This paper proposes a methodology to count and obtain the length and width averages of a sample of oysters from an image, relying on artificial intelligence (AI), which refers to systems capable of learning and decision-making, and computer vision (CV), which enables the extraction of information from digital images. The proposed approach employs the DBScan clustering algorithm, an artificial neural network (ANN), and a random forest classifier to enable automatic oyster classification, counting, and size estimation from images. As a result of the proposed methodology, the speed in measuring the length and width of the oysters was 86.7 times faster than manual measurement. Regarding the counting, the process missed the total count of oysters in two of the ten images. These results demonstrate the feasibility of using the proposed methodology to measure oyster size and count in oyster farms.
- Open Access
- 14 July 2025
- Published by Editorial Académica Dragón Azteca in International Journal of Combinatorial Optimization Problems and Informatics
- Vol. 16 (3) , 512-528
Feature Selection through Filtering with Mono and Multi-Objective Memetic Algorithms Using Correlation
Feature selection is the process of extracting the most relevant features from a dataset, helping to reduce its dimensionality by eliminating non-essential features. This leads to simpler, faster models and optimises training efficiency. This paper presents two memetic algorithms: one employs a mono-objective filter method as a fitness function, while the other adopts a multi-objective approach. The latter uses the number of attributes in the dataset as the first objective, and the sum of Pearson’s correlations for the selected attributes as the second. Additionally, we apply a novel approach to the use of correlation for attribute selection within the aforementioned memetic algorithms. Both proposals aim to identify the most relevant attributes to reduce the dimensionality of twelve test datasets. The performance of the selected features was evaluated using a J48 decision tree. The results showed a reduction in the number of attributes ranging from 14% down to 5%, while accuracy varied from −5% up to 11%, with an average improvement of over 4% (considering only those datasets where accuracy changed).
- 14 July 2025
- Published by Editorial Académica Dragón Azteca in International Journal of Combinatorial Optimization Problems and Informatics
- Vol. 16 (3) , 512-528
Open AccessFeature Selection through Filtering with Mono and Multi-Objective Memetic Algorithms Using Correlation
Feature selection is the process of extracting the most relevant features from a dataset, helping to reduce its dimensionality by eliminating non-essential features. This leads to simpler, faster models and optimises training efficiency. This paper presents two memetic algorithms: one employs a mono-objective filter method as a fitness function, while the other adopts a multi-objective approach. The latter uses the number of attributes in the dataset as the first objective, and the sum of Pearson’s correlations for the selected attributes as the second. Additionally, we apply a novel approach to the use of correlation for attribute selection within the aforementioned memetic algorithms. Both proposals aim to identify the most relevant attributes to reduce the dimensionality of twelve test datasets. The performance of the selected features was evaluated using a J48 decision tree. The results showed a reduction in the number of attributes ranging from 14% down to 5%, while accuracy varied from −5% up to 11%, with an average improvement of over 4% (considering only those datasets where accuracy changed).
- Open Access
- 24 April 2025
- Published by MDPI AG in Applied Sciences
- Vol. 15 (9) , 4700
A Multi-Objective Formulation for the Internet Shopping Optimization Problem with Multiple Item Units
The Internet Shopping Optimization Problem with multiple item Units looks for the best selection of stores where to buy various or individual units in a required list of items to minimize the final purchase cost. The problem belongs to the most challenging complexity class of optimization problems (NP-Hard). This paper adds to the already complex problem a more difficult situation with a second objective conflicting with the purchase cost minimization. As far as we know, this is the first state-of-the-art proposal with conflicting objectives for the Internet Shopping Optimization Problem or its variants. The objective in conflict with the minimization of the purchase final cost is the cash-back or reward points on personal or corporate credit cards, the most common payment method for online purchases. Due to the nature of the conflicting objectives, this paper proposes using evolutionary multi-objective optimization algorithms. We perform an experimental comparison using eight algorithms from the literature. The experimental results show that NSGA-II achieves the best overall performance for the studied instances from the state of the art.
- 24 April 2025
- Published by MDPI AG in Applied Sciences
- Vol. 15 (9) , 4700
Open AccessA Multi-Objective Formulation for the Internet Shopping Optimization Problem with Multiple Item Units
The Internet Shopping Optimization Problem with multiple item Units looks for the best selection of stores where to buy various or individual units in a required list of items to minimize the final purchase cost. The problem belongs to the most challenging complexity class of optimization problems (NP-Hard). This paper adds to the already complex problem a more difficult situation with a second objective conflicting with the purchase cost minimization. As far as we know, this is the first state-of-the-art proposal with conflicting objectives for the Internet Shopping Optimization Problem or its variants. The objective in conflict with the minimization of the purchase final cost is the cash-back or reward points on personal or corporate credit cards, the most common payment method for online purchases. Due to the nature of the conflicting objectives, this paper proposes using evolutionary multi-objective optimization algorithms. We perform an experimental comparison using eight algorithms from the literature. The experimental results show that NSGA-II achieves the best overall performance for the studied instances from the state of the art.
- Open Access
- 14 March 2025
- Published by Pensoft Publishers in JUCS - Journal of Universal Computer Science
- Vol. 31 (3) , 298-309
Integer Programming, low complexity Heuristics, and Gaussian instances for the Internet Shopping Optimization Problem with multiple item Units (ISHOP-U)
The Internet Shopping Optimization Problem with multiple item Units (ISHOP-U) is a recently proven NP-Hard variant of the classical ISHOP, which considers buying more than one unit of the same product. In this work, we propose a new set of instances where the prices of the products follow a Gaussian distribution, which is more realistic in a competitive market than the original instances with random uniform prices. We compute the optimal values of the previous uniform and new Gaussian instances using an Integer Programming formulation in CPLEX. In addition, we also propose two new low-complexity heuristics, the first not metaheuristics approaches proposed for the ISHOP-U, which use a linear representation instead of the original matrix candidate solution, achieving better results than the previous Evolutionary Algorithms for the ISHOP-U from the state-of-the-art.
- 14 March 2025
- Published by Pensoft Publishers in JUCS - Journal of Universal Computer Science
- Vol. 31 (3) , 298-309
Open AccessInteger Programming, low complexity Heuristics, and Gaussian instances for the Internet Shopping Optimization Problem with multiple item Units (ISHOP-U)
The Internet Shopping Optimization Problem with multiple item Units (ISHOP-U) is a recently proven NP-Hard variant of the classical ISHOP, which considers buying more than one unit of the same product. In this work, we propose a new set of instances where the prices of the products follow a Gaussian distribution, which is more realistic in a competitive market than the original instances with random uniform prices. We compute the optimal values of the previous uniform and new Gaussian instances using an Integer Programming formulation in CPLEX. In addition, we also propose two new low-complexity heuristics, the first not metaheuristics approaches proposed for the ISHOP-U, which use a linear representation instead of the original matrix candidate solution, achieving better results than the previous Evolutionary Algorithms for the ISHOP-U from the state-of-the-art.
- 3 December 2024
- Published by Springer Nature
- p. 61-78
Classification of Sales Time Series Through Trend Measurement: Forecasting Methods Comparison
- 3 December 2024
- Published by Springer Nature
- p. 61-78
Classification of Sales Time Series Through Trend Measurement: Forecasting Methods Comparison
- Open Access
- 27 November 2024
- Published by MDPI AG in Mathematics
- Vol. 12 (23) , 3733
Pareto Approximation Empirical Results of Energy-Aware Optimization for Precedence-Constrained Task Scheduling Considering Switching Off Completely Idle Machines
Recent advances in cloud computing, large language models, and deep learning have started a race to create massive High-Performance Computing (HPC) centers worldwide. These centers increase in energy consumption proportionally to their computing capabilities; for example, according to the top 500 organization, the HPC centers Frontier, Aurora, and Super Computer Fugaku report energy consumptions of 22,786 kW, 38,698 kW, and 29,899 kW, respectively. Currently, energy-aware scheduling is a topic of interest to many researchers. However, as far as we know, this work is the first approach considering the idle energy consumption by the HPC units and the possibility of turning off unused units entirely, driven by a quantitative objective function. We found that even when turning off unused machines, the objectives of makespan and energy consumption still conflict and, therefore, their multi-objective optimization nature. This work presents empirical results for AGEMOEA, AGEMOEA2, GWASFGA, MOCell, MOMBI, MOMBI2, NSGA2, and SMS-EMOA. The best-performing algorithm is MOCell for the 400 real scheduling problem tests. In contrast, the best-performing algorithm is GWASFGA for a small-instance synthetic testbed.
- 27 November 2024
- Published by MDPI AG in Mathematics
- Vol. 12 (23) , 3733
Open AccessPareto Approximation Empirical Results of Energy-Aware Optimization for Precedence-Constrained Task Scheduling Considering Switching Off Completely Idle Machines
Recent advances in cloud computing, large language models, and deep learning have started a race to create massive High-Performance Computing (HPC) centers worldwide. These centers increase in energy consumption proportionally to their computing capabilities; for example, according to the top 500 organization, the HPC centers Frontier, Aurora, and Super Computer Fugaku report energy consumptions of 22,786 kW, 38,698 kW, and 29,899 kW, respectively. Currently, energy-aware scheduling is a topic of interest to many researchers. However, as far as we know, this work is the first approach considering the idle energy consumption by the HPC units and the possibility of turning off unused units entirely, driven by a quantitative objective function. We found that even when turning off unused machines, the objectives of makespan and energy consumption still conflict and, therefore, their multi-objective optimization nature. This work presents empirical results for AGEMOEA, AGEMOEA2, GWASFGA, MOCell, MOMBI, MOMBI2, NSGA2, and SMS-EMOA. The best-performing algorithm is MOCell for the 400 real scheduling problem tests. In contrast, the best-performing algorithm is GWASFGA for a small-instance synthetic testbed.
- 22 September 2024
- Published by Springer Nature
- p. 153-170
Warm Starting Integer Programming for the Internet SHopping Optimization Problem with Multiple Item Units (ISHOP-U)
- 22 September 2024
- Published by Springer Nature
- p. 153-170
Warm Starting Integer Programming for the Internet SHopping Optimization Problem with Multiple Item Units (ISHOP-U)
- 29 September 2023
- Published by Springer Nature
- p. 21-38
Feature Selection: Traditional and Wrapping Techniques with Tabu Search
- 29 September 2023
- Published by Springer Nature
- p. 21-38
Feature Selection: Traditional and Wrapping Techniques with Tabu Search