PENYELESAIAN DYNAMIC TRAVELING SALESMAN PROBLEM (DTSP) MENGGUNAKAN ALGORITMA ANT COLONY OPTIMIZATION: Studi Kasus Pengiriman Roti oleh Pabrik Roti di Kabupaten Cianjur

    Muthia Rasikha Zahra, - and Kartika Yulianti, - and Isnie Yusnitha, - (2025) PENYELESAIAN DYNAMIC TRAVELING SALESMAN PROBLEM (DTSP) MENGGUNAKAN ALGORITMA ANT COLONY OPTIMIZATION: Studi Kasus Pengiriman Roti oleh Pabrik Roti di Kabupaten Cianjur. S1 thesis, Universitas Pendidikan Indonesia.

    Abstract

    Dalam kehidupan sehari-hari, ketika kita berpindah dari satu tempat ke tempat lain, penting untuk mempertimbangkan waktu dan biaya agar dapat menemukan rute terpendek yang paling efisien. Permasalahan rute terpendek (shortest path problem) merupakan suatu permasalahan optimasi pencarian rute minimum yang diperlukan untuk mencapai tempat tujuan berdasarkan beberapa jalur yang tersedia. Dynamic Traveling Salesman Problem (DTSP) merupakan varian dari Traveling Salesman Problem (TSP) yang memperhitungkan perubahan dalam himpunan simpul yang harus dikunjungi seiring waktu, seperti pembatalan atau penambahan simpul kunjungan. Penelitian ini bertujuan untuk mengembangkan model DTSP dan mengimplementasikan Algoritma Ant Colony Optimization (ACO) untuk menentukan rute pengiriman roti yang optimal meskipun terjadi perubahan simpul penjemputan oleh suatu pabrik roti di Kabupaten Cianjur. Metodologi yang digunakan melibatkan simulasi dan analisis terhadap rute pengiriman berdasarkan data dinamis yang ada. Hasil penelitian menunjukkan bahwa dari 13 simpul representatif yang diteliti, didapat rute optimal pengiriman roti dari pabrik ke 13 simpul dengan total jarak 13.110 meter. Perubahan berupa penghapusan simpul tidak memberikan pengaruh terhadap perubahan total jarak yang telah didapat. Sebaliknya, perubahan berupa penambahan simpul akan mempengaruhi total jarak yang semula 13.110 meter menjadi 13.380 meter dan 13.770 meter untuk 2 simpul berbeda yang ditambah. Dengan demikian, penelitian ini tidak hanya memberikan solusi praktis bagi pengiriman roti tetapi juga dapat memberikan kontribusi signifikan dalam pengembangan solusi untuk masalah optimasi rute yang dinamis, serta memperkaya literatur tentang DTSP dan algoritma optimasi.

    In everyday life, when we move from one place to another, it is important to consider time and cost in order to find the most efficient shortest route. The shortest path problem is an optimization problem of finding the minimum route required to reach a destination based on several available paths. Dynamic Traveling Salesman Problem (DTSP) is a variant of the Traveling Salesman Problem (TSP) that takes into account changes in the set of nodes that must be visited over time, such as the cancellation or addition of visit points. This research aims to develop a DTSP model and implement the Ant Colony Optimization (ACO) algorithm to determine the optimal bread delivery route despite changes in pick-up nodes by a bakery in Cianjur Regency. The methodology used involves simulation and analysis of delivery routes based on existing dynamic data. The results showed that from the 13 representative nodes studied, an optimal bread delivery route was obtained from the factory to 13 nodes with a total distance of 13.110 meters. Changes in the form of node deletion have no effect on changes in the total distance that has been obtained. Conversely, changes in the form of adding nodes will affect the total distance from 13.110 meters to 13.380 meters and 13.770 meters for the two different nodes added. Thus, this research not only provides a practical solution for bread delivery but can also contribute significantly to the development of solutions for dynamic route optimization problems, as well as enrich the literature on DTSP and optimization algorithms.

    Baca Full Text klik disini
    [thumbnail of S_MAT_2003169_Title.pdf] Text
    S_MAT_2003169_Title.pdf
    Download (744kB)
    [thumbnail of S_MAT_2003169_Chapter1.pdf] Text
    S_MAT_2003169_Chapter1.pdf
    Download (59kB)
    [thumbnail of S_MAT_2003169_Chapter2.pdf] Text
    S_MAT_2003169_Chapter2.pdf
    Restricted to Staf Perpustakaan
    Download (226kB)
    [thumbnail of S_MAT_2003169_Chapter3.pdf] Text
    S_MAT_2003169_Chapter3.pdf
    Download (354kB)
    [thumbnail of S_MAT_2003169_Chapter4.pdf] Text
    S_MAT_2003169_Chapter4.pdf
    Restricted to Staf Perpustakaan
    Download (870kB)
    [thumbnail of S_MAT_2003169_Chapter5.pdf] Text
    S_MAT_2003169_Chapter5.pdf
    Download (131kB)
    [thumbnail of S_MAT_2003169_Appendix.pdf] Text
    S_MAT_2003169_Appendix.pdf
    Restricted to Staf Perpustakaan
    Download (297kB)
    Official URL: https://repository.upi.edu/
    Item Type: Thesis (S1)
    Additional Information: https://repository.upi.edu/ ID SINTA Dosen Pembimbing: Kartika Yulianti 5979108 Isnie Yusnitha 5993405
    Uncontrolled Keywords: Dynamic Traveling Salesman Problem, Algoritma Ant Colony Optimization, pengiriman roti, optimasi rute, perubahan simpul. Dynamic Traveling Salesman Problem, Ant Colony Optimization, bread delivery, route optimization, node changes.
    Subjects: Q Science > Q Science (General)
    Q Science > QA Mathematics
    Divisions: Fakultas Pendidikan Matematika dan Ilmu Pengetahuan Alam > Program Studi Matematika - S1 > Program Studi Matematika (non kependidikan)
    Depositing User: Muthia Rasikha Zahra
    Date Deposited: 15 May 2025 02:28
    Last Modified: 15 May 2025 02:28
    URI: http://repository.upi.edu/id/eprint/133306

    Actions (login required)

    View Item View Item