Penentuan Rute Terpendek Dengan Metode Tabu Search (Studi Kasus)
Abstract
Save to Mendeley
Full Text:
PDFReferences
Mukhsinin, Ali., dkk. 2013. “Penentuan Rute Distribusi CV. IFFA Menggunakan Metode Nearest Neighbour dan Local Search”. Jurnal Online Institut Teknologi Nasional.
Ikfan, Noer dan Masudin, Ilyas. 2014. “Saving Matrix untuk Menentukan Rute Distribusi”. Jurnal Ilmiah Teknik Industri. Program Studi Teknik Industri Universitas Muhammadiyah Malang.
Amri, Mahardika., dkk. 2014. “Penyelesaian Vehicle Routing Problem dengan Menggunakan Metode Nearest Neighbor (Studi Kasus: MTP Nganjuk Distributor PT. Coca Cola)”. Jurusan Teknik Industri Universitas Brawijaya.
Toth, P. dan Vigo, D. 2002. “The Vehicle Routing Problem”. Universita degli Studi di Bologna Italy.
Pop, P.C., dkk. 2011. “Heuristic Algorithms for Solving the Generalized Vehicle Routing Problem”. Int. J. of Computers, Communications & Control.
Gendreau, M., dkk. 1994. “Tabu Search Heuristic for the Vehicle Routing Problem”. Management Science, Vol. 40, No. 10 (Oct., 1994), p. 1276-1290.
DOI: https://doi.org/10.33508/wt.v17i2.2164