Minimize Transportation Cost with Clark and Wright Algorithm Saving Heuristic Method With Considering Traffic Congestion Factor
Sonna Kristina, Jason
ITHB
Jl. Dipatiukur No. 82
Bandung - 40132
Indonesia
Abstract
Bandung have more than 500 city park that spread in 5 sector which need to be maintain by watering. Diskamtam are the party whose responsible for watering the city park so that need a route and schedule so that it can minimize the operational cost. In the previous research, 2 sector (2nd sector and 4th sector) route is developed by salesman traveling problem. And in this research route will developed by Clark and Wright Saving Heuristic method and considering traffic congestion factor. The output resulting from the route determination process is to minimize transportation cost and develop watering schedule during one-month period. Based on the results of the research it was found that second sector formed five watering routes and fourth sector with six watering routes. Comparison of costs incurred in this research is greater than the previous research for second sector Rp. 9.617.150,00 with an increase in operational cost of 0.69% and the fourth sector Rp. 9.163.416,00 with an increase in operational cost of 0.83%, this is affected by congestion factor.
Keywords: Capacitated Vehicle Routing Problem (CVRP), Clark and Wright Saving Heuristic algorithm, and congestion factor.
Topic: Industrial Engineering