Optimasi Rute Pengangkutan Sampah Kota Yogyakarta Menggunakan Hybrid Genetic Algorithm

Ekky Armandi(1*), Annie Purwani(2), Utaminingsih Linarti(3),

(1) Universitas Ahmad Dahlan
(2) Universitas Ahmad Dahlan
(3) Universitas Ahmad Dahlan
(*) Corresponding Author
DOI: https://doi.org/10.23917/jiti.v18i2.8744

Abstract

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.

Keywords

vehicle routing problem; routing problem; city waste collection; genetic algorithm

Full Text:

PDF

References

Angelelli, E., Speranza, M.G. (2002). The periodic vehicle routing problem with intermediate facilities. European Journal of Operational Research, 137 (2), 233–247.

Arinalhaq, F., Imran, A., Fitria, L. (2013). Penentuan Rute Kendaraan Pengangkutan Sampah Dengan Menggunakan Metode Nearest Neighbour. Jurnal Online Institut Teknologi Nasional, 1 (1).

Arvianto, A., Setiawan, A.H., Saptadi, S. (2014). Model Vehicle Routing Problem dengan Karakteristik Rute Majemuk, Multiple Time Windows, Multiple Products dan Heterogeneous Fleet untuk Depot Tunggal. Jurnal Teknik Industri, 16 (2), 83–94.

Baker, B.M., Ayechew, M.A. (2003). A genetic algorithm for the vehicle routing problem. Computers & Operations Research, 30 (5), 787–800.

Bell, J.E., McMullen, P.R. (2004). Ant colony optimization techniques for the vehicle routing problem. Advanced Engineering Informatics, 18 (1), 41–48.

Cheng, A., Yu, D. (2013). Genetic algorithm for vehicle routing problem. In ICTE 2013: Safety, Speediness, Intelligence, Low-Carbon, Innovation (pp. 2876–2881).

Eminugroho, R.S., Dwi, L. (2013). Optimasi Sistem Pengangkutan Sampah di Kota Yogyakarta dengan Model Vehicle Routing Problem Menggunakan Algoritma Sequential Insertion. Jurnal SAINTEK, 19, 31–40.

Fitria, L., Susanty, S., Suprayogi, S. (2009). Penentuan Rute Truk Pengumpulan dan Pengangkutan Sampah di Bandung. Jurnal Teknik Industri, 11 (1), 51–60.

Fukasawa, R., Longo, H., Lysgaard, J., de Aragão, M.P., Reis, M., Uchoa, E., Werneck, R. F. (2006). Robust branch-and-cut-and-price for the capacitated vehicle routing problem. Mathematical Programming, 106 (3), 491–511.

Golden, B., Assad, A., Levy, L., Gheysens, F. (1984). The fleet size and mix vehicle routing problem. Computers & Operations Research, 11 (1), 49–66.

Republik Indonesia. (2008). Undang-Undang No. 18 Tahun 2008 tentang Pengelolaan Sampah. Jakarta: Sekretariat Negara.

Indrawati, Eliyati, N., Lukowi, A. (2016). Penentuan Rute Optimal pada Pengangkutan Sampah di Kota Palembang dengan Menggunakan Metode Saving Matrix. Jurnal Penelitian Sains, 18 (3).

Izar, S. (2018). Model Multi Depot Vehicle Routing Problem dengan Split Delivery dan Time Windows.

Jiang, J., Ng, K.M., Poh, K.L., Teo, K.M. (2014). Vehicle routing problem with a heterogeneous fleet and time windows. Expert Systems with Applications, 41 (8), 3748–3760.

Lestari, H.P. (2013). Penerapan algoritma koloni semut untuk optimisasi rute distribusi pengangkutan sampah di kota Yogyakarta. Jurnal Sains Dasar, 2 (1).

Liu, S., Huang, W., Ma, H. (2009). An effective genetic algorithm for the fleet size and mix vehicle routing problems. Transportation Research Part E: Logistics and Transportation Review, 45 (3), 434–445.

Moscato, P., Cotta, C. (2003). A gentle introduction to memetic algorithms. In Handbook of metaheuristics (pp. 105–144). Springer.

Nugraha, D.C.A., Mahmudy, W.F. (2015). Optimasi Vehicle Routing Problem with Time Windows Pada Distribusi Katering Menggunakan Algoritma Genetika. Prosiding SESINDO 2015.

Pakusadewa, P.G., Dewi, C., Wihandika, R.C. (2017). Penerapan Hibridisasi Algoritme Genetika dan Simulated Annealing untuk Optimasi Vehicle Routing Problem pada Kasus Pengangkutan Sampah Kota Denpasar. Jurnal Pengembangan Teknologi Informasi Dan Ilmu Komputer E-ISSN, 2548 (February), 964X.

Prins, C. (2002). Efficient heuristics for the heterogeneous fleet multitrip VRP with application to a large-scale real case. Journal of Mathematical Modelling and Algorithms, 1 (2), 135–150.

Prins, C. (2009). Two memetic algorithms for heterogeneous fleet vehicle routing problems. Engineering Applications of Artificial Intelligence, 22 (6), 916–928.

Priyandari, Y. (2008). Alogaritma Sequential Insertion untuk Memecahkan Vehicle Routing Problem dengan Multiple Trips, Time Window dan Simultaneous Pickup Delivery. Performa, 7 (1), 88–96.

Ray, S., Soeanu, A., Debbabi, M., Boukhtouta, A., Berger, J. (2012). Modeling multi-depot split-delivery vehicle routing problem. The Proceedings of the IEEE-Cenference on Computation Engineering in System Applications.

Sharma, A., Mehta, A. (2013). Review paper of various selection methods in genetic algorithm. International Journal of Advanced Research in Computer Science and Software Engineering, 3 (7), 1476–1479.

Wibisono, E. (2018). Logika Logistik: Teknik dan Metode Pemrograman dalam Problem-problem Pengaturan Rute. Surabaya: Graha Ilmu.

Article Metrics

Abstract view(s): 1972 time(s)
PDF: 1492 time(s)

Refbacks

  • There are currently no refbacks.