Open AccessMinimize transportation cost with clark and wright algorithm saving heuristic method with considering traffic congestion factor
Author(s) -
Sonna Kristina,
; Jason
Publication year - 2019
Publication title -
iop conference series. materials science and engineering
Language(s) - English
Resource type - Journals
eISSN - 1757-899X
pISSN - 1757-8981
DOI - 10.1088/1757-899x/673/1/012080
Subject(s) - truck , schedule , heuristic , transport engineering , traffic congestion , computer science , operations research , algorithm , engineering , automotive engineering , artificial intelligence , operating system
Bandung has more than 500 city parks that spread in 5 sectors which need to be maintained. As the department in charge of the city park watering, Diskamtam need to design their daily watering route and schedules to minimize operational costs. The watering route will be designed by using Clark and Wright Saving Heuristic method. By taking into account congestion factors, transportation cost can be minimized, and watering schedule can be developed. Trucks with the capacity of 5.000 litres will be assigned to water every 25 parks in the sector 2 route and the sector 4 route. This study find sector 2 need to be divided into five watering routes and sector 4 need to be divided into 4 watering routes. as a result, there is a 0.83% increase in operational cost. this is due to the congestion factor.