Optimization of Palm Oil Distribution Routes Using the Saving Matrix Approach and Genetic Algorithm on Capacitated Vehicle Routing Problem

Evi Yuliza, Yuli Andriani, Indrawati Indrawati, Sisca Octarina, Diah Putri Ramadani

Abstract


The transportation of goods and services is a strategic issue in logistics systems, particularly in the palm oil industry. One of the key distribution optimization challenges is the Capacitated Vehicle Routing Problem (CVRP), which involves determining optimal distribution routes while considering vehicle capacity constraints. This study aims to identify the shortest distribution routes for transporting fresh oil palm fruit bunches from collection points to the palm oil mill, with the goal of minimizing total vehicle travel distance. A heuristic approach using the Saving Matrix method and a metaheuristic approach using a Genetic Algorithm were applied separately to two regions: Block P and Block Q, each consisting of 14 collection points with daily distribution schedules. The performance of both algorithms was analyzed and compared in the context of region-based distribution.The results show that the Genetic Algorithm yields more optimal solutions than the Saving Matrix, reducing the total travel distance by 33.92% in Block P and 32.81% in Block Q. In comparison, the Saving Matrix achieved reductions of 38.72% in Block P and 35.25% in Block Q. These findings indicate that the Genetic Algorithm performs better in solving CVRP for the distribution of fresh oil palm fruit bunches and can serve as a foundation for developing more efficient distribution systems using heuristic and metaheuristic approaches


Keywords


capacitated vehicle routing problem; distance; genetic algorithm; route; saving matrix

Full Text:

PDF

References


[1] A. A. Ibrahim, N. Lo, R. O. Abdulaziz, and J. A. Ishaya, “The Capacitated Vehicle Routing Prob255 lem,” International Journal of Research-Granthaalayah, vol. 7, no. 3, pp. 310–327, 2019.
[2] M. Anderson, S. Sumarsono, and A. Mahendra, “Vehicle Routing Problem In A Medical Facility Waste Collection Company: A Comparative Analysis Of Guided Local Search, Simulated Annealing And Tabu Search ,” International Journal of Technology, vol. 16, no. January 2023, pp. 423–259 432, 2018.
[3] E. Solano-Charris, C. Prins, and A. C. Santos, “Local Search Based Metaheuristics for the Robust Vehicle Routing Problem with Discrete Scenarios,” Applied Soft Computing Journal, vol. 32, pp. 518–531, 2015.
[4] E. Yuliza, S. Octarina, N. Eliyati, and F. Maya, “Application of The Robust Capacitated Vehicle Routing Problem with Time Windows Model on Gallon Water Distribution,” AIP Conference Proceedings, vol. 020076, no. 2577, pp. 13–19, 2022.
[5] A. Hottung and K. Tierney, “Neural Large Neighborhood Search For the Capacitated Vehicle Routing Problem,” Frontiers in Artificial Intelligence and Applications, vol. 325, pp. 443–450, 2020.
[6] E. Queiroga, R. Sadykov, and E. Uchoa, “A POPMUSIC Matheuristic For The Capacitated vehicle Routing Problem,” Computers and Operations Research, vol. 136, no. July, p. 105475, 2021.
[7] S. Izar, S. Suwilo, and Sutarman, “The Vehicle Routing Problem with Discrete Split Delivery and Time Windows Time Windows,” Bulletin of Mathematics, vol. 08, no. September, pp. 169–177, 2016.
[8] L. Liu, K. Li, and Z. Liu, “A Capacitated Vehicle Routing Problem with Order Available Time in e-commerce Industry,” Engineering Optimization, vol. 49, no. 3, pp. 449–465, 2017.
[9] M. Nazari, A. Oroojlooy, M. Takác, and L. V. Snyder, “Reinforcement learning for solving the vehicle routing problem,” Industrial and Systems Engineering, pp. 9839–9849, 2018.

[10] N. J. Z. Mamat, S. H. Jaaman, and R. Ahmad, “Vehicle Routing Problem and Capacitated Vehi278 cle Routing Problem Frameworks in Fund Allocation Problem,” in AIP Conference Proceedings, vol. 1784, pp. 050001–1–050001–7, American Institute of Physics, 2016.

[11] P. Sitek and J. Wikarek, “Capacitated Vehicle Routing Problem with Pick-Up and Alternative Delivery (CVRPPAD): Model and Implementation Using Hybrid Approach,” Annals of Operations Research, vol. 273, no. 1-2, pp. 257–277, 2019.
[12] Z. Borcinová, “Two models of the capacitated vehicle routing problem,” ˇ Croatian Operational Research Review, vol. 8, no. 2, pp. 463–469, 2017.
[13] M. Sajid, J. Singh, R. A. Haidri, M. Prasad, V. Varadarajan, K. Kotecha, and D. Garg, “Article a Novel Algorithm for Capacitated Vehicle Rrouting Problem for Smart Cities,” Symmetry, vol. 13, no. 10, pp. 1–23, 2021.
[14] E. Yuliza and F. Puspita, “Branch and Cut Method for Solving Capacitated Vehicle Routing Problem (CVRP) Model of LPG Gas Distribution Routes,” Science and Technology Indonesia, vol. 4, no. 4, p. 105, 2019.
[15] F. Alesiani, G. Ermis, and K. Gkiotsalitis, “Constrained Clustering for the Capacitated Vehicle Routing Problem (CC-CVRP),” Applied Artificial Intelligence, vol. 36, no. 1, 2022.
[16] N. A. Fitriani, R. A. Pratama, S. Zahro, P. H. Utomo, and T. S. Martini, “Solving Capacitated Vehicle Routing Problem Using Saving Matrix, Sequential Insertion, and Nearest Neighbor of Product ’X’ in Grobogan District,” AIP Conference Proceedings, vol. 2326, 2021.
[17] E. Yuliza, B. Suprihatin, P. B. Jaya Bangun, F. M. Puspita, S. Octarina, and Nuraina, “Saving Matrix
Method and Nearest Neighbor Method for Garbage Transport Route Problems,” AIP Conference Proceedings, vol. 3046, no. 1, 2024.
[18] D. G. Rossit, A. A. Toncovich, and M. Fermani, “Routing in waste collection: A simulated annealing algorithm for an argentinean case study,” Mathematical Biosciences and Engineering, 2021.
[19] A. K. Ariyani, W. F. Mahmudy, and Y. P. Anggodo, “Hybrid genetic algorithms and simulated annealing for multi-trip vehicle routing problem with time windows.,” International Journal of Electrical & Computer Engineering (2088-8708), vol. 8, no. 6, 2018.
[20] S. Octarina, F. M. Puspita, S. S. Supadi, R. Afrilia, and E. Yuliza, “Set covering location problem and p-median problem model in determining the optimal temporary waste disposal sites location in seberang ulu i sub-district palembang,” in AIP Conference Proceedings, vol. 2577, p. 020046, AIP Publishing LLC, 2022.
[21] C. Kamthornsawat, A. Wayuparb, and S. Chain, “An Application of the Savings Method to A Vehicle Routing Problem,” The Journal of Supply Chain Management: Research and Practice, vol. 11, no. 2, pp. 56–68, 2017.
[22] R. M. Sari, J. C. P, A. Ishak, and M. M. Tambunan, “Analysis of Goods Delivery Routes Using Saving Matrix and Clarke Wright Savings Methods,” Jurnal Sistem Teknik Industri, vol. 27, no. 1, pp. 1–7, 2025.
[23] J. Carr, “Introduction to Genetic Algorithms,” Artificial Intelligence Methods in the Environmental Sciences, pp. 103–125, 2009.
[24] L. Haldurai, T. Madhubala, and R. Rajalakshmi, “A Study on Genetic Algorithm and Its Applications,” International Research Journal of Modernization in Engineering Technology and Science, no. 10, pp. 139–143, 2023.
[25] S. D. Immanuel and U. K. Chakraborty, “Genetic Algorithm: An Approach on Optimization,” Proceedings of the 4th International Conference on Communication and Electronics Systems, ICCES 2019, no. Icces, pp. 701–708, 2019




DOI: https://doi.org/10.18860/cauchy.v10i2.36371

Refbacks

  • There are currently no refbacks.


Copyright (c) 2025 Evi Yuliza

Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

Editorial Office
Mathematics Department,
Universitas Islam Negeri Maulana Malik Ibrahim Malang
Gajayana Street 50 Malang, East Java, Indonesia 65144
Faximile (+62) 341 558933
e-mail: cauchy@uin-malang.ac.id

Creative Commons License
CAUCHY: Jurnal Matematika Murni dan Aplikasi is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.