Minimize transportation cost with clark and wright algorithm saving heuristic method with considering traffic congestion factor

1Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

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.

Cite

CITATION STYLE

APA

Kristina, S., & Jason. (2019). Minimize transportation cost with clark and wright algorithm saving heuristic method with considering traffic congestion factor. In IOP Conference Series: Materials Science and Engineering (Vol. 673). IOP Publishing Ltd. https://doi.org/10.1088/1757-899X/673/1/012080

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free