Iris Martínez-Salazar

Iris Martínez-Salazar

Auto-generated profile, based on publicly available information

Iris Martínez-Salazar

Facultad de Ingeniería Mecánica Eléctrica Universidad Autónoma de Nuevo León Monterrey Nuevo Leon Mexico

Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
17 March 2022 in Computers & Operations Research
Verified
Journal Article
Closed access
SNSamuel Nucamendi-Guillén
Samuel Nucamendi-Guillén
IMIris Martínez-Salazar
Iris Martínez-Salazar
SKSara Khodaparasti
Sara Khodaparasti
MBMaria Elena Bruni
Maria Elena Bruni

1 March 2019 in Applied Artificial Intelligence
Verified
Journal Article
Closed access
FEFernando Elizalde-Ramírez
Fernando Elizalde-Ramírez
RNRomeo Sanchez Nigenda
Romeo Sanchez Nigenda
IMIris A. Martínez-Salazar
Iris A. Martínez-Salazar
YRYasmin Rios
Yasmin Rios
Users of public transit networks require tools that generate travel plans to traverse them. The main issue is that public transit networks are time and space dependent. Travel plans depend on the current location of users and transit units, along with a set of user preferences and time restrictions. In this work, we propose the design and development of artificial intelligence (AI) planning models for engineering travel plans for such networks. The proposed models consider temporal actions, bus locations, and user preferences as constraints, to restrict the set of travel plans generated. Our approach decouples model design from algorithm construction, providing a greater level of flexibility and richness of solutions. We also introduce an integer linear programming formulation, and a fast preprocessing procedure, to evaluate the quality of the solutions returned by the proposed planning models. Experimental results show that AI planning models can efficiently generate close to optimal solutions. Furthermore, our analysis identifies user preferences as the most critical factor that increases solution complexity for planning models.

10 June 2013 in Electronic Notes in Discrete Mathematics
Verified
Journal Article
Closed access
FAFrancisco Angel-Bello
Francisco Angel-Bello
IMIris Martínez-Salazar
Iris Martínez-Salazar
AAAda Alvarez
Ada Alvarez

4 February 2022 in Optimization Letters
Verified
Journal Article
Open access
PDF file
MBMaria Elena Bruni
Maria Elena Bruni
SKSara Khodaparasti
Sara Khodaparasti
IMIris Martínez-Salazar
Iris Martínez-Salazar
SNSamuel Nucamendi-Guillén
Samuel Nucamendi-Guillén
In this paper, we study the multi-depot k-traveling repairman problem. This problem extends the traditional traveling repairman problem to the multi-depot case. Its objective, similar to the single depot variant, is the minimization of the sum of the arrival times to customers. We propose two distinct formulations to model the problem, obtained on layered graphs. In order to find feasible solutions for the largest instances, we propose a hybrid genetic algorithm where initial solutions are built using a splitting heuristic and a local search is embedded into the genetic algorithm. The efficiency of the mathematical formulations and of the solution approach are investigated through computational experiments. The proposed models are scalable enough to solve instances up to 240 customers.

21 June 2024 in PLOS ONE
Verified
Journal Article
Open access
PDF file
RMRafael Muñoz-Sánchez
Rafael Muñoz-Sánchez
IMIris Martínez-Salazar
Iris Martínez-Salazar
JGJosé Luis González-Velarde
José Luis González-Velarde
YRYasmin Rios
Yasmin Rios
Two hybrid flow shop scheduling lines must be coordinated to assemble batches of terminated products at their last stage. Each product is thus composed of two jobs, each produced in one of the lines. The set of jobs is to be processed in a series of stages to minimize the makespan of the scheduling, but jobs forming a product must arrive at the assembly line simultaneously. We propose a mixed integer linear programming model. Then, based on the model, we propose a pull-matheuristic algorithm. Finally, we present two metaheuristics, a greedy randomized adaptive search procedure and a biased random key genetic algorithm, and compare all the methodologies with real-based instances of a production scheduling problem in the automobile manufacturing industry. The greedy algorithm yields high-quality solutions, while the genetic one offers the best computational times.

1 December 2014 in Engineering Management Journal
Verified
Journal Article
Closed access
Javier  Calvo-AmodioJavier Calvo-Amodio
Javier Calvo-Amodio
VTVíctor G. Tercero-Gómez
Víctor G. Tercero-Gómez
JRJose G. Ramirez-Galindo
Jose G. Ramirez-Galindo
IMIris Martínez-Salazar
Iris Martínez-Salazar
Professional certificate training is a challenge for trainees and trainers. A certification program's financial success depends not only on its quality, but also on certification rates. In this study, the authors theorize that trainee performance in the field project component of a training certificate program is the key variable to success; therefore, identifying bottlenecks in a trainee certification process is vital to increasing the probability of certification. In order to test this hypothesis, the authors use a hybrid methodology to identify bottlenecks through the analysis of a Six Sigma certification program. The goal is to evaluate the impact that the academic components have on the successful implementation of field projects and, therefore, on certification rates. The latter is a requirement to be certified in the program studied. As a result, managers in charge of training certificate programs can assess, elaborate, and corroborate hypotheses about causes and effects of training practices and their efficiency within their program. The proposed solution combines statistical methods in the form of regression analysis and systemic tools like system dynamics (SD) to provide further understanding when early detection and intervention on trainees' deviations from expected performance is required. Findings from this research can be used as the basis for a future confirmatory analysis.