Clustering transportation area of auto parts to shops and automotive service centers in bangkok and metropolitan provinces

This paper aims to group the freight lines to achieve an efficient delivery route and reduce cost. The problem in this research is an inefficient of customer clustering. The variables in the study include the number of customers each, distribution of customers in different areas and number of truck load. The problem is solved
by applying K-Mean Clustering method to define the customer groups by using Rapid Miner Studio. The result
shows that there are 5 groups of customers. Then shortest route for 5 customer groups of 246 delivery days
are optimized by Excel Solver. The result illustrates that the average distance per one trip resulting from excel
solver reduces from 121 kilometers to 116 kilometers or 4.13%. The one day on time delivery increases from 1,395 trips/year to 1,423 trips/year or 1.7% and transportation cost reduces 33,000 baht.