OPTIMASI RUTE DISTRIBUSI PRODUK NESTLE MENGGUNAKAN METODE BRANCH AND BOUND DAN TWO-WAY EXCHANGE IMPROVEMENT HEURISTIC (STUDI KASUS : PT. PARIS JAYA MANDIRI – AMBON)
Abstract
Abstrak Traveling Salesman Problem (TSP) merupakan permasalahan optimasi pencarian rute terpendek dari satu kota ke n-kota lain tepat satu kali dan akan kembali ke titik awal keberangkatan. TSP dikategorikan sebagai hard combinatorial problem sehingga banyak teknik maupun aproksimasi yang dikembangkan untuk pemecahannya. Penelitian ini bertujuan untuk membandingkan teknik branch and bound dengan two-way exchange improvement dalam pemecahan Traveling Salesmen Problem (TSP) didasarkan pada jarak tempuh terkecil dan total waktu tempuh terkecil kendaraan. Penelitian ini diaplikasikan pada kasus nyata permasalahan penentuan rute kendaraan untuk pengiriman produk nestle dari PT. Paris Jaya Mandiri di kota Ambon. Hasil penelitian menunjukan bahwa teknik Two-Way Exchange Improvement memberikan hasil terbaik dibandingkan dengan Branch and Bound, dengan persentase penghematan jarak sebesar 18.09% dan penghematan total waktu sebesar 7.99% dari rute regular perusahaan.
Downloads
References
Fatmawati, Prihandono B, Noviani E, 2015. Penyelesaian Traveling Salesman Problem dengan Metode Tabu Search. Bimaster, Vol.4, No. 1, pp. 17-24
Hillier, F & Lieberman, G.J (2001). Introduction to Operation Research. Seventh Edition. Mc Graw Hill . New York , USA
Lawler.E.L, Lenstra.J.K, Rinooy Kan. A.H.G, dan Shimoys. D.B., 1983, The Traveling Salesmen Problem (a Guided Tour of Combinatorial Optimization), John Wiley & Sons, Chichester
Paillin, D. B dan Sosebeko I, 2017 Penentuan Rute Optimal Distribusi Produk Nestle dengan Metode TSP. Jurnal ARIKA, Vol 11 No. 1. Pp.31-40
Paillin, D. B dan Tupan J.M I, 2018. Pemecahan Traveling Salesman Problem Menggunakan Teknik Branch and Bound dan Cheapest Insertion Heuristic (Studi Kasus : PT. Paris Jaya Mandiri – Ambon). Industrial Engineering Conference (IDEC), Seminar Nasional “Peningkatan Daya Saing Industri Dan Pemberdayaan Tenaga Kerja Difabel Sebagai Tenaga Kerja Industri: Implementasi
Alat Bantu Bagi Pekerja Difabel" Dan Workshop “Solve Industrial Engineering Problem Using Experimental Design Methodâ€
Suyanto, 2010. Algoritma Optimasi (Deterministik dan Probabilistik). Yogyakarta: Penerbit Graha Ilmu;
An author who publishes in the ALE Proceeding agrees to the following terms:
- Author retains the copyright and grants ALE Proceeding the right of first publication of the work simultaneously licensed under the Creative Commons Attribution-ShareAlike 4.0 License that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
- Author is 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 the acknowledgment of its initial publication in this journal.
- Author is permitted and encouraged to post his/her 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 the published work (See The Effect of Open Access).
Read more about the Creative Commons Attribution-ShareAlike 4.0 Licence here: https://creativecommons.org/licenses/by-sa/4.0/.
