PENUGASAN RUTE DISTRIBUSI MENGGUNAKAN ALGORITMA TABU SEARCH PADA PT. YAKULT INDONESIA PERSADA CABANG LHOKSEUMAWE
DOI:
https://doi.org/10.53912/iejm.v10i1.626Keywords:
Distribusi, Transportasi, VRP, Python, Algoritma Tabu SearchAbstract
PT.Yakult Indonesia Persada Cabang Lhokseumawe merupakan salah satu cabang produk minuman yakult. Perusahaan mendistribusikan produk tersebut kepada semua konsumen dengan cara melakukan distribusi ke berbagai wilayah diantaranya 3 unit mobil box di kabupaten aceh utara, 1 unit mobil box di kota bireuen, 1 unit mobil box di bener meriah dan 2 unit mobil box untuk di aceh tengah. Dengan menggunakan Metode Algoritma Tabu Seacrh dan dengan menggunakan bantuan software phyton berharap mampu memecahkan permasalahan pada PT.Yakult Indonesia Persada Cabang Lhokseumawe dalam mendistribusikan produknya. Hasil rute yang didapatkan untuk Rute 1 total jarak Perusahaan sebesar 1133,9 km sedangkan menggunakan metode tabu search menghasilkan jarak 1065,4 km, untuk Rute 2 total jarak 719,8 km sedangkan menggunakan metode tabu search 656,4 km, Rute 3 total jarak perusahaan 210,6 km dengan menggunakan metode tabu search mempunyai total jarak 200,4 km , Rute 4 total jarak perusahaan 894,6 km sedangkan menggunakan metode tabu search menempuh total jarak 885,3 km , untuk Rute ke 5 perusahaan menempuh total jarak 929,2 km sedangkan menggunakan metode tabu search 892 km , Rute 6 total jarak perusahaan 848,85 km dengan menggunakan metode tabu search 843,45 km dan untuk Rute 7 perusahaan menempuh jarak 1304,4 sedangkan menggunakan metode tabu search hanya menempuh jarak 1248,6 km.References
Abbas, S. (2005). Manajemen Transportasi, Edisi 1.
Jakarta: PT. Raja Grahindo Persada.
Ballou R.H dan Agarwal, Y. (1998). a performance comparison of several popular algoritms for vehicle routing problem and scheduling. journal of business logistics.
Ballou, R. (2004). Business logistics management.
Prentice: Hall Inc.
Berlianty, I. d. (2010). Teknik-Teknik Optimasi Heuristik . Yogyakarta: Graha ilmu.
Bianchessi, N. R. (2007). Heuristic algorithms for the vehicle routing problem.
Dreo. J., P. A. (2006). Metaheuristics for hard optimization. Berlin: Springer- Verlag Berin Heidelberg.
Faisal., F. (2012). Penentuan Alokasi dan Rute Transportasi Yang optimal.Institut Teknologi Bandung: Sarjana Bandung.
Gendreau, M. (2002). An Introduction to Tabu Search . Montreal: University of Montreal.
Glover F dan Laguna, M. (1997). Tabu Search.
Massachusetts: Kluwer Academic publlisher.
Glover, F. &. (2003). Handbook of Metaheuristics .
Dordrecht: Kluwer Academic Publisher.
Gooddairrie, E. G. (2002). Discrete Mathematics with Graph Theory Second Edition. United States of America: Prentice-Mall,inc.
Gunadi W. Nurcahyo, R. A. (2002). Sweep Algorithm in Vehicle Routing Probem For Public Transport. Jurnal Antar Bangsa (Teknologi Maklumat).
Mahardika, A. d. (2012). Penyelesaian Vehicle Routing Problem menggunakan Metode Nearest neighbour. UB.
Pujawan, I. M. (2010). supply chain management.
Edisi Kedua Guna Widya: Surabaya.
Sharma.A, J. S. (2010). Test Cost Optimization Using Tabu Search . Software Engineering & Aplication.
Suyanto. (2010). Algoritma Optimasi Deterministik Atau Probabilistik .Yogyakarta: Graha Ilmu.
Toth P dan Vigo, D. (1998). Exact solution of the vehicle routing problem.
Toth P dan Vigo, D. (2002). The Vehicle Routing Problem. SIAM: Philadelphia. Willy.P., S. d. (2011). Metode Metaheuristik,Konsep dan Implementasi . Guna Widya.
Downloads
Published
Issue
Section
License
Copyright
Authors published in this journal agree to the following terms:
1. The copyright of each article is retained by the author (s).
2. The author grants the journal the first publication rights with the work simultaneously licensed under the Creative Commons Attribution License, allowing others to share the work with an acknowledgment of authorship and the initial publication in this journal.
3. Authors may enter into separate additional contractual agreements for the non-exclusive distribution of published journal versions of the work (for example, posting them to institutional repositories or publishing them in a book), with acknowledgment of their initial publication in this journal.
4. Authors are permitted and encouraged to post their work online (For example in the Institutional Repository or on their website) before and during the submission process, as this can lead to productive exchanges, as well as earlier and larger citations of published work.
5. Articles and all related material published are distributed under a Creative Commons Attribution-ShareAlike 4.0 International License.
License
Industrial Engineering Journal is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License
You are free to :
Share — copy and redistribute the material in any medium or format
Adapt — remix, transform, and build upon the material for any purpose, even commercially
Under the following terms :
Attribution — You must give appropriate credit, provide a link to the license, and indicate if changes were made. You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
ShareAlike — If you remix, transform, or build upon the material, you must distribute your contributions under the same license as the original
No additional restrictions — You may not apply legal terms or technological measures that legally restrict others from doing anything the license permits