Pengoptimalan Rute Pengangkutan Sampah di Kota Medan Menggunakan Program Dinamik

Abstract

Garbage is a problem that still be attention from various parties because it’s a direct line to health, cleanliness and beauty. In some ministerial areas, we still find a pile of garbage that doesn’t end up in the final dump. This is the result of the ineffective process of transporting garbage because there is no fixed route against visits to any temporary dumping grounds. Therefore it is necessary to be optimized for the pick up of trash routes for minimal distance. Optimize the route using a dynamic program with optical solutions obtained in pool A for a distance of 23,1 km with a 72 % distance reduction and in pool C for a distance of 21 km with 71,8 % distance reduction .