Pamela Chiñas-Sanchez

Dr. Pamela Chiñas-Sanchez


Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

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

Representative Publications

View All Publications
11 October 2023 in The International Journal of Advanced Manufacturing Technology
Verified
Journal Article
Closed access
PDF file
EHEnrique Alejandro Cavazos Hernández
Enrique Alejandro Cavazos Hernández
PCPamela Chiñas-Sanchez
Pamela Chiñas-Sanchez
JGJose GLZ
Jose GLZ
ISMAEL LOPEZ-JUAREZISMAEL LOPEZ-JUAREZ
ISMAEL LOPEZ-JUAREZ

12 February 2026 in Preprints.org
Verified
Preprint
Open access
PDF file
VAVICTOR MANUEL VALENZUELA ALCARAZ
VICTOR MANUEL VALENZUELA ALCARAZ
EREfrain Ruiz y Ruiz
Efrain Ruiz y Ruiz
Alma Danisa Romero OcañoAlma Danisa Romero Ocaño
Alma Danisa Romero Ocaño
PCPamela Chiñas-Sanchez
Pamela Chiñas-Sanchez
CMCecilia Mota-Gutiérrez
Cecilia Mota-Gutiérrez
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.

7 March 2026 in Mathematics
Verified
Journal Article
Open access
PDF file
VAVICTOR MANUEL VALENZUELA ALCARAZ
VICTOR MANUEL VALENZUELA ALCARAZ
EREfrain Ruiz y Ruiz
Efrain Ruiz y Ruiz
Alma Danisa Romero OcañoAlma Danisa Romero Ocaño
Alma Danisa Romero Ocaño
PCPamela Chiñas-Sanchez
Pamela Chiñas-Sanchez
CMCecilia Guadalupe Mota-Gutiérrez
Cecilia Guadalupe Mota-Gutiérrez
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.