The increasing population in Yogyakarta City has implications for consumption and solid waste production activities. The waste collection process is the most expensive one in municipal waste management. It is necessary to determine the optimal route for municipal waste collection. In this research, we developed a vehicle routing problem (VRP) with a heterogeneous fleet, multiple trips, intermediate facility, and split delivery to approach the Yogyakarta City waste collection problem. We proposed a hybrid genetic algorithm (GA) to solve the VRP. The result of this study shows that developed VRP can be used to solve the Yogyakarta City waste collection problem.Abstrak. Jumlah penduduk Kota Yogyakarta yang terus bertambah setiap tahunnya berimplikasi pada semakin meningkatnya aktivitas konsumsi sekaligus sampah yang dihasilkan. Proses pengumpulan sampah merupakan kontributor terbesar untuk biaya pengelolaan sampah. Sehingga diperlukan penentuan rute pengangkutan sampah kota yang optimal. Penelitian ini mengembangkan model vehicle routing problem (VRP) untuk persoalan penentuan rute pengangkutan sampah Kota Yogyakarta yang mempertimbangkan batasan heterogeneous fleet, multiple trip, intermediate facility, dan split delivery yang kemudian diselesaikan menggunakan hybrid genetika algoritma (GA). Peneletian ini berhasil mengembangkan model VRP untuk menyelesaikan persoalan penentuan rute pengangkutan sampah Kota Yogyakarta.Kata Kunci: Vehicle Routing Problem, penentuan rute, pengangkutan sampah kota, Algoritma Genetika
The“Bersih Bersama” Waste Bank located in Karanganom, Sitimulyo, Piyungan, Bantul, Yogyakarta Special Region was a waste bank that still exists to manage waste from the local community. The problems faced include that management ware still limited to receiving from customers, then collected and handed over to collectors. The customer was not always doing the sorting process, so the managers have to sort and even have to clean it first. In addition, the level of community awareness to manage waste is still lacking. The purpose of community service was to provide additional skills to members of the waste bank to convert used goods that were originally only sorted and sold, converted into products that have use value and sale value. Community service activities were carried out by organizing training and assistance in making coffee sachet bags using waste paper and coffee sachets (plastic) directly to the community. This training was carried out in 2 stages, namely on September 20 for stage 1 and October 10, 2020 for stage 2. The results of the implementation of community service were increased knowledge about the use of paper and plastic waste, the ability to make new products in the form of coffee sachet bags with attractive motifs that have value. added. A positive impact can be seen from the increased knowledge and understanding of waste bank members in the use of paper and plastic waste into useful and economic goods. In addition, the Karanganom Sitimulyo community can contribute to reducing plastic waste in their environment
This research constitutes an application of heuristic optimization using the nearest neighbor (NN) method. It is a method used to design a route based on the next closest distance. The case here is the garbage freight of Yogyakarta City which becomes one of the Environmental Services Department duties. The sector of this research object is Malioboro-Kranggan because it has the highest number of TPS locations. There are 34 TPS locations, and 2 depots with an average volume of total garbage are 197 m3/day. Several alternative routes have resulted because the same distance was found when deciding the next distance (TPS 26 and TPS 31). The best alternative was determined based on the best scenario parameter of total mileage and operational time. The first scenario chose the garbage volume that is close to the remaining capacity, meanwhile, the second scenario chose the smallest garbage volume. At TPS 27, an alternative with the same closest distance appeared again (TPS 15 and TPS 18). Hence, the whole algorithm results in four alternative decisions. The first alternative results 13.59 hours as the total time and 40.092 km as the total distance, the second results 13.50 hours with 40.315 km, the third results 13.57 hours with 41.393 km, and the fourth results 13.803 hours with 40.41 km. The best alternative goes to the first alternative based on the parameter set before. It means that the scenario taken is by choosing the TPS with the closest remaining volume of the vehicle.
Saat ini, penelitian pemanfaatan limbah minyak jelantah telah banyak dilakukan, salah satunya yaitu pembuatan sabun transparan dari minyak jelantah oleh anggota bank sampah. Pemanfaatan limbah minyak dalam pembuatan sabun diharapkan dapat menjadi sumber pendapatan baru di bank sampah dengan menjadikannya produk yang diperjual belikan. Pada penelitian ini sabun dibuat dengan tiga jenis essence yaitu lemon, jasmin tea dan biji bunga matahari. Perlu kita ketahui, sebelum produk didistribusikan ke konsumen, perlu dilakukan perhitungan perencaaan produksi agar hasil produksi dapat memenuhi permintaan konsumen. Berdasarkan hal tersebut, dilakukan penelitian untuk menentukan perencanaan produksi yaitu berupa penentuan jumlah produk yang akan diproduksi dari setiap jenis sabun dimana produksi yang dilakukan menggunakan sistem batch. Pada 1 batch produksi akan menghasilkan 8 pcs sabun dengan essence yang sama dalam satu 1 batch agar tercapai biaya produksi minimum. Penelitian ini menggunakan metode integer linear programing dengan fungsi tujuan minimasi biaya produksi guna mengoptimalkan sumber daya yang tersedia dengan hasil berupa bilangan bulat. Probabilitas permintaan dalam penelitian ini dihitung menggunakan rantai marcov yang merujuk dari berbagai penelitian mengenai penentuan probabilitas kejadian yang akan datang berdasarkan data sebelumnya. Perhitungan berdasarkan data kuisioner minat konsumen terhadap sabun, dihitung menggunakan matriks hingga diperoleh keadaan steady state dan hasilnya dijadikan nilai batasan permintaan. Pengolahan data pada penelitian ini menggunakan software LINGO 11.0 sehingga diperoleh biaya minimum produksi sabun transparan sebesar Rp 219.632,- dengan jumlah sabun yang diproduksi pada masing-masing essence adalah 32 lemon, 24 jasmine tea dan 8 biji bunga matahari. Selanjutnya dilakukan analisis sensitivitas pada kapasitas sumber daya baik bahan baku maupun sumber daya manusia untuk mengetahui pengaruhnya terhadap hasil yang optimal.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.