Cómo citar
Resumen
Objective: Develop a methodology for the delivery and pick-up route scheduling of medical surgical supplies under stochastic conditions. The technique was applied to a business operation case study in which it was necessary to fulfill specific delivery time windows under variable transportation and service time conditions. Materials and Methods: The method comprises a deterministic solution and a stochastic solution, both based on the Tabu Search metaheuristic. The stochastic approach was developed through a simheuristic in which Monte Carlo simulations are embedded in the procedure of the proposed metaheuristic. Travel time variation coefficients were applied to compare not only the two approaches, but also the best of them with the current procedure employed by the company under study. Results and Discussion: The indicators evaluated for all variation coefficients shows that the simheuristic performs better than both the deterministic approach and the procedure of the company. Conclusion: The implementation of the simheuristic in the routing problem is a feasible alternative that fits the stochastic conditions.
H. B. Díaz Gómez, R. G. García Cáceres, and N. Porcell Mancilla, “Las Pymes: costos en La cadena de abastecimiento,” 2008.
C. A. Díaz, Gestión de la Cadena de Abastecimiento, Primera ed. Bogotá: Fondo editorial Areandino, 2017.
A. Olvera, “Heurísticas para problemas de ruteo de vehículos,” 2004, Montevideo.
A. A. Juan, S. E. Grasman, J. Caceres-Cruz, and T. Bektaş, “A simheuristic algorithm for the Single-Period Stochastic Inventory-Routing Problem with stock-outs,” Simul Model Pract Theory, vol. 46, pp. 40–52, 2014, doi: 10.1016/j.simpat.2013.11.008.
M. Wiger, “Logistic management operationalised in a healthcare context - Understanding care chain effectiveness through logistic theories and systems theory,” 2018.
N. Velasco, J. P. Moreno, and C. Rebolledo, “Logistics practices in healthcare organizations in Bogota,” Emerald Publishing Limited, 2018, doi: 10.1108/ARLA-08-2016-0219.
V. Jonas, F. Andreas, S. Jan, and B. Jens O., “Material logistics in hospitals: A literature review,” Omega (Westport), vol. 69, pp. 82–101, 2017, doi: https://doi.org/10.1016/j.omega.2016.08.004.
B. Godfred, G. Adam, S. Melissa, P. Donkor, M. Charles, and S. Barclay, “Assessment of local supply chains and stock management practices for trauma care resources in Ghana: a comparative small sample cross-sectional study,” BMC Health Serv Res, vol. 23, no. 1, pp. 1–12, 2021, doi: https://doi.org/10.1186/s12913-021-06063-6.
R. Zhong, X. Xu, and L. Wang, “Food supply chain management: systems, implementations, and future research,” Industrial Management and Data Systems, vol. 117, no. 9, pp. 2085–2114, 2017, doi: 10.1108/IMDS-09-2016-0391.
H. H. Doulabi, G. Pesant, and L.-M. Rousseau, “Vehicle routing problems with synchronized visits and stochastic travel and service times: Applications in healthcare,” Transportation Science, vol. 54, no. 4, pp. 1053–1072, 2020, doi: 10.1287/TRSC.2019.0956.
K. Braekers, K. Ramaekers, and I. Van Nieuwenhuyse, “The vehicle routing problem: State of the art classification and review,” Comput Ind Eng, vol. 99, pp. 300–313, 2016, doi: 10.1016/j.cie.2015.12.007.
T. Leelertkij, P. Parthanadee, and J. Buddhakulsomsiri, “Vehicle Routing Problem with Transshipment: Mathematical Model and Algorithm,” J Adv Transp, vol. 2021, p. 15, 2021, doi: 10.1155/2021/8886572.
M. Nasri, A. Metrane, I. Hafidi, and A. Jamali, “A robust approach for solving a vehicle routing problem with time windows with uncertain service and travel times,” vol. 11, pp. 1–16, 2019, doi: 10.5267/j.ijiec.2019.7.002.
N. Labadie, C. Prins, and C. Prodhon, “Metaheuristics for Vehicle Routing Problems,” 2016. doi: https://doi.org/10.1007/978-3-319-45403-0_15.
D. Guimarans et al., “A simheuristic approach for the two-dimensional vehicle routing problem with stochastic travel times,” Simul Model Pract Theory, vol. 89, pp. 1–14, 2018, doi: https://doi.org/10.1016/j.simpat.2018.09.004.
B. S. Onggo, J. Panadero, C. G. Corlu, and A. A. Juan, “Agri-food supply chains with stochastic demands: A multi-period inventory routing problem with perishable products,” Simul Model Pract Theory, vol. 97, 2019, doi: 10.1016/j.simpat.2019.101970.
A. S. Kenyon and D. P. Morton, “Stochastic vehicle routing with random travel times,” Transportation Science, vol. 37, no. 1, pp. 69–82, 2003.
X. Li, P. Tian, and S. C. H. Leung, “Vehicle routing problems with time windows and stochastic travel and service times : Models and algorithm,” Intern. Journal of Production Economics, vol. 125, no. 1, pp. 137–145, 2010, doi: https://doi.org/10.1016/j.ijpe.2010.01.013.
B. Çatay, “A new saving-based ant algorithm for the Vehicle Routing Problem with Simultaneous Pickup and Delivery,” Expert Syst Appl, vol. 37, no. 10, pp. 6809–6817, 2010, doi: https://doi.org/10.1016/j.eswa.2010.03.045.
H. Lei, G. Laporte, and B. Guo, “A generalized variable neighborhood search heuristic for the capacitated vehicle routing problem with stochastic service times,” Sociedad de Estadística e Investigación Operativa, vol. 20, pp. 99–118, 2012, doi: https://doi.org/10.1007/s11750-011-0188-6.
S. Yanik, B. Bozkaya, and R. DeKervenoael, “A new VRPPD model and a hybrid heuristic solution approach for e-tailing,” Eur J Oper Res, vol. 236, no. 3, pp. 879–890, 2014, doi: https://doi.org/10.1016/j.ejor.2013.05.023.
F. Errico, G. Desaulniers, M. Gendreau, W. Rei, and L. Rousseau, “A priori optimization with recourse for the vehicle routing problem with hard time windows and stochastic service times,” Eur J Oper Res, vol. 249, no. 1, pp. 55–56, 2016, doi: https://doi.org/10.1016/j.ejor.2015.07.027.
D. M. Miranda and S. V. Conceição, “The vehicle routing problem with hard time windows and stochastic travel and service time,” Expert Syst Appl, vol. 64, pp. 104–116, 2016, doi: https://doi.org/10.1016/j.eswa.2016.07.022.
A. Gutierrez, L. Dieulle, N. Labadie, and N. Velasco, “A multi-population algorithm to solve the VRP with stochastic service and travel times,” Comput Ind Eng, vol. 125, pp. 144–156, 2018, doi: 10.1016/j.cie.2018.07.042.
Y. Shi, T. Boudouh, O. Grunder, and D. Wang, “Modeling and solving simultaneous delivery and pick-up problem with stochastic travel and service times in home health care,” Expert Syst Appl, vol. 102, pp. 218–233, 2018, doi: 10.1016/j.eswa.2018.02.025.
C. Hu, J. Lu, X. Liu, and G. Zhang, “Robust vehicle routing problem with hard time windows under demand and travel time uncertainty,” Comput Oper Res, vol. 94, pp. 139–153, 2018, doi: 10.1016/j.cor.2018.02.006.
Y. Ma, Z. Li, F. Yan, and C. Feng, “A hybrid priority-based genetic algorithm for simultaneous pickup and decision-makers,” Soft comput, vol. 23, no. 15, pp. 6697–6714, 2019, doi: https://doi.org/10.1007/s00500-019-03754-5.
L. Reyes-Rubiano, D. Ferone, A. A. Juan, and J. Faulin, “A simheuristic for routing electric vehicles with limited driving ranges and stochastic travel times,” SORT, vol. 43, no. 1, pp. 3–24, 2019, doi: 10.2436/20.8080.02.77.
H. B. Ban and P. K. Nguyen, “A hybrid metaheuristic for solving asymmetric distance-constrained vehicle routing problem,” Comput Soc Netw, vol. 8, no. 1, pp. 1–19, 2021, doi: 10.1186/s40649-020-00084-7.
R. Elshaer and H. Awad, “A taxonomic review of metaheuristic algorithms for solving the vehicle routing problem and its variants.,” Comput Ind Eng, vol. 140, p. 106242, 2020, doi: https://doi.org/10.1016/j.cie.2019.106242.
O. Bräysy and M. Gendreau, “Vehicle routing problem with time windows, Part II: Metaheuristics,” Transportation Science, vol. 39, no. 1, pp. 119–139, 2005, doi: https://doi.org/10.1287/trsc.1030.0057.
J. Brandão, “Metaheuristic for the Vehicle Routing Problem with Time Windows,” Meta-Heuristics, pp. 19–36, 1999, doi: https://doi.org/10.1007/978-1-4615-5775-3_2.
J.-F. Cordeau, G. Laporte, and A. Mercier, “A unified tabu search heuristic for vehicle routing problems with time windows,” Journal of the Operational Research Society, vol. 52, pp. 928–936, 2001.
H. Chuin-Lau, M. Sim, and K. Meng-Teo, “Vehicle routing problem with time windows and a limited number of vehicles,” Eur J Oper Res, vol. 148, no. 3, pp. 559–569, 2003, doi: https://doi.org/10.1016/S0377-2217(02)00363-6.
S. N. Gil-Abreu, “Bootstrap en poblaciones finitas,” 2014.
M. A. Figliozzi, “The impacts of congestion on commercial vehicle tour characteristics and costs,” Transp Res E Logist Transp Rev, vol. 46, no. 4, pp. 496–506, 2010, doi: https://doi.org/10.1016/j.tre.2009.04.005.
A. R. Güner, A. Murat, and R. B. Chinnam, “Dynamic routing under recurrent and non-recurrent congestion using real-time ITS information,” Comput Oper Res, vol. 39, no. 2, pp. 358–373, 2012, doi: https://doi.org/10.1016/j.cor.2011.04.012.
G. Kim, “Travel time estimation in vehicle routing problem,” IEEE International Conference on Industrial Engineering and Engineering Management, pp. 1004–1008, 2017.
Y. Hollander, “Direct versus indirect models for the effects of unreliability,” Transp Res Part A Policy Pract, vol. 40, no. 9, pp. 699–711, 2006, doi: https://doi.org/10.1016/j.tra.2005.12.007.
Y. Hollander and R. Liu, “Estimation of the distribution of travel times by repeated simulation,” Transp Res Part C Emerg Technol, vol. 16, no. 2, pp. 212–231, 2008, doi: https://doi.org/10.1016/j.trc.2007.07.005.
Esta obra está bajo una licencia internacional Creative Commons Atribución 4.0.
Derechos de autor 2025 William Guevara, Carmen del Carmen Mena, Laura Pérez, Carlos Montoya, Martha Caro, Carlos Bejarano, Stevenson Bolívar, Camilo Delgado