Penentuan Rute dan Pengelolaan Persediaan dengan Mempertimbangkan Jumlah Permintaan Stokastik dan Jendela Waktu

Andi Muhammad Fiqri Achmad; Irfan Rusydi Triyanto

Authors

Andi Muhammad Fiqri Achmad Politeknik ATI Makassar Author
Irfan Rusydi Triyanto Politeknik Negeri Jakarta Author

Keywords:

stochastic demand, mixed integer linear programming, vehicle routing, inventory control

Abstract

One problem with stochastic characteristics is the drug distribution process. Drug demand originates from pharmacies, with the quantity requested varying each time a request is sent. This can be caused by several factors, one of which is that people's illnesses also vary and are not always the same. Due to this fluctuating demand from pharmacies, drug distributors must also provide larger quantities of drugs in their warehouses as safety stock. This study aims to develop a mathematical model for determining distribution vehicle routes and inventory management by considering uncertain demand and the presence of time windows. The developed mathematical model is in the form of a MILP. The data used is entirely synthetic and randomly generated. Data processing is carried out with several scenarios, by measuring the objective function value and computation time. The data processing results have produced a global optimal solution for 15 retailers and 5 different Beta value scenarios. The objective function value and computation time will increase with the increase in the number of retailers/pharmacies.

References

[1] A. M. F. Achmad, I. S. Aziz, and C. E. M. Katili, “Penentuan Rute Kendaraan Dengan Jendela Waktu Untuk Distribusi Produk Oleh PT. X,” J. Agro-industry Eng. Res., vol. 2, no. 1, pp. 46–51, 2023.

[2] E. J. Alarcon Ortega and K. F. Doerner, “A sampling-based matheuristic for the continuous-time stochastic inventory routing problem with time-windows,” Comput. Oper. Res., vol. 152, no. December 2022, p. 106129, 2023.

[3] L. Bertazzi, A. Bosco, F. Guerriero, and D. Laganà, “A stochastic inventory routing problem with stock-out,” Transp. Res. Part C Emerg. Technol., vol. 27, pp. 89–107, 2013.

[4] A. J. Kleywegt, V. S. Nori, and M. W. P. Savelsbergh, “The stochastic inventory routing problem with direct deliveries,” Transp. Sci., vol. 36, no. 1, pp. 94–118, 2002.

[5] A. Gutierrez-Alcoba, R. Rossi, B. Martin-Barragan, and T. Embley, “The stochastic inventory routing problem on electric roads,” Eur. J. Oper. Res., vol. 310, no. 1, pp. 156–167, 2023.

[6] Y. Crama, M. Rezaei, M. Savelsbergh, and T. Van Woensel, “Stochastic inventory routing for perishable products,” Transp. Sci., vol. 52, no. 3, pp. 526–546, 2018.

[7] A. Campbell, L. Clarke, A. Kleywegt, and M. Savelsbergh, “The Inventory Routing Problem,” Fleet Manag. Logist., no. Ddm, pp. 95–113, 1998.

[8] S. Chopra and M. Peter, Supply chain management: strategy, planning, and operation - third edition. 2014.

[9] S. Barr, “Thirty Years of Inventory-Routing,” CIRRELT Work. Pap., 2012.

[10] L. Bertazzi, A. Bosco, and D. Laganà, “Managing stochastic demand in an Inventory Routing Problem with transportation procurement,” Omega (United Kingdom), vol. 56, pp. 112–121, 2015.

[11] M. Savelsbergh, “The Continuous Time Inventory Routing Problem,” no. 2008.

[12] Z. Cui, D. Z. Long, J. Qi, and L. Zhang, “The Inventory Routing Problem Under Uncertainty,” Oper. Res., vol. 71, no. 1, pp. 378–395, 2023.

[13] C. Archetti, L. Bertazzi, G. Laporte, and M. G. Speranza, “A branch-and-cut algorithm for a vendor-managed inventory-routing problem,” Transp. Sci., vol. 41, no. 3, pp. 382–391, 2007.

[14] Y. Adulyasak, J. F. Cordeau, and R. Jans, “Formulations and branch-and-cut algorithms for multivehicle production and inventory routing problems,” INFORMS J. Comput., vol. 26, no. 1, pp. 103–120, 2014.

[15] A. M. F. Achmad, A. P. Enggita, and W. H. Afris, “Algoritma Simulated Annealing untuk Penentuan Lokasi Fasilitas dan Rute Kendaraan dengan Mempertimbangkan Jendela Waktu dan Kendaraan Heterogen Terbatas pada Sistem Pengelolaan Limbah,” J. Agro-industry Eng. Res., vol. 1, no. 1, pp. 20–27, 2022.

[16] M. Çelik, C. Archetti, and H. Süral, “Inventory routing in a warehouse: The storage replenishment routing problem,” Eur. J. Oper. Res., vol. 301, no. 3, pp. 1117–1132, 2022.

[17] D. W. Cho, Y. H. Lee, T. Y. Lee, and M. Gen, “An adaptive genetic algorithm for the time dependent inventory routing problem,” J. Intell. Manuf., vol. 25, no. 5, pp. 1025–1042, 2014.

[18] A. Alvarez, P. Munari, and R. Morabito, “Iterated local search and simulated annealing algorithms for the inventory routing problem,” Int. Trans. Oper. Res., vol. 25, no. 6, pp. 1785–1809, 2018.

[19] W. Lily and M. N. Hasnah, “Ant Colony Optimization For Split Delivery Inventory Routing Problem,” Malaysian J. Comput. Sci., vol. 30, no. 4, pp. 333–348, 2017.

[20] N. Dabiri, M. J. Tarokh, and M. Alinaghian, “New mathematical model for the bi-objective inventory routing problem with a step cost function: A multi-objective particle swarm optimization solution approach,” Appl. Math. Model., vol. 49, pp. 302–318, 2017.

[21] U. Hasturk, A. H. Schrotenboer, K. J. Roodbergen, and E. Ursavas, “Constrained Reinforcement Learning for the Dynamic Inventory Routing Problem under Stochastic Supply and Demand,” no. Ipcc, pp. 1–41, 2025.

[22] A. Lodi and G. Zarpellon, “On learning and branching: a survey,” Top, vol. 25, no. 2, pp. 207–236, 2017.