Penyelesaian Masalah TSP Pada Rute Kunjungan ATM Dengan Pendekatan Heuristik (Tabu Search)

Jhon Pontas Simbolon(1*), Muhammad Zarlis(2),

(1) Universitas Sumatera Utara (USU)
(2) Universitas Sumatera Utara (USU)
(*) Corresponding Author

Abstract


Determination of optimum route is a problem that can be found in a variety of activities. Principal of the problem is how to organize the trip so the distance is the minimum distance that the optimum is best found on a map or graph. There are many algorithms available to solve them. Algorithm is divided into two parts, the exact methods and heuristic methods. Heuristic method is considered the best method because it can work quickly. Tabu search is a heuristic method that is often used in solving optimization problems. The algorithm works by improving a solution by using memory to avoid that the search process does not get stuck at a local optimum value by rejecting new solutions that may be in memory (taboo) so that the new solution will be more dispersed. The author will implement a tabu search algorithm to provide a better alternative solution to solve the problems of the effectiveness of the distribution of charging money at the ATM machine.

Full Text:

PDF

References


. Betrianis, & Aryawan P. T., “Penerapan Algoritma Tabu Search Dalam Penyelesaian Job Shop”, Makara Teknologi, Vol. 7, No. 3, pp. 107-112, Desember 2003.

. Glover, F., “Tabu Search Fundamentals And Uses”, University of Colorado, Boulder, June 1995.

. Glover, F., “Tabu Search : A Tutorial”, Center for Applied Artificial Intelligence, University of Colorado, Boulder, August 1990.

. Glover, F., “Tabu search - Part I”, ORSA Journal on Computing, Vol. 1, No. 3, pp. 190-206, 1989.

. Mutakhiroh, I., Saptono, F., Hasanah, N. & Wiryadinata, R., “Pemanfaatan Metode Heuristik Dalam Pencarian Jalur Terpendek Dengan Algoritma Semut dan Algoritma Genetik”, Seminar Nasional Aplikasi Teknologi Informasi, ISSN: 1907-5022, Yogyakarta, 2007.

. Jayaswal S., “A Comparative Study of Tabu Search and Simulated Annealing for Traveling Salesman Problem”, Project Report Applied Optimization MSCI 703, Department of Management Sciences University of Waterloo

. Panggabean, H. P., “Penjadwalan Job Shop Statik Dengan Algoritma Tabu Search”, INTEGRAL, Vol. 10, No. 1, pp. 34-45, Maret 2005.

. Wardy, I. S., ”Penggunaan graph dalam algoritma semut untuk melakukan optimisasi”, Program studi Teknik Informatika, ITB, Bandung, 2007.

. Wilson, R. J. & Watkhins, J. J., “Graph An Introductionary Approach, A First Course in Discrete Mathematics”, John Willey and Sons, New York, 1990.

. Setemen, K. & Purnomo, M. H., “Kombinasi Algoritma Genetika dan Tabu Search dalam Pembuatan Tabel Jadwal Mata Kuliah”, Seminar on Intelligent Technology and Its Applications, ISBN: 978-979-8897-24-5, 2008.

. Bona & Miklos, “A Walk Through Combinatorics An Introduction to Enumeration and Graph Theory”, World Scientific Publishing, 2006.

. Edahiro, M., “Equispreading Tree in Manhattan Distance”, Vol. 16, Issue 3, pp. 316-338. 2006.

. Li, Fajie & Klette, R., “Euclidean Shortest Paths”. Springer, 2011.

. Wallis, W.D., “A Beginner’s Guide to Graph Theory”. Universitas Birkhauser, Boston, 2010.

. Hernawati, Anies, Thiang & Eleazar, “Rute Optimum Menggunakan Algoritma Genetika”, Jurnal Teknik Elektro, Vol. 2, No. 2, pp. 78-83, September 2002.

. Joni & Luh, “Pencarian Rute Terpendek Tempat Wisata di Bali Dengan Menggunakan Algoritma Dijkstra”, Procceding, SNATI, ISSN: 1907-5022, pp. 46-49, 2010.

. Budiyanto, E., “Sistem Informasi Geografis dengan ArcView GIS”, Penerbit Andi, Yogyakarta, 2010.

. Berlianty, I. & Arifin, M., “Teknik-Teknik Optimasi Heuristik“, Graha Ilmu, Yogyakarta, 2010.




DOI: http://dx.doi.org/10.30645/jurasik.v2i1.15

DOI (PDF): http://dx.doi.org/10.30645/jurasik.v2i1.15.g12

Refbacks

  • There are currently no refbacks.



JURASIK (Jurnal Riset Sistem Informasi dan Teknik Informatika)
Published Papers Indexed/Abstracted By:

Jumlah Kunjungan : View My Stats