การจัดเส้นทางการขนส่งชิ้นส่วนอุปกรณ์ตกแต่งรถยนต์เข้าสู่กระบวนการผลิตในอุตสาหกรรมยานยนต์ด้วยวิธีอัลกอริทึมแบบประหยัด
Keywords:
Transportation Routing, Saving Algorithm, Vehicle Routing Problem, Transportation Cost, Automotive Industry, การจัดเส้นทางการขนส่ง, อัลกอริทึมแบบประหยัด, ปัญหาการจัดเส้นทางยานพาหนะ, ต้นทุนการขนส่ง, อุตสาหกรรมยานยนต์Abstract
This quantitative research aimed to (1) study and analyze transportation route planning for automotive accessory parts among affiliated factories of a case-study company and (2) compare transportation costs before and after route planning by applying the Saving Algorithm of Clarke and Wright (1964). The study used actual transportation records among four affiliated factories in Rayong Province from October to December 2022. The results showed that the original routing consisted of four separate back-and-forth trips between factory pairs, with a total distance of 26 kilometers and a total travel time of 37 minutes. After applying the Saving Algorithm, an appropriate route under the study conditions, 1-2-3-5-1, was obtained. The distance was reduced to 13 kilometers, or 50 percent, travel time was reduced by 50 percent, and the number of trips decreased from four to one per round. Transportation cost per round decreased from 9,000 baht to 3,900 baht, saving 5,100 baht per round or 56.67 percent, equivalent to approximately 673,200 baht per year under the assumption that the transportation frequency remained close to the study period.