Donor Collectors Route Optimisation using Genetic Algorithm Method

Priyandoko Gigih; Siti Nur  Arofah; Nan Mad  Sahar; Istiadi Istiadi

doi:10.31258/ijeepse.3.1.1-5

Priyandoko Gigih University of Widyagama
Siti Nur Arofah University of Widyagama
Nan Mad Sahar Universiti Tun Hussein Onn Malaysia
Istiadi Istiadi University of Widyagama

DOI: https://doi.org/10.31258/ijeepse.3.1.1-5

Abstract viewed: 378 times

PDF downloaded: 301 times

Keywords: genetic algorithm, optimization, donor collector, route map.

Abstract

Searching for a route to take donation in terms of time and the shortest route is a must for the management because it can save time and effort. In order to make donations more efficient, a system is needed to provide recommendations for taking donation routes, one of which is using a Genetic Algorithm (GA) method. The GA can be applied in optimizing schedules, routes, and spaces. The results show that after testing two different routes with different maximum generation values of 50, 100, 500 and 1000, a maximum generation value of 50 can give optimal results.

References

[1] Agrawal, A, "Systematic Approach of Genetic algorithm for Solution of traditional based logical issues", Operations Research, 3, 286–289, 2017.

[2] Auliasari, K., Kertaningtyas, M., & Basuki, D. W. L, "Optimalisasi Rute Distribusi Produk Menggunakan Metode Traveling Salesman Problem", Jurnal Sains, Teknologi Dan Industri, 16(1), 2018.

[3] Bayer, S, "Solving the Traveling Salesman Problem with Genetic Algorithms", Analysis of Applied Mathematics, 88, 2018.

[4] Ellili, W., Samet, M., & Kachouri, A, "Traveling salesman problem of optimization based on genetic algorithms", 123–127, 2018.

[5] George, T., & Amudha, T, "Genetic Algorithm Based Multiobjective Optimization Framework to Solve Traveling Salesman Problem", In Advances in Computing and Intelligent Systems (pp. 141–151), Springer, 2020.

[6] Hacizade, U., & Kaya, I, "Ga based traveling salesman problem solution and its application to transport routes optimization", IFAC-PapersOnLine, 51(30), 620–625, 2018.

[7] Juneja, S. S., Saraswat, P., Singh, K., Sharma, J., Majumdar, R., & Chowdhary, S, "Travelling salesman problem optimization using genetic algorithm", 264–268, 2019.

[8] Vats, S., & Bakshi, N, "Review Paper on Genetic Algorithm and Simulated Annealing for solving the Travelling Salesman Problem", 2018.

[9] Wang, X., Li, P., Wang, L., & Wang, L, "A novel genetic algorithm based on circles for larger-scale traveling salesman problem", 189–194, 2017.

[10] Yunus, M., & Rumlaklak, R. M. T, "Optimasi Waktu Eksekusi Penentuan Rute Menuju Obyek Wisata di Malang Raya dengan Algoritma Genetika", Jurnal Teknologi Informasi: Teori, Konsep, Dan Implementasi, 29–40, 2018.

[11] Zukhri, Z, "Algoritma Genetika Metode Komputasi Evolusioner untuk Menyelesaikan Masalah Optimasi", Yogyakarta: Andi Offset, 2014.