The Selection of Depots Location and Vehicle Routing for Para-Rubber

Authors

  • Somsak Kaewploy Department of Logistics Engineering, Faculty of Industrial Technology, Songkhla Rajabhat University
  • Sujittra Kaewploy Department of Industrial Engineering, Faculty of Engineering, Ubon Ratchathani University
  • Watchanachai Jumpa Department of Industrial Engineering, Faculty of Agriculture Industrial Technology, Rajamangala University of Technology Tawan-ok Chanthaburi Campus

DOI:

https://doi.org/10.14456/rmutlengj.2021.9

Keywords:

Location Allocation Problem, Vehicle Routing Problem, Mathematical Model

Abstract

In the past, the location routing problems of Para-rubber was not properly studied for solutions. As a result, the rubber seller has to cover the transportation cost. In this research, a mathematics model is applied to develop an algorithm for solving the problem which aims to reduce transportation cost while considering the economic worth. Results show that deploying a total of 10 depots which consists of 3 small-capacity depots, 5 middle-capacity depots and 2 unlimited-capacity depots can reduce the transportation cost from 354,335.22 baht/day down to 203,171 baht/day or 42.7 percentage. In conclusion, the mathematics model and cost-saving algorithm are proven to be an attractive solution to the location routing problem.

References

[1] Logistics Office. Optimization of industrial logistics in the southern region. Bangkok: Y C S Media; 2014.
[2] Rubber Research Institute. Natural rubber production of Thailand. Bangkok: Thai Rubber Association; 2015.
[3] Rapeepan P. Specialized topics in operations management. Ubon Ratchathani: Ubon Ratchathani University; 2017.
[4] Laporte G, Louveaux FV. Solving stochastic routing problem with the integer L-shaped method. Fleet Management and Logistics. 1998; 159-167.
[5] Fischetti M, Toth P, Vigo D. A branch and bound algorithm for the capacitated vehicle routing problem on directed graphs. Operation Research. 1994; 42(5): 846-859.
[6] Lysgaard J, Letchford AN, Eglese RW. A new branch and cut algorithm for the capacitated vehicle routing problem. Mathematical Programming. 2004 Jun;100(2):423-445.
[7] Lambert DM, Cooper MC,Pagh JD. Supply chain management: implementation issues and research opportunities. The International Journal of Logistics Management. 1998 Jul 1; 9(2):1-20.
[8] Clarke G, Wright JW. Scheduling of vehicles from a central depot to a number of delivery points. Operations Research. 1964 Aug;12(4): 568-581.
[9] Somsak K, Sujittra K, Sombat S. The location routing problem with para rubber by using tabu search. Conference on Industrial Engineering, 2018 July 23-26, Ubon Ratchathani; 2018. p. 348-1352.
[10] Somsak K, Sindhuchao S. Solving location Routing Problem of the Central Rubber Market by Tabu Search. KMUTNB Int J Appl Sci Technol. 2017; 10(2); 145-151.

Downloads

Published

2021-12-08

How to Cite

Kaewploy, S. ., Kaewploy, S. ., & Jumpa, W. . (2021). The Selection of Depots Location and Vehicle Routing for Para-Rubber . RMUTL Engineering Journal, 6(2), 29–39. https://doi.org/10.14456/rmutlengj.2021.9

Issue

Section

Research Article