Pamela Chiñas-Sánchez
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Pamela Chiñas-Sánchez has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Alma Danisa Romero Ocaño
Instituto Tecnológico de Agua Prieta
2 shared publications - Cecilia Guadalupe Mota-Gutiérrez
División de Estudios de Posgrado e Investigación, Instituto Tecnológico de Saltillo, Tecnológico Nacional de México, Saltillo 25280, Coahuila, Mexico
2 shared publications - Efraín Ruiz-Y-Ruiz
División de Estudios de Posgrado e Investigación, Instituto Tecnológico de Saltillo, Tecnológico Nacional de México, Saltillo 25280, Coahuila, Mexico
2 shared publications - Víctor Manuel Valenzuela Alcaraz
Instituto Tecnológico de Agua Prieta
2 shared publications - Enrique Alejandro Cavazos Hernández
Tecnológico Nacional de México, Instituto Tecnológico de Saltillo, Saltillo, Mexico
1 shared publication - Ismael Lopez-Juarez
Autonomous University of Yucatan (UADY),Mechatronics Department,Merida,Mexico
1 shared publication
Latest Publications
- Open Access
- 7 March 2026
- Published by MDPI AG in Mathematics
- Vol. 14 (5) , 907
A Matheuristic for the Distance Constrained Inventory Routing Problem
This paper addresses the Distance-Constrained Inventory Routing Problem (DCIRP), a complex problem that combines inventory management and vehicle routing in a logistics context. The problem arises in the context of a specialty gas delivery company that maintains a specialty gas holding facility at each customer’s site and uses several trucks to deliver specialty gas, with the additional constraint that drivers are limited to the number of kilometers they can drive each day. A Mixed Integer Linear Programming (MILP) formulation is proposed to model the DCIRP. The DCIRP is a variant of the Inventory Routing Problem (IRP), and an NP-hard combinatorial optimization problem. The main objective of this research is to improve the efficiency and effectiveness of DCIRP resolution, while accounting for vehicle capacity constraints, customer inventory levels, and delivery route distance constraints. By optimizing routes and inventory management, the company’s operations become more sustainable. To solve the problem, three solution approaches are proposed. The first is an exact method based on the MILP formulation. The second is a matheuristic that uses an inventory-first, route-second (IFRS) approach, including a minimum route cost approximation and a local search procedure. The results show that the proposed matheuristic produces high-quality solutions with a reasonable computational effort.
- 7 March 2026
- Published by MDPI AG in Mathematics
- Vol. 14 (5) , 907
Open AccessA Matheuristic for the Distance Constrained Inventory Routing Problem
This paper addresses the Distance-Constrained Inventory Routing Problem (DCIRP), a complex problem that combines inventory management and vehicle routing in a logistics context. The problem arises in the context of a specialty gas delivery company that maintains a specialty gas holding facility at each customer’s site and uses several trucks to deliver specialty gas, with the additional constraint that drivers are limited to the number of kilometers they can drive each day. A Mixed Integer Linear Programming (MILP) formulation is proposed to model the DCIRP. The DCIRP is a variant of the Inventory Routing Problem (IRP), and an NP-hard combinatorial optimization problem. The main objective of this research is to improve the efficiency and effectiveness of DCIRP resolution, while accounting for vehicle capacity constraints, customer inventory levels, and delivery route distance constraints. By optimizing routes and inventory management, the company’s operations become more sustainable. To solve the problem, three solution approaches are proposed. The first is an exact method based on the MILP formulation. The second is a matheuristic that uses an inventory-first, route-second (IFRS) approach, including a minimum route cost approximation and a local search procedure. The results show that the proposed matheuristic produces high-quality solutions with a reasonable computational effort.
- Open Access
- 12 February 2026
- Published by MDPI AG in Preprints.org
A Matheuristic for the Distance Constrained Inventory Routing Problem
This paper addresses the Distance-Constrained Inventory Routing Problem (DCIRP), a complex problem that combines inventory management and vehicle routing in a logistics context. The problem arises in the context of a specialty gas delivery company that maintains a specialty gas holding facility at each customer's site and uses several trucks to deliver specialty gas, with the additional constraint that drivers are limited to the number of kilometers they can drive each day. A Mixed Integer Linear Programming (MILP) formulation is proposed to model the DCIRP. The DCIRP is a combinatorial optimization problem of type NP-Hard. The main objective of this research is to improve the efficiency and effectiveness of DCIRP resolution, while accounting for vehicle capacity constraints, customer inventory levels, and delivery route distance constraints. By optimizing routes and inventory management, the company's operations become more sustainable. To solve the problem, three solution approaches are proposed. The first is an exact method based on the MILP formulation. The second is a mateheuristic using an inventory-first-route-second (IFRS) approach. The third solution algorithm also uses an IFRS approach, but includes a minimum route cost for each cost and a local search procedure. The results show that the third solution algorithm produces high-quality solutions with reasonable computational effort.
- 12 February 2026
- Published by MDPI AG in Preprints.org
Open AccessA Matheuristic for the Distance Constrained Inventory Routing Problem
This paper addresses the Distance-Constrained Inventory Routing Problem (DCIRP), a complex problem that combines inventory management and vehicle routing in a logistics context. The problem arises in the context of a specialty gas delivery company that maintains a specialty gas holding facility at each customer's site and uses several trucks to deliver specialty gas, with the additional constraint that drivers are limited to the number of kilometers they can drive each day. A Mixed Integer Linear Programming (MILP) formulation is proposed to model the DCIRP. The DCIRP is a combinatorial optimization problem of type NP-Hard. The main objective of this research is to improve the efficiency and effectiveness of DCIRP resolution, while accounting for vehicle capacity constraints, customer inventory levels, and delivery route distance constraints. By optimizing routes and inventory management, the company's operations become more sustainable. To solve the problem, three solution approaches are proposed. The first is an exact method based on the MILP formulation. The second is a mateheuristic using an inventory-first-route-second (IFRS) approach. The third solution algorithm also uses an IFRS approach, but includes a minimum route cost for each cost and a local search procedure. The results show that the third solution algorithm produces high-quality solutions with reasonable computational effort.
- 11 October 2023
- Published by Springer Nature in The International Journal of Advanced Manufacturing Technology
- Vol. 129 (5-6) , 2011-2030
Geometries and quality assesment of weld beads in 5052-H32 aluminum alloys joined by semiautomated GMAW through a double fuzzy system
- 11 October 2023
- Published by Springer Nature in The International Journal of Advanced Manufacturing Technology
- Vol. 129 (5-6) , 2011-2030
Geometries and quality assesment of weld beads in 5052-H32 aluminum alloys joined by semiautomated GMAW through a double fuzzy system