Chapter 1. PERENCANAAN PERBAIKAN RUTE TOL LAUT MENGGUNAKAN METODE PARALLEL INSERTION DAN EXHAUSTIVE SEARCH
Abstract
Full Text:
PDFReferences
F. Ahmad and H. F. Muharram, “Penentuan Jalur Distribusi Dengan Metode Saving Matriks,” Competitive, vol. 13, no. 1, p. 45, 2018.
C. Roch and S. Langer, “The Capacitated Vehicle Routing Problem,” Digit. Welt, vol. 3, no. 2, pp. 30–33, 2019.
R. Fitriana, P. Moengin, and U. Kusumaningrum, “Improvement Route for Distribution Solutions MDVRP (Multi Depot Vehicle Routing Problem) using Genetic Algorithm,” IOP Conf. Ser. Mater. Sci. Eng., vol. 528, no. 1, 2019.
A. Sampaio, J. Kinable, L. P. Veelenturf, and T. Van Woensel, “A Scenario-Based Approach for the Vehicle Routing Problem with Roaming Delivery Locations under Stochastic Travel Times,”
Optim. Online, 2019.
D. D. Andilas and L. A. Yanggana, “Pelaksanaan Program Tol Laut Pt Pelayaran Nasional Indonesia,” J. Manaj. Transp. Dan Logistik, vol. 4, no. 1, p. 1, 2017.
Kementerian PPN / Bappenas, “Laporan Implementasi Konsep Tol Laut 2015 Direktorat Transportasi,” p. 55, 2015.
M. F. Pradana, “Selayang Pandang Tol Laut Indonesia,” no. July 2018, 2018.
lutvia nur vitasari, “Analisis Evaluasi Implementasi Kebijakan Tol Laut,” Its, p. 106, 2017.
E. R Gultom, “Merefungsi Pengangkutan Laut Indonesia Melalui Tol Laut Untuk Pembangunan Ekonomi Indonesia Timur,” Develop, vol. 1, no. 2, 2017.
B. Prihartono, “Pengembangan Tol Laut Dalam Rpjmn 2015- 2019 Dan Implementasi 2015,” p. 110, 2015.
I. Maulana and R. Arifati, “PERENCANAAN RUTE PENGIRIMAN MENGGUNAKAN METODE PARALLEL INSERTION DAN EXHAUSTIVE SEARCH PADA PT. STARMASS LOGISTICS UPN " VETERAN " JAKARTA UPN " VETERAN " JAKARTA.”
L. Octora, A. Imran, and S. Susanty, “Pembentukan Rute Distribusi Menggunakan Algoritma Clarke & Wright Savings dan Algoritma Sequential Insertion,” Reka Integr., vol. 2, no. 2, pp. 1–11, 2014.
S. Suprayogi, “Pemecahan Masalah Rute Kendaraan Dengan Trip Majemuk, Jendela Waktu Dan Pengantaran-Penjemputan Simultan Menggunakan Algoritma Genetika,” J@ti Undip J. Tek. Ind., vol. 12, no. 2, p. 95, 2017.
M. W. P. Savelsbergh, “A parallel insertion heuristic for vehicle routing with side constraints,” Stat. Neerl., vol. 44, no. 3, pp. 139–148, 1990.
L. Chapleau, J. A. Ferland, G. Lapalme, and J. M. Rousseau, “A parallel insert method for the capacitated arc routing problem,” Oper. Res. Lett., vol. 3, no. 2, pp. 95–99, 1984.
M. A. Clark-wright, P. Studi, T. Industri, F. Teknik, and U. Diponegoro, “Optimasi Rute Angkutan Publik dengan Menggunakan,” pp. 8–9, 2017.
J. D. Fix and R. E. Ladner, “Sorting by parallel insertion on a one- dimensional subbus array,” IEEE Trans. Comput., vol. 47, no. 11, pp. 1267–1281, 1998.
Wulandari et al., “Algoritma Exhaustive Search sebagai Pencari Solusi Terbaik,” pp. 1–3, 2018.
T. Draganov Stojanovski, “Performance of exhaustive search with parallel agents,” Turkish J. Electr. Eng. Comput. Sci., vol. 22, no. 5, pp. 1382–1394, 2014.
N. I. Fajariyah et al., “Unnes Journal of Mathematics Education,” Ujme, vol. 1, no. 2, pp. 153–167, 2012.
G. Wilson, S. Harding, O. Hoeber, R. Devillers, and W. Banzhaf, “Parallel exhaustive search vs. evolutionary computation in a large real world network search space,” 2012 IEEE Congr. Evol. Comput. CEC 2012, 2012.
Refbacks
- There are currently no refbacks.
Katalog Buku Karya Dosen ITATS