Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Mayra Guadalupe Treviño-Berrones has a total of 18 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Assessing Performance and Crossover Operators on Differential Evolution for Attribute Weighting

    by Andrea Ortega-Guzmán, Salvador Ibarra-Martínez, José Antonio Castan-Rocha, J. David Teran-Villanueva, Mayra Guadalupe Treviño-Berrones, Aurelio Alejandro Santigo-Pineda

    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

    Integer Programming, low complexity Heuristics, and Gaussian instances for the Internet Shopping Optimization Problem with multiple item Units (ISHOP-U)

    by Fernando Ornelas, Alejandro H. García, Alejandro Santiago, Salvador Ibarra Martínez, José Antonio Castán Rocha, Fausto Balderas, Julio Laria-Menchaca, Mayra Guadalupe Treviño-Berrones

    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.


  • Open Access

    Pareto Approximation Empirical Results of Energy-Aware Optimization for Precedence-Constrained Task Scheduling Considering Switching Off Completely Idle Machines

    by José Antonio Castán Rocha, Alejandro Santiago, Alejandro H. García-Ruiz, Jesús David Terán-Villanueva, Salvador Ibarra Martínez, Mayra Guadalupe Treviño Berrones

    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.


  • Cluster Analysis Using k-Means in School Dropout

    by Luis Earving Lee Hernández, José Antonio Castán-Rocha, Salvador Ibarra-Martínez, Jésus David Terán-Villanueva, Mayra Guadalupe Treviño-Berrones, Julio Laria-Menchaca


  • Open Access

    The Internet Shopping Optimization Problem with Multiple Item Units (ISHOP-U): Formulation, Instances, NP-Completeness, and Evolutionary Optimization

    by Fernando Ornelas, Alejandro Santiago, Salvador Ibarra Martínez, Mirna Patricia Ponce-Flores, Jesús David Terán-Villanueva, Fausto Balderas, José Antonio Castán Rocha, Alejandro H. García, Julio Laria-Menchaca, Mayra Guadalupe Treviño-Berrones

    In this work, we investigate the variant of the Internet Shopping Optimization Problem (ISHOP) that considers different item units. This variant is more challenging than the original problem. The original ISHOP is already known as a combinatorial NP-hard problem. In this work, we present a formal proof that the ISHOP variant considering different item units belongs to the NP-Hard complexity class. The abovementioned variant is familiar to companies and consumers who need to purchase more than one unit of a specific product to satisfy their requirements. For example, companies buy different quantities of construction materials, medical equipment, office supplies, or chemical components. We propose two new evolutionary operators (crossover and mutation) and an unfeasible solution repair method for the studied ISHOP variant. Furthermore, we produce a new benchmark of 15 synthetic instances where item prices follow a random uniform distribution. Finally, to assess our evolutionary operators, we implemented two Evolutionary Algorithms, a Genetic Algorithm (GA) and a Cellular Genetic Algorithm (CGA), and an experimental evaluation against a Water Cycle Algorithm (WCA) from the state-of-the-art. Experimental results show that our proposed GA performs well with statistical significance.


  • Open Access

    Short Time Series Forecasting: Recommended Methods and Techniques

    by Mariel Abigail Cruz-Nájera, Mayra Guadalupe Treviño-Berrones, Mirna Patricia Ponce-Flores, Jesús David Terán-Villanueva, José Antonio Castán-Rocha, Salvador Ibarra-Martínez, Alejandro Santiago, Julio Laria-Menchaca

    This paper tackles the problem of forecasting real-life crime. However, the recollected data only produced thirty-five short-sized crime time series for three urban areas. We present a comparative analysis of four simple and four machine-learning-based ensemble forecasting methods. Additionally, we propose five forecasting techniques that manage the seasonal component of the time series. Furthermore, we used the symmetric mean average percentage error and a Friedman test to compare the performance of the forecasting methods and proposed techniques. The results showed that simple moving average with seasonal removal techniques produce the best performance for these series. It is important to highlight that a high percentage of the time series has no auto-correlation and a high level of symmetry, which is deemed as white noise and, therefore, difficult to forecast.


  • Open Access

    GRASP Optimization for the Strip Packing Problem with Flags, Waste Functions, and an Improved Restricted Candidate List

    by Edgar Oviedo-Salas, Jesús David Terán-Villanueva, Salvador Ibarra-Martínez, Alejandro Santiago-Pineda, Mirna Patricia Ponce-Flores, Julio Laria-Menchaca, José Antonio Castán-Rocha, Mayra Guadalupe Treviño-Berrones

    This research addresses the two-dimensional strip packing problem to minimize the total strip height used, avoiding overlapping and placing objects outside the strip limits. This is an NP-hard optimization problem. We propose a greedy randomized adaptive search procedure (GRASP), incorporating flags as a new approach for this problem. These flags indicate available space after accommodating an object; they hold the available width and height for the following objects. We also propose three waste functions as surrogate objective functions for the GRASP candidate list and use and enhanced selection for the restricted candidate list, limiting the object options to better elements. Finally, we use overlapping functions to ensure that the object fits in the flag because there are some cases where a flag’s width can be wrong due to new object placement. The tests showed that our proposal outperforms the most recent state-of-the-art metaheuristic. Additionally, we make comparisons against two exact algorithms and another metaheuristic.


  • Open Access

    Energy Idle Aware Stochastic Lexicographic Local Searches for Precedence-Constraint Task List Scheduling on Heterogeneous Systems

    by Alejandro Santiago, Mirna Ponce-Flores, J. David Terán-Villanueva, Fausto Balderas, Salvador Ibarra Martínez, José Antonio Castan Rocha, Julio Laria Menchaca, Mayra Guadalupe Treviño Berrones

    The use of parallel applications in High-Performance Computing (HPC) demands high computing times and energy resources. Inadequate scheduling produces longer computing times which, in turn, increases energy consumption and monetary cost. Task scheduling is an NP-Hard problem; thus, several heuristics methods appear in the literature. The main approaches can be grouped into the following categories: fast heuristics, metaheuristics, and local search. Fast heuristics and metaheuristics are used when pre-scheduling times are short and long, respectively. The third is commonly used when pre-scheduling time is limited by CPU seconds or by objective function evaluations. This paper focuses on optimizing the scheduling of parallel applications, considering the energy consumption during the idle time while no tasks are executing. Additionally, we detail a comparative literature study of the performance of lexicographic variants with local searches adapted to be stochastic and aware of idle energy consumption.


  • Open Access

    Assessing a Multi-Objective Genetic Algorithm with a Simulated Environment for Energy-Saving of Air Conditioning Systems with User Preferences

    by Alejandro Humberto García Ruiz, Salvador Ibarra Martínez, José Antonio Castán Rocha, Jesús David Terán Villanueva, Julio Laria Menchaca, Mayra Guadalupe Treviño Berrones, Mirna Patricia Ponce Flores, Aurelio Alejandro Santiago Pineda

    Electricity is one of the most important resources for the growth and sustainability of the population. This paper assesses the energy consumption and user satisfaction of a simulated air conditioning system controlled with two different optimization algorithms. The algorithms are a genetic algorithm (GA), implemented from the state of the art, and a non-dominated sorting genetic algorithm II (NSGA II) proposed in this paper; these algorithms control an air conditioning system considering user preferences. It is worth noting that we made several modifications to the objective function’s definition to make it more robust. The energy-saving optimization is essential to reduce CO2 emissions and economic costs; on the other hand, it is desirable for the user to feel comfortable, yet it will entail a higher energy consumption. Thus, we integrate user preferences with energy-saving on a single weighted function and a Pareto bi-objective problem to increase user satisfaction and decrease electrical energy consumption. To assess the experimentation, we constructed a simulator by training a backpropagation neural network with real data from a laboratory’s air conditioning system. According to the results, we conclude that NSGA II provides better results than the state of the art (GA) regarding user preferences and energy-saving.


  • Open Access

    GRASP and Iterated Local Search-Based Cellular Processing algorithm for Precedence-Constraint Task List Scheduling on Heterogeneous Systems

    by Alejandro Santiago, J. David Terán-Villanueva, Salvador Ibarra Martínez, José Antonio Castán Rocha, Julio Laria Menchaca, Mayra Guadalupe Treviño Berrones, Mirna Ponce-Flores

    High-Performance Computing systems rely on the software’s capability to be highly parallelized in individual computing tasks. However, even with a high parallelization level, poor scheduling can lead to long runtimes; this scheduling is in itself an NP-hard problem. Therefore, it is our interest to use a heuristic approach, particularly Cellular Processing Algorithms (CPA), which is a novel metaheuristic framework for optimization. This framework has its foundation in exploring the search space by multiple Processing Cells that communicate to exploit the search and in the individual stagnation detection mechanism in the Processing Cells. In this paper, we proposed using a Greedy Randomized Adaptive Search Procedure (GRASP) to look for promising task execution orders; later, a CPA formed with Iterated Local Search (ILS) Processing Cells is used for the optimization. We assess our approach with a high-performance ILS state-of-the-art approach. Experimental results show that the CPA outperforms the previous ILS in real applications and synthetic instances.