Keywords:Transportation, Routing, Saving Algorithm, Nearest Neighbor Method
The purpose of this study was to investigate the routing of trucks in order to reduce the backhaul of freight for bulk & sack product, which have multiple depot VRP. The case study was a transportation company, that has the source and destination locations are all ports and factories. The experiment chose total of 12 factories and ports with one transport truck to be case study. This research compared the original transport routes with the Heuristic method using the nearest neighbor method and saving algorithm. The results of the study concluded that the nearest neighbor approach has the shortest transportation distance. The original transport routing has total 4,118 km in transit distance, with 40.79% was non-freighter. The nearest neighbor algorithm transport route has a total transit distance of 3,722.9 km, with 34.50% was non-freighter and the saving algorithm has a total transit distance of 4,008.1 km, with 39.16% was non-freighter.
The article has been published in Kasem Bundit Engineering Journal (KBEJ) is the copyright of the Kasem Bundit University. Do not bring all of the messages or republished except permission from the university.
If the article is published as an article that infringes the copyright or has the wrong content the author of article must be responsible.