Improving the Efficiency of Planning Delivery Routes for Goods Transportation: A Case Study of Sample Company
Keywords:
Vehicle Routing Problem, K-means clustering, VRP Spreadsheet SolverAbstract
This study presented a method for solving the Vehicle Routing Problem ( VRP). In the case of having only one warehouse. There were many customers, each with a different demand for products but knew the quantity of products that customers need in advance and the exact time period for receiving the customers’ s products. The objective of the study was to reduce transportation costs of the cases study companies and to be able to solve problems related to various limitations, which included: Time Windows, Split Demand Delivery and Capacitated. The researcher has compared transportation costs of the 2 methods: Using routing. Using Clustering and Routing. The results obtained from transporting goods to 117 customers using both methods were compared with using the experience of drivers in planning the route, it was found that the first method made transportation costs to increase by 2.5 baht, equivalent to 0.006% and the other method could reduce transportation costs by 1,535.5 baht, equivalent to 3.43%.
References
Y. Kao, M. H. Chen, and Y. T. Huang, “A hybrid algorithm based on ACO and PSO for capacitated vehicle routing problems,” Math. Probl. Eng. , vol. 2012, pp. 1-7, 2012.
N. Wichapa, T. Sudsuansee, and P. Khokhajaikiat, “ Solving the vehicle routing problems with time windows using hybrid genetic algorithm with push forward insertion heuristic and local search procedure,” King Mongkut’s Univ. Technol. North Bangkok Acad. J., vol. 29, no. 1, pp. 4-13, 2019.
J. F. Bard, G. Kontoravdis, and G. Yu, “ A branch- and- cut procedure for the vehicle routing problem with time windows,” Transp. Sci., 2002. vol. 36, no. 2, pp. 250–269.
M. Desrochers, J. Desrosiers, and M. Solomon, “ A new optimization algorithm for the vehicle routing problem with time windows,” Oper. Res., 1992, vol. 40, no. 2, pp. 342–354.
N. Azi, M. Gendreau, and J.-Y. Potvin, “ An exact algorithm for a vehicle routing problem with time windows and multiple use of vehicles,” Eur. J. Oper. Res., 2010. vol. 202, no. 3, pp. 756–763.
W. - C. Chiang and R. A. Russell, “ Simulated annealing metaheuristics for the vehicle routing problem with time windows,” Ann. Oper. Res., 1996. vol. 63, no. 1, pp. 3–27.
J. F. Cordeau, G. Laporte, and A. Mercier, “ A unified tabu search heuristic for vehicle routing problems with time windows,” J. Oper. Res. Soc., 2001. vol. 52, no. 8, pp. 928-936.
G. B. Alvarenga, G. R. Mateus, and G. de Tomi, “ A genetic and set partitioning two- phase approach for the vehicle routing problem with time windows,” Comput. Oper. Res., 2007. vol. 34, no. 6, pp. 1561–1584.
G. Erdoğan, “ An open source spreadsheet solver for vehicle routing problems,” Comput. Oper. Res., 2017. vol. 84, pp. 62-72.
S. Ingpaiboon, C. Yiengkamolsing, P. Naksidi, and W. Ngamsa- ard, “Improving the efficiency of vehicle routing using the VRP Spreadsheet Solver: A case study of ThaiNamthip Co. , Ltd. ,” Southeast Bangkok Univ. J. Sci. Technol., 2022. vol. 2, no. 3, pp. 1-11.
P. Phriktim, P. Siriora, and P. Autsavanakul, “ Reducing transportation costs: A case study of an oil filter manufacturing company,” Thonburi Univ. J. Sci. Technol., 2022. vol. 6, no. 2, pp. 16-23.
P. MeeBua and J. Jitrotevej, “Customer segmentation of a logistics company providing international sea container transportation,” KKU Sci. J., 2015. vol. 43, no. 2, pp. 297-308.
A. Chumpol, N. Phasan, and P. Tipsantia, “ Application of the KMeans- TSP method for solving transportation routing problems: A case study of Sangchai Rungruang Co. , Ltd. ,” Surin Rajabhat Univ. J. Manage. Sci. Res., 2020. vol. 4, no. 2, pp. 15-26.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2024 Faculty of Industrial Technology, Suan Sunandha Rajabhat University
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
บทความที่ได้รับการตีพิมพ์เป็นลิขสิทธิ์ของคณะเทคโนโลยีอุตสาหกรรม มหาวิทยาลัยราชภัฎสวนสุนันทา
ข้อความที่ปรากฏในบทความแต่ละเรื่องในวารสารวิชาการเล่มนี้เป็นความคิดเห็นส่วนตัวของผู้เขียนแต่ละท่านไม่เกี่ยวข้องกับมหาวิทยาลัยราชภัฎสวนสุนันทา และคณาจารย์ท่านอื่นๆในมหาวิทยาลัยฯ แต่อย่างใด ความรับผิดชอบองค์ประกอบทั้งหมดของบทความแต่ละเรื่องเป็นของผู้เขียนแต่ละท่าน หากมีความผิดพลาดใดๆ ผู้เขียนแต่ละท่านจะรับผิดชอบบทความของตนเองแต่ผู้เดียว
