Yajaira Cardona-Valdés

Yajaira Cardona-Valdés

Auto-generated profile, based on publicly available information

Yajaira Cardona-Valdés

Centro de Investigación en Matemáticas Aplicadas, Universidad Autónoma de Coahuila, Blvd. V. Carranza s/n. Col. República Oriente, Saltillo C.P. 25280, Coahuila, Mexico

Research Focus & Metrics

Academic Career Length

16Years (2011-Present)

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

Representative Publications

View All Publications
1 August 2011 in Transportation Research Part C: Emerging Technologies
Verified
Journal Article
Closed access
YCY. Cardona-Valdés
Y. Cardona-Valdés
AÁA. Álvarez
A. Álvarez
DOD. Ozdemir
D. Ozdemir

29 December 2013 in Transportation Research Part B: Methodological
Verified
Journal Article
Closed access
YCY. Cardona-Valdés
Y. Cardona-Valdés
AÁA. Álvarez
A. Álvarez
JPJ. Pacheco
J. Pacheco

1 September 2018 in Computers & Industrial Engineering
Verified
Journal Article
Closed access
OAOliver Avalos-Rosales
Oliver Avalos-Rosales
FAFrancisco Angel-Bello
Francisco Angel-Bello
AÁAda Álvarez
Ada Álvarez
YCYajaira Cardona-Valdés
Yajaira Cardona-Valdés

1 November 2015 in Journal of Computer and Systems Sciences International
Verified
Journal Article
Closed access
PDF file
SNSamuel Nucamendi-Guillén
Samuel Nucamendi-Guillén
YCY. Cardona-Valdes
Y. Cardona-Valdes
FAF. Angel-Bello Acosta
F. Angel-Bello Acosta
In this paper we study a new variant of the unit demand vehicle routing problem with the aim of minimizing the sum of customers waiting times to receive service. These kinds of problems are relevant in applications where the customers' waiting time is essential or is more important than the vehicles' travel time. We modify a known formulation for the multiple traveling salesman problem adapting it to the addressed problem. The derived mixed integer formulation is able to solve to optimality instances up to 40 nodes. We also develop a metaheuristic algorithm based on Iterated Greedy approach. We implement two variants of the metaheuristic algorithm using two different strategies in the constructive phase. For instances up to 40 nodes the proposed algorithms found almost all the optimal solutions and outperformed the results obtained by the formulation for instances with unknown optimal solution. In general, both versions of the metaheuristic algorithm are very fast and have a good performance too for instances ranging from 50 to 100 nodes.

8 February 2017 in Operational Research
Verified
Journal Article
Closed access
PDF file
FAF. Angel-Bello
F. Angel-Bello
YCY. Cardona-Valdés
Y. Cardona-Valdés
AÁA. Álvarez
A. Álvarez

1 June 2020 in Mathematics
Verified
Journal Article
Open access
PDF file
YCYajaira Cardona-Valdés
Yajaira Cardona-Valdés
SNSamuel Nucamendi-Guillén
Samuel Nucamendi-Guillén
RPRodrigo E. Peimbert-García
Rodrigo E. Peimbert-García
GMGustavo Macedo-Barragán
Gustavo Macedo-Barragán
EMEduardo Díaz Medina
Eduardo Díaz Medina
This paper addresses the multi-product, multi-period capacitated lot sizing problem. In particular, this work determines the optimal lot size allowing for shortages (imposed by budget restrictions), but with a penalty cost. The developed models are well suited to the usually rather inflexible production resources found in retail industries. Two models are proposed based on mixed-integer formulations: (i) one that allows shortage and (ii) one that forces fulfilling the demand. Both models are implemented over test instances and a case study of a real industry. By investigating the properties of the obtained solutions, we can determine whether the shortage allowance will benefit the company. The experimental results indicate that, for the test instances, the fact of allowing shortages produces savings up to 17% in comparison with the model without shortages, whereas concerning the current situation of the company, these savings represent 33% of the total costs while preserving the revenue.