Shortest route for waste transportation in northern bandung using vehicle routing problem - clarke and wright - saving method

ISSN: 22783075
1Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.

Abstract

Bandung is one of big cities in Indonesia, and like the big city around the world, waste is become the problem to keep the city’s clean, and particularly on waste problem is to transporting waste from transfer station (tempat pembuangan sampah – TPS) to intermediate facility (stasiun peralihan antara – SPA) then to a landfill/dump site (tempat pemrosesan akhir – TPA). There are 29 TPS’s in Northern Bandung with a difference waste volume for each TPS. The waste will be loaded up and be transferred using stationary container system (SCS) to SPA daily. This paper is discussing waste transportation for 4 trucks of 6 m3 capacity for each from truck pool to many TPS’s and to a single SPA to obtain the shortest route. Using modified VRP – Saving method resulting 11 routes with total travel distance is 466,88 km and total service time is 25.51 hours. Method of Nearest Neighbor is also being used to find the alternate shortest route which are also resulting 11 routes and found alternate shortest route with total travel distance is 450, 25 km and total service time is 24.60 hours.

Cite

CITATION STYLE

APA

Wahyukaton, & Rochaeni, A. (2019). Shortest route for waste transportation in northern bandung using vehicle routing problem - clarke and wright - saving method. International Journal of Innovative Technology and Exploring Engineering, 8(8), 679–686.

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