Solusi Heuristik untuk Permasalahan Rute Inventori Berkala pada Produk Segar
DOI:
https://doi.org/10.26418/jp.v8i1.51667Keywords:
Produk segar, Periodic inventory routing, Greedy, Random, heuristikAbstract
Produk segar yang mudah rusak (perishable) ialah produk yang mengalami penurunan nilai seiring dengan waktu sehingga dibutuhkan strategi pendistribusian dan penyimpanan yang tepat agar produk dapat terjual sebelum nilai produk menurun secara signifikan. Pada riset ini dikembangkan suatu metode solusi heuristik bagi masalah inventory routing berkala untuk pendistribusian dan pengelolaan persediaan produk segar mudah rusak dengan tujuan memaksimalkan pendapatan total yang dihasilkan. Pengembangan metode solusi heuristik ini menggunakan dua algoritma heuristik yaitu greedy dan random. Eksperimen terhadap kedua algoritma ini dilakukan menggunakan dua skenario pola demand konsumen akhir. Hasil eksperimen menunjukkan bahwa Algoritma Greedy mampu memberikan solusi yang lebih baik dibandingkan dengan Algoritma Random pada skenario pola demand menurun.References
M. Sloof, L. M. M. Tijskens, and E. C. Wilkinson, “Concepts for modelling the quality of perishable products,†Trends Food Sci. Technol., vol. 7, no. 5, pp. 165–171, 1996.
S. Harifi, M. Khalilian, J. Mohammadzadeh, and S. Ebrahimnejad, “Optimization in solving inventory control problem using nature inspired Emperor Penguins Colony algorithm,†J. Intell. Manuf., vol. 32, no. 5, pp. 1361–1375, 2021, doi: 10.1007/s10845-020-01616-8.
A. M. Campbell and M. W. P. Savelsbergh, “A decomposition approach for the inventory-routing problem,†Transp. Sci., vol. 38, no. 4, pp. 488–502, 2004, doi: 10.1287/trsc.1030.0054.
H. M. Beheshti, I. J. Clelland, and K. V. Harrington, “Competitive advantage with vendor managed inventory,†J. Promot. Manag., vol. 26, no. 6, pp. 836–854, 2020, doi: 10.1080/10496491.2020.1794507.
Y. Dong and K. Xu, “A supply chain model of vendor managed inventory,†Transp. Res. Part E Logist. Transp. Rev., vol. 38, no. 2, pp. 75–95, 2002, doi: 10.1016/S1366-5545(01)00014-X.
P. De Giovanni, “Smart Supply Chains with vendor managed inventory, coordination, and environmental performance,†Eur. J. Oper. Res., vol. 292, no. 2, pp. 515–531, 2021, doi: 10.1016/j.ejor.2020.10.049.
D. F. Ross, Distribution Planning and Control: Managing in the Era of Supply Chain Management, 3th ed. Springer New York, 2015.
A. W. I. Federgruen, G. Prastacos, and P. H. Zipkin, “An allocation and distribution model for perishable products,†Oper. Res. Soc. Am., vol. 34, no. 1, pp. 75–82, 1986.
Z. Dai, K. Gao, and B. C. Giri, “A hybrid heuristic algorithm for cyclic inventory-routing problem with perishable products in VMI supply chain,†Expert Syst. Appl., vol. 153, p. 113322, 2020, doi: 10.1016/j.eswa.2020.113322.
A. Ghasemkhani, R. Tavakkoli-Moghaddam, Y. Rahimi, S. Shahnejat-Bushehri, and H. Tavakkoli-Moghaddam, “Integrated production-inventory-routing problem for multi-perishable products under uncertainty by meta-heuristic algorithms,†Int. J. Prod. Res., pp. 1–21, 2021, doi: 10.1080/00207543.2021.1902013.
M. Yavari, H. Enjavi, and M. Geraeli, “Demand management to cope with routes disruptions in location-inventory-routing problem for perishable products,†Res. Transp. Bus. Manag., vol. 37, p. 100552, 2020, doi: 10.1016/j.rtbm.2020.100552.
R. Li and J. T. Teng, “Pricing and lot-sizing decisions for perishable goods when demand depends on selling price, reference price, product freshness, and displayed stocks,†Eur. J. Oper. Res., vol. 270, no. 3, pp. 1099–1108, 2018, doi: 10.1016/j.ejor.2018.04.029.
A. C. Baller, M. van Ee, M. Hoogeboom, and L. Stougie, “Complexity of inventory routing problems when routing is easy,†Networks, vol. 75, no. 2, pp. 113–123, 2020, doi: 10.1002/net.21908.
T. G. Crainic and M. Gendreau, “Heuristics and Metaheuristics for Fixed-Charge Network Design,†in Network Design with Applications to Transportation and Logistics, Springer, Cham, 2021, pp. 91–138.
G. Michel and P. Jean-Yves, Eds., Handbook of Metaheuristics. Springer International Publishing, 2018.
F. Arnold and K. Sörensen, “What makes a VRP solution good? The generation of problem-specific knowledge for heuristics,†Comput. Oper. Res., vol. 106, pp. 280–288, 2019, doi: 10.1016/j.cor.2018.02.007.
L. C. Coelho and G. Laporte, “The exact solution of several classes of inventory-routing problems,†Comput. Oper. Res., vol. 40, no. 2, pp. 558–565, 2013, doi: 10.1016/j.cor.2012.08.012.
B. Raa and T. Aouam, “Multi-vehicle stochastic cyclic inventory routing with guaranteed replenishments,†Int. J. Prod. Econ., vol. 234, p. 108059, 2021, doi: 10.1016/j.ijpe.2021.108059.
M. Yang, Y. Ni, X. Yang, and D. A. Ralescu, “The consistent vehicle routing problem under uncertain environment,†J. Intell. Fuzzy Syst., vol. 41, no. 2, pp. 2797–2812, 2021, doi: 10.3233/JIFS-202593.
A. Diabat, C. Archetti, and W. Najy, “The fixed-partition policy inventory routing problem,†Transp. Sci., vol. 55, no. 2, pp. 353–370, 2021.
L. Feng, Y. L. Chan, and L. E. Cárdenas-Barrón, “Pricing and lot-sizing polices for perishable goods when the demand depends on selling price, displayed stocks, and expiration date,†Int. J. Prod. Econ., vol. 185, pp. 11–20, 2017, doi: 10.1016/j.ijpe.2016.12.017.
V. Chaudhary, and S. R. Rakhee Kulshrestha, R. Kulshrestha, and S. Routroy, “State-of-the-art literature review on inventory models for perishable products,†J. Adv. Manag. Res., vol. 15, no. 3, pp. 306–346, 2018, doi: 10.1108/JAMR-09-2017-0091.
