PENYELESAIAN MULTIPLE TRAVELING SALESMAN PROBLEM DENGAN TIME WINDOWS MENGGUNAKAN ALGORITMA IMPROVED ANT COLONY OPTIMIZATION

    Gilang Sukma Diriksa, - and Khusnul Novianingsih, - and Imam Nugraha Albania, - (2025) PENYELESAIAN MULTIPLE TRAVELING SALESMAN PROBLEM DENGAN TIME WINDOWS MENGGUNAKAN ALGORITMA IMPROVED ANT COLONY OPTIMIZATION. S1 thesis, Universitas Pendidikan Indonesia.

    Abstract

    Multiple Traveling Salesman Problem dengan Time Windows (mTSP-TW) merupakan pengembangan dari TSP dengan melibatkan lebih dari satu salesman dan batasan waktu kunjungan pada setiap lokasi. Penelitian ini menyelesaikan mTSP-TW menggunakan algoritma Improved Ant Colony Optimization (IACO), yang merupakan pengembangan dari ACO dengan penambahan mutasi reciprocal exchange dan local search 2-opt untuk meningkatkan kualitas solusi. Hasil percobaan menunjukkan bahwa IACO mampu menghasilkan solusi yang feasible dan efisien dengan total jarak minimum sebesar 1026,76 km dalam 100 iterasi dan 20 percobaan. Parameter terbaik diperoleh dengan jumlah semut 15, pheromone awal 0,1, tingkat penguapan pheromone 0,2, nilai eksploitasi q₀ = 0,7, serta bobot α = 1 dan β = 2. The Multiple Traveling Salesman Problem dengan Time Windows (mTSP-TW) is an extension of the TSP that involves more than one salesman and time window constraints at each location. This study addresses the mTSP-TW using the Improved Ant Colony Optimization (IACO) algorithm, an enhancement of ACO that incorporates reciprocal exchange mutation and 2-opt local search to improve solution quality. The computational results show that IACO can produce feasible and efficient solutions, achieving a minimum total distance of 1180.50 km in 100 iterations and 20 trials. The best performance was achieved using 15 ants, an initial pheromone value of 0.1, a pheromone evaporation rate of 0.2, an exploitation factor q₀ of 0.7, and pheromone and visibility weights of α = 1 and β = 1, respectively.

    Baca Full Text klik disini
    [thumbnail of S_MAT_2106345_Title.pdf] Text
    S_MAT_2106345_Title.pdf
    Download (2MB)
    [thumbnail of S_MAT_2106345_Chapter1.pdf] Text
    S_MAT_2106345_Chapter1.pdf
    Download (770kB)
    [thumbnail of S_MAT_2106345_Chapter2.pdf] Text
    S_MAT_2106345_Chapter2.pdf
    Restricted to Staf Perpustakaan
    Download (1MB)
    [thumbnail of S_MAT_2106345_Chapter3.pdf] Text
    S_MAT_2106345_Chapter3.pdf
    Download (997kB)
    [thumbnail of S_MAT_2106345_Chapter4.pdf] Text
    S_MAT_2106345_Chapter4.pdf
    Restricted to Staf Perpustakaan
    Download (2MB)
    [thumbnail of S_MAT_2106345_Chapter5.pdf] Text
    S_MAT_2106345_Chapter5.pdf
    Download (742kB)
    [thumbnail of S_MAT_2106345_Appendix.pdf] Text
    S_MAT_2106345_Appendix.pdf
    Restricted to Staf Perpustakaan
    Download (1MB)
    Official URL: https://repository.upi.edu/
    Item Type: Thesis (S1)
    Additional Information: ID SINTA Dosen Pembimbing: Khusnul Novianingsih : 258640 Imam Nugraha Albania :6711447
    Uncontrolled Keywords: Multiple Traveling Salesman Problem dengan Time Windows, Improved Ant Colony Optimization, mutasi reciprocal exchange, local search 2-opt Multiple Traveling Salesman Problem dengan Time Windows, Improved Ant Colony Optimization, reciprocal exchange mutation, 2-opt local search
    Subjects: Q Science > QA Mathematics
    Divisions: Fakultas Pendidikan Matematika dan Ilmu Pengetahuan Alam > Program Studi Matematika - S1 > Program Studi Matematika (non kependidikan)
    Depositing User: Gilang Sukma Diriksa
    Date Deposited: 26 Aug 2025 06:32
    Last Modified: 26 Aug 2025 06:32
    URI: http://repository.upi.edu/id/eprint/135740

    Actions (login required)

    View Item View Item