41
DAFTAR PUSTAKA
Amponsah, S., & Salhi, S. (2004). The investigation of a class of capacitated arc routing problems: the collection of garbage in developing countries. Waste Management, 24(7), 711–721.
Archetti, C., Guerriero, F., & Macrina, G. (2021). The online vehicle routing problem with occasional drivers. Computers & Operations Research, 127, 105144.
Baressi ŠEgota, S., Lorencin, I., Ohkura, K., & Car, Z. (2019). On the Traveling Salesman Problem in Nautical Environments: an Evolutionary Computing Approach to Optimization of Tourist Route Paths in Medulin, Croatia.
Journal of Maritime & Transportation Science, 57(1), 71–87.
Bovet, D. P., Crescenzi, P., & Bovet, D. (1994). Introduction to the Theory of Complexity (p. 69). London: Prentice Hall.
Directions | API. (2022, May 9). Mapbox.https://docs.mapbox.com/api/navigation/directions/
Faber, V. (1994). Clustering and the continuous k-means algorithm. Los Alamos Science, 22(138144.21), 67.
Hozairi, H., Tukan, M., Lumaksono, H., & Alim, S. (2020). Optimasi Jalur Distribusi Kapal Pengangkut Ikan Dengan Metode Simulated Annealing Menggunakan Google OR-Tools. In Seminar MASTER PPNS (Vol. 5, No.
1).
Jaradat, A., & Diabat, W. (2019, April). Solving traveling salesman problem using firefly algorithm and k-means clustering. In 2019 IEEE Jordan International Joint Conference on Electrical Engineering and Information Technology (JEEIT) (pp. 586-589). IEEE.
Jünger, M., Reinelt, G., & Rinaldi, G. (1995). The traveling salesman problem. Handbooks in operations research and management science, 7, 225-330.
Kalra, M., Lal, N., & Qamar, S. (2018). K-mean clustering algorithm approach for data mining of heterogeneous data. In Information and Communication Technology for Sustainable Development (pp. 61-70). Springer, Singapore.
Knuth, D. E. (1974). Postscript about NP-hard problems. ACM SIGACT News, 6(2), 15-16.
42
Kurniawan, M., & Suciati, N. (2017). Modifikasi kombinasi particle swarm optimization dan genetic algorithm untuk permasalahan fungsi non-linier.
INTEGER: Journal of Information Technology, 2(2)
Matai, R., Singh, S. P., & Mittal, M. L. (2010). Traveling salesman problem: an overview of applications, formulations, and solution approaches. Traveling salesman problem, theory and applications, 1.
McMenemy, P., Veerapen, N., Adair, J., & Ochoa, G. (2019, April). Rigorous performance analysis of state-of-the-art tsp heuristic solvers. In European Conference on Evolutionary Computation in Combinatorial Optimization (Part of EvoStar) (pp. 99-114). Springer, Cham.
Pooja Vaishnav, Naveen Choudhary, and Kalpana Jain. Traveling salesman problem using genetic algorithm: a survey. International Journal of Scientific Research in Computer Science, Engineering and Information Technology, 2(3):105–108, 2017
Rokbani, N., Kumar, R., Abraham, A., Alimi, A. M., Long, H. V., Priyadarshini, I.,
& Son, L. H. (2020b). Bi-heuristic ant colony optimization-based approaches for traveling salesman problem. Soft Computing, 25(5), 3775–
3794.
Tan, L. Z., Tan, Y. Y., Yun, G. X., & Zhang, C. (2017). An improved genetic algorithm based on k-means clustering for solving traveling salesman problem. In Computer Science, Technology and Application: Proceedings of the 2016 International Conference on Computer Science, Technology and Application (CSTA2016) (pp. 334-343).
Usman, M. Z., & Oktiarso, T. (2019). Implementasi Algoritma Greedy Untuk Menyelesaikan Travelling Salesman Problem di Distributor PT. Z. Journal of Integrated System, 1(2), 216–229.
Van Leeuwen, J. (Ed.). (1991). Handbook of theoretical computer science (vol. A) algorithms and complexity. Mit Press.
Yuan, C., & Yang, H. (2019). Research on K-value selection method of K-means clustering algorithm. J, 2(2), 226-235.
