Main Article Content
Abstract
Keywords
Article Details
Authors who publish with this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).
References
- R. Alexander, "Pencarian Rute Distribusi Barang Menggunakan Algoritma Semut," Universitas Sanata Dharma, Jakarta, 2015.
- O. Farisi, "Penyelesaian Multi-Depot Multiple Traveling Salesmen Problem Menggunakan K-Means dan Ant Colony Optimization," Jurnal Nusantara, vol. 2, no. 5, pp. 1-8, 2016.
- A. Leksono, "Algoritma Ant Colony Optimization (ACO) untuk Menyelesaikan Traveling Salesmen Problem (TSP)," Universitas Diponegoro, Semarang, 2009.
- A. Adha, "Peta Interaktif Pencarian Jalur Terpendek dengan Menggunakan Algoritma Semut untuk Penjemputan Barang," Universitas Islam Negeri Sultan Syarif Kasim, Pekanbaru, 2010.
- D. Mulia, "Aplikasi Algoritma Ant System (AS) dalam Kasus Traveling Salesmen Problem (TSP)," Universitas Islam Negeri Syarief Hidayatullah, Jakarta, 2011.
- E. Mindaputra, "Penggunaan Algoritma Ant Colony System dalam Traveling Salesman Problem (TSP) pada PT. Eka Jaya Motor," Universitas Diponegoro, Semarang, 2009.
- D. B. Painlin, "Penentuan Rute Optimal Distribusi Produk Nestle dengan Metode Traveling Salesman Problem (TSP) (Studi Kasus: PT. Paris Jaya Mandiri)," Jurnal Arika, vol. 11, no. 1, pp. 35-43, 2017.
- J. S. Budayasa, Teori Graph dan Aplikasinya, Surabaya: Unesa University Press, 2017.
- J. S. Siang, Matematika Diskrit dan Aplikasinya Pada Ilmu Komputer, Yogyakarta: Penerbit Andi, 2002.
References
R. Alexander, "Pencarian Rute Distribusi Barang Menggunakan Algoritma Semut," Universitas Sanata Dharma, Jakarta, 2015.
O. Farisi, "Penyelesaian Multi-Depot Multiple Traveling Salesmen Problem Menggunakan K-Means dan Ant Colony Optimization," Jurnal Nusantara, vol. 2, no. 5, pp. 1-8, 2016.
A. Leksono, "Algoritma Ant Colony Optimization (ACO) untuk Menyelesaikan Traveling Salesmen Problem (TSP)," Universitas Diponegoro, Semarang, 2009.
A. Adha, "Peta Interaktif Pencarian Jalur Terpendek dengan Menggunakan Algoritma Semut untuk Penjemputan Barang," Universitas Islam Negeri Sultan Syarif Kasim, Pekanbaru, 2010.
D. Mulia, "Aplikasi Algoritma Ant System (AS) dalam Kasus Traveling Salesmen Problem (TSP)," Universitas Islam Negeri Syarief Hidayatullah, Jakarta, 2011.
E. Mindaputra, "Penggunaan Algoritma Ant Colony System dalam Traveling Salesman Problem (TSP) pada PT. Eka Jaya Motor," Universitas Diponegoro, Semarang, 2009.
D. B. Painlin, "Penentuan Rute Optimal Distribusi Produk Nestle dengan Metode Traveling Salesman Problem (TSP) (Studi Kasus: PT. Paris Jaya Mandiri)," Jurnal Arika, vol. 11, no. 1, pp. 35-43, 2017.
J. S. Budayasa, Teori Graph dan Aplikasinya, Surabaya: Unesa University Press, 2017.
J. S. Siang, Matematika Diskrit dan Aplikasinya Pada Ilmu Komputer, Yogyakarta: Penerbit Andi, 2002.